R
↳Dependency Pair Analysis
SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))
SEL(s(X), cons(Y, Z)) -> ACTIVATE(Z)
ACTIVATE(nfrom(X)) -> FROM(X)
R
↳DPs
→DP Problem 1
↳Polynomial Ordering
SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))
from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(X) -> X
innermost
SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))
POL(n__from(x1)) = 0 POL(from(x1)) = 0 POL(activate(x1)) = 0 POL(cons(x1, x2)) = 0 POL(SEL(x1, x2)) = x1 POL(s(x1)) = 1 + x1
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 2
↳Dependency Graph
from(X) -> cons(X, nfrom(s(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nfrom(X)) -> from(X)
activate(X) -> X
innermost