YES(O(1), O(n^1)) 0.00/0.76 YES(O(1), O(n^1)) 0.00/0.77 0.00/0.77 0.00/0.77
0.00/0.77 0.00/0.780 CpxTRS0.00/0.78
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.78
↳2 CdtProblem0.00/0.78
↳3 CdtUnreachableProof (⇔)0.00/0.78
↳4 CdtProblem0.00/0.78
↳5 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.78
↳6 CdtProblem0.00/0.78
↳7 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.78
↳8 CdtProblem0.00/0.78
↳9 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.78
↳10 CdtProblem0.00/0.78
↳11 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.78
↳12 BOUNDS(O(1), O(1))0.00/0.78
from(X) → cons(X, n__from(n__s(X))) 0.00/0.78
sel(0, cons(X, Y)) → X 0.00/0.78
sel(s(X), cons(Y, Z)) → sel(X, activate(Z)) 0.00/0.78
from(X) → n__from(X) 0.00/0.78
s(X) → n__s(X) 0.00/0.78
activate(n__from(X)) → from(activate(X)) 0.00/0.78
activate(n__s(X)) → s(activate(X)) 0.00/0.78
activate(X) → X
Tuples:
from(z0) → cons(z0, n__from(n__s(z0))) 0.00/0.78
from(z0) → n__from(z0) 0.00/0.78
sel(0, cons(z0, z1)) → z0 0.00/0.78
sel(s(z0), cons(z1, z2)) → sel(z0, activate(z2)) 0.00/0.78
s(z0) → n__s(z0) 0.00/0.78
activate(n__from(z0)) → from(activate(z0)) 0.00/0.78
activate(n__s(z0)) → s(activate(z0)) 0.00/0.78
activate(z0) → z0
S tuples:
SEL(s(z0), cons(z1, z2)) → c3(SEL(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.78
ACTIVATE(n__from(z0)) → c5(FROM(activate(z0)), ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(S(activate(z0)), ACTIVATE(z0))
K tuples:none
SEL(s(z0), cons(z1, z2)) → c3(SEL(z0, activate(z2)), ACTIVATE(z2)) 0.00/0.78
ACTIVATE(n__from(z0)) → c5(FROM(activate(z0)), ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(S(activate(z0)), ACTIVATE(z0))
from, sel, s, activate
SEL, ACTIVATE
c3, c5, c6
SEL(s(z0), cons(z1, z2)) → c3(SEL(z0, activate(z2)), ACTIVATE(z2))
Tuples:
from(z0) → cons(z0, n__from(n__s(z0))) 0.00/0.78
from(z0) → n__from(z0) 0.00/0.78
sel(0, cons(z0, z1)) → z0 0.00/0.78
sel(s(z0), cons(z1, z2)) → sel(z0, activate(z2)) 0.00/0.78
s(z0) → n__s(z0) 0.00/0.78
activate(n__from(z0)) → from(activate(z0)) 0.00/0.78
activate(n__s(z0)) → s(activate(z0)) 0.00/0.78
activate(z0) → z0
S tuples:
ACTIVATE(n__from(z0)) → c5(FROM(activate(z0)), ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(S(activate(z0)), ACTIVATE(z0))
K tuples:none
ACTIVATE(n__from(z0)) → c5(FROM(activate(z0)), ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(S(activate(z0)), ACTIVATE(z0))
from, sel, s, activate
ACTIVATE
c5, c6
Tuples:
from(z0) → cons(z0, n__from(n__s(z0))) 0.00/0.78
from(z0) → n__from(z0) 0.00/0.78
sel(0, cons(z0, z1)) → z0 0.00/0.78
sel(s(z0), cons(z1, z2)) → sel(z0, activate(z2)) 0.00/0.78
s(z0) → n__s(z0) 0.00/0.78
activate(n__from(z0)) → from(activate(z0)) 0.00/0.78
activate(n__s(z0)) → s(activate(z0)) 0.00/0.78
activate(z0) → z0
S tuples:
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
K tuples:none
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
from, sel, s, activate
ACTIVATE
c5, c6
We considered the (Usable) Rules:none
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0))
The order we found is given by the following interpretation:
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
POL(ACTIVATE(x1)) = [2]x1 0.00/0.78
POL(c5(x1)) = x1 0.00/0.78
POL(c6(x1)) = x1 0.00/0.78
POL(n__from(x1)) = [1] + x1 0.00/0.78
POL(n__s(x1)) = x1
Tuples:
from(z0) → cons(z0, n__from(n__s(z0))) 0.00/0.78
from(z0) → n__from(z0) 0.00/0.78
sel(0, cons(z0, z1)) → z0 0.00/0.78
sel(s(z0), cons(z1, z2)) → sel(z0, activate(z2)) 0.00/0.78
s(z0) → n__s(z0) 0.00/0.78
activate(n__from(z0)) → from(activate(z0)) 0.00/0.78
activate(n__s(z0)) → s(activate(z0)) 0.00/0.78
activate(z0) → z0
S tuples:
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
K tuples:
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
Defined Rule Symbols:
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0))
from, sel, s, activate
ACTIVATE
c5, c6
We considered the (Usable) Rules:none
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
The order we found is given by the following interpretation:
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
POL(ACTIVATE(x1)) = [3]x1 0.00/0.78
POL(c5(x1)) = x1 0.00/0.78
POL(c6(x1)) = x1 0.00/0.78
POL(n__from(x1)) = x1 0.00/0.78
POL(n__s(x1)) = [1] + x1
Tuples:
from(z0) → cons(z0, n__from(n__s(z0))) 0.00/0.78
from(z0) → n__from(z0) 0.00/0.78
sel(0, cons(z0, z1)) → z0 0.00/0.78
sel(s(z0), cons(z1, z2)) → sel(z0, activate(z2)) 0.00/0.78
s(z0) → n__s(z0) 0.00/0.78
activate(n__from(z0)) → from(activate(z0)) 0.00/0.78
activate(n__s(z0)) → s(activate(z0)) 0.00/0.78
activate(z0) → z0
S tuples:none
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
Defined Rule Symbols:
ACTIVATE(n__from(z0)) → c5(ACTIVATE(z0)) 0.00/0.78
ACTIVATE(n__s(z0)) → c6(ACTIVATE(z0))
from, sel, s, activate
ACTIVATE
c5, c6