2.93/1.47	WORST_CASE(NON_POLY, ?)
2.93/1.48	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
2.93/1.48	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.93/1.48	
2.93/1.48	
2.93/1.48	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.93/1.48	
2.93/1.48	(0) Name of obligation not specified
2.93/1.48	(1) ExtraVarProof [FINISHED, 0 ms]
2.93/1.48	(2) BOUNDS(INF, INF)
2.93/1.48	
2.93/1.48	
2.93/1.48	----------------------------------------
2.93/1.48	
2.93/1.48	(0)
2.93/1.48	Obligation:
2.93/1.48	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.93/1.48	
2.93/1.48	
2.93/1.48	The TRS R consists of the following rules:
2.93/1.48	
2.93/1.48	   sel(s(N), cons(X)) -> sel(N, XS)
2.93/1.48	   fib(N) -> sel(N, fib1(s(0), s(0)))
2.93/1.48	   fib1(X, Y) -> cons(X)
2.93/1.48	   add(0, X) -> X
2.93/1.48	   add(s(X), Y) -> s(add(X, Y))
2.93/1.48	   sel(0, cons(X)) -> X
2.93/1.48	
2.93/1.48	
2.93/1.48	----------------------------------------
2.93/1.48	
2.93/1.48	(1) ExtraVarProof (FINISHED)
2.93/1.48	unbounded runtime complexity due to extra variable on rhs
2.93/1.48	----------------------------------------
2.93/1.48	
2.93/1.48	(2)
2.93/1.48	BOUNDS(INF, INF)
3.00/1.52	EOF