Presolve eliminates 908 constraints and 412 variables.
"option presolve 10;" used, but "option presolve 5;" would suffice.
Adjusted problem:
25843 variables:
	15041 binary variables
	2172 nonlinear variables
	8630 linear variables
34350 constraints, all linear; 94131 nonzeros
	1896 equality constraints
	32454 inequality constraints
1 nonlinear objective; 6950 nonzeros.

CPLEX 20.1.0.0: presolve=0

mipdisplay=2

iisfind=1

Clique table members: 70262.

MIP emphasis: balance optimality and feasibility.

MIP search method: dynamic search.

Parallel mode: deterministic, using up to 8 threads.

Root relaxation solution time = 2.69 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                                       5013         

Elapsed time = 21.63 sec. (12682.50 ticks, tree = 0.01 MB)



Root node processing (before b&c):

  Real time             =   21.64 sec. (12684.53 ticks)

Parallel b&c, 8 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) =   21.64 sec. (12684.53 ticks)

Problem is feasible; no conflict available.

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