YES

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
f(0,1,x:S) -> f(x:S,x:S,x:S)
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(0,1,x:S) -> f(x:S,x:S,x:S)
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(0,1,x:S) -> F(x:S,x:S,x:S)
-> Rules:
 f(0,1,x:S) -> f(x:S,x:S,x:S)

Problem 1: 

SCC Processor:
-> Pairs:
 F(0,1,x:S) -> F(x:S,x:S,x:S)
-> Rules:
 f(0,1,x:S) -> f(x:S,x:S,x:S)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.