YES(O(1), O(1)) 0.00/0.95 YES(O(1), O(1)) 0.00/0.97 0.00/0.97 0.00/0.97
0.00/0.97 0.00/0.970 CpxTRS0.00/0.97
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.97
↳2 CdtProblem0.00/0.97
↳3 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.97
↳4 CdtProblem0.00/0.97
↳5 CdtLeafRemovalProof (ComplexityIfPolyImplication)0.00/0.97
↳6 CdtProblem0.00/0.97
↳7 CdtNarrowingProof (BOTH BOUNDS(ID, ID))0.00/0.97
↳8 CdtProblem0.00/0.97
↳9 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.97
↳10 CdtProblem0.00/0.97
↳11 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))0.00/0.97
↳12 CdtProblem0.00/0.97
↳13 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.97
↳14 BOUNDS(O(1), O(1))0.00/0.97
f(0) → cons(0, n__f(s(0))) 0.00/0.97
f(s(0)) → f(p(s(0))) 0.00/0.97
p(s(X)) → X 0.00/0.97
f(X) → n__f(X) 0.00/0.97
activate(n__f(X)) → f(X) 0.00/0.97
activate(X) → X
Tuples:
f(0) → cons(0, n__f(s(0))) 0.00/0.97
f(s(0)) → f(p(s(0))) 0.00/0.97
f(z0) → n__f(z0) 0.00/0.97
p(s(z0)) → z0 0.00/0.97
activate(n__f(z0)) → f(z0) 0.00/0.97
activate(z0) → z0
S tuples:
F(s(0)) → c1(F(p(s(0))), P(s(0))) 0.00/0.97
ACTIVATE(n__f(z0)) → c4(F(z0))
K tuples:none
F(s(0)) → c1(F(p(s(0))), P(s(0))) 0.00/0.97
ACTIVATE(n__f(z0)) → c4(F(z0))
f, p, activate
F, ACTIVATE
c1, c4
Tuples:
f(0) → cons(0, n__f(s(0))) 0.00/0.97
f(s(0)) → f(p(s(0))) 0.00/0.97
f(z0) → n__f(z0) 0.00/0.97
p(s(z0)) → z0 0.00/0.97
activate(n__f(z0)) → f(z0) 0.00/0.97
activate(z0) → z0
S tuples:
ACTIVATE(n__f(z0)) → c4(F(z0)) 0.00/0.97
F(s(0)) → c1(F(p(s(0))))
K tuples:none
ACTIVATE(n__f(z0)) → c4(F(z0)) 0.00/0.97
F(s(0)) → c1(F(p(s(0))))
f, p, activate
ACTIVATE, F
c4, c1
ACTIVATE(n__f(z0)) → c4(F(z0))
Tuples:
f(0) → cons(0, n__f(s(0))) 0.00/0.97
f(s(0)) → f(p(s(0))) 0.00/0.97
f(z0) → n__f(z0) 0.00/0.97
p(s(z0)) → z0 0.00/0.97
activate(n__f(z0)) → f(z0) 0.00/0.97
activate(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, activate
F
c1
F(s(0)) → c1(F(0))
Tuples:
f(0) → cons(0, n__f(s(0))) 0.00/0.97
f(s(0)) → f(p(s(0))) 0.00/0.97
f(z0) → n__f(z0) 0.00/0.97
p(s(z0)) → z0 0.00/0.97
activate(n__f(z0)) → f(z0) 0.00/0.97
activate(z0) → z0
S tuples:
F(s(0)) → c1(F(0))
K tuples:none
F(s(0)) → c1(F(0))
f, p, activate
F
c1
Tuples:
f(0) → cons(0, n__f(s(0))) 0.00/0.97
f(s(0)) → f(p(s(0))) 0.00/0.97
f(z0) → n__f(z0) 0.00/0.97
p(s(z0)) → z0 0.00/0.97
activate(n__f(z0)) → f(z0) 0.00/0.97
activate(z0) → z0
S tuples:
F(s(0)) → c1
K tuples:none
F(s(0)) → c1
f, p, activate
F
c1
F(s(0)) → c1
Tuples:none
f(0) → cons(0, n__f(s(0))) 0.00/0.97
f(s(0)) → f(p(s(0))) 0.00/0.97
f(z0) → n__f(z0) 0.00/0.97
p(s(z0)) → z0 0.00/0.97
activate(n__f(z0)) → f(z0) 0.00/0.97
activate(z0) → z0
f, p, activate