--- Job enigma Start 10/01/08 16:24:10 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 --- enigma.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/enigma.gdx --- enigma.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.006 --- enigma.gms(123) 4 Mb --- Generating MIP model m --- enigma.gms(124) 4 Mb --- 22 rows 101 columns 299 non-zeroes --- 100 discrete-columns --- Executing SCIP: elapsed 0:00:00.010 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, 20 upgd conss, 0 impls, 20 clqs presolving (2 rounds): 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 56 implications, 20 cliques presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 21 constraints 20 constraints of type 1 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 0.01 node | left |LP iter| mem |mdpt | dualbound | primalbound | gap 1 | 0 | 55 | 278k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 220 | 284k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 241 | 296k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 251 | 302k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 300 | 310k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 359 | 324k| 0 | 0.000000e+00 | -- | Inf 1 | 0 | 397 | 335k| 0 | 0.000000e+00 | -- | Inf 1 | 2 | 397 | 335k| 0 | 0.000000e+00 | -- | Inf 100 | 9 | 1298 | 362k| 16 | 0.000000e+00 | -- | Inf 200 | 20 | 1809 | 393k| 19 | 0.000000e+00 | -- | Inf 300 | 19 | 2392 | 411k| 20 | 0.000000e+00 | -- | Inf 400 | 27 | 2947 | 439k| 20 | 0.000000e+00 | -- | Inf 500 | 28 | 3362 | 465k| 21 | 0.000000e+00 | -- | Inf 600 | 34 | 3784 | 495k| 22 | 0.000000e+00 | -- | Inf * 643 | 0 | 3981 | 471k| 22 | 0.000000e+00 | 0.000000e+00 | 0.00% SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.74 Solving Nodes : 643 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 : 0.74 Original Problem : Problem name : gamsmodel Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 21 initial, 21 maximal Presolved Problem : Problem name : t_gamsmodel Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous) Constraints : 21 initial, 372 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.01 0 0 0 0 0 0 0 0 setppc : 0.00 0 0 0 0 0 0 0 0 linear : 0.00 0 0 0 0 0 0 0 0 logicor : 0.00 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 543 0 45 245 0 0 698 setppc : 20 6 1862 1 0 51 4458 0 0 0 linear : 1 6 1811 1 0 210 1177 0 0 0 logicor : 0+ 0 593 0 0 16 117 0 0 0 countsols : 0 0 0 1 0 0 0 0 0 0 Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS integral : 0.31 0.00 0.00 0.31 0.00 setppc : 0.04 0.00 0.04 0.00 0.00 linear : 0.03 0.00 0.03 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 1652 0 0 Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters propagation : 0.03 277 211 1177 35.4 0 0.0 - infeasible LP : 0.00 76 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 : - - - 351 16.2 - - - applied locally : - - - 1 61.0 - - - Separators : Time Calls Cutoffs DomReds Cuts Conss cut pool : 0.00 5 - - 17 - (maximal pool size: 39) redcost : 0.00 542 0 1 0 0 impliedbounds : 0.00 6 0 0 0 0 intobj : 0.00 0 0 0 0 0 gomory : 0.00 6 0 0 0 0 strongcg : 0.00 6 0 0 0 0 cmir : 0.01 6 0 0 21 0 flowcover : 0.06 6 0 0 21 0 clique : 0.00 6 0 0 2 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 : 0.31 542 45 245 0 0 698 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 pscostdiving : 0.00 7 0 fracdiving : 0.00 7 0 veclendiving : 0.01 7 0 simplerounding : 0.00 0 0 rounding : 0.02 286 0 shifting : 0.00 60 0 intshifting : 0.00 0 0 fixandinfer : 0.00 0 0 feaspump : 0.02 7 0 coefdiving : 0.00 7 0 intdiving : 0.00 0 0 actconsdiving : 0.00 0 0 objpscostdiving : 0.01 3 0 rootsoldiving : 0.00 3 0 linesearchdiving : 0.01 7 0 guideddiving : 0.00 0 0 octane : 0.00 0 0 rens : 0.02 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.00 0 0 0.00 - dual LP : 0.17 606 3603 5.95 21194.12 barrier LP : 0.00 0 0 0.00 - diving/probing LP: 0.04 99 378 3.82 9450.00 strong branching : 0.31 975 14329 14.70 46222.58 (at root node) : - 25 2248 89.92 - conflict analysis: 0.00 0 0 0.00 - B&B Tree : number of runs : 1 nodes : 643 nodes (total) : 643 nodes left : 0 max depth : 22 max depth (total): 22 backtracks : 99 (15.4%) delayed cutoffs : 18 repropagations : 201 (341 domain reductions, 18 cutoffs) avg switch length: 3.01 switching time : 0.01 Solution : Solutions found : 1 (1 improvements) Primal Bound : +0.00000000000000e+00 (in run 1, after 643 nodes, 0.74 seconds, depth 16, 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 --- enigma.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job enigma.gms Stop 10/01/08 16:24:11 elapsed 0:00:00.824