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