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