2.73/1.22	NO
2.73/1.23	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
2.73/1.23	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.73/1.23	
2.73/1.23	
2.73/1.23	Outermost Termination of the given OTRS could be disproven:
2.73/1.23	
2.73/1.23	(0) OTRS
2.73/1.23	(1) OutermostNonTerminationProof [COMPLETE, 0 ms]
2.73/1.23	(2) NO
2.73/1.23	
2.73/1.23	
2.73/1.23	----------------------------------------
2.73/1.23	
2.73/1.23	(0)
2.73/1.23	Obligation:
2.73/1.23	Term rewrite system R:
2.73/1.23	The TRS R consists of the following rules:
2.73/1.23	
2.73/1.23	   and(true) -> X
2.73/1.23	   if(true) -> X
2.73/1.23	   if(false) -> Y
2.73/1.23	   add(0) -> X
2.73/1.23	   and(false) -> false
2.73/1.23	   add(s) -> s
2.73/1.23	   first(0, X) -> nil
2.73/1.23	   first(s, cons) -> cons
2.73/1.23	   from -> cons
2.73/1.23	
2.73/1.23	
2.73/1.23	
2.73/1.23	Outermost Strategy.
2.73/1.23	
2.73/1.23	----------------------------------------
2.73/1.23	
2.73/1.23	(1) OutermostNonTerminationProof (COMPLETE)
2.73/1.23	Term rewrite system R:
2.73/1.23	The TRS R consists of the following rules:
2.73/1.23	
2.73/1.23	   and(true) -> X
2.73/1.23	   if(true) -> X
2.73/1.23	   if(false) -> Y
2.73/1.23	   add(0) -> X
2.73/1.23	   and(false) -> false
2.73/1.23	   add(s) -> s
2.73/1.23	   first(0, X) -> nil
2.73/1.23	   first(s, cons) -> cons
2.73/1.23	   from -> cons
2.73/1.23	
2.73/1.23	
2.73/1.23	
2.73/1.23	Outermost Strategy.
2.73/1.23	
2.73/1.23	---------- Loop: ----------
2.73/1.23	
2.73/1.23	and(true) -> and(true) with rule and(true) -> X at position [] and matcher [X / and(true)]
2.73/1.23	
2.73/1.23	Now an instance of the first term with Matcher [ ] occurs in the last term at position [].
2.73/1.23	
2.73/1.23	Context: []
2.73/1.23	
2.73/1.23	We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
2.73/1.23	----------------------------------------
2.73/1.23	
2.73/1.23	(2)
2.73/1.23	NO
2.76/1.27	EOF