current bounds on the number of colors: 0 -- 127 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:40:04 2012 Optimize a model with 52102 rows, 8826 columns and 163926 nonzeros Presolve time: 0.17s Presolved: 52102 rows, 8826 columns, 163926 nonzeros Variable types: 0 continuous, 8826 integer (8826 binary) Root relaxation: objective 0.000000e+00, 322 iterations, 0.06 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 (605 simplex iterations) in 0.30 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 -- 63 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:40:04 2012 Optimize a model with 25702 rows, 4762 columns and 80662 nonzeros Presolve time: 0.11s Presolved: 25702 rows, 4762 columns, 80662 nonzeros Variable types: 0 continuous, 4762 integer (4762 binary) Root relaxation: objective 0.000000e+00, 307 iterations, 0.03 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 (640 simplex iterations) in 0.18 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 -- 31 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:40:05 2012 Optimize a model with 12502 rows, 2730 columns and 39030 nonzeros Presolve time: 0.04s Presolved: 12502 rows, 2730 columns, 39030 nonzeros Variable types: 0 continuous, 2730 integer (2730 binary) Root relaxation: objective 0.000000e+00, 257 iterations, 0.01 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 (518 simplex iterations) in 0.07 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 -- 15 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:40:05 2012 Optimize a model with 5902 rows, 1714 columns and 18214 nonzeros Presolve time: 0.02s Presolved: 5902 rows, 1714 columns, 18214 nonzeros Variable types: 0 continuous, 1714 integer (1714 binary) Root relaxation: objective 0.000000e+00, 270 iterations, 0.01 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 (950 simplex iterations) in 0.05 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 -- 7 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:40:05 2012 Optimize a model with 2602 rows, 1206 columns and 7806 nonzeros Presolve time: 0.01s Presolved: 2602 rows, 1206 columns, 7806 nonzeros Variable types: 0 continuous, 1206 integer (1206 binary) Root relaxation: objective 0.000000e+00, 286 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 254 - 0.00000 - - 0s 0 0 0.00000 0 290 - 0.00000 - - 0s 0 0 infeasible 0 - 0.10000 - - 0s Explored 0 nodes (4584 simplex iterations) in 0.57 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: 3 -- 7 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:40:06 2012 Optimize a model with 4252 rows, 1460 columns and 13010 nonzeros Presolve time: 0.01s Presolved: 4252 rows, 1460 columns, 13010 nonzeros Variable types: 0 continuous, 1460 integer (1460 binary) Root relaxation: objective 0.000000e+00, 267 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 254 - 0.00000 - - 0s 0 0 0.00000 0 246 - 0.00000 - - 0s 0 0 0.00000 0 318 - 0.00000 - - 0s 0 0 0.00000 0 363 - 0.00000 - - 1s 0 0 0.00000 0 283 - 0.00000 - - 1s 0 0 0.00000 0 264 - 0.00000 - - 2s 0 0 0.00000 0 271 - 0.00000 - - 2s 0 0 0.00000 0 237 - 0.00000 - - 3s 0 0 0.00000 0 232 - 0.00000 - - 3s 0 0 0.00000 0 236 - 0.00000 - - 4s 0 0 0.00000 0 256 - 0.00000 - - 4s 0 0 0.00000 0 292 - 0.00000 - - 5s 0 0 0.00000 0 292 - 0.00000 - - 5s 0 2 0.00000 0 292 - 0.00000 - - 5s 617 54 infeasible 18 - 0.00000 - 102 10s 706 74 0.00000 20 310 - 0.00000 - 100 15s 710 77 0.00000 9 293 - 0.00000 - 100 21s 749 97 infeasible 31 - 0.00000 - 153 25s 1025 64 0.00000 30 311 - 0.00000 - 172 30s 1284 87 infeasible 30 - 0.00000 - 186 35s 1554 77 infeasible 30 - 0.00000 - 196 40s 1800 77 0.00000 29 290 - 0.00000 - 203 45s 2075 80 infeasible 33 - 0.00000 - 207 50s 2321 88 infeasible 39 - 0.00000 - 212 55s 2559 92 0.00000 25 296 - 0.00000 - 216 60s 2807 84 0.00000 24 300 - 0.00000 - 219 65s 3062 108 0.00000 33 285 - 0.00000 - 220 70s 3387 135 infeasible 34 - 0.00000 - 219 75s 3680 142 0.00000 33 281 - 0.00000 - 220 80s 3922 144 infeasible 39 - 0.00000 - 222 85s 4166 158 infeasible 37 - 0.00000 - 224 90s 4409 167 0.00000 31 294 - 0.00000 - 226 95s 4638 174 infeasible 35 - 0.00000 - 227 100s 4899 193 infeasible 37 - 0.00000 - 229 105s 5137 195 0.00000 36 301 - 0.00000 - 230 110s 5389 195 0.00000 31 220 - 0.00000 - 231 115s 5639 185 0.00000 32 277 - 0.00000 - 232 120s 5877 179 infeasible 36 - 0.00000 - 233 125s 6122 188 0.00000 33 264 - 0.00000 - 234 130s 6392 180 infeasible 31 - 0.00000 - 234 135s 6645 177 infeasible 31 - 0.00000 - 235 140s 6901 163 0.00000 36 288 - 0.00000 - 235 145s 7126 166 0.00000 30 273 - 0.00000 - 236 150s 7347 179 0.00000 29 293 - 0.00000 - 237 155s 7579 167 infeasible 34 - 0.00000 - 238 160s 7799 159 infeasible 24 - 0.00000 - 239 165s 8007 137 infeasible 31 - 0.00000 - 240 170s 8253 159 infeasible 28 - 0.00000 - 240 175s 8584 172 infeasible 30 - 0.00000 - 239 180s 8916 168 infeasible 31 - 0.00000 - 238 185s 9159 161 0.00000 24 292 - 0.00000 - 238 190s 9400 156 infeasible 27 - 0.00000 - 239 195s 9625 161 infeasible 36 - 0.00000 - 240 200s 9884 156 infeasible 33 - 0.00000 - 240 205s 10104 160 0.00000 33 270 - 0.00000 - 241 210s 10331 163 0.00000 29 260 - 0.00000 - 241 215s 10583 153 infeasible 37 - 0.00000 - 241 220s 10822 150 infeasible 27 - 0.00000 - 242 225s 11070 142 infeasible 31 - 0.00000 - 242 230s 11353 149 0.00000 35 190 - 0.00000 - 242 235s 11595 151 infeasible 40 - 0.00000 - 242 240s 11825 153 infeasible 40 - 0.00000 - 242 245s 12081 155 infeasible 35 - 0.00000 - 242 250s 12344 146 infeasible 32 - 0.00000 - 242 255s 12583 147 infeasible 29 - 0.00000 - 243 260s 12836 144 infeasible 40 - 0.00000 - 243 265s 13074 150 infeasible 39 - 0.00000 - 243 270s 13311 169 0.00000 34 282 - 0.00000 - 243 275s 13547 169 0.00000 36 292 - 0.00000 - 244 280s 13771 161 infeasible 37 - 0.00000 - 244 285s 13981 161 0.00000 30 229 - 0.00000 - 245 290s 14250 152 infeasible 33 - 0.00000 - 245 295s Cutting planes: Clique: 4 Zero half: 20 Explored 14323 nodes (3544806 simplex iterations) in 296.56 seconds Thread count was 1 (of 16 available processors) Time limit reached Best objective -, best bound 0.000000000000e+00, gap - current bounds on the number of colors: 5 -- 7 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:45:03 2012 Optimize a model with 5077 rows, 1587 columns and 15612 nonzeros Presolve time: 0.01s Presolved: 5077 rows, 1587 columns, 15612 nonzeros Variable types: 0 continuous, 1587 integer (1587 binary) Root relaxation: time limit, 281 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 - 0 - - - - 0s Explored 0 nodes (281 simplex iterations) in 0.02 seconds Thread count was 1 (of 16 available processors) Time limit reached Best objective -, best bound -, gap - optimal solution found: number of colors: 7