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