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