NO
proof of /export/starexec/sandbox/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:

   U11(tt) -> s(length(L))
   and(tt) -> X
   zeros -> cons(0)
   isNat -> tt
   isNat -> isNatList
   isNat -> isNat
   isNatIList -> isNatList
   isNatIList -> tt
   isNatIList -> and(isNat)
   isNatList -> tt
   isNatList -> and(isNat)
   length(nil) -> 0
   length(cons(N)) -> U11(and(isNatList))


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

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

(2)
NO