NO

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

** BEGIN proof argument **
The following generalized rewrite rule was generated while unfolding the analyzed TRS:
2ndspos(s(_0),cons(_1)) -> rcons(posrecip(_2),2ndsneg(_0,_3))
Hence, the term 2ndspos(s(_0),cons(_1)) starts an infinite rewrite sequence 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)...
Found a generalized rewrite rule!

** 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 = 4