(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → b(c(x))
a(b(x)) → x
a(b(b(x))) → b(b(a(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(b(b(x))) → A(a(x))
A(b(b(x))) → A(x)
The TRS R consists of the following rules:
a(x) → b(c(x))
a(b(x)) → x
a(b(b(x))) → b(b(a(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(b(b(x))) → A(a(x))
A(b(b(x))) → A(x)
The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
| POL(b(x1)) = | | + | | / | 0A | 0A | 1A | \ |
| | | -I | -I | 0A | | |
| \ | 0A | -I | -I | / |
| · | x1 |
| POL(a(x1)) = | | + | | / | 0A | -I | 0A | \ |
| | | 1A | -I | 0A | | |
| \ | 0A | -I | -I | / |
| · | x1 |
| POL(c(x1)) = | | + | | / | 0A | -I | -I | \ |
| | | 0A | -I | -I | | |
| \ | -I | -I | -I | / |
| · | x1 |
The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
a(x) → b(c(x))
a(b(x)) → x
a(b(b(x))) → b(b(a(a(x))))
(4) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
a(x) → b(c(x))
a(b(x)) → x
a(b(b(x))) → b(b(a(a(x))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(6) YES