R
↳Dependency Pair Analysis
F(a, empty) -> G(a, empty)
F(a, cons(x, k)) -> F(cons(x, a), k)
G(cons(x, k), d) -> G(k, cons(x, d))
R
↳DPs
→DP Problem 1
↳Instantiation Transformation
→DP Problem 2
↳Remaining
G(cons(x, k), d) -> G(k, cons(x, d))
f(a, empty) -> g(a, empty)
f(a, cons(x, k)) -> f(cons(x, a), k)
g(empty, d) -> d
g(cons(x, k), d) -> g(k, cons(x, d))
one new Dependency Pair is created:
G(cons(x, k), d) -> G(k, cons(x, d))
G(cons(x0, k''), cons(x'', d'')) -> G(k'', cons(x0, cons(x'', d'')))
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 2
↳Remaining Obligation(s)
G(cons(x0, k''), cons(x'', d'')) -> G(k'', cons(x0, cons(x'', d'')))
f(a, empty) -> g(a, empty)
f(a, cons(x, k)) -> f(cons(x, a), k)
g(empty, d) -> d
g(cons(x, k), d) -> g(k, cons(x, d))
F(a, cons(x, k)) -> F(cons(x, a), k)
f(a, empty) -> g(a, empty)
f(a, cons(x, k)) -> f(cons(x, a), k)
g(empty, d) -> d
g(cons(x, k), d) -> g(k, cons(x, d))
R
↳DPs
→DP Problem 1
↳Inst
→DP Problem 2
↳Remaining Obligation(s)
G(cons(x0, k''), cons(x'', d'')) -> G(k'', cons(x0, cons(x'', d'')))
f(a, empty) -> g(a, empty)
f(a, cons(x, k)) -> f(cons(x, a), k)
g(empty, d) -> d
g(cons(x, k), d) -> g(k, cons(x, d))
F(a, cons(x, k)) -> F(cons(x, a), k)
f(a, empty) -> g(a, empty)
f(a, cons(x, k)) -> f(cons(x, a), k)
g(empty, d) -> d
g(cons(x, k), d) -> g(k, cons(x, d))