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