YES(O(1), O(1)) 0.00/0.54 YES(O(1), O(1)) 0.00/0.56 0.00/0.56 0.00/0.56
0.00/0.56 0.00/0.560 CpxTRS0.00/0.56
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳2 CdtProblem0.00/0.56
↳3 CdtUnreachableProof (⇔)0.00/0.56
↳4 CdtProblem0.00/0.56
↳5 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳6 CdtProblem0.00/0.56
↳7 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳8 CdtProblem0.00/0.56
↳9 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.56
↳10 BOUNDS(O(1), O(1))0.00/0.56
f(f(x)) → f(c(f(x))) 0.00/0.56
f(f(x)) → f(d(f(x))) 0.00/0.56
g(c(x)) → x 0.00/0.56
g(d(x)) → x 0.00/0.56
g(c(0)) → g(d(1)) 0.00/0.56
g(c(1)) → g(d(0))
Tuples:
f(f(z0)) → f(c(f(z0))) 0.00/0.56
f(f(z0)) → f(d(f(z0))) 0.00/0.56
g(c(z0)) → z0 0.00/0.56
g(d(z0)) → z0 0.00/0.56
g(c(0)) → g(d(1)) 0.00/0.56
g(c(1)) → g(d(0))
S tuples:
F(f(z0)) → c1(F(c(f(z0))), F(z0)) 0.00/0.56
F(f(z0)) → c2(F(d(f(z0))), F(z0)) 0.00/0.56
G(c(0)) → c5(G(d(1))) 0.00/0.56
G(c(1)) → c6(G(d(0)))
K tuples:none
F(f(z0)) → c1(F(c(f(z0))), F(z0)) 0.00/0.56
F(f(z0)) → c2(F(d(f(z0))), F(z0)) 0.00/0.56
G(c(0)) → c5(G(d(1))) 0.00/0.56
G(c(1)) → c6(G(d(0)))
f, g
F, G
c1, c2, c5, c6
F(f(z0)) → c1(F(c(f(z0))), F(z0)) 0.00/0.56
F(f(z0)) → c2(F(d(f(z0))), F(z0))
Tuples:
f(f(z0)) → f(c(f(z0))) 0.00/0.56
f(f(z0)) → f(d(f(z0))) 0.00/0.56
g(c(z0)) → z0 0.00/0.56
g(d(z0)) → z0 0.00/0.56
g(c(0)) → g(d(1)) 0.00/0.56
g(c(1)) → g(d(0))
S tuples:
G(c(0)) → c5(G(d(1))) 0.00/0.56
G(c(1)) → c6(G(d(0)))
K tuples:none
G(c(0)) → c5(G(d(1))) 0.00/0.56
G(c(1)) → c6(G(d(0)))
f, g
G
c5, c6
Tuples:
f(f(z0)) → f(c(f(z0))) 0.00/0.56
f(f(z0)) → f(d(f(z0))) 0.00/0.56
g(c(z0)) → z0 0.00/0.56
g(d(z0)) → z0 0.00/0.56
g(c(0)) → g(d(1)) 0.00/0.56
g(c(1)) → g(d(0))
S tuples:
G(c(0)) → c5 0.00/0.56
G(c(1)) → c6
K tuples:none
G(c(0)) → c5 0.00/0.56
G(c(1)) → c6
f, g
G
c5, c6
G(c(1)) → c6 0.00/0.56
G(c(0)) → c5
Tuples:none
f(f(z0)) → f(c(f(z0))) 0.00/0.56
f(f(z0)) → f(d(f(z0))) 0.00/0.56
g(c(z0)) → z0 0.00/0.56
g(d(z0)) → z0 0.00/0.56
g(c(0)) → g(d(1)) 0.00/0.56
g(c(1)) → g(d(0))
f, g