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