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