NO

Prover = TRS(tech=GUIDED_UNF, nb_unfoldings=unlimited, unfold_variables=true, strategy=LEFTMOST_NE)

** BEGIN proof argument **
The following rule was generated while unfolding the analyzed TRS:
[iteration = 1] h(_0,g(_0,s(_0))) -> h(0,g(_0,s(_0)))
Let l be the left-hand side and r be the right-hand side of this rule.
Let p = epsilon, theta1 = {_0->0} and theta2 = {}.
We have r|p = h(0,g(_0,s(_0))) and theta2(theta1(l)) = theta1(r|p).
Hence, the term theta1(l) = h(0,g(0,s(0))) loops w.r.t. the analyzed TRS.
** END proof argument **

** BEGIN proof description **
## Searching for a generalized rewrite rule
(a rule whose right-hand side contains a variable
that does not occur in the left-hand side)...
No generalized rewrite rule found!

## Searching for a loop by unfolding (unfolding of variable subterms: ON)...
# Iteration 0: no loop detected, 2 unfolded rules generated.
# Iteration 1: loop detected, 1 unfolded rule generated.
Here is the successful unfolding. Let IR be the TRS under analysis.
L0 = [h^#(_0,_1) -> f^#(_0,s(_0),_1), f^#(_2,_3,g(_2,_3)) -> h^#(0,g(_2,_3))] is in U_IR^0.
We merge the first and the second rule of L0.
==> L1 = h^#(0,g(0,s(0))) -> h^#(0,g(0,s(0))) is in U_IR^1.

** END proof description **

Proof stopped at iteration 1
Number of unfolded rules generated by this proof = 3
Number of unfolded rules generated by all the parallel proofs = 3