CPLEX 20.1.0.0: presolve=0

mipdisplay=2

feasibility=1e-5

cutsfactor=0

iisfind=1

timelimit=3600

Clique table members: 72078.

MIP emphasis: balance optimality and feasibility.

MIP search method: dynamic search.

Parallel mode: deterministic, using up to 8 threads.

Root relaxation solution time = 1.69 sec. (1786.91 ticks)



        Nodes                                         Cuts/

   Node  Left     Objective  IInf  Best Integer    Best Bound    ItCnt     Gap



      0     0   5.38244e+07  2294                 5.38244e+07      161         

      0     0    infeasible                       5.38244e+07   108391         

Elapsed time = 87.00 sec. (54441.95 ticks, tree = 0.02 MB)



Root node processing (before b&c):

  Real time             =   16.00 sec. (8499.17 ticks)

Parallel b&c, 8 threads:

  Real time             =   71.03 sec. (45958.89 ticks)

  Sync time (average)   =   62.09 sec.

  Wait time (average)   =    0.00 sec.

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

Total (root+branch&cut) =   87.03 sec. (54458.06 ticks)

Problem is feasible; no conflict available.

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