f(empty,

f(cons(

g(

R

↳Dependency Pair Analysis

F(cons(x,k),l) -> G(k,l, cons(x,k))

G(a,b,c) -> F(a, cons(b,c))

Furthermore,

R

↳DPs

→DP Problem 1

↳Remaining Obligation(s)

The following remains to be proven:

**G( a, b, c) -> F(a, cons(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))

Duration:

0:00 minutes