from(X) → cons(X, n__from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
from(X) → cons(X, n__from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
AFTER(s(N), cons(X, XS)) → ACTIVATE(XS)
AFTER(s(N), cons(X, XS)) → AFTER(N, activate(XS))
ACTIVATE(n__from(X)) → FROM(X)
from(X) → cons(X, n__from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
AFTER(s(N), cons(X, XS)) → ACTIVATE(XS)
AFTER(s(N), cons(X, XS)) → AFTER(N, activate(XS))
ACTIVATE(n__from(X)) → FROM(X)
from(X) → cons(X, n__from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
AFTER(s(N), cons(X, XS)) → AFTER(N, activate(XS))
from(X) → cons(X, n__from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
AFTER(s(N), cons(X, XS)) → AFTER(N, activate(XS))
The value of delta used in the strict ordering is 16.
POL(cons(x1, x2)) = 4 + (2)x_1
POL(from(x1)) = 1 + (4)x_1
POL(AFTER(x1, x2)) = (4)x_1
POL(n__from(x1)) = (3)x_1
POL(s(x1)) = 4 + (2)x_1
POL(activate(x1)) = 0
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
from(X) → cons(X, n__from(s(X)))
after(0, XS) → XS
after(s(N), cons(X, XS)) → after(N, activate(XS))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X