f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)
↳ QTRS
↳ DependencyPairsProof
f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)
B(y, b(a, z)) → B(f(z), a)
F(f(f(c(z, x, a)))) → F(x)
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
B(y, b(a, z)) → F(c(y, y, a))
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)
f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
B(y, b(a, z)) → B(f(z), a)
F(f(f(c(z, x, a)))) → F(x)
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
B(y, b(a, z)) → F(c(y, y, a))
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)
f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
F(f(f(c(z, x, a)))) → F(x)
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)
f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(f(f(c(z, x, a)))) → F(x)
F(f(f(c(z, x, a)))) → B(f(x), z)
B(y, b(a, z)) → F(z)
Used ordering: Polynomial interpretation [25,35]:
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
The value of delta used in the strict ordering is 1.
POL(f(x1)) = (2)x_1
POL(a) = 0
POL(b(x1, x2)) = (2)x_2
POL(c(x1, x2, x3)) = 4 + (4)x_1 + (4)x_2 + (4)x_3
POL(B(x1, x2)) = 4 + (2)x_2
POL(F(x1)) = 3 + (2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
B(y, b(a, z)) → B(f(c(y, y, a)), b(f(z), a))
f(b(a, z)) → z
b(y, b(a, z)) → b(f(c(y, y, a)), b(f(z), a))
f(f(f(c(z, x, a)))) → b(f(x), z)