(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, empty) → x
f(empty, cons(a, k)) → f(cons(a, k), k)
f(cons(a, k), y) → f(y, k)
Q is empty.
(1) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(2) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(empty, cons(a, k)) → F(cons(a, k), k)
F(cons(a, k), y) → F(y, k)
The TRS R consists of the following rules:
f(x, empty) → x
f(empty, cons(a, k)) → f(cons(a, k), k)
f(cons(a, k), y) → f(y, k)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.