R
↳Dependency Pair Analysis
F(g(x), s(0), y) -> F(g(s(0)), y, g(x))
F(g(x), s(0), y) -> G(s(0))
G(s(x)) -> G(x)
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
→DP Problem 2
↳Remaining
G(s(x)) -> G(x)
f(g(x), s(0), y) -> f(g(s(0)), y, g(x))
g(s(x)) -> s(g(x))
g(0) -> 0
G(s(x)) -> G(x)
POL(G(x1)) = x1 POL(s(x1)) = 1 + x1
G(x1) -> G(x1)
s(x1) -> s(x1)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 3
↳Dependency Graph
→DP Problem 2
↳Remaining
f(g(x), s(0), y) -> f(g(s(0)), y, g(x))
g(s(x)) -> s(g(x))
g(0) -> 0
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Remaining Obligation(s)
F(g(x), s(0), y) -> F(g(s(0)), y, g(x))
f(g(x), s(0), y) -> f(g(s(0)), y, g(x))
g(s(x)) -> s(g(x))
g(0) -> 0