3.36/1.56	WORST_CASE(NON_POLY, ?)
3.36/1.56	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.36/1.56	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.36/1.56	
3.36/1.56	
3.36/1.56	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.36/1.56	
3.36/1.56	(0) CpxTRS
3.36/1.56	(1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
3.36/1.56	(2) TRS for Loop Detection
3.36/1.56	(3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
3.36/1.56	(4) BEST
3.36/1.56	    (5) proven lower bound
3.36/1.56	        (6) LowerBoundPropagationProof [FINISHED, 0 ms]
3.36/1.56	        (7) BOUNDS(n^1, INF)
3.36/1.56	    (8) TRS for Loop Detection
3.36/1.56	        (9) DecreasingLoopProof [FINISHED, 4 ms]
3.36/1.56	        (10) BOUNDS(EXP, INF)
3.36/1.56	
3.36/1.56	
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(0)
3.36/1.56	Obligation:
3.36/1.56	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.36/1.56	
3.36/1.56	
3.36/1.56	The TRS R consists of the following rules:
3.36/1.56	
3.36/1.56	   exp(x, 0) -> s(0)
3.36/1.56	   exp(x, s(y)) -> *(x, exp(x, y))
3.36/1.56	   *(0, y) -> 0
3.36/1.56	   *(s(x), y) -> +(y, *(x, y))
3.36/1.56	   -(0, y) -> 0
3.36/1.56	   -(x, 0) -> x
3.36/1.56	   -(s(x), s(y)) -> -(x, y)
3.36/1.56	
3.36/1.56	S is empty.
3.36/1.56	Rewrite Strategy: FULL
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
3.36/1.56	Transformed a relative TRS into a decreasing-loop problem.
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(2)
3.36/1.56	Obligation:
3.36/1.56	Analyzing the following TRS for decreasing loops:
3.36/1.56	
3.36/1.56	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.36/1.56	
3.36/1.56	
3.36/1.56	The TRS R consists of the following rules:
3.36/1.56	
3.36/1.56	   exp(x, 0) -> s(0)
3.36/1.56	   exp(x, s(y)) -> *(x, exp(x, y))
3.36/1.56	   *(0, y) -> 0
3.36/1.56	   *(s(x), y) -> +(y, *(x, y))
3.36/1.56	   -(0, y) -> 0
3.36/1.56	   -(x, 0) -> x
3.36/1.56	   -(s(x), s(y)) -> -(x, y)
3.36/1.56	
3.36/1.56	S is empty.
3.36/1.56	Rewrite Strategy: FULL
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(3) DecreasingLoopProof (LOWER BOUND(ID))
3.36/1.56	The following loop(s) give(s) rise to the lower bound Omega(n^1):
3.36/1.56	
3.36/1.56	The rewrite sequence
3.36/1.56	
3.36/1.56	exp(x, s(y)) ->^+ *(x, exp(x, y))
3.36/1.56	
3.36/1.56	gives rise to a decreasing loop by considering the right hand sides subterm at position [1].
3.36/1.56	
3.36/1.56	The pumping substitution is [y / s(y)].
3.36/1.56	
3.36/1.56	The result substitution is [ ].
3.36/1.56	
3.36/1.56	
3.36/1.56	
3.36/1.56	
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(4)
3.36/1.56	Complex Obligation (BEST)
3.36/1.56	
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(5)
3.36/1.56	Obligation:
3.36/1.56	Proved the lower bound n^1 for the following obligation:
3.36/1.56	
3.36/1.56	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.36/1.56	
3.36/1.56	
3.36/1.56	The TRS R consists of the following rules:
3.36/1.56	
3.36/1.56	   exp(x, 0) -> s(0)
3.36/1.56	   exp(x, s(y)) -> *(x, exp(x, y))
3.36/1.56	   *(0, y) -> 0
3.36/1.56	   *(s(x), y) -> +(y, *(x, y))
3.36/1.56	   -(0, y) -> 0
3.36/1.56	   -(x, 0) -> x
3.36/1.56	   -(s(x), s(y)) -> -(x, y)
3.36/1.56	
3.36/1.56	S is empty.
3.36/1.56	Rewrite Strategy: FULL
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(6) LowerBoundPropagationProof (FINISHED)
3.36/1.56	Propagated lower bound.
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(7)
3.36/1.56	BOUNDS(n^1, INF)
3.36/1.56	
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(8)
3.36/1.56	Obligation:
3.36/1.56	Analyzing the following TRS for decreasing loops:
3.36/1.56	
3.36/1.56	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).
3.36/1.56	
3.36/1.56	
3.36/1.56	The TRS R consists of the following rules:
3.36/1.56	
3.36/1.56	   exp(x, 0) -> s(0)
3.36/1.56	   exp(x, s(y)) -> *(x, exp(x, y))
3.36/1.56	   *(0, y) -> 0
3.36/1.56	   *(s(x), y) -> +(y, *(x, y))
3.36/1.56	   -(0, y) -> 0
3.36/1.56	   -(x, 0) -> x
3.36/1.56	   -(s(x), s(y)) -> -(x, y)
3.36/1.56	
3.36/1.56	S is empty.
3.36/1.56	Rewrite Strategy: FULL
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(9) DecreasingLoopProof (FINISHED)
3.36/1.56	The following loop(s) give(s) rise to the lower bound EXP:
3.36/1.56	
3.36/1.56	The rewrite sequence
3.36/1.56	
3.36/1.56	exp(s(x1_0), s(y)) ->^+ +(exp(s(x1_0), y), *(x1_0, exp(s(x1_0), y)))
3.36/1.56	
3.36/1.56	gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
3.36/1.56	
3.36/1.56	The pumping substitution is [y / s(y)].
3.36/1.56	
3.36/1.56	The result substitution is [ ].
3.36/1.56	
3.36/1.56	
3.36/1.56	
3.36/1.56	The rewrite sequence
3.36/1.56	
3.36/1.56	exp(s(x1_0), s(y)) ->^+ +(exp(s(x1_0), y), *(x1_0, exp(s(x1_0), y)))
3.36/1.56	
3.36/1.56	gives rise to a decreasing loop by considering the right hand sides subterm at position [1,1].
3.36/1.56	
3.36/1.56	The pumping substitution is [y / s(y)].
3.36/1.56	
3.36/1.56	The result substitution is [ ].
3.36/1.56	
3.36/1.56	
3.36/1.56	
3.36/1.56	
3.36/1.56	----------------------------------------
3.36/1.56	
3.36/1.56	(10)
3.36/1.56	BOUNDS(EXP, INF)
3.36/1.60	EOF