YES

Problem 1: 

(VAR v_NonEmpty:S L:S X:S XS:S Y:S YS:S)
(RULES
app(cons(X:S),YS:S) -> cons(X:S)
app(nil,YS:S) -> YS:S
from(X:S) -> cons(X:S)
prefix(L:S) -> cons(nil)
zWadr(cons(X:S),cons(Y:S)) -> cons(app(Y:S,cons(X:S)))
zWadr(nil,YS:S) -> nil
zWadr(XS:S,nil) -> nil
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ZWADR(cons(X:S),cons(Y:S)) -> APP(Y:S,cons(X:S))
-> Rules:
 app(cons(X:S),YS:S) -> cons(X:S)
 app(nil,YS:S) -> YS:S
 from(X:S) -> cons(X:S)
 prefix(L:S) -> cons(nil)
 zWadr(cons(X:S),cons(Y:S)) -> cons(app(Y:S,cons(X:S)))
 zWadr(nil,YS:S) -> nil
 zWadr(XS:S,nil) -> nil

Problem 1: 

SCC Processor:
-> Pairs:
 ZWADR(cons(X:S),cons(Y:S)) -> APP(Y:S,cons(X:S))
-> Rules:
 app(cons(X:S),YS:S) -> cons(X:S)
 app(nil,YS:S) -> YS:S
 from(X:S) -> cons(X:S)
 prefix(L:S) -> cons(nil)
 zWadr(cons(X:S),cons(Y:S)) -> cons(app(Y:S,cons(X:S)))
 zWadr(nil,YS:S) -> nil
 zWadr(XS:S,nil) -> nil
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.