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(activate(X))
ACTIVATE(nfrom(X)) -> ACTIVATE(X)
ACTIVATE(ns(X)) -> S(activate(X))
ACTIVATE(ns(X)) -> ACTIVATE(X)
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
ACTIVATE(ns(X)) -> ACTIVATE(X)
ACTIVATE(nfrom(X)) -> ACTIVATE(X)
from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
s(X) -> ns(X)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(X) -> X
innermost
ACTIVATE(ns(X)) -> ACTIVATE(X)
POL(n__from(x1)) = x1 POL(n__s(x1)) = 1 + x1 POL(ACTIVATE(x1)) = x1
ACTIVATE(x1) -> ACTIVATE(x1)
ns(x1) -> ns(x1)
nfrom(x1) -> nfrom(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Argument Filtering and Ordering
ACTIVATE(nfrom(X)) -> ACTIVATE(X)
from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
s(X) -> ns(X)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(X) -> X
innermost
ACTIVATE(nfrom(X)) -> ACTIVATE(X)
POL(n__from(x1)) = 1 + x1 POL(ACTIVATE(x1)) = x1
ACTIVATE(x1) -> ACTIVATE(x1)
nfrom(x1) -> nfrom(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳AFS
...
→DP Problem 3
↳Dependency Graph
from(X) -> cons(X, nfrom(ns(X)))
from(X) -> nfrom(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
s(X) -> ns(X)
activate(nfrom(X)) -> from(activate(X))
activate(ns(X)) -> s(activate(X))
activate(X) -> X
innermost