2.32/1.31	NO
2.60/1.31	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.60/1.31	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.60/1.31	
2.60/1.31	
2.60/1.31	Outermost Termination of the given OTRS could be disproven:
2.60/1.31	
2.60/1.31	(0) OTRS
2.60/1.31	(1) OutermostNonTerminationProof [COMPLETE, 54 ms]
2.60/1.31	(2) NO
2.60/1.31	
2.60/1.31	
2.60/1.31	----------------------------------------
2.60/1.31	
2.60/1.31	(0)
2.60/1.31	Obligation:
2.60/1.31	Term rewrite system R:
2.60/1.31	The TRS R consists of the following rules:
2.60/1.31	
2.60/1.31	   zeros -> cons(0, n__zeros)
2.60/1.31	   and(tt, X) -> activate(X)
2.60/1.31	   length(nil) -> 0
2.60/1.31	   length(cons(N, L)) -> s(length(activate(L)))
2.60/1.31	   zeros -> n__zeros
2.60/1.31	   activate(n__zeros) -> zeros
2.60/1.31	   activate(X) -> X
2.60/1.31	
2.60/1.31	
2.60/1.31	
2.60/1.31	Outermost Strategy.
2.60/1.31	
2.60/1.31	----------------------------------------
2.60/1.31	
2.60/1.31	(1) OutermostNonTerminationProof (COMPLETE)
2.60/1.31	Term rewrite system R:
2.60/1.31	The TRS R consists of the following rules:
2.60/1.31	
2.60/1.31	   zeros -> cons(0, n__zeros)
2.60/1.31	   and(tt, X) -> activate(X)
2.60/1.31	   length(nil) -> 0
2.60/1.31	   length(cons(N, L)) -> s(length(activate(L)))
2.60/1.31	   zeros -> n__zeros
2.60/1.31	   activate(n__zeros) -> zeros
2.60/1.31	   activate(X) -> X
2.60/1.31	
2.60/1.31	
2.60/1.31	
2.60/1.31	Outermost Strategy.
2.60/1.31	
2.60/1.31	---------- Loop: ----------
2.60/1.31	
2.60/1.31	length(activate(n__zeros)) -> length(zeros) with rule activate(n__zeros) -> zeros at position [0] and matcher [ ]
2.60/1.31	
2.60/1.31	length(zeros) -> length(cons(0, n__zeros)) with rule zeros -> cons(0, n__zeros) at position [0] and matcher [ ]
2.60/1.31	
2.60/1.31	length(cons(0, n__zeros)) -> s(length(activate(n__zeros))) with rule length(cons(N, L)) -> s(length(activate(L))) at position [] and matcher [N / 0, L / n__zeros]
2.60/1.31	
2.60/1.31	Now an instance of the first term with Matcher [ ] occurs in the last term at position [0].
2.60/1.31	
2.60/1.31	Context: s([])
2.60/1.31	
2.60/1.31	We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
2.60/1.31	----------------------------------------
2.60/1.31	
2.60/1.31	(2)
2.60/1.31	NO
2.65/1.89	EOF