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

** END proof description **

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