3.09/1.49	WORST_CASE(NON_POLY, ?)
3.09/1.49	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.09/1.49	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.09/1.49	
3.09/1.49	
3.09/1.49	The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.09/1.49	
3.09/1.49	(0) CpxTRS
3.09/1.49	(1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
3.09/1.49	(2) TRS for Loop Detection
3.09/1.49	(3) DecreasingLoopProof [FINISHED, 0 ms]
3.09/1.49	(4) BOUNDS(EXP, INF)
3.09/1.49	
3.09/1.49	
3.09/1.49	----------------------------------------
3.09/1.49	
3.09/1.49	(0)
3.09/1.49	Obligation:
3.09/1.49	The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.09/1.49	
3.09/1.49	
3.09/1.49	The TRS R consists of the following rules:
3.09/1.49	
3.09/1.49	   fib(0) -> 0
3.09/1.49	   fib(s(0)) -> s(0)
3.09/1.49	   fib(s(s(x))) -> +(fib(s(x)), fib(x))
3.09/1.49	   +(x, 0) -> x
3.09/1.49	   +(x, s(y)) -> s(+(x, y))
3.09/1.49	
3.09/1.49	S is empty.
3.09/1.49	Rewrite Strategy: INNERMOST
3.09/1.49	----------------------------------------
3.09/1.49	
3.09/1.49	(1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
3.09/1.49	Transformed a relative TRS into a decreasing-loop problem.
3.09/1.49	----------------------------------------
3.09/1.49	
3.09/1.49	(2)
3.09/1.49	Obligation:
3.09/1.49	Analyzing the following TRS for decreasing loops:
3.09/1.49	
3.09/1.49	The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.09/1.49	
3.09/1.49	
3.09/1.49	The TRS R consists of the following rules:
3.09/1.49	
3.09/1.49	   fib(0) -> 0
3.09/1.49	   fib(s(0)) -> s(0)
3.09/1.49	   fib(s(s(x))) -> +(fib(s(x)), fib(x))
3.09/1.49	   +(x, 0) -> x
3.09/1.49	   +(x, s(y)) -> s(+(x, y))
3.09/1.49	
3.09/1.49	S is empty.
3.09/1.49	Rewrite Strategy: INNERMOST
3.09/1.49	----------------------------------------
3.09/1.49	
3.09/1.49	(3) DecreasingLoopProof (FINISHED)
3.09/1.49	The following loop(s) give(s) rise to the lower bound EXP:
3.09/1.49	
3.09/1.49	The rewrite sequence
3.09/1.49	
3.09/1.49	fib(s(s(x))) ->^+ +(fib(s(x)), fib(x))
3.09/1.49	
3.09/1.49	gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
3.09/1.49	
3.09/1.49	The pumping substitution is [x / s(x)].
3.09/1.49	
3.09/1.49	The result substitution is [ ].
3.09/1.49	
3.09/1.49	
3.09/1.49	
3.09/1.49	The rewrite sequence
3.09/1.49	
3.09/1.49	fib(s(s(x))) ->^+ +(fib(s(x)), fib(x))
3.09/1.49	
3.09/1.49	gives rise to a decreasing loop by considering the right hand sides subterm at position [1].
3.09/1.49	
3.09/1.49	The pumping substitution is [x / s(s(x))].
3.09/1.49	
3.09/1.49	The result substitution is [ ].
3.09/1.49	
3.09/1.49	
3.09/1.49	
3.09/1.49	
3.09/1.49	----------------------------------------
3.09/1.49	
3.09/1.49	(4)
3.09/1.49	BOUNDS(EXP, INF)
3.26/1.52	EOF