--- Job bell5 Start 10/01/08 12:49:58 GAMS Rev 228 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G080908/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- bell5.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/bell5.gdx --- bell5.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.008 --- bell5.gms(123) 4 Mb --- Generating MIP model m --- bell5.gms(124) 4 Mb --- 92 rows 105 columns 341 non-zeroes --- 58 discrete-columns --- Executing SCIP: elapsed 0:00:00.012 SCIP version 1.10.0 [LP solver: Clp 1.8stable] Copyright (c) 2002-2008 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) Optionfile /home/stefan/work/gams/benchmarks/LINLib.MIP/scip.opt successfully read. Starting MIP solve... presolving: (round 1) 5 del vars, 7 del conss, 62 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 2) 8 del vars, 11 del conss, 68 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 3) 8 del vars, 12 del conss, 69 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 4) 9 del vars, 13 del conss, 69 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 5) 9 del vars, 13 del conss, 96 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 6) 14 del vars, 21 del conss, 96 chg bounds, 1 chg sides, 11 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 7) 15 del vars, 22 del conss, 96 chg bounds, 1 chg sides, 11 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 8) 15 del vars, 22 del conss, 128 chg bounds, 1 chg sides, 11 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 9) 15 del vars, 24 del conss, 128 chg bounds, 3 chg sides, 20 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 10) 15 del vars, 24 del conss, 143 chg bounds, 3 chg sides, 20 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 11) 15 del vars, 24 del conss, 143 chg bounds, 3 chg sides, 23 chg coeffs, 0 upgd conss, 108 impls, 0 clqs (round 12) 22 del vars, 24 del conss, 159 chg bounds, 3 chg sides, 25 chg coeffs, 0 upgd conss, 194 impls, 0 clqs (round 13) 24 del vars, 37 del conss, 159 chg bounds, 3 chg sides, 25 chg coeffs, 0 upgd conss, 194 impls, 0 clqs (round 14) 25 del vars, 39 del conss, 159 chg bounds, 3 chg sides, 25 chg coeffs, 0 upgd conss, 194 impls, 0 clqs (round 15) 25 del vars, 40 del conss, 167 chg bounds, 3 chg sides, 25 chg coeffs, 0 upgd conss, 194 impls, 0 clqs (round 16) 25 del vars, 40 del conss, 183 chg bounds, 3 chg sides, 25 chg coeffs, 0 upgd conss, 194 impls, 0 clqs (round 17) 25 del vars, 41 del conss, 183 chg bounds, 3 chg sides, 25 chg coeffs, 0 upgd conss, 194 impls, 0 clqs (round 18) 25 del vars, 41 del conss, 188 chg bounds, 3 chg sides, 25 chg coeffs, 18 upgd conss, 194 impls, 0 clqs (round 19) 25 del vars, 41 del conss, 188 chg bounds, 7 chg sides, 33 chg coeffs, 18 upgd conss, 195 impls, 0 clqs (round 20) 25 del vars, 43 del conss, 188 chg bounds, 7 chg sides, 33 chg coeffs, 18 upgd conss, 195 impls, 0 clqs presolving (21 rounds): 25 deleted vars, 43 deleted constraints, 188 tightened bounds, 0 added holes, 7 changed sides, 33 changed coefficients 195 implications, 0 cliques presolved problem has 79 variables (23 bin, 23 int, 0 impl, 33 cont) and 52 constraints 15 constraints of type 4 constraints of type 32 constraints of type 1 constraints of type Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 48 | 290k| 0 | 8.912506e+06 | -- | Inf s 1 | 0 | 48 | 293k| 0 | 8.912506e+06 | 1.029193e+07 | 15.48% 1 | 0 | 63 | 313k| 0 | 8.917086e+06 | 1.029193e+07 | 15.42% 1 | 0 | 72 | 321k| 0 | 8.925250e+06 | 1.029193e+07 | 15.31% s 1 | 0 | 72 | 323k| 0 | 8.925250e+06 | 1.026234e+07 | 14.98% 1 | 0 | 78 | 328k| 0 | 8.934071e+06 | 1.026234e+07 | 14.87% s 1 | 0 | 78 | 330k| 0 | 8.934071e+06 | 1.022432e+07 | 14.44% 1 | 0 | 88 | 337k| 0 | 8.943089e+06 | 1.022432e+07 | 14.33% 1 | 0 | 96 | 342k| 0 | 8.946294e+06 | 1.022432e+07 | 14.29% s 1 | 0 | 96 | 343k| 0 | 8.946294e+06 | 9.969596e+06 | 11.44% 1 | 0 | 99 | 346k| 0 | 8.947382e+06 | 9.969596e+06 | 11.42% s 1 | 0 | 99 | 348k| 0 | 8.947382e+06 | 9.332731e+06 | 4.31% 1 | 0 | 104 | 354k| 0 | 8.948772e+06 | 9.332731e+06 | 4.29% 1 | 0 | 108 | 358k| 0 | 8.952450e+06 | 9.332731e+06 | 4.25% 1 | 0 | 112 | 364k| 0 | 8.954542e+06 | 9.332731e+06 | 4.22% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 120 | 368k| 0 | 8.955703e+06 | 9.332731e+06 | 4.21% s 1 | 0 | 120 | 370k| 0 | 8.955703e+06 | 9.070259e+06 | 1.28% 1 | 0 | 120 | 370k| 0 | 8.955703e+06 | 9.070259e+06 | 1.28% k 1 | 0 | 150 | 373k| 0 | 8.955703e+06 | 9.051309e+06 | 1.07% 1 | 0 | 150 | 372k| 0 | 8.955703e+06 | 9.051309e+06 | 1.07% s 1 | 0 | 150 | 373k| 0 | 8.955703e+06 | 9.027644e+06 | 0.80% 1 | 0 | 150 | 373k| 0 | 8.955703e+06 | 9.027644e+06 | 0.80% 1 | 2 | 150 | 373k| 0 | 8.955703e+06 | 9.027644e+06 | 0.80% r 7 | 1 | 159 | 377k| 6 | 8.961320e+06 | 8.966895e+06 | 0.06% * 84 | 62 | 567 | 634k| 17 | 8.964238e+06 | 8.966406e+06 | 0.02% 100 | 74 | 637 | 653k| 17 | 8.964490e+06 | 8.966406e+06 | 0.02% 200 | 148 | 1053 | 770k| 18 | 8.964662e+06 | 8.966406e+06 | 0.02% 300 | 190 | 1327 | 887k| 19 | 8.964890e+06 | 8.966406e+06 | 0.02% 400 | 220 | 1564 | 971k| 19 | 8.965214e+06 | 8.966406e+06 | 0.01% 500 | 236 | 1719 |1026k| 21 | 8.965330e+06 | 8.966406e+06 | 0.01% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 600 | 226 | 1852 |1049k| 21 | 8.965400e+06 | 8.966406e+06 | 0.01% 700 | 206 | 1985 |1067k| 21 | 8.965574e+06 | 8.966406e+06 | 0.01% 800 | 186 | 2123 |1079k| 21 | 8.965629e+06 | 8.966406e+06 | 0.01% 900 | 138 | 2230 |1081k| 21 | 8.965745e+06 | 8.966406e+06 | 0.01% 1000 | 58 | 2365 | 990k| 21 | 8.965805e+06 | 8.966406e+06 | 0.01% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.88 Solving Nodes : 1058 Primal Bound : +8.96640649152000e+06 (272 solutions) Dual Bound : +8.96640649152000e+06 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 0.88 Original Problem : Problem name : gamsmodel Variables : 104 (30 binary, 28 integer, 0 implicit integer, 46 continuous) Constraints : 91 initial, 91 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 79 (23 binary, 23 integer, 0 implicit integer, 33 continuous) Constraints : 52 initial, 513 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 0 0 0 0 0 0 0 0 dualfix : 0.00 4 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 5 0 0 0 0 0 implics : 0.00 0 0 0 0 0 0 0 0 probing : 0.00 7 0 0 8 0 0 0 0 varbound : 0.00 0 0 0 0 0 0 0 0 knapsack : 0.00 0 0 0 0 0 2 4 8 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 0 14 0 180 0 41 3 25 logicor : 0.00 0 0 0 0 0 0 0 0 bounddisjunction : 0.00 0 0 0 0 0 0 0 0 root node : - 16 - - 55 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 545 0 6 5 0 0 1066 varbound : 15 13 12795 1 0 0 2383 0 0 0 setppc : 4 13 27 0 0 0 2 0 0 0 linear : 32 13 12904 1 0 111 43315 2 0 0 logicor : 1 13 4 0 0 0 0 0 0 0 bounddisjunction : 0+ 0 5830 0 0 0 260 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.02 0.00 0.00 0.02 0.00 varbound : 0.01 0.00 0.01 0.00 0.00 setppc : 0.00 0.00 0.00 0.00 0.00 linear : 0.12 0.00 0.12 0.00 0.00 logicor : 0.00 0.00 0.00 0.00 0.00 bounddisjunction : 0.07 0.00 0.07 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 2 0 23 pseudoobj : 0.06 12872 0 1268 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.01 106 106 701 19.2 74 5.2 - infeasible LP : 0.00 109 1 4 14.8 0 0.0 0 bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0 strong branching : 0.00 0 0 0 0.0 0 0.0 0 pseudo solution : 0.00 0 0 0 0.0 0 0.0 - applied globally : - - - 541 17.1 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 12 - - 21 - (maximal pool size: 132) redcost : 0.01 936 0 696 0 0 impliedbounds : 0.00 13 0 0 18 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 13 0 0 33 0 strongcg : 0.00 13 0 0 4 0 cmir : 0.03 10 0 0 105 0 flowcover : 0.02 10 0 0 13 0 clique : 0.00 1 0 0 0 0 zerohalf : 0.00 0 0 0 0 0 mcf : 0.00 0 0 0 0 0 Pricers : Time Calls Vars problem variables: 0.00 0 0 Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children relpscost : 0.02 544 6 5 0 0 1066 pscost : 0.00 0 0 0 0 0 0 inference : 0.00 0 0 0 0 0 0 mostinf : 0.00 0 0 0 0 0 0 leastinf : 0.00 0 0 0 0 0 0 fullstrong : 0.00 0 0 0 0 0 0 allfullstrong : 0.00 0 0 0 0 0 0 random : 0.00 0 0 0 0 0 0 Primal Heuristics : Time Calls Found LP solutions : 0.00 - 1 pseudo solutions : 0.00 - 0 feaspump : 0.00 0 0 oneopt : 0.00 3 1 linesearchdiving : 0.01 18 10 veclendiving : 0.01 18 17 fracdiving : 0.04 18 21 pscostdiving : 0.04 18 35 coefdiving : 0.03 18 12 guideddiving : 0.06 19 6 simplerounding : 0.01 560 142 rounding : 0.00 299 0 shifting : 0.00 35 8 intshifting : 0.01 5 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.01 1 9 rootsoldiving : 0.01 1 10 octane : 0.00 0 0 rens : 0.01 1 0 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 crossover : 0.01 1 0 dins : 0.00 0 0 LP : Time Calls Iterations Iter/call Iter/sec primal LP : 0.00 0 0 0.00 - dual LP : 0.20 971 1465 1.51 7325.00 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.13 510 963 1.89 7407.69 strong branching : 0.02 68 392 5.76 19600.00 (at root node) : - 10 96 9.60 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 1058 nodes (total) : 1058 nodes left : 0 max depth : 22 max depth (total): 22 backtracks : 502 (47.4%) delayed cutoffs : 0 repropagations : 152 (16 domain reductions, 0 cutoffs) avg switch length: 8.28 switching time : 0.06 Solution : Solutions found : 272 (10 improvements) Primal Bound : +8.96640649152000e+06 (in run 1, after 84 nodes, 0.17 seconds, depth 11, found by ) Dual Bound : +8.96640649152000e+06 Gap : 0.00 % Root Dual Bound : +8.95570292168958e+06 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- bell5.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job bell5.gms Stop 10/01/08 12:49:59 elapsed 0:00:00.981