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