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