/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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) -> N
   U21(tt) -> s(plus(N, M))
   and(tt) -> X
   isNat -> tt
   isNat -> and(isNat)
   isNat -> isNat
   plus(N, 0) -> U11(isNat)
   plus(N, s(M)) -> U21(and(isNat))


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

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

(2)
NO