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:

   U31(tt) -> N
   U41(tt) -> s(plus(N, M))
   and(tt) -> X
   U11(tt) -> U12(isNat)
   U12(tt) -> U13(isNat)
   U13(tt) -> tt
   U21(tt) -> U22(isNat)
   U22(tt) -> tt
   isNat -> tt
   isNat -> U11(and(isNatKind))
   isNat -> U21(isNatKind)
   isNatKind -> tt
   isNatKind -> and(isNatKind)
   isNatKind -> isNatKind
   plus(N, 0) -> U31(and(isNat))
   plus(N, s(M)) -> U41(and(and(isNat)))


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

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

(2)
NO