task2_50.log

option show_stats 1;

solve;

Presolve eliminates 4836 constraints and 2306 variables.
Adjusted problem:
194 variables, all binary
264 constraints, all linear; 772 nonzeros
	194 equality constraints
	70 inequality constraints
1 linear objective; 194 nonzeros.

CPLEX 12.6.2.0: timing = 1
mipdisplay = 2
mipinterval = 1
Found incumbent of value 0.000000 after 0.00 sec. (0.00 ticks)
MIP Presolve eliminated 134 rows and 12 columns.
MIP Presolve modified 3 coefficients.
Reduced MIP has 33 rows, 85 columns, and 170 nonzeros.
Reduced MIP has 85 binaries, 0 generals, 0 SOSs, and 0 indicators.
Probing time = 0.00 sec. (0.07 ticks)
Reduced MIP has 33 rows, 85 columns, and 170 nonzeros.
Reduced MIP has 85 binaries, 0 generals, 0 SOSs, and 0 indicators.
Probing time = 0.00 sec. (0.07 ticks)
Clique table members: 33.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 4 threads.
Root relaxation solution time = 0.00 sec. (0.08 ticks)

        Nodes                                         Cuts/
   Node  Left     Objective  IInf  Best Integer    Best Bound    ItCnt     Gap

*     0+    0                            4.0000      174.0000              --- 
*     0+    0                           28.0000      174.0000           521.43%
      0     0       29.0000     5       28.0000       29.0000       24    3.57%
      0     0        cutoff             28.0000       29.0000       24    3.57%
Elapsed time = 0.01 sec. (0.95 ticks, tree = 0.00 MB)

Root node processing (before b&c):
  Real time             =    0.01 sec. (0.96 ticks)
Parallel b&c, 4 threads:
  Real time             =    0.00 sec. (0.00 ticks)
  Sync time (average)   =    0.00 sec.
  Wait time (average)   =    0.00 sec.
                          ------------
Total (root+branch&cut) =    0.01 sec. (0.96 ticks)

Times (seconds):
Input =  0.001098
Solve =  0.01034
Output = 0.000369
CPLEX 12.6.2.0: optimal integer solution; objective 28
24 MIP simplex iterations
0 branch-and-bound nodes
No basis.

print Total_swaps > task2_50.log;
28

print {i in (1 .. total_pairs)}: {j in (1 .. total_pairs)} pair_swap[i, j] > task2_50.out;