Termination of the following Term Rewriting System could be disproven:
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
2nd(cons(X)) → Y
from(X) → cons(X)
↳ GTRS
↳ CritRuleProof
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
2nd(cons(X)) → Y
from(X) → cons(X)
The rule 2nd(cons(X)) → Y contains free variables in its right-hand side. Hence the TRS is not-terminating.