NO
Termination proof of ../tpdb/qualif/no.trs
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:
f(a, f(a, a)) → f(x, b)
↳ GTRS
↳ CritRuleProof
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
f(a, f(a, a)) → f(x, b)
The rule f(a, f(a, a)) → f(x, b) contains free variables in its right-hand side. Hence the TRS is not-terminating.