YES(O(1), O(1)) 0.00/0.96 YES(O(1), O(1)) 0.00/0.98 0.00/0.98 0.00/0.98
0.00/0.98 0.00/0.980 CpxTRS0.00/0.98
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.98
↳2 CdtProblem0.00/0.98
↳3 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.98
↳4 CdtProblem0.00/0.98
↳5 CdtNarrowingProof (BOTH BOUNDS(ID, ID))0.00/0.98
↳6 CdtProblem0.00/0.98
↳7 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.98
↳8 CdtProblem0.00/0.98
↳9 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))0.00/0.98
↳10 CdtProblem0.00/0.98
↳11 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.98
↳12 BOUNDS(O(1), O(1))0.00/0.98
f(0) → cons(0) 0.00/0.98
f(s(0)) → f(p(s(0))) 0.00/0.98
p(s(X)) → X
Tuples:
f(0) → cons(0) 0.00/0.98
f(s(0)) → f(p(s(0))) 0.00/0.98
p(s(z0)) → z0
S tuples:
F(s(0)) → c1(F(p(s(0))), P(s(0)))
K tuples:none
F(s(0)) → c1(F(p(s(0))), P(s(0)))
f, p
F
c1
Tuples:
f(0) → cons(0) 0.00/0.98
f(s(0)) → f(p(s(0))) 0.00/0.98
p(s(z0)) → z0
S tuples:
F(s(0)) → c1(F(p(s(0))))
K tuples:none
F(s(0)) → c1(F(p(s(0))))
f, p
F
c1
F(s(0)) → c1(F(0))
Tuples:
f(0) → cons(0) 0.00/0.98
f(s(0)) → f(p(s(0))) 0.00/0.98
p(s(z0)) → z0
S tuples:
F(s(0)) → c1(F(0))
K tuples:none
F(s(0)) → c1(F(0))
f, p
F
c1
Tuples:
f(0) → cons(0) 0.00/0.98
f(s(0)) → f(p(s(0))) 0.00/0.98
p(s(z0)) → z0
S tuples:
F(s(0)) → c1
K tuples:none
F(s(0)) → c1
f, p
F
c1
F(s(0)) → c1
Tuples:none
f(0) → cons(0) 0.00/0.98
f(s(0)) → f(p(s(0))) 0.00/0.98
p(s(z0)) → z0
f, p