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 = 0] app(app(_0,0),_1) -> app(app(hd,app(app(map,_0),app(app(cons,0),nil))),_1)
Let l be the left-hand side and r be the right-hand side of this rule.
Let p = [0, 1, 1], theta1 = {} and theta2 = {_1->nil, _0->cons}.
We have r|p = app(app(cons,0),nil) and theta2(theta1(l)) = theta1(r|p).
Hence, the term theta1(l) = app(app(_0,0),_1) 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: loop detected, 1 unfolded rule generated.
Here is the successful unfolding. Let IR be the TRS under analysis.
L0 = app^#(app(_0,0),_1) -> app^#(app(hd,app(app(map,_0),app(app(cons,0),nil))),_1) is in U_IR^0.

** END proof description **

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