--- Job acc-tight-6 Start 10/01/08 10:12:06 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 --- acc-tight-6.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-6.gdx --- acc-tight-6.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.050 --- acc-tight-6.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-6.gms(124) 5 Mb --- 3,053 rows 1,340 columns 16,136 non-zeroes --- 1,339 discrete-columns --- acc-tight-6.gms(124) 5 Mb --- Executing SCIP: elapsed 0:00:00.145 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) 7 del vars, 9 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5150 impls, 489 clqs (round 2) 31 del vars, 37 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5150 impls, 488 clqs (round 3) 31 del vars, 49 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5150 impls, 488 clqs (round 4) 31 del vars, 78 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 2919 upgd conss, 5150 impls, 488 clqs (round 5) 31 del vars, 154 del conss, 16 chg bounds, 83 chg sides, 555 chg coeffs, 2919 upgd conss, 5150 impls, 488 clqs (round 6) 31 del vars, 193 del conss, 16 chg bounds, 83 chg sides, 555 chg coeffs, 2926 upgd conss, 5150 impls, 488 clqs (round 7) 120 del vars, 193 del conss, 16 chg bounds, 83 chg sides, 555 chg coeffs, 2926 upgd conss, 7950 impls, 465 clqs (round 8) 120 del vars, 334 del conss, 16 chg bounds, 86 chg sides, 568 chg coeffs, 2926 upgd conss, 7950 impls, 468 clqs (round 9) 120 del vars, 349 del conss, 16 chg bounds, 86 chg sides, 568 chg coeffs, 2926 upgd conss, 7950 impls, 468 clqs (round 10) 170 del vars, 349 del conss, 16 chg bounds, 86 chg sides, 568 chg coeffs, 2926 upgd conss, 49180 impls, 456 clqs (round 11) 170 del vars, 413 del conss, 16 chg bounds, 94 chg sides, 626 chg coeffs, 2926 upgd conss, 49324 impls, 461 clqs (round 12) 170 del vars, 432 del conss, 16 chg bounds, 94 chg sides, 628 chg coeffs, 2926 upgd conss, 49324 impls, 461 clqs (0.7s) probing: 1000/1308 (76.5%) - 143 fixings, 39 aggregations, 23418 implications, 0 bound changes (round 13) 239 del vars, 432 del conss, 17 chg bounds, 94 chg sides, 628 chg coeffs, 2926 upgd conss, 79977 impls, 447 clqs (round 14) 241 del vars, 509 del conss, 17 chg bounds, 130 chg sides, 856 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 15) 246 del vars, 534 del conss, 17 chg bounds, 132 chg sides, 875 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 16) 246 del vars, 560 del conss, 17 chg bounds, 132 chg sides, 880 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 17) 246 del vars, 560 del conss, 17 chg bounds, 132 chg sides, 884 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 18) 246 del vars, 582 del conss, 17 chg bounds, 132 chg sides, 888 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 19) 246 del vars, 582 del conss, 17 chg bounds, 132 chg sides, 892 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 20) 246 del vars, 582 del conss, 17 chg bounds, 132 chg sides, 896 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 21) 246 del vars, 582 del conss, 17 chg bounds, 132 chg sides, 899 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 22) 246 del vars, 582 del conss, 17 chg bounds, 132 chg sides, 902 chg coeffs, 2927 upgd conss, 80187 impls, 472 clqs (round 23) 296 del vars, 582 del conss, 17 chg bounds, 132 chg sides, 902 chg coeffs, 2927 upgd conss, 84983 impls, 465 clqs (round 24) 297 del vars, 606 del conss, 17 chg bounds, 139 chg sides, 957 chg coeffs, 2927 upgd conss, 85007 impls, 470 clqs (round 25) 297 del vars, 623 del conss, 17 chg bounds, 139 chg sides, 962 chg coeffs, 2928 upgd conss, 85007 impls, 470 clqs (round 26) 297 del vars, 624 del conss, 17 chg bounds, 139 chg sides, 965 chg coeffs, 2928 upgd conss, 85007 impls, 470 clqs (round 27) 315 del vars, 624 del conss, 17 chg bounds, 139 chg sides, 965 chg coeffs, 2928 upgd conss, 85937 impls, 468 clqs (round 28) 316 del vars, 636 del conss, 17 chg bounds, 139 chg sides, 966 chg coeffs, 2928 upgd conss, 85937 impls, 467 clqs (round 29) 316 del vars, 639 del conss, 17 chg bounds, 139 chg sides, 967 chg coeffs, 2933 upgd conss, 85937 impls, 467 clqs (round 30) 316 del vars, 646 del conss, 17 chg bounds, 139 chg sides, 967 chg coeffs, 2933 upgd conss, 85937 impls, 467 clqs presolving (31 rounds): 316 deleted vars, 646 deleted constraints, 17 tightened bounds, 0 added holes, 139 changed sides, 967 changed coefficients 85937 implications, 467 cliques presolved problem has 1023 variables (1023 bin, 0 int, 0 impl, 0 cont) and 2536 constraints 375 constraints of type 451 constraints of type 40 constraints of type 1670 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 1.06 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1356 |8024k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 18242 | 14M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 21632 | 21M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 25081 | 28M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 28722 | 34M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 32480 | 40M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 36310 | 47M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 37726 | 47M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 41672 | 53M| 0 | 0.000000e+00 | -- | Inf 1 | 2 | 41672 | 53M| 0 | 0.000000e+00 | -- | Inf 100 | 63 |375576 | 53M| 15 | 0.000000e+00 | -- | Inf 200 | 89 |546295 | 53M| 21 | 0.000000e+00 | -- | Inf 300 | 105 |648143 | 53M| 31 | 0.000000e+00 | -- | Inf 400 | 107 |724600 | 53M| 31 | 0.000000e+00 | -- | Inf 500 | 113 |810314 | 53M| 31 | 0.000000e+00 | -- | Inf node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 600 | 127 |895478 | 53M| 31 | 0.000000e+00 | -- | Inf 700 | 131 |952073 | 54M| 36 | 0.000000e+00 | -- | Inf 800 | 133 | 1001k| 54M| 36 | 0.000000e+00 | -- | Inf 900 | 121 | 1056k| 53M| 37 | 0.000000e+00 | -- | Inf 1000 | 125 | 1154k| 53M| 37 | 0.000000e+00 | -- | Inf 1100 | 125 | 1222k| 53M| 37 | 0.000000e+00 | -- | Inf 1200 | 121 | 1283k| 53M| 37 | 0.000000e+00 | -- | Inf 1300 | 117 | 1347k| 53M| 37 | 0.000000e+00 | -- | Inf 1400 | 115 | 1448k| 53M| 37 | 0.000000e+00 | -- | Inf 1500 | 113 | 1531k| 53M| 37 | 0.000000e+00 | -- | Inf 1600 | 115 | 1626k| 53M| 37 | 0.000000e+00 | -- | Inf 1700 | 115 | 1701k| 53M| 37 | 0.000000e+00 | -- | Inf 1800 | 115 | 1794k| 53M| 37 | 0.000000e+00 | -- | Inf 1900 | 105 | 1917k| 53M| 37 | 0.000000e+00 | -- | Inf 2000 | 111 | 1981k| 53M| 37 | 0.000000e+00 | -- | Inf node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 2100 | 111 | 2049k| 53M| 37 | 0.000000e+00 | -- | Inf 2200 | 105 | 2114k| 53M| 37 | 0.000000e+00 | -- | Inf 2300 | 103 | 2210k| 53M| 37 | 0.000000e+00 | -- | Inf 2400 | 109 | 2282k| 54M| 37 | 0.000000e+00 | -- | Inf 2500 | 111 | 2369k| 54M| 37 | 0.000000e+00 | -- | Inf 2600 | 117 | 2433k| 54M| 37 | 0.000000e+00 | -- | Inf 2700 | 129 | 2477k| 54M| 37 | 0.000000e+00 | -- | Inf 2800 | 127 | 2533k| 54M| 37 | 0.000000e+00 | -- | Inf 2900 | 113 | 2619k| 54M| 37 | 0.000000e+00 | -- | Inf * 2959 | 0 | 2659k| 53M| 37 | 0.000000e+00 | 0.000000e+00 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 1390.80 Solving Nodes : 2959 Primal Bound : +0.00000000000000e+00 (1 solutions) Dual Bound : +0.00000000000000e+00 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 1390.80 Original Problem : Problem name : gamsmodel Variables : 1339 (1339 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 3052 initial, 3052 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1023 (1023 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 2536 initial, 2633 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 17 0 0 0 0 0 0 0 dualfix : 0.00 0 0 0 0 0 0 0 0 boundshift : 0.00 0 0 0 0 0 0 0 0 inttobinary : 0.00 0 0 0 0 0 0 0 0 implics : 0.00 0 1 0 0 0 0 0 0 probing : 0.49 184 92 0 1 0 0 0 0 knapsack : 0.30 0 0 0 0 0 69 130 967 setppc : 0.02 0 1 0 0 0 174 0 0 linear : 0.08 16 5 0 16 0 79 9 0 logicor : 0.14 0 0 0 0 0 324 0 0 root node : - 16 - - 16 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 1572 0 2 31 0 0 3082 knapsack : 375 7 16308 1 0 3 2224 0 0 0 setppc : 451 7 16305 1 0 58 35777 0 0 0 linear : 40 7 16247 1 0 5 1557 0 0 0 logicor : 1670+ 7 11068 1 0 18 34611 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 397.86 0.00 0.00 397.86 0.00 knapsack : 0.16 0.01 0.15 0.00 0.00 setppc : 0.35 0.00 0.35 0.00 0.00 linear : 0.09 0.00 0.09 0.00 0.00 logicor : 0.25 0.00 0.25 0.00 0.00 countsols : 0.00 0.00 0.00 0.00 0.00 Propagators : Time Calls Cutoffs DomReds rootredcost : 0.00 0 0 0 pseudoobj : 0.00 12170 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 27 27 178 22.4 11 6.0 - infeasible LP : 0.18 1468 0 0 0.0 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 : - - - 135 20.3 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.06 6 - - 0 - (maximal pool size: 3273) redcost : 0.08 1616 0 276 0 0 impliedbounds : 0.02 7 0 0 46 0 intobj : 0.00 0 0 0 0 0 gomory : 4.62 7 0 0 0 0 strongcg : 2.23 7 0 0 3500 0 cmir : 0.11 7 0 0 0 0 flowcover : 0.11 7 0 0 0 0 clique : 0.17 7 0 0 54 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 : 397.85 1571 2 31 0 0 3082 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 oneopt : 0.00 0 0 crossover : 0.00 0 0 guideddiving : 0.00 0 0 intshifting : 0.00 0 0 veclendiving : 28.58 5 0 fracdiving : 17.40 6 0 pscostdiving : 16.37 6 0 objpscostdiving : 4.69 3 0 rootsoldiving : 10.20 3 0 feaspump : 11.66 3 0 coefdiving : 16.58 6 0 linesearchdiving : 11.43 6 0 simplerounding : 0.00 0 0 rounding : 0.29 525 0 shifting : 0.13 135 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 3.42 1 0 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 dins : 0.00 0 0 LP : Time Calls Iterations Iter/call Iter/sec primal LP : 0.12 0 0 0.00 0.00 dual LP : 861.41 2971 2370623 797.92 2752.03 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 115.96 1939 288399 148.74 2487.06 strong branching : 397.63 3857 912768 236.65 2295.52 (at root node) : - 37 8856 239.35 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 2959 nodes (total) : 2959 nodes left : 0 max depth : 37 max depth (total): 37 backtracks : 676 (22.8%) delayed cutoffs : 0 repropagations : 84 (106 domain reductions, 0 cutoffs) avg switch length: 3.30 switching time : 0.55 Solution : Solutions found : 1 (1 improvements) Primal Bound : +0.00000000000000e+00 (in run 1, after 2959 nodes, 1390.80 seconds, depth 31, found by ) Dual Bound : +0.00000000000000e+00 Gap : 0.00 % Root Dual Bound : +0.00000000000000e+00 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- acc-tight-6.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-6.gms Stop 10/01/08 10:35:25 elapsed 0:23:18.991