3.03/1.70	WORST_CASE(?, O(1))
3.31/1.71	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
3.31/1.71	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.31/1.71	
3.31/1.71	
3.31/1.71	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).
3.31/1.71	
3.31/1.71	(0) CpxIntTrs
3.31/1.71	(1) Koat2 Proof [FINISHED, 20 ms]
3.31/1.71	(2) BOUNDS(1, 1)
3.31/1.71	
3.31/1.71	
3.31/1.71	----------------------------------------
3.31/1.71	
3.31/1.71	(0)
3.31/1.71	Obligation:
3.31/1.71	Complexity Int TRS consisting of the following rules:
3.31/1.71	f2(A) -> Com_1(f5(B)) :|: TRUE
3.31/1.71	
3.31/1.71	The start-symbols are:[f2_1]
3.31/1.71	
3.31/1.71	
3.31/1.71	----------------------------------------
3.31/1.71	
3.31/1.71	(1) Koat2 Proof (FINISHED)
3.31/1.71	YES( ?, 1 {O(1)})
3.31/1.71	
3.31/1.71	
3.31/1.71	
3.31/1.71	Initial Complexity Problem:
3.31/1.71	
3.31/1.71	  Start:  f2  
3.31/1.71	
3.31/1.71	  Program_Vars:  Arg_0  
3.31/1.71	
3.31/1.71	  Temp_Vars:  B  
3.31/1.71	
3.31/1.71	  Locations:  f2, f5  
3.31/1.71	
3.31/1.71	  Transitions:
3.31/1.71	
3.31/1.71	  f2(Arg_0) -> f5(B):|:  
3.31/1.71	
3.31/1.71	
3.31/1.71	
3.31/1.71	Timebounds: 
3.31/1.71	
3.31/1.71	  Overall timebound: 1 {O(1)}
3.31/1.71	
3.31/1.71	  0: f2->f5: 1 {O(1)}
3.31/1.71	
3.31/1.71	
3.31/1.71	
3.31/1.71	Costbounds:
3.31/1.71	
3.31/1.71	  Overall costbound: 1 {O(1)}
3.31/1.71	
3.31/1.71	  0: f2->f5: 1 {O(1)}
3.31/1.71	
3.31/1.71	
3.31/1.71	
3.31/1.71	Sizebounds:
3.31/1.71	
3.31/1.71	`Lower:
3.31/1.71	
3.31/1.71	  
3.31/1.71	
3.31/1.71	`Upper:
3.31/1.71	
3.31/1.71	  
3.31/1.71	
3.31/1.71	
3.31/1.71	----------------------------------------
3.31/1.71	
3.31/1.71	(2)
3.31/1.71	BOUNDS(1, 1)
3.31/1.75	EOF