CPLEX 20.1.0.0: presolve=0

mipdisplay=2

iisfind=1

timelimit=3600

cutpass = -1

Clique table members: 1562.

MIP emphasis: balance optimality and feasibility.

MIP search method: dynamic search.

Parallel mode: deterministic, using up to 8 threads.

Root relaxation solution time = 2.70 sec. (2383.09 ticks)



        Nodes                                         Cuts/

   Node  Left     Objective  IInf  Best Integer    Best Bound    ItCnt     Gap



      0     0   5.38244e+07  1550                 5.38244e+07      170         

      0     0        cutoff                       5.38244e+07     3365         

Elapsed time = 29.20 sec. (28974.59 ticks, tree = 0.01 MB)



Root node processing (before b&c):

  Real time             =   29.20 sec. (28974.59 ticks)

Parallel b&c, 8 threads:

  Real time             =    0.06 sec. (15.21 ticks)

  Sync time (average)   =    0.01 sec.

  Wait time (average)   =    0.00 sec.

                          ------------

Total (root+branch&cut) =   29.27 sec. (28989.79 ticks)

Problem is feasible; no conflict available.

CPLEX 20.1.0.0: integer infeasible.
3365 MIP simplex iterations
0 branch-and-bound nodes
Surprise values mc = 0, nc = 0 from CPXrefineconflict.
Return 1719 from CPXgetconflict.
No basis.