YES Problem: a__app(nil(),YS) -> mark(YS) a__app(cons(X,XS),YS) -> cons(mark(X),app(XS,YS)) a__from(X) -> cons(mark(X),from(s(X))) a__zWadr(nil(),YS) -> nil() a__zWadr(XS,nil()) -> nil() a__zWadr(cons(X,XS),cons(Y,YS)) -> cons(a__app(mark(Y),cons(mark(X),nil())),zWadr(XS,YS)) a__prefix(L) -> cons(nil(),zWadr(L,prefix(L))) mark(app(X1,X2)) -> a__app(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(zWadr(X1,X2)) -> a__zWadr(mark(X1),mark(X2)) mark(prefix(X)) -> a__prefix(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(s(X)) -> s(mark(X)) a__app(X1,X2) -> app(X1,X2) a__from(X) -> from(X) a__zWadr(X1,X2) -> zWadr(X1,X2) a__prefix(X) -> prefix(X) Proof: DP Processor: DPs: a__app#(nil(),YS) -> mark#(YS) a__app#(cons(X,XS),YS) -> mark#(X) a__from#(X) -> mark#(X) a__zWadr#(cons(X,XS),cons(Y,YS)) -> mark#(X) a__zWadr#(cons(X,XS),cons(Y,YS)) -> mark#(Y) a__zWadr#(cons(X,XS),cons(Y,YS)) -> a__app#(mark(Y),cons(mark(X),nil())) mark#(app(X1,X2)) -> mark#(X2) mark#(app(X1,X2)) -> mark#(X1) mark#(app(X1,X2)) -> a__app#(mark(X1),mark(X2)) mark#(from(X)) -> mark#(X) mark#(from(X)) -> a__from#(mark(X)) mark#(zWadr(X1,X2)) -> mark#(X2) mark#(zWadr(X1,X2)) -> mark#(X1) mark#(zWadr(X1,X2)) -> a__zWadr#(mark(X1),mark(X2)) mark#(prefix(X)) -> mark#(X) mark#(prefix(X)) -> a__prefix#(mark(X)) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__app(nil(),YS) -> mark(YS) a__app(cons(X,XS),YS) -> cons(mark(X),app(XS,YS)) a__from(X) -> cons(mark(X),from(s(X))) a__zWadr(nil(),YS) -> nil() a__zWadr(XS,nil()) -> nil() a__zWadr(cons(X,XS),cons(Y,YS)) -> cons(a__app(mark(Y),cons(mark(X),nil())),zWadr(XS,YS)) a__prefix(L) -> cons(nil(),zWadr(L,prefix(L))) mark(app(X1,X2)) -> a__app(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(zWadr(X1,X2)) -> a__zWadr(mark(X1),mark(X2)) mark(prefix(X)) -> a__prefix(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(s(X)) -> s(mark(X)) a__app(X1,X2) -> app(X1,X2) a__from(X) -> from(X) a__zWadr(X1,X2) -> zWadr(X1,X2) a__prefix(X) -> prefix(X) Matrix Interpretation Processor: dim=1 usable rules: a__app(nil(),YS) -> mark(YS) a__app(cons(X,XS),YS) -> cons(mark(X),app(XS,YS)) a__from(X) -> cons(mark(X),from(s(X))) a__zWadr(nil(),YS) -> nil() a__zWadr(XS,nil()) -> nil() a__zWadr(cons(X,XS),cons(Y,YS)) -> cons(a__app(mark(Y),cons(mark(X),nil())),zWadr(XS,YS)) a__prefix(L) -> cons(nil(),zWadr(L,prefix(L))) mark(app(X1,X2)) -> a__app(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(zWadr(X1,X2)) -> a__zWadr(mark(X1),mark(X2)) mark(prefix(X)) -> a__prefix(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(s(X)) -> s(mark(X)) a__app(X1,X2) -> app(X1,X2) a__from(X) -> from(X) a__zWadr(X1,X2) -> zWadr(X1,X2) a__prefix(X) -> prefix(X) interpretation: [a__prefix#](x0) = x0, [a__zWadr#](x0, x1) = 4x0 + 4x1 + 4, [a__from#](x0) = 4x0 + 6, [mark#](x0) = 4x0 + 4, [a__app#](x0, x1) = 4x0 + 4x1 + 6, [prefix](x0) = 2x0 + 2, [a__prefix](x0) = 2x0 + 2, [zWadr](x0, x1) = x0 + 4x1 + 1, [a__zWadr](x0, x1) = x0 + 4x1 + 1, [from](x0) = 2x0 + 1, [s](x0) = x0 + 3, [a__from](x0) = 2x0 + 1, [app](x0, x1) = 2x0 + x1 + 4, [cons](x0, x1) = x0 + 1, [mark](x0) = x0, [a__app](x0, x1) = 2x0 + x1 + 4, [nil] = 1 orientation: a__app#(nil(),YS) = 4YS + 10 >= 4YS + 4 = mark#(YS) a__app#(cons(X,XS),YS) = 4X + 4YS + 10 >= 4X + 4 = mark#(X) a__from#(X) = 4X + 6 >= 4X + 4 = mark#(X) a__zWadr#(cons(X,XS),cons(Y,YS)) = 4X + 4Y + 12 >= 4X + 4 = mark#(X) a__zWadr#(cons(X,XS),cons(Y,YS)) = 4X + 4Y + 12 >= 4Y + 4 = mark#(Y) a__zWadr#(cons(X,XS),cons(Y,YS)) = 4X + 4Y + 12 >= 4X + 4Y + 10 = a__app#(mark(Y),cons(mark(X),nil())) mark#(app(X1,X2)) = 8X1 + 4X2 + 20 >= 4X2 + 4 = mark#(X2) mark#(app(X1,X2)) = 8X1 + 4X2 + 20 >= 4X1 + 4 = mark#(X1) mark#(app(X1,X2)) = 8X1 + 4X2 + 20 >= 4X1 + 4X2 + 6 = a__app#(mark(X1),mark(X2)) mark#(from(X)) = 8X + 8 >= 4X + 4 = mark#(X) mark#(from(X)) = 8X + 8 >= 4X + 6 = a__from#(mark(X)) mark#(zWadr(X1,X2)) = 4X1 + 16X2 + 8 >= 4X2 + 4 = mark#(X2) mark#(zWadr(X1,X2)) = 4X1 + 16X2 + 8 >= 4X1 + 4 = mark#(X1) mark#(zWadr(X1,X2)) = 4X1 + 16X2 + 8 >= 4X1 + 4X2 + 4 = a__zWadr#(mark(X1),mark(X2)) mark#(prefix(X)) = 8X + 12 >= 4X + 4 = mark#(X) mark#(prefix(X)) = 8X + 12 >= X = a__prefix#(mark(X)) mark#(cons(X1,X2)) = 4X1 + 8 >= 4X1 + 4 = mark#(X1) mark#(s(X)) = 4X + 16 >= 4X + 4 = mark#(X) a__app(nil(),YS) = YS + 6 >= YS = mark(YS) a__app(cons(X,XS),YS) = 2X + YS + 6 >= X + 1 = cons(mark(X),app(XS,YS)) a__from(X) = 2X + 1 >= X + 1 = cons(mark(X),from(s(X))) a__zWadr(nil(),YS) = 4YS + 2 >= 1 = nil() a__zWadr(XS,nil()) = XS + 5 >= 1 = nil() a__zWadr(cons(X,XS),cons(Y,YS)) = X + 4Y + 6 >= X + 2Y + 6 = cons(a__app(mark(Y),cons(mark(X),nil())),zWadr(XS,YS)) a__prefix(L) = 2L + 2 >= 2 = cons(nil(),zWadr(L,prefix(L))) mark(app(X1,X2)) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = a__app(mark(X1),mark(X2)) mark(from(X)) = 2X + 1 >= 2X + 1 = a__from(mark(X)) mark(zWadr(X1,X2)) = X1 + 4X2 + 1 >= X1 + 4X2 + 1 = a__zWadr(mark(X1),mark(X2)) mark(prefix(X)) = 2X + 2 >= 2X + 2 = a__prefix(mark(X)) mark(nil()) = 1 >= 1 = nil() mark(cons(X1,X2)) = X1 + 1 >= X1 + 1 = cons(mark(X1),X2) mark(s(X)) = X + 3 >= X + 3 = s(mark(X)) a__app(X1,X2) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = app(X1,X2) a__from(X) = 2X + 1 >= 2X + 1 = from(X) a__zWadr(X1,X2) = X1 + 4X2 + 1 >= X1 + 4X2 + 1 = zWadr(X1,X2) a__prefix(X) = 2X + 2 >= 2X + 2 = prefix(X) problem: DPs: TRS: a__app(nil(),YS) -> mark(YS) a__app(cons(X,XS),YS) -> cons(mark(X),app(XS,YS)) a__from(X) -> cons(mark(X),from(s(X))) a__zWadr(nil(),YS) -> nil() a__zWadr(XS,nil()) -> nil() a__zWadr(cons(X,XS),cons(Y,YS)) -> cons(a__app(mark(Y),cons(mark(X),nil())),zWadr(XS,YS)) a__prefix(L) -> cons(nil(),zWadr(L,prefix(L))) mark(app(X1,X2)) -> a__app(mark(X1),mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(zWadr(X1,X2)) -> a__zWadr(mark(X1),mark(X2)) mark(prefix(X)) -> a__prefix(mark(X)) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(s(X)) -> s(mark(X)) a__app(X1,X2) -> app(X1,X2) a__from(X) -> from(X) a__zWadr(X1,X2) -> zWadr(X1,X2) a__prefix(X) -> prefix(X) Qed