3.02/1.51	WORST_CASE(NON_POLY, ?)
3.02/1.51	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.02/1.51	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.02/1.51	
3.02/1.51	
3.02/1.51	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.02/1.51	
3.02/1.51	(0) Name of obligation not specified
3.02/1.51	(1) ExtraVarProof [FINISHED, 0 ms]
3.02/1.51	(2) BOUNDS(INF, INF)
3.02/1.51	
3.02/1.51	
3.02/1.51	----------------------------------------
3.02/1.51	
3.02/1.51	(0)
3.02/1.51	Obligation:
3.02/1.51	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.02/1.51	
3.02/1.51	
3.02/1.51	The TRS R consists of the following rules:
3.02/1.51	
3.02/1.51	   U12(tt) -> s(length(L))
3.02/1.51	   zeros -> cons(0)
3.02/1.51	   U11(tt) -> U12(tt)
3.02/1.51	   length(nil) -> 0
3.02/1.51	   length(cons(N)) -> U11(tt)
3.02/1.51	
3.02/1.51	
3.02/1.51	----------------------------------------
3.02/1.51	
3.02/1.51	(1) ExtraVarProof (FINISHED)
3.02/1.51	unbounded runtime complexity due to extra variable on rhs
3.02/1.51	----------------------------------------
3.02/1.51	
3.02/1.51	(2)
3.02/1.51	BOUNDS(INF, INF)
3.02/1.54	EOF