current bounds on the number of colors: 0 -- 127 Gurobi 5.0.1 (linux64) logging started Thu Dec 13 23:55:04 2012 Optimize a model with 49897 rows, 8791 columns and 157311 nonzeros Presolve time: 0.17s Presolved: 49897 rows, 8791 columns, 157311 nonzeros Variable types: 0 continuous, 8791 integer (8791 binary) Root relaxation: objective 0.000000e+00, 332 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 (612 simplex iterations) in 0.29 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:55:05 2012 Optimize a model with 24617 rows, 4727 columns and 77407 nonzeros Presolve time: 0.11s Presolved: 24617 rows, 4727 columns, 77407 nonzeros Variable types: 0 continuous, 4727 integer (4727 binary) Root relaxation: objective 0.000000e+00, 310 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 (754 simplex iterations) in 0.19 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:55:05 2012 Optimize a model with 11977 rows, 2695 columns and 37455 nonzeros Presolve time: 0.04s Presolved: 11977 rows, 2695 columns, 37455 nonzeros Variable types: 0 continuous, 2695 integer (2695 binary) Root relaxation: objective 0.000000e+00, 263 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 (522 simplex iterations) in 0.06 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:55:06 2012 Optimize a model with 5657 rows, 1679 columns and 17479 nonzeros Presolve time: 0.02s Presolved: 5657 rows, 1679 columns, 17479 nonzeros Variable types: 0 continuous, 1679 integer (1679 binary) Root relaxation: objective 0.000000e+00, 267 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 (1148 simplex iterations) in 0.06 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:55:06 2012 Optimize a model with 2497 rows, 1171 columns and 7491 nonzeros Presolve time: 0.01s Presolved: 2497 rows, 1171 columns, 7491 nonzeros Variable types: 0 continuous, 1171 integer (1171 binary) Root relaxation: objective 0.000000e+00, 277 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 0.00000 0 202 - 0.00000 - - 0s 0 0 0.00000 0 252 - 0.00000 - - 0s 0 0 infeasible 0 - 0.10000 - - 0s Explored 0 nodes (4813 simplex iterations) in 0.49 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:55:06 2012 Optimize a model with 4077 rows, 1425 columns and 12485 nonzeros Presolve time: 0.01s Presolved: 4077 rows, 1425 columns, 12485 nonzeros Variable types: 0 continuous, 1425 integer (1425 binary) Root relaxation: objective 0.000000e+00, 261 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 236 - 0.00000 - - 0s 0 0 0.00000 0 238 - 0.00000 - - 0s 0 0 0.00000 0 323 - 0.00000 - - 0s 0 0 0.00000 0 335 - 0.00000 - - 0s 0 0 0.00000 0 233 - 0.00000 - - 1s 0 0 0.00000 0 193 - 0.00000 - - 2s 0 0 0.00000 0 219 - 0.00000 - - 2s 0 0 0.00000 0 190 - 0.00000 - - 2s 0 0 0.00000 0 305 - 0.00000 - - 3s 0 0 0.00000 0 320 - 0.00000 - - 3s 0 0 0.00000 0 320 - 0.00000 - - 4s 0 2 0.00000 0 320 - 0.00000 - - 4s 8 8 0.00000 7 295 - 0.00000 - 521 5s 612 95 0.00000 13 300 - 0.00000 - 84.6 10s 615 97 0.00000 5 316 - 0.00000 - 84.2 15s 619 99 0.00000 29 313 - 0.00000 - 83.6 20s 624 103 0.00000 27 291 - 0.00000 - 83.0 25s 761 108 infeasible 35 - 0.00000 - 166 30s 1097 43 infeasible 33 - 0.00000 - 183 35s 1484 50 infeasible 37 - 0.00000 - 187 40s 1862 44 0.00000 28 227 - 0.00000 - 191 45s 2185 51 infeasible 30 - 0.00000 - 197 50s 2496 68 infeasible 33 - 0.00000 - 201 55s 2827 85 0.00000 32 267 - 0.00000 - 204 60s 3169 69 infeasible 30 - 0.00000 - 205 65s 3485 59 infeasible 27 - 0.00000 - 208 70s 3867 151 infeasible 32 - 0.00000 - 206 75s 4219 185 infeasible 31 - 0.00000 - 206 80s 4545 239 0.00000 34 291 - 0.00000 - 207 85s 4870 242 infeasible 40 - 0.00000 - 208 90s 5198 284 infeasible 35 - 0.00000 - 208 95s 5535 337 infeasible 30 - 0.00000 - 208 100s 5846 410 infeasible 32 - 0.00000 - 209 105s 6132 446 0.00000 30 250 - 0.00000 - 211 110s 6426 482 0.00000 33 278 - 0.00000 - 212 115s 6722 506 0.00000 34 188 - 0.00000 - 213 120s 7003 505 0.00000 33 252 - 0.00000 - 215 125s 7273 467 infeasible 38 - 0.00000 - 216 130s 7590 446 0.00000 35 255 - 0.00000 - 217 135s 7904 424 infeasible 33 - 0.00000 - 217 140s 8185 435 infeasible 30 - 0.00000 - 219 145s 8486 440 infeasible 36 - 0.00000 - 219 150s 8743 421 infeasible 35 - 0.00000 - 221 155s 9059 401 infeasible 33 - 0.00000 - 221 160s 9380 394 0.00000 37 233 - 0.00000 - 222 165s 9680 396 0.00000 33 192 - 0.00000 - 222 170s 9980 392 infeasible 36 - 0.00000 - 222 175s 10283 393 0.00000 32 270 - 0.00000 - 223 180s 10599 387 infeasible 34 - 0.00000 - 223 185s 10901 383 infeasible 35 - 0.00000 - 223 190s 11198 382 0.00000 31 282 - 0.00000 - 224 195s 11520 376 infeasible 34 - 0.00000 - 224 200s 11828 372 infeasible 35 - 0.00000 - 224 205s 12168 368 infeasible 37 - 0.00000 - 224 210s 12479 361 0.00000 31 231 - 0.00000 - 224 215s 12824 388 0.00000 26 210 - 0.00000 - 224 220s 13148 440 0.00000 32 222 - 0.00000 - 224 225s 13498 444 infeasible 33 - 0.00000 - 223 230s 13827 441 infeasible 32 - 0.00000 - 224 235s 14113 445 infeasible 29 - 0.00000 - 224 240s 14409 457 infeasible 31 - 0.00000 - 224 245s 14729 457 0.00000 28 232 - 0.00000 - 224 250s 15061 459 infeasible 27 - 0.00000 - 224 255s 15374 464 0.00000 37 234 - 0.00000 - 224 260s 15678 464 infeasible 32 - 0.00000 - 225 265s 15988 448 infeasible 40 - 0.00000 - 225 270s 16306 458 0.00000 39 269 - 0.00000 - 225 275s 16622 458 0.00000 34 211 - 0.00000 - 225 280s 16971 457 infeasible 33 - 0.00000 - 225 285s 17291 457 infeasible 36 - 0.00000 - 225 290s 17652 466 infeasible 32 - 0.00000 - 225 295s Cutting planes: Clique: 2 Zero half: 7 Explored 17770 nodes (4022612 simplex iterations) in 296.70 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 Fri Dec 14 00:00:03 2012 Optimize a model with 4867 rows, 1552 columns and 14982 nonzeros Presolve time: 0.01s Presolved: 4867 rows, 1552 columns, 14982 nonzeros Variable types: 0 continuous, 1552 integer (1552 binary) Root relaxation: objective 0.000000e+00, 263 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 Explored 0 nodes (775 simplex iterations) in 0.04 seconds Thread count was 1 (of 16 available processors) Time limit reached Best objective -, best bound 0.000000000000e+00, gap - optimal solution found: number of colors: 7