TRS:
 {         app(nil(), YS) -> YS,
         app(cons(X), YS) -> cons(X),
                  from(X) -> cons(X),
         zWadr(nil(), YS) -> nil(),
         zWadr(XS, nil()) -> nil(),
  zWadr(cons(X), cons(Y)) -> cons(app(Y, cons(X))),
                prefix(L) -> cons(nil())}
 RPO Product:
  Quasi-Precedence:
  zWadr > app
  empty
  
  Qed


TRS:
 {         app(nil(), YS) -> YS,
         app(cons(X), YS) -> cons(X),
                  from(X) -> cons(X),
         zWadr(nil(), YS) -> nil(),
         zWadr(XS, nil()) -> nil(),
  zWadr(cons(X), cons(Y)) -> cons(app(Y, cons(X))),
                prefix(L) -> cons(nil())}
 Cdiprover:
  Interpretation class: quasisimplemixed
  Complexity bound: POLYTIME COMPUTABLE IF RPO-TERMINATING
  prefix(X6) = + 0*X6^2 + 2 + 2*X6
  zWadr(X5, X4) = + 0*X5^2 + 0*X4^2 + 2*X5 + 0 + 2*X4 + 3*X4*X5
  from(X3) = + 0*X3^2 + 2 + 2*X3
  cons(X2) = + 1*X2 + 1
  nil = + 0
  app(X1, X0) = + 0*X1^2 + 0*X0^2 + 2*X1 + 0 + 2*X0 + 0*X0*X1
  
  Qed