/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, 34 ms]
(2) BOUNDS(1, 1)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1, G1, H1, I1, J1, K1, L1, M1, N1, O1, P1, Q1, R1, S1, T1, U1, V1) -> Com_1(f75(2, W1, W1, W1, W1, W1, 2, X1, X1, X1, X1, X1, 2, Y1, Y1, Y1, Y1, Y1, 2, Z1, Z1, Z1, Z1, Z1, 2, A2, A2, A2, A2, A2, 2, B2, B2, B2, B2, B2, 2, C2, C2, C2, C2, C2, 2, D2, D2, D2, D2, D2)) :|: TRUE

The start-symbols are:[f0_48]


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

(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, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10, Arg_11, Arg_12, Arg_13, Arg_14, Arg_15, Arg_16, Arg_17, Arg_18, Arg_19, Arg_20, Arg_21, Arg_22, Arg_23, Arg_24, Arg_25, Arg_26, Arg_27, Arg_28, Arg_29, Arg_30, Arg_31, Arg_32, Arg_33, Arg_34, Arg_35, Arg_36, Arg_37, Arg_38, Arg_39, Arg_40, Arg_41, Arg_42, Arg_43, Arg_44, Arg_45, Arg_46, Arg_47  

  Temp_Vars:  A2, B2, C2, D2, W1, X1, Y1, Z1  

  Locations:  f0, f75  

  Transitions:

  0: f0->f75  



Timebounds: 

  Overall timebound: 1 {O(1)}

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



Costbounds:

  Overall costbound: 1 {O(1)}

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



Sizebounds:

`Lower:

  

`Upper:

  


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

(2)
BOUNDS(1, 1)