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

Gurobi 5.0.1 (linux64) logging started Thu Dec 13 17:55:52 2012

Optimize a model with 65 rows, 50 columns and 204 nonzeros
Presolve time: 0.00s
Presolved: 65 rows, 50 columns, 204 nonzeros
Variable types: 0 continuous, 50 integer (50 binary)

Root relaxation: objective 0.000000e+00, 16 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 (16 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 17:55:52 2012

Optimize a model with 37 rows, 32 columns and 102 nonzeros
Presolve removed 9 rows and 9 columns
Presolve time: 0.00s
Presolved: 28 rows, 23 columns, 84 nonzeros
Variable types: 0 continuous, 23 integer (23 binary)

Root relaxation: objective 0.000000e+00, 10 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    9          -    0.00000     -      -    0s
     0     0 infeasible    0               -    0.10000     -      -    0s

Explored 0 nodes (24 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 17:55:52 2012

Optimize a model with 51 rows, 41 columns and 153 nonzeros
Presolve time: 0.00s
Presolved: 51 rows, 41 columns, 153 nonzeros
Variable types: 0 continuous, 41 integer (41 binary)

Root relaxation: objective 0.000000e+00, 18 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 (31 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