Welcome to IBM(R) ILOG(R) CPLEX(R) Interactive Optimizer 20.1.0.0 with Simplex, Mixed Integer & Barrier Optimizers 5725-A06 5725-A29 5724-Y48 5724-Y49 5724-Y54 5724-Y55 5655-Y21 Copyright IBM Corp. 1988, 2020. All Rights Reserved. Type 'help' for a list of available commands. Type 'help' followed by a command name for more information on commands. CPLEX> New value for absolute objective gap: 0 CPLEX> New value for intensity for populating the MIP solution pool: 4 CPLEX> New value for solutions limit for each populate call: 10 CPLEX> New value for capacity of solution pool: 10 CPLEX> New value for variables to include in .sol and .mst files: 1 CPLEX> Problem 'pram.lp' read. Read time = 0.56 sec. (56.18 ticks) CPLEX> Version identifier: 20.1.0.0 | 2020-11-10 | 9bedb6d68 CPXPARAM_Output_WriteLevel 1 CPXPARAM_MIP_Pool_Capacity 10 CPXPARAM_MIP_Pool_Intensity 4 CPXPARAM_MIP_Limits_Populate 10 CPXPARAM_MIP_Pool_AbsGap 0 Populate: phase I Tried aggregator 1 time. MIP Presolve eliminated 190 rows and 16367 columns. MIP Presolve modified 168655 coefficients. Reduced MIP has 2080 rows, 92588 columns, and 3355561 nonzeros. Reduced MIP has 92588 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 1.58 sec. (2398.55 ticks) Tried aggregator 1 time. MIP Presolve eliminated 3 rows and 189 columns. MIP Presolve modified 1323 coefficients. Reduced MIP has 2076 rows, 92399 columns, and 3348836 nonzeros. Reduced MIP has 92399 binaries, 0 generals, 0 SOSs, and 0 indicators. Presolve time = 1.21 sec. (1922.93 ticks) Probing fixed 4066 vars, tightened 0 bounds. Probing time = 9.26 sec. (4090.12 ticks) Cover probing fixed 26 vars, tightened 0 bounds. Clique table members: 94525. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 8 threads. Root relaxation solution time = 60.82 sec. (29012.88 ticks) Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 0.0000 1410 0.0000 68 Heuristic still looking. Heuristic still looking. Heuristic still looking. 0 2 0.0000 1263 0.0000 65318 Elapsed time = 1633.16 sec. (1908791.70 ticks, tree = 0.02 MB, solutions = 0) 1 3 0.0000 1252 0.0000 89533 2 3 0.0000 1260 0.0000 98790 3 4 0.0000 1219 0.0000 109513 4 5 0.0000 1215 0.0000 143556 5 5 0.0000 1254 0.0000 149379 6 6 0.0000 1162 0.0000 171377 7 7 0.0000 1170 0.0000 184550 8 6 0.0000 1164 0.0000 187295 9 9 0.0000 1169 0.0000 221254 10 10 0.0000 1169 0.0000 240857 Elapsed time = 2295.96 sec. (2111999.11 ticks, tree = 0.07 MB, solutions = 0) 11 4 0.0000 1238 0.0000 172547 12 8 0.0000 1244 0.0000 242622 13 9 0.0000 1126 0.0000 248847 14 8 0.0000 1348 0.0000 253370 15 11 0.0000 1165 0.0000 306731 16 7 0.0000 1169 0.0000 245331 18 12 0.0000 1068 0.0000 320644 19 18 0.0000 1176 0.0000 542903 20 14 infeasible 0.0000 459473 21 21 0.0000 1060 0.0000 685203 Elapsed time = 2806.06 sec. (2271908.45 ticks, tree = 0.60 MB, solutions = 0) 22 19 0.0000 1164 0.0000 627079 23 19 0.0000 1133 0.0000 545890 24 14 0.0000 1173 0.0000 413761 25 23 0.0000 1097 0.0000 688811 26 20 0.0000 1132 0.0000 629840 27 15 0.0000 1139 0.0000 475943 28 20 0.0000 1048 0.0000 679627 29 22 0.0000 991 0.0000 690609 30 26 0.0000 1088 0.0000 737721 31 24 0.0000 1057 0.0000 691514 Elapsed time = 3019.88 sec. (2346339.95 ticks, tree = 1.44 MB, solutions = 0) 32 24 0.0000 1108 0.0000 733816 33 27 0.0000 1124 0.0000 790639 34 28 0.0000 970 0.0000 823386 35 25 0.0000 1031 0.0000 693498 36 30 0.0000 924 0.0000 834200 37 25 0.0000 1135 0.0000 736324 38 29 0.0000 911 0.0000 826515 39 15 0.0000 1082 0.0000 518730 40 17 0.0000 1195 0.0000 589327 41 37 0.0000 913 0.0000 869372 Elapsed time = 3505.31 sec. (2453677.89 ticks, tree = 1.88 MB, solutions = 0) 42 33 0.0000 980 0.0000 876819 43 35 0.0000 1132 0.0000 883034 44 32 infeasible 0.0000 878519 46 37 0.0000 1050 0.0000 942869 47 28 0.0000 1109 0.0000 820559 48 38 0.0000 937 0.0000 892161 49 31 0.0000 924 0.0000 862504 50 39 0.0000 1110 0.0000 1026911 51 39 0.0000 1007 0.0000 1070316 52 41 0.0000 1069 0.0000 1119435 Elapsed time = 3889.26 sec. (2527796.08 ticks, tree = 3.46 MB, solutions = 0) 53 38 0.0000 1008 0.0000 966778 54 27 0.0000 1024 0.0000 805459 55 42 0.0000 1033 0.0000 1140921 56 47 0.0000 1003 0.0000 1248961 57 45 0.0000 911 0.0000 1216618 58 49 0.0000 1018 0.0000 1318783 60 39 0.0000 1245 0.0000 1064361 61 46 0.0000 864 0.0000 1232731 64 49 infeasible 0.0000 1339216 65 52 0.0000 914 0.0000 1448083 Elapsed time = 4187.88 sec. (2631041.01 ticks, tree = 3.07 MB, solutions = 0) 67 56 0.0000 926 0.0000 1497377 68 50 0.0000 985 0.0000 1357357 69 40 0.0000 1173 0.0000 1093456 70 53 0.0000 829 0.0000 1464981 71 58 0.0000 857 0.0000 1553598 72 57 0.0000 890 0.0000 1513938 73 60 0.0000 922 0.0000 1612477 75 54 0.0000 841 0.0000 1483948 76 62 0.0000 1148 0.0000 1682472 77 59 0.0000 838 0.0000 1573422 Elapsed time = 4522.45 sec. (2704651.25 ticks, tree = 4.05 MB, solutions = 0) 78 61 0.0000 811 0.0000 1629365 79 60 0.0000 757 0.0000 1592061 Root node processing (before b&c): Real time = 1556.80 sec. (1851683.81 ticks) Parallel b&c, 8 threads: Real time = 27504.93 sec. (959331.41 ticks) Sync time (average) = 578.92 sec. Wait time (average) = 0.00 sec. ------------ Total (root+branch&cut) = 29061.74 sec. (2811015.22 ticks) Populate - Aborted, no integer solution. Current MIP best bound = -0.0000000000e+00 (gap is infinite) Solution time = 29061.74 sec. Iterations = 2053284 Nodes = 80 (73) Deterministic time = 2811015.95 ticks (96.73 ticks/sec) CPLEX> CPLEX Error 1217: No solution exists. No file written. CPLEX>