YES

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
f(g(x:S),s(0)) -> f(g(x:S),g(x:S))
g(0) -> 0
g(s(x:S)) -> s(g(x:S))
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(g(x:S),s(0)) -> F(g(x:S),g(x:S))
 G(s(x:S)) -> G(x:S)
-> Rules:
 f(g(x:S),s(0)) -> f(g(x:S),g(x:S))
 g(0) -> 0
 g(s(x:S)) -> s(g(x:S))

Problem 1: 

SCC Processor:
-> Pairs:
 F(g(x:S),s(0)) -> F(g(x:S),g(x:S))
 G(s(x:S)) -> G(x:S)
-> Rules:
 f(g(x:S),s(0)) -> f(g(x:S),g(x:S))
 g(0) -> 0
 g(s(x:S)) -> s(g(x:S))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G(s(x:S)) -> G(x:S)
->->-> Rules:
 f(g(x:S),s(0)) -> f(g(x:S),g(x:S))
 g(0) -> 0
 g(s(x:S)) -> s(g(x:S))

Problem 1: 

Subterm Processor:
-> Pairs:
 G(s(x:S)) -> G(x:S)
-> Rules:
 f(g(x:S),s(0)) -> f(g(x:S),g(x:S))
 g(0) -> 0
 g(s(x:S)) -> s(g(x:S))
->Projection:
 pi(G) = 1

Problem 1: 

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

The problem is finite.