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