2.97/1.49	WORST_CASE(NON_POLY, ?)
2.97/1.50	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
2.97/1.50	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.97/1.50	
2.97/1.50	
2.97/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.50	
2.97/1.50	(0) Name of obligation not specified
2.97/1.50	(1) ExtraVarProof [FINISHED, 0 ms]
2.97/1.50	(2) BOUNDS(INF, INF)
2.97/1.50	
2.97/1.50	
2.97/1.50	----------------------------------------
2.97/1.50	
2.97/1.50	(0)
2.97/1.50	Obligation:
2.97/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.50	
2.97/1.50	
2.97/1.50	The TRS R consists of the following rules:
2.97/1.50	
2.97/1.50	   hd(cons) -> X
2.97/1.50	   tl(cons) -> Y
2.97/1.50	   nats -> adx(zeros)
2.97/1.50	   zeros -> cons
2.97/1.50	   incr(cons) -> cons
2.97/1.50	   adx(cons) -> incr(cons)
2.97/1.50	
2.97/1.50	
2.97/1.50	----------------------------------------
2.97/1.50	
2.97/1.50	(1) ExtraVarProof (FINISHED)
2.97/1.50	unbounded runtime complexity due to extra variable on rhs
2.97/1.50	----------------------------------------
2.97/1.50	
2.97/1.50	(2)
2.97/1.50	BOUNDS(INF, INF)
3.12/1.64	EOF