3.14/1.59	WORST_CASE(?, O(1))
3.14/1.60	proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
3.14/1.60	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.14/1.60	
3.14/1.60	
3.14/1.60	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).
3.14/1.60	
3.14/1.60	(0) CpxIntTrs
3.14/1.60	(1) Koat Proof [FINISHED, 0 ms]
3.14/1.60	(2) BOUNDS(1, 1)
3.14/1.60	
3.14/1.60	
3.14/1.60	----------------------------------------
3.14/1.60	
3.14/1.60	(0)
3.14/1.60	Obligation:
3.14/1.60	Complexity Int TRS consisting of the following rules:
3.14/1.60	f0(A, B, C) -> Com_1(f8(-(1), -(1), -(1))) :|: TRUE
3.14/1.60	
3.14/1.60	The start-symbols are:[f0_3]
3.14/1.60	
3.14/1.60	
3.14/1.60	----------------------------------------
3.14/1.60	
3.14/1.60	(1) Koat Proof (FINISHED)
3.14/1.60	YES(?, 1)
3.14/1.60	
3.14/1.60	
3.14/1.60	
3.14/1.60	Initial complexity problem:
3.14/1.60	
3.14/1.60	1:	T:
3.14/1.60	
3.14/1.60			(Comp: ?, Cost: 1)    f0(ar_0, ar_1, ar_2) -> Com_1(f8(-1, -1, -1))
3.14/1.60	
3.14/1.60			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2) -> Com_1(f0(ar_0, ar_1, ar_2)) [ 0 <= 0 ]
3.14/1.60	
3.14/1.60		start location:	koat_start
3.14/1.60	
3.14/1.60		leaf cost:	0
3.14/1.60	
3.14/1.60	
3.14/1.60	
3.14/1.60	Repeatedly propagating knowledge in problem 1 produces the following problem:
3.14/1.60	
3.14/1.60	2:	T:
3.14/1.60	
3.14/1.60			(Comp: 1, Cost: 1)    f0(ar_0, ar_1, ar_2) -> Com_1(f8(-1, -1, -1))
3.14/1.60	
3.14/1.60			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2) -> Com_1(f0(ar_0, ar_1, ar_2)) [ 0 <= 0 ]
3.14/1.60	
3.14/1.60		start location:	koat_start
3.14/1.60	
3.14/1.60		leaf cost:	0
3.14/1.60	
3.14/1.60	
3.14/1.60	
3.14/1.60	Complexity upper bound 1
3.14/1.60	
3.14/1.60	
3.14/1.60	
3.14/1.60	Time: 0.007 sec (SMT: 0.007 sec)
3.14/1.60	
3.14/1.60	
3.14/1.60	----------------------------------------
3.14/1.60	
3.14/1.60	(2)
3.14/1.60	BOUNDS(1, 1)
3.14/1.61	EOF