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] g(f(f(_0,_1),_2)) -> g(f(f(g(g(_0)),g(g(_1))),f(g(g(_0)),g(g(_1)))))
Let l be the left-hand side and r be the right-hand side of this rule.
Let p = epsilon, theta1 = {} and theta2 = {_2->f(g(g(_0)),g(g(_1))), _1->g(g(_1)), _0->g(g(_0))}.
We have r|p = g(f(f(g(g(_0)),g(g(_1))),f(g(g(_0)),g(g(_1))))) and theta2(theta1(l)) = theta1(r|p).
Hence, the term theta1(l) = g(f(f(_0,_1),_2)) 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, 4 unfolded rules generated.
# Iteration 1: loop detected, 1 unfolded rule generated.
Here is the successful unfolding. Let IR be the TRS under analysis.
L0 = g^#(f(_0,_1)) -> g^#(g(_0)) is in U_IR^0.
Let p0 = [0].
We unfold the rule of L0 forwards at position p0
with the rule g(f(_0,_1)) -> f(f(g(g(_0)),g(g(_1))),f(g(g(_0)),g(g(_1)))).
==> L1 = g^#(f(f(_0,_1),_2)) -> g^#(f(f(g(g(_0)),g(g(_1))),f(g(g(_0)),g(g(_1))))) is in U_IR^1.

** END proof description **

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