YES

Problem 1: 

(VAR v_NonEmpty:S X:S Y:S Z:S)
(RULES
add(0,X:S) -> X:S
add(s,Y:S) -> s
from(X:S) -> cons(X:S)
fst(0,Z:S) -> nil
fst(s,cons(Y:S)) -> cons(Y:S)
len(cons(X:S)) -> s
len(nil) -> 0
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 add(0,X:S) -> X:S
 add(s,Y:S) -> s
 from(X:S) -> cons(X:S)
 fst(0,Z:S) -> nil
 fst(s,cons(Y:S)) -> cons(Y:S)
 len(cons(X:S)) -> s
 len(nil) -> 0

Problem 1: 

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

The problem is finite.