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