Gurobi 5.0.1 (linux64) logging started Fri Nov 16 15:30:03 2012

Optimize a model with 11004 rows, 5112 columns and 37770 nonzeros
Presolve removed 1991 rows and 73 columns
Presolve time: 0.45s
Presolved: 9013 rows, 5039 columns, 32688 nonzeros
Variable types: 0 continuous, 5039 integer (5039 binary)
Found heuristic solution: objective 71.0000000

Root relaxation: objective 3.000000e+00, 7623 iterations, 1.30 seconds

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

     0     0    3.00000    0 1131   71.00000    3.00000  95.8%     -    5s
H    0     0                       7.0000000    3.00000  57.1%     -    5s
     0     0    3.00000    0 1609    7.00000    3.00000  57.1%     -    6s
     0     0    3.00000    0  107    7.00000    3.00000  57.1%     -   14s
H    0     0                       4.0000000    3.00000  25.0%     -   14s
     0     0    3.00000    0   97    4.00000    3.00000  25.0%     -   19s
     0     0    3.00000    0  100    4.00000    3.00000  25.0%     -   23s
     0     0    3.00000    0  106    4.00000    3.00000  25.0%     -   30s
     0     0    3.00000    0  134    4.00000    3.00000  25.0%     -   38s
     0     0    3.00000    0  134    4.00000    3.00000  25.0%     -   42s
     0     2    3.00000    0  134    4.00000    3.00000  25.0%     -   51s
     4     4    3.00000    1  104    4.00000    3.00000  25.0%  2298   60s
     5     5    3.00000    1 1044    4.00000    3.00000  25.0%  1839   68s
     6     6    3.00000    1  120    4.00000    3.00000  25.0%  1532   74s
     7     6    3.00000    1  111    4.00000    3.00000  25.0%  1313   82s
     8     7    3.00000    1  108    4.00000    3.00000  25.0%  1149   87s
     9     8    3.00000    1  131    4.00000    3.00000  25.0%  1022  102s
    10     8    3.00000    1  131    4.00000    3.00000  25.0%   919  106s
    12    12    3.00000   15  145    4.00000    3.00000  25.0% 13316  125s
    13    12    3.00000   15  108    4.00000    3.00000  25.0% 12459  131s
    14    13    3.00000   16   86    4.00000    3.00000  25.0% 11763  137s
    18    10    3.00000   16  100    4.00000    3.00000  25.0%  9334  144s
    19    10    3.00000   16  127    4.00000    3.00000  25.0%  8970  152s
    22     8 infeasible   18         4.00000    3.00000  25.0%  8052  155s
    24     8    3.00000   17   94    4.00000    3.00000  25.0%  7626  161s
    28     4 infeasible   18         4.00000    3.00000  25.0%  6813  165s

Cutting planes:
  Gomory: 2
  Zero half: 12

Explored 30 nodes (328642 simplex iterations) in 165.57 seconds
Thread count was 1 (of 16 available processors)

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