2.96/1.48	WORST_CASE(NON_POLY, ?)
2.96/1.49	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.96/1.49	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.96/1.49	
2.96/1.49	
2.96/1.49	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.96/1.49	
2.96/1.49	(0) Name of obligation not specified
2.96/1.49	(1) ExtraVarProof [FINISHED, 0 ms]
2.96/1.49	(2) BOUNDS(INF, INF)
2.96/1.49	
2.96/1.49	
2.96/1.49	----------------------------------------
2.96/1.49	
2.96/1.49	(0)
2.96/1.49	Obligation:
2.96/1.49	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.96/1.49	
2.96/1.49	
2.96/1.49	The TRS R consists of the following rules:
2.96/1.49	
2.96/1.49	   tail(cons(X)) -> XS
2.96/1.49	   zeros -> cons(0)
2.96/1.49	
2.96/1.49	
2.96/1.49	----------------------------------------
2.96/1.49	
2.96/1.49	(1) ExtraVarProof (FINISHED)
2.96/1.49	unbounded runtime complexity due to extra variable on rhs
2.96/1.49	----------------------------------------
2.96/1.49	
2.96/1.49	(2)
2.96/1.49	BOUNDS(INF, INF)
3.06/1.53	EOF