YES

Problem 1: 

(VAR v_NonEmpty:S X:S Y:S)
(RULES
first(0,X:S) -> nil
first(s(X:S),cons(Y:S)) -> cons(Y:S)
from(X:S) -> cons(X:S)
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 first(0,X:S) -> nil
 first(s(X:S),cons(Y:S)) -> cons(Y:S)
 from(X:S) -> cons(X:S)

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 first(0,X:S) -> nil
 first(s(X:S),cons(Y:S)) -> cons(Y:S)
 from(X:S) -> cons(X:S)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.