YES(O(1), O(n^1)) 0.00/0.78 YES(O(1), O(n^1)) 0.00/0.79 0.00/0.79 0.00/0.79
0.00/0.79 0.00/0.790 CpxTRS0.00/0.79
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.79
↳2 CdtProblem0.00/0.79
↳3 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.79
↳4 CdtProblem0.00/0.79
↳5 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))0.00/0.79
↳6 CdtProblem0.00/0.79
↳7 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.79
↳8 CdtProblem0.00/0.79
↳9 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.79
↳10 BOUNDS(O(1), O(1))0.00/0.79
from(X) → cons(X, n__from(s(X))) 0.00/0.79
after(0, XS) → XS 0.00/0.79
after(s(N), cons(X, XS)) → after(N, activate(XS)) 0.00/0.79
from(X) → n__from(X) 0.00/0.79
activate(n__from(X)) → from(X) 0.00/0.79
activate(X) → X
Tuples:
from(z0) → cons(z0, n__from(s(z0))) 0.00/0.79
from(z0) → n__from(z0) 0.00/0.79
after(0, z0) → z0 0.00/0.79
after(s(z0), cons(z1, z2)) → after(z0, activate(z2)) 0.00/0.79
activate(n__from(z0)) → from(z0) 0.00/0.79
activate(z0) → z0
S tuples:
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4(FROM(z0))
K tuples:none
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4(FROM(z0))
from, after, activate
AFTER, ACTIVATE
c3, c4
Tuples:
from(z0) → cons(z0, n__from(s(z0))) 0.00/0.79
from(z0) → n__from(z0) 0.00/0.79
after(0, z0) → z0 0.00/0.79
after(s(z0), cons(z1, z2)) → after(z0, activate(z2)) 0.00/0.79
activate(n__from(z0)) → from(z0) 0.00/0.79
activate(z0) → z0
S tuples:
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
K tuples:none
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
from, after, activate
AFTER, ACTIVATE
c3, c4
ACTIVATE(n__from(z0)) → c4
Tuples:
from(z0) → cons(z0, n__from(s(z0))) 0.00/0.79
from(z0) → n__from(z0) 0.00/0.79
after(0, z0) → z0 0.00/0.79
after(s(z0), cons(z1, z2)) → after(z0, activate(z2)) 0.00/0.79
activate(n__from(z0)) → from(z0) 0.00/0.79
activate(z0) → z0
S tuples:
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
K tuples:none
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
from, after, activate
AFTER, ACTIVATE
c3, c4
We considered the (Usable) Rules:
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
And the Tuples:
activate(n__from(z0)) → from(z0) 0.00/0.79
activate(z0) → z0 0.00/0.79
from(z0) → cons(z0, n__from(s(z0))) 0.00/0.79
from(z0) → n__from(z0)
The order we found is given by the following interpretation:
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
POL(ACTIVATE(x1)) = [1] 0.00/0.79
POL(AFTER(x1, x2)) = [2]x1 0.00/0.79
POL(activate(x1)) = 0 0.00/0.79
POL(c3(x1, x2)) = x1 + x2 0.00/0.79
POL(c4) = 0 0.00/0.79
POL(cons(x1, x2)) = x1 0.00/0.79
POL(from(x1)) = [3] + [3]x1 0.00/0.79
POL(n__from(x1)) = x1 0.00/0.79
POL(s(x1)) = [1] + x1
Tuples:
from(z0) → cons(z0, n__from(s(z0))) 0.00/0.79
from(z0) → n__from(z0) 0.00/0.79
after(0, z0) → z0 0.00/0.79
after(s(z0), cons(z1, z2)) → after(z0, activate(z2)) 0.00/0.79
activate(n__from(z0)) → from(z0) 0.00/0.79
activate(z0) → z0
S tuples:none
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
Defined Rule Symbols:
AFTER(s(z0), cons(z1, z2)) → c3(AFTER(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.79
ACTIVATE(n__from(z0)) → c4
from, after, activate
AFTER, ACTIVATE
c3, c4