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