YES
O(n)
TRS:
 {
           app(nil(), YS) -> YS,
         app(cons(X), YS) -> cons(X),
                  from(X) -> cons(X),
         zWadr(XS, nil()) -> nil(),
         zWadr(nil(), YS) -> nil(),
  zWadr(cons(X), cons(Y)) -> cons(app(Y, cons(X))),
                prefix(L) -> cons(nil())
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
             app(nil(), YS) -> YS,
           app(cons(X), YS) -> cons(X),
                    from(X) -> cons(X),
           zWadr(XS, nil()) -> nil(),
           zWadr(nil(), YS) -> nil(),
    zWadr(cons(X), cons(Y)) -> cons(app(Y, cons(X))),
                  prefix(L) -> cons(nil())
   }
  BOUND:
   Automaton:
    {
       prefix_0(6) -> 6,
     zWadr_0(6, 6) -> 6,
         from_0(6) -> 6,
         cons_2(6) -> 6,
         cons_1(6) -> 6,
         cons_0(6) -> 6,
           nil_1() -> 6,
           nil_0() -> 6,
       app_1(6, 6) -> 6,
       app_0(6, 6) -> 6
    }
   Strict:
    {}
   Qed