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