YES(O(1), O(1)) 0.00/0.54 YES(O(1), O(1)) 0.00/0.55 0.00/0.55 0.00/0.55
0.00/0.55 0.00/0.550 CpxTRS0.00/0.55
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.55
↳2 CdtProblem0.00/0.55
↳3 CdtUnreachableProof (⇔)0.00/0.55
↳4 CdtProblem0.00/0.55
↳5 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.55
↳6 BOUNDS(O(1), O(1))0.00/0.55
f(c(c(a, y, a), b(x, z), a)) → b(y, f(c(f(a), z, z))) 0.00/0.55
f(b(b(x, f(y)), z)) → c(z, x, f(b(b(f(a), y), y))) 0.00/0.55
c(b(a, a), b(y, z), x) → b(a, b(z, z))
Tuples:
f(c(c(a, z0, a), b(z1, z2), a)) → b(z0, f(c(f(a), z2, z2))) 0.00/0.55
f(b(b(z0, f(z1)), z2)) → c(z2, z0, f(b(b(f(a), z1), z1))) 0.00/0.55
c(b(a, a), b(z0, z1), z2) → b(a, b(z1, z1))
S tuples:
F(c(c(a, z0, a), b(z1, z2), a)) → c1(F(c(f(a), z2, z2)), C(f(a), z2, z2), F(a)) 0.00/0.55
F(b(b(z0, f(z1)), z2)) → c2(C(z2, z0, f(b(b(f(a), z1), z1))), F(b(b(f(a), z1), z1)), F(a))
K tuples:none
F(c(c(a, z0, a), b(z1, z2), a)) → c1(F(c(f(a), z2, z2)), C(f(a), z2, z2), F(a)) 0.00/0.55
F(b(b(z0, f(z1)), z2)) → c2(C(z2, z0, f(b(b(f(a), z1), z1))), F(b(b(f(a), z1), z1)), F(a))
f, c
F
c1, c2
F(c(c(a, z0, a), b(z1, z2), a)) → c1(F(c(f(a), z2, z2)), C(f(a), z2, z2), F(a)) 0.00/0.55
F(b(b(z0, f(z1)), z2)) → c2(C(z2, z0, f(b(b(f(a), z1), z1))), F(b(b(f(a), z1), z1)), F(a))
Tuples:none
f(c(c(a, z0, a), b(z1, z2), a)) → b(z0, f(c(f(a), z2, z2))) 0.00/0.55
f(b(b(z0, f(z1)), z2)) → c(z2, z0, f(b(b(f(a), z1), z1))) 0.00/0.55
c(b(a, a), b(z0, z1), z2) → b(a, b(z1, z1))
f, c