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