3.05/1.50	WORST_CASE(NON_POLY, ?)
3.05/1.50	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.05/1.50	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.05/1.50	
3.05/1.50	
3.05/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.05/1.50	
3.05/1.50	(0) Name of obligation not specified
3.05/1.50	(1) ExtraVarProof [FINISHED, 0 ms]
3.05/1.50	(2) BOUNDS(INF, INF)
3.05/1.50	
3.05/1.50	
3.05/1.50	----------------------------------------
3.05/1.50	
3.05/1.50	(0)
3.05/1.50	Obligation:
3.05/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.05/1.50	
3.05/1.50	
3.05/1.50	The TRS R consists of the following rules:
3.05/1.50	
3.05/1.50	   tail(cons(X)) -> Y
3.05/1.50	   if(true) -> X
3.05/1.50	   if(false) -> Y
3.05/1.50	   primes -> sieve(from(s(s(0))))
3.05/1.50	   from(X) -> cons(X)
3.05/1.50	   head(cons(X)) -> X
3.05/1.50	   filter(s(s(X)), cons(Y)) -> if(divides(s(s(X)), Y))
3.05/1.50	   sieve(cons(X)) -> cons(X)
3.05/1.50	
3.05/1.50	
3.05/1.50	----------------------------------------
3.05/1.50	
3.05/1.50	(1) ExtraVarProof (FINISHED)
3.05/1.50	unbounded runtime complexity due to extra variable on rhs
3.05/1.50	----------------------------------------
3.05/1.50	
3.05/1.50	(2)
3.05/1.50	BOUNDS(INF, INF)
3.05/1.53	EOF