Gurobi 5.0.1 (linux64) logging started Sun Nov 18 05:35:56 2012

Optimize a model with 1 rows, 166 columns and 166 nonzeros
Model has 144 quadratic objective terms
Presolve removed 0 rows and 26 columns
Presolve time: 0.00s
Presolved: 145 rows, 284 columns, 572 nonzeros
Variable types: 0 continuous, 284 integer (283 binary)
Found heuristic solution: objective 33.0000000

Root relaxation: objective 0.000000e+00, 191 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   46   33.00000    0.00000   100%     -    0s
     0     0    0.00000    0   28   33.00000    0.00000   100%     -    0s
H    0     0                      27.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   25   27.00000    0.00000   100%     -    0s
H    0     0                      21.0000000    0.00000   100%     -    0s
H    0     0                      13.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   25   13.00000    0.00000   100%     -    0s
     0     0    0.00000    0   16   13.00000    0.00000   100%     -    0s
     0     0    0.00000    0   17   13.00000    0.00000   100%     -    0s
     0     0    0.00000    0   16   13.00000    0.00000   100%     -    0s
H    0     0                       9.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   13    9.00000    0.00000   100%     -    0s
     0     0    0.00000    0    6    9.00000    0.00000   100%     -    0s
H    0     0                       6.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   13    6.00000    0.00000   100%     -    0s
     0     0    0.00000    0   11    6.00000    0.00000   100%     -    0s
H    0     0                       4.0000000    0.00000   100%     -    0s
     0     2    0.00000    0   11    4.00000    0.00000   100%     -    0s
*  370    92              21       3.0000000    0.00000   100%   5.8    0s
H  406    49                       2.0000000    0.00000   100%   6.4    0s
*  429     5              15       1.0000000    0.00000   100%   7.9    0s

Cutting planes:
  Cover: 180
  MIR: 1

Explored 430 nodes (3934 simplex iterations) in 0.11 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%