--- Job acc-tight-4 Start 10/01/08 10:04:34 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-4.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-4.gdx --- acc-tight-4.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.059 --- acc-tight-4.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-4.gms(124) 5 Mb --- 2,287 rows 1,621 columns 12,980 non-zeroes --- 1,620 discrete-columns --- acc-tight-4.gms(124) 5 Mb --- Executing SCIP: elapsed 0:00:00.152 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, 2259 upgd conss, 2592 impls, 414 clqs (0.1s) probing: 101/1620 (6.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings presolving (2 rounds): 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 2592 implications, 414 cliques presolved problem has 1620 variables (1620 bin, 0 int, 0 impl, 0 cont) and 2286 constraints 270 constraints of type 414 constraints of type 27 constraints of type 1575 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.10 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 1069 |6444k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 16712 | 16M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 17691 | 26M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 18706 | 35M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 20066 | 45M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 20969 | 55M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 21900 | 66M| 0 | 0.000000e+00 | -- | Inf 1 | 2 | 21900 | 66M| 0 | 0.000000e+00 | -- | Inf * 71 | 0 | 39823 | 66M| 70 | 0.000000e+00 | 0.000000e+00 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 94.83 Solving Nodes : 71 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 : 94.83 Original Problem : Problem name : gamsmodel Variables : 1620 (1620 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 2286 initial, 2286 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1620 (1620 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 2286 initial, 2286 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.02 0 0 0 0 0 0 0 0 knapsack : 0.02 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.04 0 0 0 0 0 0 0 0 logicor : 0.01 0 0 0 0 0 0 0 0 root node : - 0 - - 0 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 71 0 0 0 0 0 140 knapsack : 270 6 378 1 0 0 27 0 0 0 setppc : 414 6 378 1 0 0 755 0 0 0 linear : 27 6 378 1 0 0 32 0 0 0 logicor : 1575 6 301 1 0 0 430 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 62.34 0.00 0.00 62.34 0.00 knapsack : 0.01 0.01 0.00 0.00 0.00 setppc : 0.00 0.00 0.00 0.00 0.00 linear : 0.00 0.00 0.00 0.00 0.00 logicor : 0.00 0.00 0.00 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.01 178 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 0 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.04 5 - - 6 - (maximal pool size: 3009) redcost : 0.01 76 0 0 0 0 impliedbounds : 0.00 6 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 6.04 6 0 0 428 0 strongcg : 2.24 6 0 0 3000 0 cmir : 0.10 6 0 0 0 0 flowcover : 0.11 6 0 0 0 0 clique : 0.07 6 0 0 36 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 : 62.34 70 0 0 0 0 140 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 coefdiving : 0.00 0 0 pscostdiving : 0.00 0 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 intshifting : 0.00 0 0 crossover : 0.00 0 0 feaspump : 4.74 1 0 simplerounding : 0.00 0 0 rounding : 0.07 76 0 shifting : 0.03 13 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 7.96 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.16 0 0 0.00 0.00 dual LP : 10.55 77 25489 331.03 2416.02 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 4.74 3 14334 4778.00 3024.05 strong branching : 62.32 549 127035 231.39 2038.43 (at root node) : - 18 4272 237.33 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 71 nodes (total) : 71 nodes left : 0 max depth : 70 max depth (total): 70 backtracks : 0 (0.0%) delayed cutoffs : 0 repropagations : 0 (0 domain reductions, 0 cutoffs) avg switch length: 2.00 switching time : 0.17 Solution : Solutions found : 1 (1 improvements) Primal Bound : +0.00000000000000e+00 (in run 1, after 71 nodes, 94.83 seconds, depth 70, 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-4.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job acc-tight-4.gms Stop 10/01/08 10:06:09 elapsed 0:01:35.428