(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
a(a(b(a(x)))) → b(b(a(a(a(x)))))
b(x) → a(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(b(a(x)))) → B(b(a(a(a(x)))))
A(a(b(a(x)))) → B(a(a(a(x))))
A(a(b(a(x)))) → A(a(a(x)))
A(a(b(a(x)))) → A(a(x))
B(x) → A(x)
The TRS R consists of the following rules:
a(x) → x
a(a(b(a(x)))) → b(b(a(a(a(x)))))
b(x) → a(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,JAR06].
The following pairs can be oriented strictly and are deleted.
A(a(b(a(x)))) → B(b(a(a(a(x)))))
A(a(b(a(x)))) → B(a(a(a(x))))
A(a(b(a(x)))) → A(a(a(x)))
A(a(b(a(x)))) → A(a(x))
The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
| POL(a(x1)) = | | + | | / | 0A | -I | 0A | \ |
| | | 0A | 0A | 0A | | |
| \ | 0A | -I | 0A | / |
| · | x1 |
| POL(b(x1)) = | | + | | / | 0A | 0A | 1A | \ |
| | | 0A | 0A | 0A | | |
| \ | 0A | -I | 0A | / |
| · | x1 |
The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
a(x) → x
a(a(b(a(x)))) → b(b(a(a(a(x)))))
b(x) → a(x)
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
B(x) → A(x)
The TRS R consists of the following rules:
a(x) → x
a(a(b(a(x)))) → b(b(a(a(a(x)))))
b(x) → a(x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
(6) TRUE