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