NO
proof of Transformed_CSR_04_PALINDROME_nosorts_L.trs
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 jera 20211004 unpublished


Termination of the given GTRS could be disproven:

(0) GTRS
(1) CritRuleProof [COMPLETE, 0 ms]
(2) NO


----------------------------------------

(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
   __(__(X, Y), Z) -> __(X, __(Y, Z))
   __(X, nil) -> X
   __(nil, X) -> X
   isNePal(__(I, __(P, I))) -> tt


----------------------------------------

(1) CritRuleProof (COMPLETE)
The rule and(tt) -> X contains free variables in its right-hand side. Hence the TRS is not-terminating.
----------------------------------------

(2)
NO