2.31/1.28	NO
2.55/1.28	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.55/1.28	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.55/1.28	
2.55/1.28	
2.55/1.28	Outermost Termination of the given OTRS could be disproven:
2.55/1.28	
2.55/1.28	(0) OTRS
2.55/1.28	(1) OutermostNonTerminationProof [COMPLETE, 0 ms]
2.55/1.28	(2) NO
2.55/1.28	
2.55/1.28	
2.55/1.28	----------------------------------------
2.55/1.28	
2.55/1.28	(0)
2.55/1.28	Obligation:
2.55/1.28	Term rewrite system R:
2.55/1.28	The TRS R consists of the following rules:
2.55/1.28	
2.55/1.28	   sel(0, cons) -> X
2.55/1.28	   sel(s, cons) -> sel(X, Z)
2.55/1.28	   dbl1(s) -> s1(s1(dbl1(X)))
2.55/1.28	   sel1(0, cons) -> X
2.55/1.28	   sel1(s, cons) -> sel1(X, Z)
2.55/1.28	   quote(s) -> s1(quote(X))
2.55/1.28	   dbl(0) -> 0
2.55/1.28	   dbl(s) -> s
2.55/1.28	   dbls(nil) -> nil
2.55/1.28	   dbls(cons) -> cons
2.55/1.28	   indx(nil) -> nil
2.55/1.28	   indx(cons) -> cons
2.55/1.28	   from -> cons
2.55/1.28	   dbl1(0) -> 01
2.55/1.28	   quote(0) -> 01
2.55/1.28	   quote(dbl(X)) -> dbl1(X)
2.55/1.28	   quote(sel(X, Y)) -> sel1(X, Y)
2.55/1.28	
2.55/1.28	
2.55/1.28	
2.55/1.28	Outermost Strategy.
2.55/1.28	
2.55/1.28	----------------------------------------
2.55/1.28	
2.55/1.28	(1) OutermostNonTerminationProof (COMPLETE)
2.55/1.28	Term rewrite system R:
2.55/1.28	The TRS R consists of the following rules:
2.55/1.28	
2.55/1.28	   sel(0, cons) -> X
2.55/1.28	   sel(s, cons) -> sel(X, Z)
2.55/1.28	   dbl1(s) -> s1(s1(dbl1(X)))
2.55/1.28	   sel1(0, cons) -> X
2.55/1.28	   sel1(s, cons) -> sel1(X, Z)
2.55/1.28	   quote(s) -> s1(quote(X))
2.55/1.28	   dbl(0) -> 0
2.55/1.28	   dbl(s) -> s
2.55/1.28	   dbls(nil) -> nil
2.55/1.28	   dbls(cons) -> cons
2.55/1.28	   indx(nil) -> nil
2.55/1.28	   indx(cons) -> cons
2.55/1.28	   from -> cons
2.55/1.28	   dbl1(0) -> 01
2.55/1.28	   quote(0) -> 01
2.55/1.28	   quote(dbl(X)) -> dbl1(X)
2.55/1.28	   quote(sel(X, Y)) -> sel1(X, Y)
2.55/1.28	
2.55/1.28	
2.55/1.28	
2.55/1.28	Outermost Strategy.
2.55/1.28	
2.55/1.28	---------- Loop: ----------
2.55/1.28	
2.55/1.28	sel(0, cons) -> sel(0, cons) with rule sel(0, cons) -> X at position [] and matcher [X / sel(0, cons)]
2.55/1.28	
2.55/1.28	Now an instance of the first term with Matcher [ ] occurs in the last term at position [].
2.55/1.28	
2.55/1.28	Context: []
2.55/1.28	
2.55/1.28	We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
2.55/1.28	----------------------------------------
2.55/1.28	
2.55/1.28	(2)
2.55/1.28	NO
2.55/1.32	EOF