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