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