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