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
   
   interpretation:
    [a__prefix#](x0) = x0,
    
    [a__zWadr#](x0, x1) = 4x0 + 4x1 + 3,
    
    [a__from#](x0) = 4x0 + 2,
    
    [mark#](x0) = 4x0 + 1,
    
    [a__app#](x0, x1) = 4x0 + 4x1 + 4,
    
    [prefix](x0) = 2x0 + 4,
    
    [a__prefix](x0) = 2x0 + 4,
    
    [zWadr](x0, x1) = 3x0 + 4x1 + 1,
    
    [a__zWadr](x0, x1) = 3x0 + 4x1 + 1,
    
    [from](x0) = x0 + 4,
    
    [s](x0) = 4x0 + 2,
    
    [a__from](x0) = x0 + 4,
    
    [app](x0, x1) = 4x0 + 2x1 + 4,
    
    [cons](x0, x1) = x0 + 2,
    
    [mark](x0) = x0,
    
    [a__app](x0, x1) = 4x0 + 2x1 + 4,
    
    [nil] = 0
   orientation:
    a__app#(nil(),YS) = 4YS + 4 >= 4YS + 1 = mark#(YS)
    
    a__app#(cons(X,XS),YS) = 4X + 4YS + 12 >= 4X + 1 = mark#(X)
    
    a__from#(X) = 4X + 2 >= 4X + 1 = mark#(X)
    
    a__zWadr#(cons(X,XS),cons(Y,YS)) = 4X + 4Y + 19 >= 4X + 1 = mark#(X)
    
    a__zWadr#(cons(X,XS),cons(Y,YS)) = 4X + 4Y + 19 >= 4Y + 1 = mark#(Y)
    
    a__zWadr#(cons(X,XS),cons(Y,YS)) = 4X + 4Y + 19 >= 4X + 4Y + 12 = a__app#(mark(Y),cons(mark(X),nil()))
    
    mark#(app(X1,X2)) = 16X1 + 8X2 + 17 >= 4X2 + 1 = mark#(X2)
    
    mark#(app(X1,X2)) = 16X1 + 8X2 + 17 >= 4X1 + 1 = mark#(X1)
    
    mark#(app(X1,X2)) = 16X1 + 8X2 + 17 >= 4X1 + 4X2 + 4 = a__app#(mark(X1),mark(X2))
    
    mark#(from(X)) = 4X + 17 >= 4X + 1 = mark#(X)
    
    mark#(from(X)) = 4X + 17 >= 4X + 2 = a__from#(mark(X))
    
    mark#(zWadr(X1,X2)) = 12X1 + 16X2 + 5 >= 4X2 + 1 = mark#(X2)
    
    mark#(zWadr(X1,X2)) = 12X1 + 16X2 + 5 >= 4X1 + 1 = mark#(X1)
    
    mark#(zWadr(X1,X2)) = 12X1 + 16X2 + 5 >= 4X1 + 4X2 + 3 = a__zWadr#(mark(X1),mark(X2))
    
    mark#(prefix(X)) = 8X + 17 >= 4X + 1 = mark#(X)
    
    mark#(prefix(X)) = 8X + 17 >= X = a__prefix#(mark(X))
    
    mark#(cons(X1,X2)) = 4X1 + 9 >= 4X1 + 1 = mark#(X1)
    
    mark#(s(X)) = 16X + 9 >= 4X + 1 = mark#(X)
    
    a__app(nil(),YS) = 2YS + 4 >= YS = mark(YS)
    
    a__app(cons(X,XS),YS) = 4X + 2YS + 12 >= X + 2 = cons(mark(X),app(XS,YS))
    
    a__from(X) = X + 4 >= X + 2 = cons(mark(X),from(s(X)))
    
    a__zWadr(nil(),YS) = 4YS + 1 >= 0 = nil()
    
    a__zWadr(XS,nil()) = 3XS + 1 >= 0 = nil()
    
    a__zWadr(cons(X,XS),cons(Y,YS)) = 3X + 4Y + 15 >= 2X + 4Y + 10 = cons(a__app(mark(Y),cons(mark(X),nil())),zWadr(XS,YS))
    
    a__prefix(L) = 2L + 4 >= 2 = cons(nil(),zWadr(L,prefix(L)))
    
    mark(app(X1,X2)) = 4X1 + 2X2 + 4 >= 4X1 + 2X2 + 4 = a__app(mark(X1),mark(X2))
    
    mark(from(X)) = X + 4 >= X + 4 = a__from(mark(X))
    
    mark(zWadr(X1,X2)) = 3X1 + 4X2 + 1 >= 3X1 + 4X2 + 1 = a__zWadr(mark(X1),mark(X2))
    
    mark(prefix(X)) = 2X + 4 >= 2X + 4 = a__prefix(mark(X))
    
    mark(nil()) = 0 >= 0 = nil()
    
    mark(cons(X1,X2)) = X1 + 2 >= X1 + 2 = cons(mark(X1),X2)
    
    mark(s(X)) = 4X + 2 >= 4X + 2 = s(mark(X))
    
    a__app(X1,X2) = 4X1 + 2X2 + 4 >= 4X1 + 2X2 + 4 = app(X1,X2)
    
    a__from(X) = X + 4 >= X + 4 = from(X)
    
    a__zWadr(X1,X2) = 3X1 + 4X2 + 1 >= 3X1 + 4X2 + 1 = zWadr(X1,X2)
    
    a__prefix(X) = 2X + 4 >= 2X + 4 = 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