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