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