YES

Problem 1: 

(VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S)
(RULES
2nd(cons(X:S,n__cons(Y:S,Z:S))) -> activate(Y:S)
activate(n__cons(X1:S,X2:S)) -> cons(X1:S,X2:S)
activate(n__from(X:S)) -> from(X:S)
activate(X:S) -> X:S
cons(X1:S,X2:S) -> n__cons(X1:S,X2:S)
from(X:S) -> cons(X:S,n__from(s(X:S)))
from(X:S) -> n__from(X:S)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 2ND(cons(X:S,n__cons(Y:S,Z:S))) -> ACTIVATE(Y:S)
 ACTIVATE(n__cons(X1:S,X2:S)) -> CONS(X1:S,X2:S)
 ACTIVATE(n__from(X:S)) -> FROM(X:S)
 FROM(X:S) -> CONS(X:S,n__from(s(X:S)))
-> Rules:
 2nd(cons(X:S,n__cons(Y:S,Z:S))) -> activate(Y:S)
 activate(n__cons(X1:S,X2:S)) -> cons(X1:S,X2:S)
 activate(n__from(X:S)) -> from(X:S)
 activate(X:S) -> X:S
 cons(X1:S,X2:S) -> n__cons(X1:S,X2:S)
 from(X:S) -> cons(X:S,n__from(s(X:S)))
 from(X:S) -> n__from(X:S)

Problem 1: 

SCC Processor:
-> Pairs:
 2ND(cons(X:S,n__cons(Y:S,Z:S))) -> ACTIVATE(Y:S)
 ACTIVATE(n__cons(X1:S,X2:S)) -> CONS(X1:S,X2:S)
 ACTIVATE(n__from(X:S)) -> FROM(X:S)
 FROM(X:S) -> CONS(X:S,n__from(s(X:S)))
-> Rules:
 2nd(cons(X:S,n__cons(Y:S,Z:S))) -> activate(Y:S)
 activate(n__cons(X1:S,X2:S)) -> cons(X1:S,X2:S)
 activate(n__from(X:S)) -> from(X:S)
 activate(X:S) -> X:S
 cons(X1:S,X2:S) -> n__cons(X1:S,X2:S)
 from(X:S) -> cons(X:S,n__from(s(X:S)))
 from(X:S) -> n__from(X:S)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.