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