Welcome to IBM(R) ILOG(R) CPLEX(R) Interactive Optimizer 12.4.0.0 with Simplex, Mixed Integer & Barrier Optimizers 5725-A06 5725-A29 5724-Y48 5724-Y49 5724-Y54 5724-Y55 Copyright IBM Corp. 1988, 2011. All Rights Reserved. Type 'help' for a list of available commands. Type 'help' followed by a command name for more information on commands. CPLEX> Selected objective sense: MINIMIZE Selected objective name: R1042 Selected RHS name: B Selected bound name: BOUND Problem 'in_i.mps.gz' read. Read time = 0.02 sec. CPLEX> Available MIP parameters: cuts set types of cuts used during mixed integer optimization display set level of mixed integer node display interval set interval for printing mixed integer node display limits set limits for mixed integer optimization ordertype set type of generated priority order polishafter set starting conditions for solution polishing pool set solution pool characteristics strategy set strategy for mixed integer optimization tolerances set tolerances for mixed integer optimization MIP parameter to set: Available mixed integer limits: aggforcut set constraint aggregation limit for cut generation auxrootthreads set number of threads to use for auxiliary root tasks cutpasses set number of cutting plane passes cutsfactor set rows multiplier factor to limit cuts eachcutlimit set limit on number of cuts for each type per pass gomorycand set candidate limit for generating Gomory fractional cuts gomorypass set pass limit for generating Gomory fractional cuts nodes set branch and cut node limit polishtime set time limit for polishing best solution populate set solutions limit for each populate call probetime set time limit for probing repairtries set number of times to try repair heuristic solutions set mixed integer solutions limit strongcand set strong branching candidate limit strongit set strong branching iteration limit submipnodelim set sub-MIP node limit treememory set upper limit on size of tree in megabytes Mixed integer limit to set: Present value for mixed integer solutions limit: 9223372036800000000 New value for mixed integer solutions limit: New value for mixed integer solutions limit: 1 CPLEX> Present value for time limit in seconds: 1e+75 New value for time limit in seconds: New value for time limit in seconds: 3600 CPLEX> Tried aggregator 1 time. MIP Presolve eliminated 57 rows and 24 columns. MIP Presolve modified 63 coefficients. Reduced MIP has 984 rows, 1713 columns, and 18075 nonzeros. Reduced MIP has 1713 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing time = 0.00 sec. Tried aggregator 1 time. Presolve time = 0.03 sec. Probing time = 0.00 sec. Clique table members: 1189. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 4 threads. Root relaxation solution time = 0.20 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap 0 0 0.0000 441 0.0000 2110 0 0 0.0000 282 Cliques: 2 2143 0 0 0.0000 413 Cuts: 93 4387 0 0 0.0000 250 Cliques: 1 4409 0 0 0.0000 383 Cuts: 35 4770 0 2 0.0000 259 0.0000 4770 Elapsed real time = 3.71 sec. (tree size = 0.01 MB, solutions = 0) 1 3 0.0000 412 0.0000 9692 2 4 0.0000 438 0.0000 12700 3 5 0.0000 432 0.0000 15911 4 6 0.0000 436 0.0000 18646 13 15 0.0000 458 0.0000 25507 21 23 0.0000 429 0.0000 29682 60 62 0.0000 351 0.0000 44680 73 75 0.0000 200 0.0000 54140 99 97 0.0000 303 0.0000 67291 208 140 infeasible 0.0000 140325 Elapsed real time = 7.35 sec. (tree size = 0.17 MB, solutions = 0) 241 141 0.0000 136 0.0000 178662 379 161 infeasible 0.0000 230341 620 162 infeasible 0.0000 272967 883 145 infeasible 0.0000 320540 1091 141 infeasible 0.0000 359664 1362 154 0.0000 135 0.0000 407521 1591 145 infeasible 0.0000 452310 1795 157 infeasible 0.0000 492404 1996 154 infeasible 0.0000 526139 2251 169 infeasible 0.0000 573278 Elapsed real time = 16.02 sec. (tree size = 0.13 MB, solutions = 0) 2452 192 infeasible 0.0000 611343 2617 185 0.0000 146 0.0000 636620 2840 176 0.0000 145 0.0000 678735 3069 149 0.0000 192 0.0000 721440 3353 155 0.0000 132 0.0000 769969 3562 146 infeasible 0.0000 805213 3783 155 infeasible 0.0000 844273 4015 205 infeasible 0.0000 884504 4241 207 infeasible 0.0000 922089 4495 197 infeasible 0.0000 968656 Elapsed real time = 24.48 sec. (tree size = 0.11 MB, solutions = 0) 4699 205 0.0000 147 0.0000 1006038 4888 208 0.0000 257 0.0000 1047150 4890 209 0.0000 403 0.0000 1055820 4892 210 0.0000 452 0.0000 1061782 4896 212 0.0000 424 0.0000 1069125 4913 225 0.0000 431 0.0000 1074774 4929 235 0.0000 426 0.0000 1081181 4959 248 0.0000 371 0.0000 1093122 5061 255 infeasible 0.0000 1147477 5180 203 0.0000 152 0.0000 1229916 Elapsed real time = 39.17 sec. (tree size = 0.99 MB, solutions = 0) 5384 160 0.0000 195 0.0000 1310970 5501 149 0.0000 212 0.0000 1366941 5593 156 0.0000 206 0.0000 1394074 5763 179 infeasible 0.0000 1436628 5924 188 0.0000 220 0.0000 1470187 6068 195 infeasible 0.0000 1503651 6164 166 0.0000 210 0.0000 1534760 6316 183 infeasible 0.0000 1572821 6437 155 0.0000 225 0.0000 1608355 6551 168 0.0000 174 0.0000 1636610 Elapsed real time = 47.76 sec. (tree size = 0.47 MB, solutions = 0) 6750 186 0.0000 226 0.0000 1682716 6920 176 0.0000 216 0.0000 1728429 7084 198 0.0000 172 0.0000 1761553 7236 189 0.0000 253 0.0000 1796585 7238 190 0.0000 427 0.0000 1804338 7242 192 0.0000 445 0.0000 1814357 7258 200 0.0000 438 0.0000 1822498 7274 208 0.0000 449 0.0000 1827491 7292 217 0.0000 414 0.0000 1836058 7329 241 0.0000 383 0.0000 1848744 Elapsed real time = 68.56 sec. (tree size = 1.78 MB, solutions = 0) 7358 262 0.0000 412 0.0000 1860249 7420 290 0.0000 346 0.0000 1880926 7490 272 0.0000 339 0.0000 1898497 7621 212 0.0000 205 0.0000 1929591 7739 222 0.0000 182 0.0000 1958596 7862 226 0.0000 206 0.0000 1987234 7993 215 infeasible 0.0000 2020936 8149 198 infeasible 0.0000 2056383 8296 240 infeasible 0.0000 2090780 8453 225 0.0000 246 0.0000 2140361 Elapsed real time = 76.71 sec. (tree size = 0.99 MB, solutions = 0) 8643 236 infeasible 0.0000 2184824 8788 233 infeasible 0.0000 2216794 8952 213 0.0000 186 0.0000 2260432 9063 216 0.0000 241 0.0000 2289212 9178 239 0.0000 243 0.0000 2321740 9305 236 0.0000 173 0.0000 2360805 9414 226 infeasible 0.0000 2401875 9547 253 0.0000 194 0.0000 2442368 9679 269 0.0000 202 0.0000 2473642 9824 291 infeasible 0.0000 2509514 Elapsed real time = 84.54 sec. (tree size = 0.89 MB, solutions = 0) 10022 290 infeasible 0.0000 2553903 10179 259 0.0000 201 0.0000 2594497 10300 238 infeasible 0.0000 2630187 10426 232 0.0000 198 0.0000 2668198 10547 227 infeasible 0.0000 2710408 10669 233 0.0000 209 0.0000 2758067 10781 227 infeasible 0.0000 2794422 10924 208 0.0000 216 0.0000 2834962 11040 239 0.0000 190 0.0000 2868181 11164 236 infeasible 0.0000 2903251 Elapsed real time = 92.40 sec. (tree size = 0.65 MB, solutions = 0) 11292 220 0.0000 203 0.0000 2945220 11443 252 0.0000 139 0.0000 3005764 11582 240 infeasible 0.0000 3060524 11834 228 infeasible 0.0000 3125518 11982 242 infeasible 0.0000 3162539 12165 224 0.0000 170 0.0000 3211026 12286 217 infeasible 0.0000 3239559 12422 232 0.0000 211 0.0000 3267597 12633 223 infeasible 0.0000 3320180 * 12787 160 integral 0 0.0000 0.0000 3359719 0.00% Elapsed real time = 100.62 sec. (tree size = 0.66 MB, solutions = 0) Root node processing (before b&c): Real time = 3.63 Parallel b&c, 4 threads: Real time = 97.61 Sync time (average) = 0.03 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 101.24 sec. Solution pool: 1 solution saved. MIP - Integer optimal solution: Objective = 0.0000000000e+00 Solution time = 101.27 sec. Iterations = 3383560 Nodes = 12890 Deterministic time = 122075.54 ticks (1205.42 ticks/sec) CPLEX> 319.13user 0.07system 1:41.29elapsed 315%CPU (0avgtext+0avgdata 575616maxresident)k 0inputs+280outputs (0major+43233minor)pagefaults 0swaps