(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
c(c(c(y))) → c(c(a(y, 0)))
c(a(a(0, x), y)) → a(c(c(c(0))), y)
c(y) → y
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:
C(c(c(y))) → C(c(a(y, 0)))
C(c(c(y))) → C(a(y, 0))
C(a(a(0, x), y)) → C(c(c(0)))
C(a(a(0, x), y)) → C(c(0))
C(a(a(0, x), y)) → C(0)
The TRS R consists of the following rules:
c(c(c(y))) → c(c(a(y, 0)))
c(a(a(0, x), y)) → a(c(c(c(0))), y)
c(y) → y
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(c(y))) → C(a(y, 0))
C(a(a(0, x), y)) → C(c(c(0)))
C(c(c(y))) → C(c(a(y, 0)))
C(a(a(0, x), y)) → C(c(0))
The TRS R consists of the following rules:
c(c(c(y))) → c(c(a(y, 0)))
c(a(a(0, x), y)) → a(c(c(c(0))), y)
c(y) → y
Q is empty.
We have to consider all minimal (P,Q,R)-chains.