Term Rewriting System R:
[x, a, k, y]
f(x, empty) -> x
f(empty, cons(a, k)) -> f(cons(a, k), k)
f(cons(a, k), y) -> f(y, k)

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(empty, cons(a, k)) -> F(cons(a, k), k)
F(cons(a, k), y) -> F(y, k)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

F(cons(a, k), y) -> F(y, k)
F(empty, cons(a, k)) -> F(cons(a, k), k)


Rules:


f(x, empty) -> x
f(empty, cons(a, k)) -> f(cons(a, k), k)
f(cons(a, k), y) -> f(y, k)




Termination of R could not be shown.
Duration:
0:00 minutes