YES

Prover = TRS(tech=PATTERN_RULES, nb_unfoldings=unlimited, max_nb_unfolded_rules=200)

** BEGIN proof argument **
The set of SCCs of the estimated dependency graph is empty.
** 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!

## Applying the DP framework...
The TRS under analysis terminates because the set of SCCs
of its estimated dependency graph is empty.

** END proof description **

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