R
↳Dependency Pair Analysis
F(s(0)) -> F(p(s(0)))
F(s(0)) -> P(s(0))
ACTIVATE(nf(X)) -> F(X)
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
F(s(0)) -> F(p(s(0)))
f(0) -> cons(0, nf(s(0)))
f(s(0)) -> f(p(s(0)))
f(X) -> nf(X)
p(s(0)) -> 0
activate(nf(X)) -> f(X)
activate(X) -> X
F(s(0)) -> F(p(s(0)))
p(s(0)) -> 0
f(0) -> cons(0, nf(s(0)))
f(s(0)) -> f(p(s(0)))
f(X) -> nf(X)
activate(nf(X)) -> f(X)
activate(X) -> X
{activate, f} > nf
{activate, f} > cons
{activate, f} > s
{0, p}
F(x1) -> F(x1)
s(x1) -> s(x1)
p(x1) -> p
f(x1) -> f(x1)
cons(x1, x2) -> cons(x1, x2)
nf(x1) -> nf(x1)
activate(x1) -> activate(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Dependency Graph
f(0) -> cons(0, nf(s(0)))
f(s(0)) -> f(p(s(0)))
f(X) -> nf(X)
p(s(0)) -> 0
activate(nf(X)) -> f(X)
activate(X) -> X