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