Optimize a model with 22 rows, 231 columns and 462 nonzeros
Presolve time: 0.00s
Presolved: 22 rows, 231 columns, 462 nonzeros
Variable types: 0 continuous, 231 integer (210 binary)
adding cut for [(8, 10), (6, 8), (6, 10)]
adding cut for [(13, 17), (13, 18), (14, 16), (14, 18), (15, 16), (15, 17)]
adding cut for [(9, 21), (9, 22), (10, 21), (10, 22)]
adding cut for [(12, 19), (12, 20), (11, 19), (11, 20)]

Root relaxation: objective 3.865000e+02, 22 iterations, 0.00 seconds

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

     0     0  386.50000    0    6          -  386.50000     -      -    0s
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (7, 9), (8, 10), (9, 11)]
adding cut for [(16, 19), (18, 21), (18, 22), (19, 21), (20, 22)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (7, 9), (7, 10), (8, 10), (9, 12)]
adding cut for [(18, 21), (18, 22), (19, 21), (20, 22)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (8, 10), (12, 14)]
adding cut for [(16, 19), (19, 21), (20, 22), (21, 22)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (8, 10)]
adding cut for [(18, 21), (20, 22), (14, 20), (21, 22)]
adding cut for [(2, 3), (2, 7), (3, 6), (4, 5), (4, 7), (5, 12), (6, 8), (8, 10), (12, 14)]
adding cut for [(2, 3), (2, 7), (3, 6), (4, 5), (4, 7), (5, 12), (6, 8), (8, 10)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (7, 9), (8, 10)]
     0     0  422.50000    0    8          -  422.50000     -      -    0s
     0     0  423.00000    0   13          -  423.00000     -      -    0s
adding cut for [(2, 3), (2, 4), (3, 7), (4, 5), (5, 12), (7, 9), (9, 11), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 7), (4, 5), (5, 12), (7, 9), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (7, 11), (8, 10)]
     0     2  424.00000    0   13          -  424.00000     -      -    0s
adding cut for [(2, 3), (2, 7), (3, 6), (6, 8), (7, 11), (8, 10)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 7), (6, 8), (8, 10)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (7, 8), (7, 9), (9, 11), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (7, 8), (7, 9), (9, 11)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (6, 8), (8, 10)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (7, 8), (7, 9), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (7, 8), (7, 9)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 7), (7, 9), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 7), (7, 9)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (8, 11), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8), (8, 11)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 8)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 11), (12, 14)]
adding cut for [(2, 3), (2, 4), (3, 6), (4, 5), (5, 12), (6, 10), (12, 14)]
*    5     5               3     431.0000000  426.00000  1.16%   3.0    0s
adding cut for [(2, 3), (2, 7), (3, 6), (6, 8), (7, 9), (8, 10), (9, 11)]
*    8     0               2     427.0000000  427.00000   0.0%   2.1    0s

Cutting planes:
  MIR: 1

Explored 9 nodes (78 simplex iterations) in 0.03 seconds
Thread count was 1 (of 16 available processors)

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

Gurobi 5.0.1 (linux64) logging started Fri Dec  7 08:09:03 2012