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