/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:

   U62(tt) -> s(length(L))
   zeros -> cons(0)
   U11(tt) -> tt
   U21(tt) -> tt
   U31(tt) -> tt
   U41(tt) -> U42(isNatIList)
   U42(tt) -> tt
   U51(tt) -> U52(isNatList)
   U52(tt) -> tt
   U61(tt) -> U62(isNat)
   isNat -> tt
   isNat -> U11(isNatList)
   isNat -> U21(isNat)
   isNatIList -> U31(isNatList)
   isNatIList -> tt
   isNatIList -> U41(isNat)
   isNatList -> tt
   isNatList -> U51(isNat)
   length(nil) -> 0
   length(cons(N)) -> U61(isNatList)


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

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

(2)
NO