/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?, O(1))
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 0 ms]
(2) BOUNDS(1, 1)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f0(A, B, C, D, E) -> Com_1(f7(0, 0, F, G, H)) :|: TRUE

The start-symbols are:[f0_5]


----------------------------------------

(1) Koat2 Proof (FINISHED)
YES( ?, 1 {O(1)})



Initial Complexity Problem:

  Start:  f0  

  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3, Arg_4  

  Temp_Vars:  F, G, H  

  Locations:  f0, f7  

  Transitions:

  0: f0->f7  



Timebounds: 

  Overall timebound: 1 {O(1)}

  0: f0->f7: 1 {O(1)}



Costbounds:

  Overall costbound: 1 {O(1)}

  0: f0->f7: 1 {O(1)}



Sizebounds:

`Lower:

  

`Upper:

  


----------------------------------------

(2)
BOUNDS(1, 1)