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] f(tt,nil) -> f(tt,nil)
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 = f(tt,nil) and theta2(theta1(l)) = theta1(r|p).
Hence, the term theta1(l) = f(tt,nil) 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, 1 unfolded rule generated.
# Iteration 1: loop detected, 2 unfolded rules generated.
Here is the successful unfolding. Let IR be the TRS under analysis.
L0 = f^#(tt,_0) -> f^#(isList(_0),_0) is in U_IR^0.
Let p0 = [0].
We unfold the rule of L0 forwards at position p0
with the rule isList(nil) -> tt.
==> L1 = f^#(tt,nil) -> f^#(tt,nil) 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