R
↳Dependency Pair Analysis
F(s(X)) -> F(X)
G(cons(0, Y)) -> G(Y)
H(cons(X, Y)) -> H(g(cons(X, Y)))
H(cons(X, Y)) -> G(cons(X, Y))
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
→DP Problem 2
↳AFS
→DP Problem 3
↳Remaining
F(s(X)) -> F(X)
f(s(X)) -> f(X)
g(cons(0, Y)) -> g(Y)
g(cons(s(X), Y)) -> s(X)
h(cons(X, Y)) -> h(g(cons(X, Y)))
F(s(X)) -> F(X)
f(s(X)) -> f(X)
g(cons(0, Y)) -> g(Y)
g(cons(s(X), Y)) -> s(X)
h(cons(X, Y)) -> h(g(cons(X, Y)))
F(x1) -> F(x1)
s(x1) -> s(x1)
f(x1) -> f(x1)
g(x1) -> g(x1)
cons(x1, x2) -> cons(x1, x2)
h(x1) -> h
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 4
↳Dependency Graph
→DP Problem 2
↳AFS
→DP Problem 3
↳Remaining
f(s(X)) -> f(X)
g(cons(0, Y)) -> g(Y)
g(cons(s(X), Y)) -> s(X)
h(cons(X, Y)) -> h(g(cons(X, Y)))
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Argument Filtering and Ordering
→DP Problem 3
↳Remaining
G(cons(0, Y)) -> G(Y)
f(s(X)) -> f(X)
g(cons(0, Y)) -> g(Y)
g(cons(s(X), Y)) -> s(X)
h(cons(X, Y)) -> h(g(cons(X, Y)))
G(cons(0, Y)) -> G(Y)
f(s(X)) -> f(X)
g(cons(0, Y)) -> g(Y)
g(cons(s(X), Y)) -> s(X)
h(cons(X, Y)) -> h(g(cons(X, Y)))
G(x1) -> G(x1)
cons(x1, x2) -> cons(x1, x2)
f(x1) -> f(x1)
s(x1) -> s(x1)
g(x1) -> g(x1)
h(x1) -> h
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳AFS
→DP Problem 5
↳Dependency Graph
→DP Problem 3
↳Remaining
f(s(X)) -> f(X)
g(cons(0, Y)) -> g(Y)
g(cons(s(X), Y)) -> s(X)
h(cons(X, Y)) -> h(g(cons(X, Y)))
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳AFS
→DP Problem 3
↳Remaining Obligation(s)
H(cons(X, Y)) -> H(g(cons(X, Y)))
f(s(X)) -> f(X)
g(cons(0, Y)) -> g(Y)
g(cons(s(X), Y)) -> s(X)
h(cons(X, Y)) -> h(g(cons(X, Y)))