--- Job acc-tight-5 Start 10/01/08 10:06:09 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-5.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-5.gdx --- acc-tight-5.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.048 --- acc-tight-5.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-5.gms(124) 5 Mb --- 3,250 rows 1,621 columns 16,787 non-zeroes --- 1,620 discrete-columns --- acc-tight-5.gms(124) 5 Mb --- Executing SCIP: elapsed 0:00:00.128 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) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3222 upgd conss, 5346 impls, 414 clqs (0.5s) probing: 1000/1620 (61.7%) - 0 fixings, 0 aggregations, 24410 implications, 0 bound changes (round 2) 50 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3222 upgd conss, 108610 impls, 411 clqs (round 3) 50 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3222 upgd conss, 108610 impls, 411 clqs presolving (4 rounds): 50 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 108610 implications, 411 cliques presolved problem has 1570 variables (1570 bin, 0 int, 0 impl, 0 cont) and 3246 constraints 387 constraints of type 411 constraints of type 27 constraints of type 2421 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.83 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2177 | 10M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 26841 | 20M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 30940 | 31M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 34498 | 42M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 38383 | 52M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 41252 | 63M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 43737 | 74M| 0 | 0.000000e+00 | -- | Inf 1 | 2 | 43737 | 74M| 0 | 0.000000e+00 | -- | Inf v 28 | 29 |179512 | 74M| 10 | 0.000000e+00 | 1.000000e+00 | Inf v 65 | 0 |404626 | 74M| 13 | 0.000000e+00 | 0.000000e+00 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 354.89 Solving Nodes : 65 Primal Bound : +0.00000000000000e+00 (2 solutions) Dual Bound : +0.00000000000000e+00 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 354.89 Original Problem : Problem name : gamsmodel Variables : 1620 (1620 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 3249 initial, 3249 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1570 (1570 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 3246 initial, 3246 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 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 0 0 0 0 0 0 0 probing : 0.65 0 50 0 0 0 0 0 0 knapsack : 0.08 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 3 0 0 linear : 0.06 0 0 0 0 0 0 0 0 logicor : 0.03 0 0 0 0 0 0 0 0 root node : - 1 - - 1 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 64 0 0 0 0 0 128 knapsack : 387 6 9583 0 0 0 0 0 0 0 setppc : 411 6 9583 0 0 0 327 0 0 0 linear : 27 6 9583 0 0 0 0 0 0 0 logicor : 2421 6 5287 0 0 0 859 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 127.28 0.00 0.00 127.28 0.00 knapsack : 0.08 0.00 0.08 0.00 0.00 setppc : 0.10 0.00 0.10 0.00 0.00 linear : 0.07 0.00 0.07 0.00 0.00 logicor : 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.02 1 0 1 pseudoobj : 0.00 4133 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 0 0 0 0.0 0 0.0 - infeasible LP : 0.00 17 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 : - - - 0 0.0 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.06 5 - - 0 - (maximal pool size: 2966) redcost : 0.00 69 0 0 0 0 impliedbounds : 0.01 6 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 7.70 6 0 0 0 0 strongcg : 2.32 6 0 0 3000 0 cmir : 0.14 6 0 0 0 0 flowcover : 0.13 6 0 0 0 0 clique : 0.17 6 0 0 48 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 : 127.28 64 0 0 0 0 128 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 - 0 pseudo solutions : 0.00 - 0 crossover : 0.00 0 0 oneopt : 0.00 1 0 objpscostdiving : 11.21 1 0 simplerounding : 0.00 0 0 rounding : 0.09 70 0 shifting : 0.04 13 0 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 11.18 1 0 coefdiving : 17.54 2 0 pscostdiving : 13.68 2 0 fracdiving : 16.36 2 0 veclendiving : 23.82 2 2 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 rootsoldiving : 14.94 1 0 linesearchdiving : 15.14 2 0 guideddiving : 15.99 3 0 octane : 0.00 0 0 rens : 0.01 0 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.28 0 0 0.00 0.00 dual LP : 75.75 71 121865 1716.41 1608.78 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 138.35 3063 282761 92.32 2043.81 strong branching : 127.22 641 176713 275.68 1389.03 (at root node) : - 19 5206 274.00 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 65 nodes (total) : 65 nodes left : 0 max depth : 13 max depth (total): 13 backtracks : 21 (32.3%) delayed cutoffs : 0 repropagations : 1 (0 domain reductions, 0 cutoffs) avg switch length: 4.37 switching time : 0.30 Solution : Solutions found : 2 (2 improvements) Primal Bound : +0.00000000000000e+00 (in run 1, after 65 nodes, 354.88 seconds, depth 24, 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-5.gms(124) 0 Mb --- Reading solution for model m --- acc-tight-5.gms(124) 3 Mb *** Status: Normal completion --- Job acc-tight-5.gms Stop 10/01/08 10:12:06 elapsed 0:05:56.928