NO

Problem 1: 

(VAR v_NonEmpty:S X:S X1:S Y:S Z:S)
(RULES
2nd(cons(X:S,X1:S)) -> 2nd(cons1(X:S,X1:S))
2nd(cons1(X:S,cons(Y:S,Z:S))) -> Y:S
from(X:S) -> cons(X:S,from(s(X:S)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 2ND(cons(X:S,X1:S)) -> 2ND(cons1(X:S,X1:S))
 FROM(X:S) -> FROM(s(X:S))
-> Rules:
 2nd(cons(X:S,X1:S)) -> 2nd(cons1(X:S,X1:S))
 2nd(cons1(X:S,cons(Y:S,Z:S))) -> Y:S
 from(X:S) -> cons(X:S,from(s(X:S)))

Problem 1: 

Infinite Processor:
-> Pairs:
 2ND(cons(X:S,X1:S)) -> 2ND(cons1(X:S,X1:S))
 FROM(X:S) -> FROM(s(X:S))
-> Rules:
 2nd(cons(X:S,X1:S)) -> 2nd(cons1(X:S,X1:S))
 2nd(cons1(X:S,cons(Y:S,Z:S))) -> Y:S
 from(X:S) -> cons(X:S,from(s(X:S)))
-> Pairs in cycle:
 FROM(X:S) -> FROM(s(X:S))

The problem is infinite.