--- Job acc-tight-2 Start 10/01/08 09:51:48 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-2.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/acc-tight-2.gdx --- acc-tight-2.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.072 --- acc-tight-2.gms(123) 4 Mb --- Generating MIP model m --- acc-tight-2.gms(124) 5 Mb --- 3,286 rows 1,621 columns 17,075 non-zeroes --- 1,620 discrete-columns --- acc-tight-2.gms(124) 5 Mb --- Executing SCIP: elapsed 0:00:00.181 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, 3249 upgd conss, 5346 impls, 423 clqs (0.5s) probing: 1000/1620 (61.7%) - 0 fixings, 45 aggregations, 24721 implications, 0 bound changes (round 2) 50 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3249 upgd conss, 107456 impls, 418 clqs (round 3) 50 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3249 upgd conss, 107456 impls, 418 clqs presolving (4 rounds): 50 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 107456 implications, 418 cliques presolved problem has 1570 variables (1570 bin, 0 int, 0 impl, 0 cont) and 3280 constraints 396 constraints of type 418 constraints of type 36 constraints of type 2430 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.79 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 2298 | 10M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 29706 | 21M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 33801 | 31M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 38479 | 42M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 42493 | 53M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 46786 | 63M| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 50563 | 74M| 0 | 0.000000e+00 | -- | Inf 1 | 2 | 50563 | 74M| 0 | 0.000000e+00 | -- | Inf 100 | 95 |368332 | 74M| 30 | 0.000000e+00 | -- | Inf 200 | 117 |566503 | 74M| 31 | 0.000000e+00 | -- | Inf * 275 | 0 |683672 | 74M| 33 | 0.000000e+00 | 0.000000e+00 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 643.73 Solving Nodes : 275 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 : 643.73 Original Problem : Problem name : gamsmodel Variables : 1620 (1620 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 3285 initial, 3285 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 1570 (1570 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 3280 initial, 3298 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.60 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 5 0 0 linear : 0.07 0 0 0 0 0 0 0 0 logicor : 0.03 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 197 0 0 0 0 0 392 knapsack : 396 6 7940 1 0 0 13 0 0 0 setppc : 418 6 7940 1 0 2 1746 0 0 0 linear : 36 6 7938 1 0 0 138 0 0 0 logicor : 2430+ 6 4938 1 0 3 4949 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 246.48 0.00 0.00 246.48 0.00 knapsack : 0.07 0.00 0.07 0.00 0.00 setppc : 0.11 0.00 0.11 0.00 0.00 linear : 0.02 0.00 0.02 0.00 0.00 logicor : 0.08 0.01 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 0 0 0 pseudoobj : 0.00 2818 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.00 5 5 19 20.8 3 4.3 - infeasible LP : 0.01 88 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 : - - - 18 17.5 - - - applied locally : - - - 0 0.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.07 5 - - 0 - (maximal pool size: 2951) redcost : 0.03 202 0 0 0 0 impliedbounds : 0.00 6 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 7.98 6 0 0 0 0 strongcg : 2.42 6 0 0 3000 0 cmir : 0.15 6 0 0 0 0 flowcover : 0.13 6 0 0 0 0 clique : 0.21 6 0 0 51 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 : 246.48 196 0 0 0 0 392 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 fracdiving : 5.70 1 0 veclendiving : 8.71 1 0 linesearchdiving : 4.53 1 0 rootsoldiving : 10.44 1 0 objpscostdiving : 14.68 1 0 coefdiving : 19.41 2 0 feaspump : 12.90 1 0 pscostdiving : 17.07 2 0 simplerounding : 0.00 0 0 rounding : 0.14 148 0 shifting : 0.07 23 0 fixandinfer : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 octane : 0.00 0 0 rens : 16.32 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.27 0 0 0.00 0.00 dual LP : 274.86 279 493399 1768.46 1795.09 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 92.24 1708 190273 111.40 2062.80 strong branching : 246.42 1328 365844 275.48 1484.64 (at root node) : - 18 5004 278.00 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 275 nodes (total) : 275 nodes left : 0 max depth : 33 max depth (total): 33 backtracks : 46 (16.7%) delayed cutoffs : 0 repropagations : 3 (22 domain reductions, 0 cutoffs) avg switch length: 3.40 switching time : 0.28 Solution : Solutions found : 1 (1 improvements) Primal Bound : +0.00000000000000e+00 (in run 1, after 275 nodes, 643.73 seconds, depth 32, 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-2.gms(124) 0 Mb --- Reading solution for model m --- acc-tight-2.gms(124) 3 Mb *** Status: Normal completion --- Job acc-tight-2.gms Stop 10/01/08 10:02:35 elapsed 0:10:47.021