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


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


NO
proof of /export/starexec/sandbox2/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) -> s(length(L))
   U31(tt) -> cons(N)
   and(tt) -> X
   zeros -> cons(0)
   U21(tt) -> nil
   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))
   take(0, IL) -> U21(isNatIList)
   take(s(M), cons(N)) -> U31(and(isNatIList))


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

(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