Gurobi 5.0.1 (linux64) logging started Sun Nov 18 05:26:00 2012

Optimize a model with 1 rows, 148 columns and 148 nonzeros
Model has 112 quadratic objective terms
Presolve removed 0 rows and 30 columns
Presolve time: 0.00s
Presolved: 113 rows, 230 columns, 454 nonzeros
Variable types: 0 continuous, 230 integer (229 binary)
Found heuristic solution: objective 28.0000000

Root relaxation: objective 0.000000e+00, 137 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   28.00000    0.00000   100%     -    0s
H    0     0                       9.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   14    9.00000    0.00000   100%     -    0s
H    0     0                       8.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   10    8.00000    0.00000   100%     -    0s
     0     0    0.00000    0    7    8.00000    0.00000   100%     -    0s
H    0     0                       7.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   12    7.00000    0.00000   100%     -    0s
     0     0    0.00000    0    8    7.00000    0.00000   100%     -    0s
H    0     0                       6.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   20    6.00000    0.00000   100%     -    0s
     0     0    0.00000    0   14    6.00000    0.00000   100%     -    0s
     0     0    0.00000    0    8    6.00000    0.00000   100%     -    0s
     0     0    0.00000    0    8    6.00000    0.00000   100%     -    0s
     0     0    0.00000    0    8    6.00000    0.00000   100%     -    0s
     0     2    0.00000    0    8    6.00000    0.00000   100%     -    0s
H    6     6                       5.0000000    0.00000   100%   2.2    0s
H   54    19                       4.0000000    0.00000   100%   1.8    0s
H  275    68                       3.0000000    0.00000   100%   4.1    0s
H  282    27                       2.0000000    0.00000   100%   4.3    0s
*  378    13              15       1.0000000    0.00000   100%   6.5    0s

Cutting planes:
  Cover: 142

Explored 379 nodes (2888 simplex iterations) in 0.09 seconds
Thread count was 1 (of 16 available processors)

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