--- Job neos1 Start 10/03/08 02:34:24 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 --- neos1.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/neos1.gdx --- neos1.gms(148) 4 Mb --- Starting execution: elapsed 0:00:00.068 --- neos1.gms(123) 4 Mb --- Generating MIP model m --- neos1.gms(124) 6 Mb --- 5,021 rows 2,113 columns 21,601 non-zeroes --- 2,112 discrete-columns --- neos1.gms(124) 6 Mb --- Executing SCIP: elapsed 0:00:00.147 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) 384 del vars, 3840 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 432 impls, 90 clqs (round 2) 384 del vars, 4002 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 918 upgd conss, 432 impls, 90 clqs (round 3) 384 del vars, 4002 del conss, 0 chg bounds, 1728 chg sides, 3744 chg coeffs, 918 upgd conss, 18432 impls, 378 clqs (round 4) 384 del vars, 4578 del conss, 0 chg bounds, 1728 chg sides, 3744 chg coeffs, 918 upgd conss, 18432 impls, 378 clqs (0.1s) probing: 101/1728 (5.8%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (0.1s) probing aborted: 100/100 successive totally useless probings presolving (5 rounds): 384 deleted vars, 4578 deleted constraints, 0 tightened bounds, 0 added holes, 1728 changed sides, 3744 changed coefficients 18432 implications, 378 cliques presolved problem has 1728 variables (1728 bin, 0 int, 0 impl, 0 cont) and 2170 constraints 36 constraints of type 1818 constraints of type 100 constraints of type 216 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.11 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 721 |7137k| 0 | 1.300000e+01 | -- | Inf F 1 | 0 | 1346 |7336k| 0 | 1.300000e+01 | 2.100000e+01 | 61.54% 1 | 0 | 1483 |8088k| 0 | 1.300000e+01 | 2.100000e+01 | 61.54% 1 | 0 | 1757 |8749k| 0 | 1.300000e+01 | 2.100000e+01 | 61.54% 1 | 0 | 2541 | 11M| 0 | 1.300000e+01 | 2.100000e+01 | 61.54% 1 | 0 | 3363 | 13M| 0 | 1.300000e+01 | 2.100000e+01 | 61.54% 1 | 0 | 3874 | 16M| 0 | 1.300000e+01 | 2.100000e+01 | 61.54% 1 | 0 | 4998 | 16M| 0 | 1.350000e+01 | 2.100000e+01 | 55.56% 1 | 0 | 5844 | 18M| 0 | 1.381408e+01 | 2.100000e+01 | 52.02% 1 | 0 | 6520 | 23M| 0 | 1.458333e+01 | 2.100000e+01 | 44.00% 1 | 0 | 7355 | 24M| 0 | 1.508333e+01 | 2.100000e+01 | 39.23% 1 | 0 | 8445 | 27M| 0 | 1.551408e+01 | 2.100000e+01 | 35.36% 1 | 0 | 10219 | 34M| 0 | 1.600000e+01 | 2.100000e+01 | 31.25% 1 | 0 | 12107 | 39M| 0 | 1.633333e+01 | 2.100000e+01 | 28.57% 1 | 0 | 13809 | 46M| 0 | 1.700000e+01 | 2.100000e+01 | 23.53% node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 15403 | 56M| 0 | 1.700000e+01 | 2.100000e+01 | 23.53% 1 | 0 | 16753 | 56M| 0 | 1.700000e+01 | 2.100000e+01 | 23.53% 1 | 0 | 18222 | 56M| 0 | 1.700000e+01 | 2.100000e+01 | 23.53% 1 | 0 | 19530 | 65M| 0 | 1.700000e+01 | 2.100000e+01 | 23.53% 1 | 0 | 20910 | 73M| 0 | 1.766667e+01 | 2.100000e+01 | 18.87% 1 | 0 | 21433 | 79M| 0 | 1.800000e+01 | 2.100000e+01 | 16.67% 1 | 0 | 21917 | 84M| 0 | 1.800000e+01 | 2.100000e+01 | 16.67% 1 | 0 | 22417 | 84M| 0 | 1.800000e+01 | 2.100000e+01 | 16.67% 1 | 0 | 22890 | 87M| 0 | 1.800000e+01 | 2.100000e+01 | 16.67% 1 | 0 | 23489 | 88M| 0 | 1.800000e+01 | 2.100000e+01 | 16.67% E 1 | 0 | 23489 | 88M| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% 1 | 0 | 23489 | 88M| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% 1 | 0 | 23489 | 88M| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% 1 | 2 | 23489 | 88M| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% (run 1, node 1) restarting after 575 global fixings of integer variables (restart) converted 112 cuts from the global cut pool into linear constraints presolving: (round 1) 575 del vars, 57 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 18686 impls, 258 clqs (round 2) 575 del vars, 57 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 126 upgd conss, 18686 impls, 258 clqs (round 3) 575 del vars, 372 del conss, 0 chg bounds, 5 chg sides, 12 chg coeffs, 126 upgd conss, 18686 impls, 258 clqs presolving (4 rounds): 575 deleted vars, 372 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 12 changed coefficients 18686 implications, 258 cliques presolved problem has 1153 variables (1153 bin, 0 int, 0 impl, 0 cont) and 1267 constraints 39 constraints of type 970 constraints of type 83 constraints of type 175 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.16 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 24548 |7313k| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% 1 | 0 | 24654 |9094k| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% 1 | 0 | 24654 |9091k| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% (run 2, node 1) restarting after 359 global fixings of integer variables (restart) converted 11 cuts from the global cut pool into linear constraints presolving: (round 1) 379 del vars, 94 del conss, 0 chg bounds, 12 chg sides, 659 chg coeffs, 0 upgd conss, 18728 impls, 174 clqs (round 2) 379 del vars, 99 del conss, 0 chg bounds, 12 chg sides, 660 chg coeffs, 18 upgd conss, 18728 impls, 174 clqs (round 3) 379 del vars, 100 del conss, 0 chg bounds, 16 chg sides, 677 chg coeffs, 18 upgd conss, 18728 impls, 174 clqs (round 4) 379 del vars, 131 del conss, 0 chg bounds, 17 chg sides, 677 chg coeffs, 18 upgd conss, 18728 impls, 174 clqs presolving (5 rounds): 379 deleted vars, 131 deleted constraints, 0 tightened bounds, 0 added holes, 17 changed sides, 677 changed coefficients 18728 implications, 174 cliques presolved problem has 774 variables (774 bin, 0 int, 0 impl, 0 cont) and 865 constraints 37 constraints of type 648 constraints of type 69 constraints of type 111 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.21 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 25446 |6890k| 0 | 1.800000e+01 | 1.900000e+01 | 5.56% 1 | 0 | 25682 |8332k| 0 | 1.900000e+01 | 1.900000e+01 | 0.00% 1 | 0 | 25682 |8332k| 0 | 1.900000e+01 | 1.900000e+01 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 23.35 Solving Nodes : 1 (total of 3 nodes in 3 runs) Primal Bound : +1.90000000000000e+01 (2 solutions) Dual Bound : +1.90000000000000e+01 Gap : 0.00 % SCIP Status : problem is solved [optimal solution found] Solving Time : 23.35 Original Problem : Problem name : gamsmodel Variables : 2112 (2112 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 5020 initial, 5020 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 774 (774 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 865 initial, 865 maximal Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs trivial : 0.00 934 0 0 0 0 0 0 0 dualfix : 0.00 384 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.03 0 0 0 0 0 0 0 0 knapsack : 0.09 0 0 0 0 0 591 1747 4433 setppc : 0.02 19 1 0 0 0 372 1 0 linear : 0.04 0 0 0 0 0 4005 2 0 logicor : 0.02 0 0 0 0 0 113 0 0 root node : - 961 - - 961 - - - - Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children integral : 0 0 0 2 0 0 5 0 0 2 knapsack : 37 27 210 0 0 0 0 0 0 0 setppc : 648 27 210 0 0 0 226 0 0 0 linear : 69 27 210 0 0 0 42 0 0 0 logicor : 111 27 203 0 0 0 0 0 0 0 countsols : 0 0 0 0 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 2.02 0.00 0.00 2.02 0.00 knapsack : 0.01 0.01 0.00 0.00 0.00 setppc : 0.02 0.00 0.02 0.00 0.00 linear : 0.08 0.06 0.02 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.00 24 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.00 0 - - 0 - (maximal pool size: 215) redcost : 0.01 27 0 688 0 0 impliedbounds : 0.00 27 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 4.40 27 0 0 8177 0 strongcg : 3.67 22 0 0 7734 0 cmir : 0.23 12 0 0 0 0 flowcover : 0.34 12 0 0 0 0 clique : 0.13 27 0 0 145 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 : 2.02 2 0 5 0 0 2 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 simplerounding : 0.00 0 0 rounding : 0.00 27 0 shifting : 0.04 27 0 intshifting : 0.00 0 0 oneopt : 0.00 1 0 fixandinfer : 0.00 0 0 feaspump : 0.13 1 1 coefdiving : 0.00 0 0 pscostdiving : 0.00 0 0 fracdiving : 0.00 0 0 veclendiving : 0.00 0 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.00 0 0 rootsoldiving : 0.00 0 0 linesearchdiving : 0.00 0 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.04 1 1 rins : 0.00 0 0 localbranching : 0.00 0 0 mutation : 0.00 0 0 crossover : 0.00 0 0 dins : 0.00 0 0 LP : Time Calls Iterations Iter/call Iter/sec primal LP : 0.21 0 0 0.00 0.00 dual LP : 11.11 28 25057 894.89 2255.36 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.12 15 625 41.67 5208.33 strong branching : 2.02 46 5899 128.24 2920.30 (at root node) : - 46 5899 128.24 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 3 nodes : 1 nodes (total) : 3 nodes left : 0 max depth : 0 max depth (total): 0 backtracks : 0 (0.0%) delayed cutoffs : 0 repropagations : 0 (0 domain reductions, 0 cutoffs) avg switch length: 2.00 switching time : 0.00 Solution : Solutions found : 2 (2 improvements) Primal Bound : +1.90000000000000e+01 (in run 1, after 1 nodes, 20.47 seconds, depth 0, found by ) Dual Bound : +1.90000000000000e+01 Gap : 0.00 % Root Dual Bound : +1.90000000000000e+01 Solving LP with fixed discrete variables... GAMS/SCIP finished. --- Restarting execution --- neos1.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job neos1.gms Stop 10/03/08 02:34:48 elapsed 0:00:23.918