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