(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → b(b(a(x)))
b(x) → c(a(c(x)))
c(c(x)) → 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(x)) → B(b(a(x)))
A(b(x)) → B(a(x))
A(b(x)) → A(x)
B(x) → C(a(c(x)))
B(x) → A(c(x))
B(x) → C(x)
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → b(b(a(x)))
b(x) → c(a(c(x)))
c(c(x)) → 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 2 less nodes.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
B(x) → A(c(x))
A(b(x)) → B(b(a(x)))
A(b(x)) → B(a(x))
A(b(x)) → A(x)
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → b(b(a(x)))
b(x) → c(a(c(x)))
c(c(x)) → 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(x) → A(c(x))
The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:
| POL(c(x1)) = | | + | | / | -I | 0A | -I | \ |
| | | 0A | -I | -I | | |
| \ | 0A | 0A | 0A | / |
| · | x1 |
| POL(b(x1)) = | | + | | / | 0A | -I | -I | \ |
| | | 1A | 0A | 0A | | |
| \ | 0A | 0A | 0A | / |
| · | x1 |
| POL(a(x1)) = | | + | | / | 0A | -I | -I | \ |
| | | -I | 0A | -I | | |
| \ | -I | 0A | 0A | / |
| · | x1 |
The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:
c(c(x)) → x
a(x) → x
a(b(x)) → b(b(a(x)))
b(x) → c(a(c(x)))
(6) Obligation:
Q DP problem:
The TRS P consists of the following rules:
A(b(x)) → B(b(a(x)))
A(b(x)) → B(a(x))
A(b(x)) → A(x)
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → b(b(a(x)))
b(x) → c(a(c(x)))
c(c(x)) → 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 2 less nodes.
(8) Obligation:
Q DP problem:
The TRS P consists of the following rules:
A(b(x)) → A(x)
The TRS R consists of the following rules:
a(x) → x
a(b(x)) → b(b(a(x)))
b(x) → c(a(c(x)))
c(c(x)) → x
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(9) UsableRulesProof (EQUIVALENT transformation)
We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.
(10) Obligation:
Q DP problem:
The TRS P consists of the following rules:
A(b(x)) → A(x)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(11) QDPSizeChangeProof (EQUIVALENT transformation)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.
From the DPs we obtained the following set of size-change graphs:
- A(b(x)) → A(x)
The graph contains the following edges 1 > 1
(12) YES