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