YES Problem: rev1(0(),nil()) -> 0() rev1(s(X),nil()) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev(nil()) -> nil() rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev2(X,nil()) -> nil() rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) Proof: DP Processor: DPs: rev1#(X,cons(Y,L)) -> rev1#(Y,L) rev#(cons(X,L)) -> rev2#(X,L) rev#(cons(X,L)) -> rev1#(X,L) rev2#(X,cons(Y,L)) -> rev2#(Y,L) rev2#(X,cons(Y,L)) -> rev#(rev2(Y,L)) rev2#(X,cons(Y,L)) -> rev#(cons(X,rev(rev2(Y,L)))) TRS: rev1(0(),nil()) -> 0() rev1(s(X),nil()) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev(nil()) -> nil() rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev2(X,nil()) -> nil() rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) Matrix Interpretation Processor: dim=1 interpretation: [rev2#](x0, x1) = 2x1 + 1, [rev#](x0) = x0 + 1, [rev1#](x0, x1) = x1, [rev2](x0, x1) = x1, [rev](x0) = x0, [cons](x0, x1) = 4x1 + 1, [s](x0) = 0, [rev1](x0, x1) = 4x1 + 5, [nil] = 4, [0] = 0 orientation: rev1#(X,cons(Y,L)) = 4L + 1 >= L = rev1#(Y,L) rev#(cons(X,L)) = 4L + 2 >= 2L + 1 = rev2#(X,L) rev#(cons(X,L)) = 4L + 2 >= L = rev1#(X,L) rev2#(X,cons(Y,L)) = 8L + 3 >= 2L + 1 = rev2#(Y,L) rev2#(X,cons(Y,L)) = 8L + 3 >= L + 1 = rev#(rev2(Y,L)) rev2#(X,cons(Y,L)) = 8L + 3 >= 4L + 2 = rev#(cons(X,rev(rev2(Y,L)))) rev1(0(),nil()) = 21 >= 0 = 0() rev1(s(X),nil()) = 21 >= 0 = s(X) rev1(X,cons(Y,L)) = 16L + 9 >= 4L + 5 = rev1(Y,L) rev(nil()) = 4 >= 4 = nil() rev(cons(X,L)) = 4L + 1 >= 4L + 1 = cons(rev1(X,L),rev2(X,L)) rev2(X,nil()) = 4 >= 4 = nil() rev2(X,cons(Y,L)) = 4L + 1 >= 4L + 1 = rev(cons(X,rev(rev2(Y,L)))) problem: DPs: TRS: rev1(0(),nil()) -> 0() rev1(s(X),nil()) -> s(X) rev1(X,cons(Y,L)) -> rev1(Y,L) rev(nil()) -> nil() rev(cons(X,L)) -> cons(rev1(X,L),rev2(X,L)) rev2(X,nil()) -> nil() rev2(X,cons(Y,L)) -> rev(cons(X,rev(rev2(Y,L)))) Qed