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