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