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