R
↳Dependency Pair Analysis
F(X) -> G(X)
G(s(X)) -> G(X)
SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))
SEL(s(X), cons(Y, Z)) -> ACTIVATE(Z)
ACTIVATE(nf(X)) -> F(X)
R
↳DPs
→DP Problem 1
↳Polynomial Ordering
→DP Problem 2
↳Remaining
G(s(X)) -> G(X)
f(X) -> cons(X, nf(g(X)))
f(X) -> nf(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nf(X)) -> f(X)
activate(X) -> X
G(s(X)) -> G(X)
POL(G(x1)) = x1 POL(s(x1)) = 1 + x1
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 3
↳Dependency Graph
→DP Problem 2
↳Remaining
f(X) -> cons(X, nf(g(X)))
f(X) -> nf(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nf(X)) -> f(X)
activate(X) -> X
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 2
↳Remaining Obligation(s)
SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))
f(X) -> cons(X, nf(g(X)))
f(X) -> nf(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(nf(X)) -> f(X)
activate(X) -> X