f(x, empty) → x
f(empty, cons(a, k)) → f(cons(a, k), k)
f(cons(a, k), y) → f(y, k)
↳ QTRS
↳ DependencyPairsProof
f(x, empty) → x
f(empty, cons(a, k)) → f(cons(a, k), k)
f(cons(a, k), y) → f(y, k)
F(empty, cons(a, k)) → F(cons(a, k), k)
F(cons(a, k), y) → F(y, k)
f(x, empty) → x
f(empty, cons(a, k)) → f(cons(a, k), k)
f(cons(a, k), y) → f(y, k)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
F(empty, cons(a, k)) → F(cons(a, k), k)
F(cons(a, k), y) → F(y, k)
f(x, empty) → x
f(empty, cons(a, k)) → f(cons(a, k), k)
f(cons(a, k), y) → f(y, k)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(empty, cons(a, k)) → F(cons(a, k), k)
F(cons(a, k), y) → F(y, k)
The value of delta used in the strict ordering is 3.
POL(cons(x1, x2)) = 3 + (2)x_1 + (4)x_2
POL(empty) = 0
POL(F(x1, x2)) = (3)x_1 + (4)x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
f(x, empty) → x
f(empty, cons(a, k)) → f(cons(a, k), k)
f(cons(a, k), y) → f(y, k)