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