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