0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3693545-1338038975.opb>
0.00/0.01 c original problem has 331 variables (331 bin, 0 int, 0 impl, 0 cont) and 2032 constraints
0.00/0.01 c problem read in 0.01
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 164 del vars, 296 del conss, 0 add conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5530 impls, 0 clqs
0.00/0.02 c (round 2) 196 del vars, 479 del conss, 0 add conss, 38 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 5601 impls, 0 clqs
0.00/0.03 c (round 3) 272 del vars, 1823 del conss, 0 add conss, 84 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 5640 impls, 0 clqs
0.00/0.03 c (round 4) 295 del vars, 1940 del conss, 0 add conss, 89 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 5640 impls, 0 clqs
0.00/0.03 c (round 5) 301 del vars, 1952 del conss, 0 add conss, 90 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 5643 impls, 0 clqs
0.00/0.03 c (round 6) 304 del vars, 1956 del conss, 0 add conss, 90 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 5643 impls, 0 clqs
0.00/0.03 c (round 7) 306 del vars, 2005 del conss, 0 add conss, 90 chg bounds, 8 chg sides, 1 chg coeffs, 0 upgd conss, 5643 impls, 0 clqs
0.00/0.03 c (round 8) 315 del vars, 2012 del conss, 0 add conss, 90 chg bounds, 8 chg sides, 1 chg coeffs, 0 upgd conss, 5643 impls, 0 clqs
0.00/0.03 c (round 9) 317 del vars, 2013 del conss, 0 add conss, 93 chg bounds, 8 chg sides, 2 chg coeffs, 0 upgd conss, 5648 impls, 0 clqs
0.00/0.03 c (round 10) 321 del vars, 2019 del conss, 0 add conss, 93 chg bounds, 8 chg sides, 2 chg coeffs, 0 upgd conss, 5648 impls, 0 clqs
0.00/0.03 c (round 11) 323 del vars, 2021 del conss, 0 add conss, 93 chg bounds, 8 chg sides, 2 chg coeffs, 0 upgd conss, 5648 impls, 0 clqs
0.00/0.03 c (round 12) 323 del vars, 2021 del conss, 0 add conss, 93 chg bounds, 8 chg sides, 2 chg coeffs, 11 upgd conss, 5648 impls, 0 clqs
0.00/0.03 c (0.0s) probing cycle finished: starting next cycle
0.00/0.03 c (round 13) 325 del vars, 2027 del conss, 2 add conss, 93 chg bounds, 8 chg sides, 2 chg coeffs, 11 upgd conss, 5652 impls, 0 clqs
0.00/0.03 c (round 14) 325 del vars, 2030 del conss, 3 add conss, 93 chg bounds, 8 chg sides, 2 chg coeffs, 15 upgd conss, 5652 impls, 0 clqs
0.00/0.03 c presolving (15 rounds):
0.00/0.03 c 331 deleted vars, 2035 deleted constraints, 3 added constraints, 93 tightened bounds, 0 added holes, 8 changed sides, 2 changed coefficients
0.00/0.03 c 5652 implications, 0 cliques
0.00/0.03 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.03
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.1.1.4
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1797
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 o 126
0.00/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c t 0.0s| 1 | 0 | 0 | - |1358k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | -- | 1.260000e+02 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 0 | - |1358k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1.260000e+02 | 1.260000e+02 | 0.00%
0.00/0.03 c
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time (sec) : 0.04
0.00/0.03 c Solving Nodes : 1
0.00/0.03 c Primal Bound : +1.26000000000000e+02 (1 solutions)
0.00/0.03 c Dual Bound : +1.26000000000000e+02
0.00/0.03 c Gap : 0.00 %
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v x175 x174 x173 x172 x171 x170 x169 x168 x167 x166 -x154 -x165 -x152 -x151 -x147 -x164 -x142 -x163 -x141 -x153 -x162 -x161 -x160
0.00/0.04 v -x148 -x145 -x159 -x158 -x157 -x140 -x156 -x146 -x138 -x150 -x149 -x144 -x143 -x155 -x139 -x137 -x136 x135 x134 x133 x132 x131
0.00/0.04 v x130 x129 x128 x127 x126 x125 x124 x123 x122 x121 x120 x119 x118 x117 x116 x115 x114 x113 x112 x111 x110 x109 x108 -x107 x106
0.00/0.04 v x105 x104 x103 x102 x101 x100 x99 x98 x97 x96 x95 x94 x93 x92 x91 x90 x89 x88 x87 x86 x85 x84 x83 x82 x81 x80 x79 x78 x77
0.00/0.04 v x76 x75 x74 x73 x72 x71 x70 x69 -x68 x67 x66 x65 x64 -x63 x62 x61 x60 x59 x58 x57 x56 x55 x54 x53 x52 x51 x50 x49 x48 x47 x46
0.00/0.04 v x45 x44 x43 x42 x41 x40 x39 x38 x37 x36 x35 x34 x33 x32 x31 x30 x29 x28 x27 x26 x25 x24 x23 x22 x21 x20 x19 x18 x17 x16 x15
0.00/0.04 v x14 x13 x12 x11 x10 x9 x8 x7 x6 x5 x4 x3 x2 x1 x331 x330 x329 x328 x327 x326 x325 x324 x323 x322 x321 x320 x319 x318 x317 x316
0.00/0.04 v x315 x314 x313 x312 x311 x310 x309 -x308 x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294
0.00/0.04 v -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 x277 x276 x275 x274 x273 x272
0.00/0.04 v x271 x270 x269 x268 x267 x266 x265 x264 x263 x262 x261 x260 x259 x258 x257 x256 x255 x254 x253 x252 x251 x250 x249 x248 x247
0.00/0.04 v x246 x245 x244 x243 x242 x241 x240 x239 x238 x237 x236 x235 x234 x233 x232 x231 x230 x229 x228 x227 x226 x225 x224 x223 x222
0.00/0.04 v x221 x220 x219 x218 x217 x216 x215 x214 x213 x212 x211 x210 x209 x208 x207 x206 x205 x204 x203 x202 x201 x200 x199 x198 x197
0.00/0.04 v x196 x195 x194 x193 x192 x191 x190 x189 x188 x187 x186 x185 x184 x183 x182 x181 x180 x179 x178 x177 x176
0.00/0.04 c SCIP Status : problem is solved [optimal solution found]
0.00/0.04 c Total Time : 0.04
0.00/0.04 c solving : 0.04
0.00/0.04 c presolving : 0.03 (included in solving)
0.00/0.04 c reading : 0.01 (included in solving)
0.00/0.04 c copying : 0.00 (0 times copied the problem)
0.00/0.04 c Original Problem :
0.00/0.04 c Problem name : HOME/instance-3693545-1338038975.opb
0.00/0.04 c Variables : 331 (331 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 2032 initial, 2032 maximal
0.00/0.04 c Objective sense : minimize
0.00/0.04 c Presolved Problem :
0.00/0.04 c Problem name : t_HOME/instance-3693545-1338038975.opb
0.00/0.04 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.04 c Constraints : 0 initial, 0 maximal
0.00/0.04 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.04 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c trivial : 0.00 0.00 24 0 0 0 0 0 0 0 0
0.00/0.04 c dualfix : 0.00 0.00 58 0 0 0 0 0 0 0 0
0.00/0.04 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c gateextraction : 0.00 0.00 0 0 0 0 0 6 2 0 0
0.00/0.04 c implics : 0.00 0.00 0 21 0 0 0 0 0 0 0
0.00/0.04 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.04 c probing : 0.00 0.00 2 0 0 0 0 0 0 0 0
0.00/0.04 c setppc : 0.00 0.00 0 0 0 0 0 5 0 0 0
0.00/0.04 c and : 0.00 0.00 0 0 0 0 0 1 1 0 0
0.00/0.04 c linear : 0.01 0.00 69 157 0 93 0 2021 0 8 2
0.00/0.04 c logicor : 0.00 0.00 0 0 0 0 0 2 0 0 0
0.00/0.04 c root node : - - 0 - - 0 - - - - -
0.00/0.04 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.04 c integral : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.04 c countsols : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.04 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.04 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.04 c pseudoobj : 0 0 0 0
0.00/0.04 c rootredcost : 0 0 0 0
0.00/0.04 c vbounds : 0 0 0 0
0.00/0.04 c redcost : 0 0 0 0
0.00/0.04 c probing : 0 0 0 0
0.00/0.04 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.04 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c probing : 0.00 0.00 0.00 0.00 0.00
0.00/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.04 c propagation : 0.00 2 0 0 0.0 0 0.0 -
0.00/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.04 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.04 c applied globally : - - - 0 0.0 - - -
0.00/0.04 c applied locally : - - - 0 0.0 - - -
0.00/0.04 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.04 c clique : 0.00 0.00 0 0 0 0 0
0.00/0.04 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.04 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.04 c cmir : 0.00 0.00 0 0 0 0 0
0.00/0.04 c flowcover : 0.00 0.00 0 0 0 0 0
0.00/0.04 c gomory : 0.00 0.00 0 0 0 0 0
0.00/0.04 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.00/0.04 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.04 c mcf : 0.00 0.00 0 0 0 0 0
0.00/0.04 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.04 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.04 c strongcg : 0.00 0.00 0 0 0 0 0
0.00/0.04 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.04 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.04 c problem variables: 0.00 - 0 0
0.00/0.04 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.04 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.04 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.04 c LP solutions : 0.00 - - 0
0.00/0.04 c pseudo solutions : 0.00 - - 0
0.00/0.04 c smallcard : 0.00 0.00 0 0
0.00/0.04 c trivial : 0.00 0.00 2 1
0.00/0.04 c shiftandpropagate: 0.00 0.00 0 0
0.00/0.04 c simplerounding : 0.00 0.00 0 0
0.00/0.04 c zirounding : 0.00 0.00 0 0
0.00/0.04 c rounding : 0.00 0.00 0 0
0.00/0.04 c shifting : 0.00 0.00 0 0
0.00/0.04 c intshifting : 0.00 0.00 0 0
0.00/0.04 c oneopt : 0.00 0.00 0 0
0.00/0.04 c twoopt : 0.00 0.00 0 0
0.00/0.04 c indtwoopt : 0.00 0.00 0 0
0.00/0.04 c indoneopt : 0.00 0.00 0 0
0.00/0.04 c fixandinfer : 0.00 0.00 0 0
0.00/0.04 c feaspump : 0.00 0.00 0 0
0.00/0.04 c clique : 0.00 0.00 0 0
0.00/0.04 c indrounding : 0.00 0.00 0 0
0.00/0.04 c indcoefdiving : 0.00 0.00 0 0
0.00/0.04 c coefdiving : 0.00 0.00 0 0
0.00/0.04 c pscostdiving : 0.00 0.00 0 0
0.00/0.04 c nlpdiving : 0.00 0.00 0 0
0.00/0.04 c fracdiving : 0.00 0.00 0 0
0.00/0.04 c veclendiving : 0.00 0.00 0 0
0.00/0.04 c intdiving : 0.00 0.00 0 0
0.00/0.04 c actconsdiving : 0.00 0.00 0 0
0.00/0.04 c objpscostdiving : 0.00 0.00 0 0
0.00/0.04 c rootsoldiving : 0.00 0.00 0 0
0.00/0.04 c linesearchdiving : 0.00 0.00 0 0
0.00/0.04 c guideddiving : 0.00 0.00 0 0
0.00/0.04 c octane : 0.00 0.00 0 0
0.00/0.04 c rens : 0.00 0.00 0 0
0.00/0.04 c rins : 0.00 0.00 0 0
0.00/0.04 c localbranching : 0.00 0.00 0 0
0.00/0.04 c mutation : 0.00 0.00 0 0
0.00/0.04 c crossover : 0.00 0.00 0 0
0.00/0.04 c dins : 0.00 0.00 0 0
0.00/0.04 c vbounds : 0.00 0.00 0 0
0.00/0.04 c undercover : 0.00 0.00 0 0
0.00/0.04 c subnlp : 0.00 0.00 0 0
0.00/0.04 c trysol : 0.00 0.00 0 0
0.00/0.04 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.04 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c dual LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.04 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.04 c strong branching : 0.00 0 0 0.00 -
0.00/0.04 c (at root node) : - 0 0 0.00 -
0.00/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.04 c B&B Tree :
0.00/0.04 c number of runs : 1
0.00/0.04 c nodes : 1
0.00/0.04 c nodes (total) : 1
0.00/0.04 c nodes left : 0
0.00/0.04 c max depth : 0
0.00/0.04 c max depth (total): 0
0.00/0.04 c backtracks : 0 (0.0%)
0.00/0.04 c delayed cutoffs : 0
0.00/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.04 c avg switch length: 2.00
0.00/0.04 c switching time : 0.00
0.00/0.04 c Solution :
0.00/0.04 c Solutions found : 1 (1 improvements)
0.00/0.04 c First Solution : +1.26000000000000e+02 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <trivial>)
0.00/0.04 c Primal Bound : +1.26000000000000e+02 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <trivial>)
0.00/0.04 c Dual Bound : +1.26000000000000e+02
0.00/0.04 c Gap : 0.00 %
0.00/0.04 c Root Dual Bound : +1.26000000000000e+02
0.00/0.04 c Root Iterations : 0
0.00/0.04 c Time complete: 0.03.