FICO Xpress Optimizer 64-bit v23.01.02 (Hyper64 capacity) (c) Copyright Fair Isaac Corporation 1983-2012. All rights reserved Reading Problem lectsched-3 Problem Statistics 45263 ( 0 spare) rows 25776 ( 0 spare) structural columns 279967 ( 184 spare) non-zero elements Global Statistics 25776 entities 0 sets 0 set members Minimizing MILP lectsched-3 Original problem has: 45263 rows 25776 cols 279967 elements 25776 globals Presolved problem has: 14058 rows 7164 cols 60991 elements 7164 globals LP relaxation tightened Symmetric problem: generators: 237, support set: 377 Number of orbits: 140, largest orbit: 12 Concurrent solve, 0s Dual Primal objective suminf objective suminf | p .0000000 7.1516744 | p .0000000 .0000000 ----- interrupted ----- | ------- optimal ------- Deterministic concurrent statistics: Dual: 1424 simplex iterations, 0.023291s Primal: 87 simplex iterations, 0.020483s Primal solved problem Its Obj Value S Ninf Nneg Sum Inf Time 87 .000000 P 0 0 .000000 0 Optimal solution found Starting root cutting & heuristics Its Type BestSoln BestBound Sols Add Del Gap GInf Time 1 K .000000 0 5000 0 1049 1 2 K .000000 0 6244 3905 845 1 3 K .000000 0 6731 6102 644 1 4 K .000000 0 6675 6589 799 2 5 K .000000 0 6201 6595 700 2 6 K .000000 0 6628 6164 665 2 7 K .000000 0 6605 6570 724 2 8 K .000000 0 5188 6597 731 3 9 K .000000 0 4895 5125 611 3 10 K .000000 0 2834 4901 540 3 11 K .000000 0 4982 2831 576 3 12 K .000000 0 6577 4981 713 3 13 K .000000 0 5294 6587 640 4 14 K .000000 0 6573 5275 668 4 15 K .000000 0 5694 6573 632 4 16 K .000000 0 6575 5698 701 4 17 K .000000 0 4043 6591 685 4 18 K .000000 0 5300 4057 447 5 19 K .000000 0 6584 5292 630 5 20 K .000000 0 6153 12560 614 5 21 G .000000 0 3168 197 624 5 22 G .000000 0 5156 8181 624 5 Heuristic search started Heuristic search stopped Cuts in the matrix : 1729 Cut elements in the matrix : 6254 Will try to keep branch and bound tree memory usage below 13.2Gb Starting tree search with up to 4 threads (deterministic mode) Node BestSoln BestBound Sols Active Depth Gap GInf Time 1 .000000 0 2 1 285 6 2 .000000 0 0 2 380 6 3 .000000 0 1 2 413 6 4 .000000 0 0 3 361 6 5 .000000 0 1 3 411 6 6 .000000 0 1 3 397 6 7 .000000 0 3 4 302 6 8 .000000 0 2 3 397 6 9 .000000 0 4 4 373 6 10 .000000 0 4 4 390 6 20 .000000 0 9 6 383 7 30 .000000 0 9 10 346 7 40 .000000 0 9 8 435 7 50 .000000 0 9 16 332 7 60 .000000 0 9 20 334 7 70 .000000 0 22 16 393 7 80 .000000 0 22 22 217 7 90 .000000 0 22 8 395 7 100 .000000 0 22 20 283 7 B&B tree size: 6.6Mb total Node BestSoln BestBound Sols Active Depth Gap GInf Time 200 .000000 0 43 51 200 8 300 .000000 0 105 79 84 8 + 338 .000000 .000000 1 105 61 .000000 0 9 *** Maximum integer solutions *** Time: 9 *** Search completed *** Time: 9 Nodes: 342 Number of integer feasible solutions found is 1 Best integer solution found is .000000 Best bound is .000000 Uncrunching matrix 17.47user 0.10system 0:09.47elapsed 185%CPU (0avgtext+0avgdata 722512maxresident)k 0inputs+24outputs (0major+69417minor)pagefaults 0swaps