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