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