2.58/1.27	NO
2.58/1.28	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
2.58/1.28	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.58/1.28	
2.58/1.28	
2.58/1.28	Outermost Termination of the given OTRS could be disproven:
2.58/1.28	
2.58/1.28	(0) OTRS
2.58/1.28	(1) OutermostNonTerminationProof [COMPLETE, 0 ms]
2.58/1.28	(2) NO
2.58/1.28	
2.58/1.28	
2.58/1.28	----------------------------------------
2.58/1.28	
2.58/1.28	(0)
2.58/1.28	Obligation:
2.58/1.28	Term rewrite system R:
2.58/1.28	The TRS R consists of the following rules:
2.58/1.28	
2.58/1.28	   app(nil, YS) -> YS
2.58/1.28	   app(cons(X, XS), YS) -> cons(X, n__app(activate(XS), YS))
2.58/1.28	   from(X) -> cons(X, n__from(s(X)))
2.58/1.28	   zWadr(nil, YS) -> nil
2.58/1.28	   zWadr(XS, nil) -> nil
2.58/1.28	   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, n__nil)), n__zWadr(activate(XS), activate(YS)))
2.58/1.28	   prefix(L) -> cons(nil, n__zWadr(L, prefix(L)))
2.58/1.28	   app(X1, X2) -> n__app(X1, X2)
2.58/1.28	   from(X) -> n__from(X)
2.58/1.28	   nil -> n__nil
2.58/1.28	   zWadr(X1, X2) -> n__zWadr(X1, X2)
2.58/1.28	   activate(n__app(X1, X2)) -> app(X1, X2)
2.58/1.28	   activate(n__from(X)) -> from(X)
2.58/1.28	   activate(n__nil) -> nil
2.58/1.28	   activate(n__zWadr(X1, X2)) -> zWadr(X1, X2)
2.58/1.28	   activate(X) -> X
2.58/1.28	
2.58/1.28	
2.58/1.28	
2.58/1.28	Outermost Strategy.
2.58/1.28	
2.58/1.28	----------------------------------------
2.58/1.28	
2.58/1.28	(1) OutermostNonTerminationProof (COMPLETE)
2.58/1.28	Term rewrite system R:
2.58/1.28	The TRS R consists of the following rules:
2.58/1.28	
2.58/1.28	   app(nil, YS) -> YS
2.58/1.28	   app(cons(X, XS), YS) -> cons(X, n__app(activate(XS), YS))
2.58/1.28	   from(X) -> cons(X, n__from(s(X)))
2.58/1.28	   zWadr(nil, YS) -> nil
2.58/1.28	   zWadr(XS, nil) -> nil
2.58/1.28	   zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, n__nil)), n__zWadr(activate(XS), activate(YS)))
2.58/1.28	   prefix(L) -> cons(nil, n__zWadr(L, prefix(L)))
2.58/1.28	   app(X1, X2) -> n__app(X1, X2)
2.58/1.28	   from(X) -> n__from(X)
2.58/1.28	   nil -> n__nil
2.58/1.28	   zWadr(X1, X2) -> n__zWadr(X1, X2)
2.58/1.28	   activate(n__app(X1, X2)) -> app(X1, X2)
2.58/1.28	   activate(n__from(X)) -> from(X)
2.58/1.28	   activate(n__nil) -> nil
2.58/1.28	   activate(n__zWadr(X1, X2)) -> zWadr(X1, X2)
2.58/1.28	   activate(X) -> X
2.58/1.28	
2.58/1.28	
2.58/1.28	
2.58/1.28	Outermost Strategy.
2.58/1.28	
2.58/1.28	---------- Loop: ----------
2.58/1.28	
2.58/1.28	prefix(L) -> cons(nil, n__zWadr(L, prefix(L))) with rule prefix(L') -> cons(nil, n__zWadr(L', prefix(L'))) at position [] and matcher [L' / L]
2.58/1.28	
2.58/1.28	Now an instance of the first term with Matcher [ ] occurs in the last term at position [1,1].
2.58/1.28	
2.58/1.28	Context: cons(nil, n__zWadr(L, []))
2.58/1.28	
2.58/1.28	We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
2.58/1.28	----------------------------------------
2.58/1.28	
2.58/1.28	(2)
2.58/1.28	NO
2.58/1.30	EOF