Term Rewriting System R:
[l, x, k, a, b, c]
f(empty, l) -> l
f(cons(x, k), l) -> g(k, l, cons(x, k))
g(a, b, c) -> f(a, cons(b, c))
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(cons(x, k), l) -> G(k, l, cons(x, k))
G(a, b, c) -> F(a, cons(b, c))
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pairs:
G(a, b, c) -> F(a, cons(b, c))
F(cons(x, k), l) -> G(k, l, cons(x, k))
Rules:
f(empty, l) -> l
f(cons(x, k), l) -> g(k, l, cons(x, k))
g(a, b, c) -> f(a, cons(b, c))
Termination of R could not be shown.
Duration:
0:00 minutes