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