R
↳Dependency Pair Analysis
F(s(0)) -> F(p(s(0)))
F(s(0)) -> P(s(0))
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
F(s(0)) -> F(p(s(0)))
f(0) -> cons(0)
f(s(0)) -> f(p(s(0)))
p(s(0)) -> 0
F(s(0)) -> F(p(s(0)))
p(s(0)) -> 0
f(0) -> cons(0)
f(s(0)) -> f(p(s(0)))
POL(0) = 0 POL(cons(x1)) = x1 POL(s(x1)) = 1 + x1 POL(F(x1)) = x1 POL(f(x1)) = x1 POL(p) = 0
F(x1) -> F(x1)
s(x1) -> s(x1)
p(x1) -> p
f(x1) -> f(x1)
cons(x1) -> cons(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Dependency Graph
f(0) -> cons(0)
f(s(0)) -> f(p(s(0)))
p(s(0)) -> 0