/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


Outermost Termination of the given OTRS could be disproven:

(0) OTRS
(1) OutermostNonTerminationProof [COMPLETE, 0 ms]
(2) NO


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

(0)
Obligation:
Term rewrite system R:
The TRS R consists of the following rules:

   and(tt) -> X
   length(cons(N)) -> s(length(L))
   zeros -> cons(0)
   length(nil) -> 0
   take(0, IL) -> nil
   take(s(M), cons(N)) -> cons(N)



Outermost Strategy.

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

(1) OutermostNonTerminationProof (COMPLETE)
Term rewrite system R:
The TRS R consists of the following rules:

   and(tt) -> X
   length(cons(N)) -> s(length(L))
   zeros -> cons(0)
   length(nil) -> 0
   take(0, IL) -> nil
   take(s(M), cons(N)) -> cons(N)



Outermost Strategy.

---------- Loop: ----------

and(tt) -> and(tt) with rule and(tt) -> X at position [] and matcher [X / and(tt)]

Now an instance of the first term with Matcher [ ] occurs in the last term at position [].

Context: []

We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
----------------------------------------

(2)
NO