(0) Obligation:
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
and(tt) → X
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))
x(N, 0) → 0
x(N, s(M)) → plus(x(N, M), N)
(1) CritRuleProof (EQUIVALENT transformation)
The rule and(tt) → X contains free variables in its right-hand side. Hence the TRS is not-terminating.
(2) FALSE