Gurobi 5.0.1 (linux64) logging started Sun Nov 18 05:28:36 2012

Optimize a model with 1 rows, 156 columns and 156 nonzeros
Model has 128 quadratic objective terms
Presolve removed 0 rows and 26 columns
Presolve time: 0.00s
Presolved: 129 rows, 258 columns, 514 nonzeros
Variable types: 0 continuous, 258 integer (257 binary)
Found heuristic solution: objective 33.0000000

Root relaxation: objective 0.000000e+00, 161 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   30   33.00000    0.00000   100%     -    0s
H    0     0                      29.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   29   29.00000    0.00000   100%     -    0s
H    0     0                      26.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   30   26.00000    0.00000   100%     -    0s
H    0     0                      22.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   13   22.00000    0.00000   100%     -    0s
H    0     0                      12.0000000    0.00000   100%     -    0s
     0     0    0.00000    0   19   12.00000    0.00000   100%     -    0s
     0     0    0.00000    0   17   12.00000    0.00000   100%     -    0s
H    0     0                      10.0000000    0.00000   100%     -    0s
     0     2    0.00000    0   15   10.00000    0.00000   100%     -    0s
H   53    44                       9.0000000    0.00000   100%   1.5    0s
H   81    54                       8.0000000    0.00000   100%   1.9    0s
*   96    59              21       7.0000000    0.00000   100%   1.8    0s
H  108    49                       5.0000000    0.00000   100%   1.9    0s
*  121    39              20       4.0000000    0.00000   100%   1.9    0s
*  295    40              16       2.0000000    0.00000   100%   6.2    0s

Cutting planes:
  Cover: 217
  MIR: 1
  Zero half: 1

Explored 390 nodes (4759 simplex iterations) in 0.10 seconds
Thread count was 1 (of 16 available processors)

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