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


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


WORST_CASE(?, O(n^1))
proof of /export/starexec/sandbox2/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, max(1, 2 + Arg_0)).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 241 ms]
(2) BOUNDS(1, max(1, 2 + Arg_0))


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
zip3(A, B, C) -> Com_1(zip3(A - 1, B - 1, C - 1)) :|: A >= 1 && B >= 1 && C >= 1
group3(A, B, C) -> Com_1(group3(A - 3, B, C)) :|: A >= 4
start(A, B, C) -> Com_1(zip3(A, B, C)) :|: TRUE

The start-symbols are:[start_3]


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

(1) Koat2 Proof (FINISHED)
YES( ?, max([1, 2+Arg_0]) {O(n)})



Initial Complexity Problem:

  Start:  start  

  Program_Vars:  Arg_0, Arg_1, Arg_2  

  Temp_Vars:    

  Locations:  group3, start, zip3  

  Transitions:

  1: group3->group3

  2: start->zip3

  0: zip3->zip3  



Timebounds: 

  Overall timebound: max([1, 2+Arg_0]) {O(n)}

  1: group3->group3: 0 {O(1)}

  2: start->zip3: 1 {O(1)}

  0: zip3->zip3: max([0, 1+Arg_0]) {O(n)}



Costbounds:

  Overall costbound: max([1, 2+Arg_0]) {O(n)}

  1: group3->group3: 0 {O(1)}

  2: start->zip3: 1 {O(1)}

  0: zip3->zip3: max([0, 1+Arg_0]) {O(n)}



Sizebounds:

`Lower:

  1: group3->group3, Arg_0: 1 {O(1)}

  1: group3->group3, Arg_1: inf {Infinity}

  1: group3->group3, Arg_2: inf {Infinity}

  2: start->zip3, Arg_0: Arg_0 {O(n)}

  2: start->zip3, Arg_1: Arg_1 {O(n)}

  2: start->zip3, Arg_2: Arg_2 {O(n)}

  0: zip3->zip3, Arg_0: 0 {O(1)}

  0: zip3->zip3, Arg_1: 0 {O(1)}

  0: zip3->zip3, Arg_2: 0 {O(1)}

`Upper:

  1: group3->group3, Arg_0: -(inf) {Infinity}

  1: group3->group3, Arg_1: -(inf) {Infinity}

  1: group3->group3, Arg_2: -(inf) {Infinity}

  2: start->zip3, Arg_0: Arg_0 {O(n)}

  2: start->zip3, Arg_1: Arg_1 {O(n)}

  2: start->zip3, Arg_2: Arg_2 {O(n)}

  0: zip3->zip3, Arg_0: Arg_0 {O(n)}

  0: zip3->zip3, Arg_1: Arg_1 {O(n)}

  0: zip3->zip3, Arg_2: Arg_2 {O(n)}


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

(2)
BOUNDS(1, max(1, 2 + Arg_0))