rev(

r1(empty,

r1(cons(

R

↳Dependency Pair Analysis

REV(ls) -> R1(ls, empty)

R1(cons(x,k),a) -> R1(k, cons(x,a))

Furthermore,

R

↳DPs

→DP Problem 1

↳Remaining Obligation(s)

The following remains to be proven:

**R1(cons( x, k), a) -> R1(k, cons(x, a))**

rev(ls) -> r1(ls, empty)

r1(empty,a) ->a

r1(cons(x,k),a) -> r1(k, cons(x,a))

Duration:

0:00 minutes