0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2666209-1276593458.opb>
0.00/0.01 c original problem has 431 variables (431 bin, 0 int, 0 impl, 0 cont) and 177 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 431
0.00/0.02 c feasible solution found by trivial heuristic, objective value 4.310000e+02
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 26 del conss, 0 chg bounds, 26 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 0 clqs
0.00/0.03 c (round 2) 4 del vars, 26 del conss, 0 chg bounds, 26 chg sides, 0 chg coeffs, 151 upgd conss, 8 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 101/427 (23.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 4 deleted vars, 26 deleted constraints, 0 tightened bounds, 0 added holes, 26 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 0 cliques
0.00/0.03 c presolved problem has 427 variables (427 bin, 0 int, 0 impl, 0 cont) and 151 constraints
0.00/0.03 c 151 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
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 = 1799.99
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 = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/0.03 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 o 427
0.00/0.04 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.04 c t 0.0s| 1 | 0 | 0 | - | 993k| 0 | - | 427 | 151 | 0 | 0 | 0 | 0 | 0 | -- | 4.270000e+02 | Inf
0.00/0.04 o 57
0.00/0.04 c b 0.0s| 1 | 0 | 0 | - |1222k| 0 | - | 427 | 151 | 427 | 151 | 0 | 0 | 0 | -- | 5.700000e+01 | Inf
0.00/0.05 c 0.0s| 1 | 0 | 197 | - |1216k| 0 | 73 | 427 | 151 | 427 | 151 | 0 | 0 | 0 | 3.740000e+01 | 5.700000e+01 | 52.41%
0.09/0.11 c 0.1s| 1 | 0 | 215 | - |1514k| 0 | 71 | 427 | 151 | 427 | 153 | 2 | 0 | 0 | 3.740000e+01 | 5.700000e+01 | 52.41%
0.09/0.17 c 0.1s| 1 | 0 | 236 | - |1985k| 0 | 59 | 427 | 151 | 427 | 154 | 3 | 0 | 0 | 3.740000e+01 | 5.700000e+01 | 52.41%
0.19/0.23 c 0.2s| 1 | 0 | 261 | - |2145k| 0 | 58 | 427 | 151 | 427 | 155 | 4 | 0 | 0 | 3.740000e+01 | 5.700000e+01 | 52.41%
0.19/0.29 c 0.2s| 1 | 0 | 307 | - |2390k| 0 | 57 | 427 | 151 | 427 | 156 | 5 | 0 | 0 | 3.740000e+01 | 5.700000e+01 | 52.41%
0.29/0.34 c 0.3s| 1 | 0 | 323 | - |2487k| 0 | 65 | 427 | 151 | 427 | 157 | 6 | 0 | 0 | 3.766667e+01 | 5.700000e+01 | 51.33%
0.39/0.42 c 0.4s| 1 | 0 | 356 | - |2898k| 0 | 65 | 427 | 151 | 427 | 158 | 7 | 0 | 0 | 3.766667e+01 | 5.700000e+01 | 51.33%
0.49/0.50 c 0.5s| 1 | 0 | 380 | - |3249k| 0 | 67 | 427 | 151 | 427 | 159 | 8 | 0 | 0 | 3.766667e+01 | 5.700000e+01 | 51.33%
0.49/0.58 c 0.5s| 1 | 0 | 397 | - |3721k| 0 | 55 | 427 | 151 | 427 | 161 | 10 | 0 | 0 | 3.800000e+01 | 5.700000e+01 | 50.00%
0.59/0.65 c 0.6s| 1 | 0 | 465 | - |4456k| 0 | 70 | 427 | 151 | 427 | 162 | 11 | 0 | 0 | 3.800000e+01 | 5.700000e+01 | 50.00%
0.69/0.71 c 0.7s| 1 | 0 | 521 | - |4632k| 0 | 91 | 427 | 151 | 427 | 164 | 13 | 0 | 0 | 3.800000e+01 | 5.700000e+01 | 50.00%
0.69/0.78 c 0.7s| 1 | 0 | 622 | - |4808k| 0 | 90 | 427 | 151 | 427 | 164 | 15 | 0 | 0 | 3.800000e+01 | 5.700000e+01 | 50.00%
0.79/0.83 c 0.8s| 1 | 0 | 677 | - |4832k| 0 | 101 | 427 | 151 | 427 | 165 | 16 | 0 | 0 | 3.800000e+01 | 5.700000e+01 | 50.00%
0.89/0.94 o 38
0.89/0.94 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.94 c E 0.9s| 1 | 0 | 677 | - |4854k| 0 | - | 427 | 151 | 427 | 165 | 16 | 0 | 0 | 3.800000e+01 | 3.800000e+01 | 0.00%
0.89/0.95 c 0.9s| 1 | 0 | 677 | - |4854k| 0 | - | 427 | 151 | 427 | 165 | 16 | 0 | 0 | 3.800000e+01 | 3.800000e+01 | 0.00%
0.89/0.95 c
0.89/0.95 c SCIP Status : problem is solved [optimal solution found]
0.89/0.95 c Solving Time (sec) : 0.89
0.89/0.95 c Solving Nodes : 1
0.89/0.95 c Primal Bound : +3.80000000000000e+01 (20 solutions)
0.89/0.95 c Dual Bound : +3.80000000000000e+01
0.89/0.95 c Gap : 0.00 %
0.89/0.95 s OPTIMUM FOUND
0.89/0.95 v -x431 -x430 x429 -x428 -x427 -x426 -x425 -x424 x423 -x422 -x421 x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 x410
0.89/0.95 v -x409 -x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389
0.89/0.95 v -x388 -x387 -x386 x385 -x384 -x383 -x382 -x381 -x380 x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368
0.89/0.95 v -x367 -x366 -x365 -x364 -x363 -x362 -x361 x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347
0.89/0.95 v -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 x338 -x337 -x336 x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325
0.89/0.95 v -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 x310 -x309 -x308 -x307 -x306 -x305 -x304
0.89/0.95 v -x303 -x302 -x301 -x300 -x299 x298 -x297 -x296 -x295 -x294 -x293 -x292 x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283
0.89/0.95 v -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 x266 -x265 -x264 -x263 -x262
0.89/0.95 v -x261 x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241
0.89/0.95 v -x240 -x239 x238 -x237 -x236 -x235 -x234 -x233 x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220
0.89/0.95 v -x219 -x218 x217 x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 x207 -x206 -x205 -x204 -x203 x202 -x201 -x200 -x199
0.89/0.95 v -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 x183 -x182 -x181 -x180 -x179 -x178
0.89/0.95 v -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157
0.89/0.95 v -x156 -x155 -x154 -x153 -x152 -x151 x150 x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136
0.89/0.95 v -x135 -x134 x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114
0.89/0.95 v -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 x97 -x96 -x95 -x94 -x93 -x92
0.89/0.95 v -x91 -x90 -x89 -x88 -x87 -x86 x85 -x84 -x83 -x82 -x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67
0.89/0.95 v x66 x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 x44 x43 -x42 -x41
0.89/0.95 v -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.89/0.95 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 x5 -x4 -x3 -x2 -x1
0.89/0.95 c SCIP Status : problem is solved [optimal solution found]
0.89/0.95 c Solving Time : 0.89
0.89/0.95 c Original Problem :
0.89/0.95 c Problem name : HOME/instance-2666209-1276593458.opb
0.89/0.95 c Variables : 431 (431 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.95 c Constraints : 177 initial, 177 maximal
0.89/0.95 c Presolved Problem :
0.89/0.95 c Problem name : t_HOME/instance-2666209-1276593458.opb
0.89/0.95 c Variables : 427 (427 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.95 c Constraints : 151 initial, 151 maximal
0.89/0.95 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.95 c trivial : 0.00 0 0 0 0 0 0 0 0
0.89/0.95 c dualfix : 0.00 4 0 0 0 0 0 0 0
0.89/0.95 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.95 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.95 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.95 c probing : 0.00 0 0 0 0 0 0 0 0
0.89/0.95 c linear : 0.00 0 0 0 0 0 26 26 0
0.89/0.95 c logicor : 0.01 0 0 0 0 0 0 0 0
0.89/0.95 c root node : - 0 - - 0 - - - -
0.89/0.95 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.95 c integral : 0 0 0 0 0 0 0 0 0 0
0.89/0.95 c logicor : 151 13 89 0 0 0 0 0 0 0
0.89/0.95 c countsols : 0 0 0 0 0 0 0 0 0 0
0.89/0.95 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.95 c integral : 0.00 0.00 0.00 0.00 0.00
0.89/0.95 c logicor : 0.00 0.00 0.00 0.00 0.00
0.89/0.95 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.95 c Propagators : Time Calls Cutoffs DomReds
0.89/0.95 c vbounds : 0.00 2 0 0
0.89/0.95 c rootredcost : 0.00 0 0 0
0.89/0.95 c pseudoobj : 0.00 4 0 0
0.89/0.95 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.95 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.95 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.95 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.95 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.95 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.95 c applied globally : - - - 0 0.0 - - -
0.89/0.95 c applied locally : - - - 0 0.0 - - -
0.89/0.95 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.95 c cut pool : 0.01 12 - - 92 - (maximal pool size: 356)
0.89/0.95 c redcost : 0.00 13 0 0 0 0
0.89/0.95 c impliedbounds : 0.00 13 0 0 0 0
0.89/0.95 c intobj : 0.00 0 0 0 0 0
0.89/0.95 c cgmip : 0.00 0 0 0 0 0
0.89/0.95 c gomory : 0.32 13 0 0 863 0
0.89/0.95 c strongcg : 0.31 13 0 0 831 0
0.89/0.95 c cmir : 0.03 10 0 0 0 0
0.89/0.95 c flowcover : 0.08 10 0 0 0 0
0.89/0.95 c clique : 0.00 1 0 0 0 0
0.89/0.95 c zerohalf : 0.00 0 0 0 0 0
0.89/0.95 c mcf : 0.00 1 0 0 0 0
0.89/0.95 c rapidlearning : 0.00 0 0 0 0 0
0.89/0.95 c Pricers : Time Calls Vars
0.89/0.95 c problem variables: 0.00 0 0
0.89/0.95 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.95 c pscost : 0.00 0 0 0 0 0 0
0.89/0.95 c inference : 0.00 0 0 0 0 0 0
0.89/0.95 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.95 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.95 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.95 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.95 c random : 0.00 0 0 0 0 0 0
0.89/0.95 c relpscost : 0.00 0 0 0 0 0 0
0.89/0.95 c Primal Heuristics : Time Calls Found
0.89/0.95 c LP solutions : 0.00 - 0
0.89/0.95 c pseudo solutions : 0.00 - 0
0.89/0.95 c crossover : 0.00 0 0
0.89/0.95 c oneopt : 0.00 2 1
0.89/0.95 c trivial : 0.00 2 3
0.89/0.95 c simplerounding : 0.00 13 13
0.89/0.95 c zirounding : 0.00 1 1
0.89/0.95 c rounding : 0.00 13 0
0.89/0.95 c shifting : 0.00 13 1
0.89/0.95 c intshifting : 0.00 0 0
0.89/0.95 c twoopt : 0.00 0 0
0.89/0.95 c fixandinfer : 0.00 0 0
0.89/0.95 c feaspump : 0.00 0 0
0.89/0.95 c coefdiving : 0.00 0 0
0.89/0.95 c pscostdiving : 0.00 0 0
0.89/0.95 c fracdiving : 0.00 0 0
0.89/0.95 c veclendiving : 0.00 0 0
0.89/0.95 c intdiving : 0.00 0 0
0.89/0.95 c actconsdiving : 0.00 0 0
0.89/0.95 c objpscostdiving : 0.00 0 0
0.89/0.95 c rootsoldiving : 0.00 0 0
0.89/0.95 c linesearchdiving : 0.00 0 0
0.89/0.95 c guideddiving : 0.00 0 0
0.89/0.95 c octane : 0.00 0 0
0.89/0.95 c rens : 0.04 1 1
0.89/0.95 c rins : 0.00 0 0
0.89/0.95 c localbranching : 0.00 0 0
0.89/0.95 c mutation : 0.00 0 0
0.89/0.95 c dins : 0.00 0 0
0.89/0.95 c undercover : 0.00 0 0
0.89/0.95 c nlp : 0.00 0 0
0.89/0.95 c trysol : 0.00 0 0
0.89/0.95 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.95 c primal LP : 0.01 0 0 0.00 0.00
0.89/0.95 c dual LP : 0.06 13 677 52.08 11283.33
0.89/0.95 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.95 c barrier LP : 0.00 0 0 0.00 -
0.89/0.95 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.95 c strong branching : 0.00 0 0 0.00 -
0.89/0.95 c (at root node) : - 0 0 0.00 -
0.89/0.95 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.95 c B&B Tree :
0.89/0.95 c number of runs : 1
0.89/0.95 c nodes : 1
0.89/0.95 c nodes (total) : 1
0.89/0.95 c nodes left : 0
0.89/0.95 c max depth : 0
0.89/0.95 c max depth (total): 0
0.89/0.95 c backtracks : 0 (0.0%)
0.89/0.95 c delayed cutoffs : 0
0.89/0.95 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.95 c avg switch length: 2.00
0.89/0.95 c switching time : 0.00
0.89/0.95 c Solution :
0.89/0.95 c Solutions found : 20 (4 improvements)
0.89/0.95 c First Solution : +4.31000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.89/0.95 c Primal Bound : +3.80000000000000e+01 (in run 1, after 1 nodes, 0.88 seconds, depth 0, found by <rens>)
0.89/0.95 c Dual Bound : +3.80000000000000e+01
0.89/0.95 c Gap : 0.00 %
0.89/0.95 c Root Dual Bound : +3.80000000000000e+01
0.89/0.95 c Root Iterations : 677
0.89/0.96 c Time complete: 0.96.