current bounds on the number of colors: 0 -- 9

Gurobi 5.0.1 (linux64) logging started Thu Dec 13 19:35:31 2012

Optimize a model with 37 rows, 43 columns and 120 nonzeros
Presolve removed 2 rows and 8 columns
Presolve time: 0.00s
Presolved: 35 rows, 35 columns, 112 nonzeros
Variable types: 0 continuous, 35 integer (35 binary)

Root relaxation: objective 0.000000e+00, 13 iterations, 0.00 seconds

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

*    0     0               0       0.0000000    0.00000   0.0%     -    0s

Explored 0 nodes (22 simplex iterations) in 0.00 seconds
Thread count was 1 (of 16 available processors)

Optimal solution found (tolerance 1.00e-04)
Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0%


current bounds on the number of colors: 0 -- 4

Gurobi 5.0.1 (linux64) logging started Thu Dec 13 19:35:31 2012

Optimize a model with 23 rows, 25 columns and 60 nonzeros
Presolve removed 11 rows and 14 columns
Presolve time: 0.00s
Presolved: 12 rows, 11 columns, 36 nonzeros
Variable types: 0 continuous, 11 integer (11 binary)

Root relaxation: objective 0.000000e+00, 6 iterations, 0.00 seconds

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0    0.00000    0    5          -    0.00000     -      -    0s

Explored 0 nodes (22 simplex iterations) in 0.00 seconds
Thread count was 1 (of 16 available processors)

Model objective exceeds cutoff
Best objective -, best bound 1.000000000000e+00, gap -


current bounds on the number of colors: 2 -- 4

Gurobi 5.0.1 (linux64) logging started Thu Dec 13 19:35:31 2012

Optimize a model with 30 rows, 34 columns and 90 nonzeros
Presolve removed 2 rows and 6 columns
Presolve time: 0.00s
Presolved: 28 rows, 28 columns, 84 nonzeros
Variable types: 0 continuous, 28 integer (28 binary)

Root relaxation: objective 0.000000e+00, 13 iterations, 0.00 seconds

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0    0.00000    0    6          -    0.00000     -      -    0s
H    0     0                       0.0000000    0.00000   0.0%     -    0s

Explored 0 nodes (26 simplex iterations) in 0.00 seconds
Thread count was 1 (of 16 available processors)

Optimal solution found (tolerance 1.00e-04)
Best objective 0.000000000000e+00, best bound 0.000000000000e+00, gap 0.0%


optimal solution found: number of colors: 3