(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
Q is empty.
(1) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(2) Obligation:
Q DP problem:
The TRS P consists of the following rules:
A(a(x)) → B(b(x))
A(a(x)) → B(x)
B(b(a(x))) → A(b(b(x)))
B(b(a(x))) → B(b(x))
B(b(a(x))) → B(x)
The TRS R consists of the following rules:
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(3) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
A(a(x)) → B(x)
B(b(a(x))) → B(b(x))
B(b(a(x))) → B(x)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Quasi-Precedence:
[A1, B1] > [a1, b1]
Status:
A1: [1]
a1: multiset
B1: [1]
b1: multiset
The following usable rules [FROCOS05] were oriented:
b(b(a(x))) → a(b(b(x)))
a(a(x)) → b(b(x))
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
A(a(x)) → B(b(x))
B(b(a(x))) → A(b(b(x)))
The TRS R consists of the following rules:
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
B(b(a(x))) → A(b(b(x)))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A(
x1) =
x1
a(
x1) =
a(
x1)
B(
x1) =
B(
x1)
b(
x1) =
x1
Recursive path order with status [RPO].
Quasi-Precedence:
[a1, B1]
Status:
a1: [1]
B1: [1]
The following usable rules [FROCOS05] were oriented:
b(b(a(x))) → a(b(b(x)))
a(a(x)) → b(b(x))
(6) Obligation:
Q DP problem:
The TRS P consists of the following rules:
A(a(x)) → B(b(x))
The TRS R consists of the following rules:
a(a(x)) → b(b(x))
b(b(a(x))) → a(b(b(x)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(7) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
(8) TRUE