NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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
   isList -> isNeList
   isList -> tt
   isList -> and(isList)
   isNeList -> isQid
   isNeList -> and(isList)
   isNeList -> and(isNeList)
   isNePal -> isQid
   isNePal -> and(isQid)
   isPal -> isNePal
   isPal -> tt
   isQid -> 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