2.48/1.22	NO
2.49/1.23	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.49/1.23	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.49/1.23	
2.49/1.23	
2.49/1.23	Outermost Termination of the given OTRS could be disproven:
2.49/1.23	
2.49/1.23	(0) OTRS
2.49/1.23	(1) OutermostNonTerminationProof [COMPLETE, 0 ms]
2.49/1.23	(2) NO
2.49/1.23	
2.49/1.23	
2.49/1.23	----------------------------------------
2.49/1.23	
2.49/1.23	(0)
2.49/1.23	Obligation:
2.49/1.23	Term rewrite system R:
2.49/1.23	The TRS R consists of the following rules:
2.49/1.23	
2.49/1.23	   and(tt) -> X
2.49/1.23	   length(cons(N)) -> s(length(L))
2.49/1.23	   zeros -> cons(0)
2.49/1.23	   length(nil) -> 0
2.49/1.23	   take(0, IL) -> nil
2.49/1.23	   take(s(M), cons(N)) -> cons(N)
2.49/1.23	
2.49/1.23	
2.49/1.23	
2.49/1.23	Outermost Strategy.
2.49/1.23	
2.49/1.23	----------------------------------------
2.49/1.23	
2.49/1.23	(1) OutermostNonTerminationProof (COMPLETE)
2.49/1.23	Term rewrite system R:
2.49/1.23	The TRS R consists of the following rules:
2.49/1.23	
2.49/1.23	   and(tt) -> X
2.49/1.23	   length(cons(N)) -> s(length(L))
2.49/1.23	   zeros -> cons(0)
2.49/1.23	   length(nil) -> 0
2.49/1.23	   take(0, IL) -> nil
2.49/1.23	   take(s(M), cons(N)) -> cons(N)
2.49/1.23	
2.49/1.23	
2.49/1.23	
2.49/1.23	Outermost Strategy.
2.49/1.23	
2.49/1.23	---------- Loop: ----------
2.49/1.23	
2.49/1.23	and(tt) -> and(tt) with rule and(tt) -> X at position [] and matcher [X / and(tt)]
2.49/1.23	
2.49/1.23	Now an instance of the first term with Matcher [ ] occurs in the last term at position [].
2.49/1.23	
2.49/1.23	Context: []
2.49/1.23	
2.49/1.23	We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
2.49/1.23	----------------------------------------
2.49/1.23	
2.49/1.23	(2)
2.49/1.23	NO
2.49/1.24	EOF