3.50/1.64	WORST_CASE(?, O(1))
3.50/1.64	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
3.50/1.64	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.50/1.64	
3.50/1.64	
3.50/1.64	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).
3.50/1.64	
3.50/1.64	(0) CpxIntTrs
3.50/1.64	(1) Koat Proof [FINISHED, 6 ms]
3.50/1.64	(2) BOUNDS(1, 1)
3.50/1.64	
3.50/1.64	
3.50/1.64	----------------------------------------
3.50/1.64	
3.50/1.64	(0)
3.50/1.64	Obligation:
3.50/1.64	Complexity Int TRS consisting of the following rules:
3.50/1.64	f0(A, B, C, D, E, F) -> Com_1(f17(H, G, I, D, E, F)) :|: 0 >= 2 + G
3.50/1.64	f0(A, B, C, D, E, F) -> Com_1(f17(H, G, I, D, E, F)) :|: G >= 0
3.50/1.64	f0(A, B, C, D, E, F) -> Com_1(f17(H, -(1), C, 0, G, I)) :|: TRUE
3.50/1.64	
3.50/1.64	The start-symbols are:[f0_6]
3.50/1.64	
3.50/1.64	
3.50/1.64	----------------------------------------
3.50/1.64	
3.50/1.64	(1) Koat Proof (FINISHED)
3.50/1.64	YES(?, 3)
3.50/1.64	
3.50/1.64	
3.50/1.64	
3.50/1.64	Initial complexity problem:
3.50/1.64	
3.50/1.64	1:	T:
3.50/1.64	
3.50/1.64			(Comp: ?, Cost: 1)    f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f17(h, g, i, ar_3, ar_4, ar_5)) [ 0 >= g + 2 ]
3.50/1.64	
3.50/1.64			(Comp: ?, Cost: 1)    f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f17(h, g, i, ar_3, ar_4, ar_5)) [ g >= 0 ]
3.50/1.64	
3.50/1.64			(Comp: ?, Cost: 1)    f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f17(h, -1, ar_2, 0, g, i))
3.50/1.64	
3.50/1.64			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
3.50/1.64	
3.50/1.64		start location:	koat_start
3.50/1.64	
3.50/1.64		leaf cost:	0
3.50/1.64	
3.50/1.64	
3.50/1.64	
3.50/1.64	Repeatedly propagating knowledge in problem 1 produces the following problem:
3.50/1.64	
3.50/1.64	2:	T:
3.50/1.64	
3.50/1.64			(Comp: 1, Cost: 1)    f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f17(h, g, i, ar_3, ar_4, ar_5)) [ 0 >= g + 2 ]
3.50/1.64	
3.50/1.64			(Comp: 1, Cost: 1)    f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f17(h, g, i, ar_3, ar_4, ar_5)) [ g >= 0 ]
3.50/1.64	
3.50/1.64			(Comp: 1, Cost: 1)    f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f17(h, -1, ar_2, 0, g, i))
3.50/1.64	
3.50/1.64			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
3.50/1.64	
3.50/1.64		start location:	koat_start
3.50/1.64	
3.50/1.64		leaf cost:	0
3.50/1.64	
3.50/1.64	
3.50/1.64	
3.50/1.64	Complexity upper bound 3
3.50/1.64	
3.50/1.64	
3.50/1.64	
3.50/1.64	Time: 0.039 sec (SMT: 0.036 sec)
3.50/1.64	
3.50/1.64	
3.50/1.64	----------------------------------------
3.50/1.64	
3.50/1.64	(2)
3.50/1.64	BOUNDS(1, 1)
3.50/1.65	EOF