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-2666148-1276479269.opb>
0.00/0.02 c original problem has 372 variables (372 bin, 0 int, 0 impl, 0 cont) and 421 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 o 543
0.00/0.02 c feasible solution found by trivial heuristic, objective value 5.430000e+02
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 3 del vars, 3 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1556 impls, 4 clqs
0.00/0.03 c (round 2) 3 del vars, 4 del conss, 1 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 1556 impls, 4 clqs
0.00/0.04 c (round 3) 3 del vars, 4 del conss, 1 chg bounds, 1 chg sides, 0 chg coeffs, 406 upgd conss, 1556 impls, 4 clqs
0.00/0.05 c (round 4) 3 del vars, 4 del conss, 1 chg bounds, 1 chg sides, 0 chg coeffs, 417 upgd conss, 1556 impls, 4 clqs
0.00/0.07 c (0.0s) probing: 124/369 (33.6%) - 0 fixings, 0 aggregations, 34 implications, 0 bound changes
0.00/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (5 rounds):
0.00/0.07 c 3 deleted vars, 4 deleted constraints, 1 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.07 c 1674 implications, 4 cliques
0.00/0.07 c presolved problem has 369 variables (369 bin, 0 int, 0 impl, 0 cont) and 417 constraints
0.00/0.07 c 71 constraints of type <knapsack>
0.00/0.07 c 4 constraints of type <setppc>
0.00/0.07 c 342 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.03
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1799.99
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.07 o 541
0.00/0.07 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.07 c t 0.0s| 1 | 0 | 0 | - |1526k| 0 | - | 369 | 417 | 0 | 0 | 0 | 0 | 0 | -- | 5.410000e+02 | Inf
0.06/0.07 o 524
0.06/0.07 c t 0.0s| 1 | 0 | 0 | - |1531k| 0 | - | 369 | 417 | 0 | 0 | 0 | 0 | 0 | -- | 5.240000e+02 | Inf
0.06/0.07 o 251
0.06/0.07 c b 0.0s| 1 | 0 | 0 | - |1825k| 0 | - | 369 | 417 | 369 | 417 | 0 | 0 | 0 | -- | 2.510000e+02 | Inf
0.09/0.10 c 0.1s| 1 | 0 | 342 | - |1820k| 0 | 75 | 369 | 417 | 369 | 417 | 0 | 0 | 0 | 3.000000e+00 | 2.510000e+02 |8266.67%
0.09/0.10 o 89
0.09/0.10 c R 0.1s| 1 | 0 | 342 | - |1829k| 0 | 75 | 369 | 417 | 369 | 417 | 0 | 0 | 0 | 3.000000e+00 | 8.900000e+01 |2866.67%
0.09/0.10 o 31
0.09/0.10 c b 0.1s| 1 | 0 | 342 | - |1842k| 0 | 75 | 369 | 417 | 369 | 417 | 0 | 0 | 0 | 3.000000e+00 | 3.100000e+01 | 933.33%
0.19/0.23 c 0.2s| 1 | 0 | 427 | - |2070k| 0 | 113 | 369 | 417 | 369 | 418 | 1 | 0 | 0 | 3.000000e+00 | 3.100000e+01 | 933.33%
0.19/0.23 o 14
0.19/0.23 c b 0.2s| 1 | 0 | 427 | - |2081k| 0 | 113 | 369 | 417 | 369 | 418 | 1 | 0 | 0 | 3.000000e+00 | 1.400000e+01 | 366.67%
0.29/0.31 c 0.2s| 1 | 0 | 429 | - |2238k| 0 | 0 | 369 | 417 | 369 | 419 | 2 | 0 | 0 | 3.000000e+00 | 1.400000e+01 | 366.67%
0.29/0.31 o 12
0.29/0.31 c b 0.2s| 1 | 0 | 429 | - |2247k| 0 | 0 | 369 | 417 | 369 | 419 | 2 | 0 | 0 | 3.000000e+00 | 1.200000e+01 | 300.00%
0.29/0.31 o 3
0.29/0.31 c * 0.2s| 1 | 0 | 429 | - |2247k| 0 | - | 369 | 417 | 369 | 419 | 2 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.29/0.31 c
0.29/0.31 c SCIP Status : problem is solved [optimal solution found]
0.29/0.31 c Solving Time (sec) : 0.24
0.29/0.31 c Solving Nodes : 1
0.29/0.31 c Primal Bound : +3.00000000000003e+00 (9 solutions)
0.29/0.31 c Dual Bound : +3.00000000000003e+00
0.29/0.31 c Gap : 0.00 %
0.29/0.31 s OPTIMUM FOUND
0.29/0.31 v x1 x372 -x369 x368 x331 -x226 x327 -x322 -x335 -x334 x370 -x71 -x227 x371 -x225 -x318 x330 x63 x355 -x325 x321 x339 -x68 -x70 -x228
0.29/0.31 v -x332 -x216 -x333 x367 -x67 x317 x328 x359 -x62 x319 -x326 x354 x324 x352 -x300 x323 x342 -x69 x187 -x263 x338 x186 -x364
0.29/0.31 v x366 -x220 -x66 -x215 x329 x363 -x213 -x60 x320 x358 x303 x91 -x125 -x299 x304 x353 x195 -x340 x16 -x177 x191 -x262 -x336 -x365
0.29/0.31 v x87 x184 -x224 x185 -x266 -x64 x86 -x219 -x267 -x296 x362 -x20 -x315 -x61 -x214 -x295 -x316 x356 -x42 x92 -x312 x90 -x110
0.29/0.31 v -x124 -x301 x308 x194 -x341 x15 -x38 x141 -x176 x190 -x206 -x264 -x337 x269 -x37 x106 -x223 -x241 -x268 x21 -x180 -x314 -x19
0.29/0.31 v -x65 x88 x105 -x121 -x181 -x217 -x313 -x360 -x43 x89 -x144 -x210 -x41 x93 -x120 -x145 -x297 x357 x72 x111 -x163 -x244 -x298
0.29/0.31 v -x311 x109 -x126 -x245 -x302 -x307 x192 x17 x140 -x159 -x178 -x188 -x205 x265 -x279 x18 -x183 x252 -x348 x22 -x39 -x53 x142
0.29/0.31 v -x158 -x182 -x221 -x240 x251 -x349 x5 -x40 -x147 -x211 x250 -x44 x107 -x146 -x209 -x218 -x242 -x361 x26 -x85 x108 -x164 x247
0.29/0.31 v -x282 x74 x112 -x122 -x162 -x246 -x283 -x56 x77 -x94 -x123 -x294 -x309 -x57 x73 -x127 -x290 -x305 -x193 x261 x351 -x179 -x189
0.29/0.31 v -x207 x260 -x278 -x350 -x14 -x170 -x208 x259 x6 -x52 x143 x160 -x169 -x212 -x222 -x256 -x280 -x9 -x36 -x82 x132 x161 -x168 -x199
0.29/0.31 v -x285 x4 x27 -x54 -x84 -x131 -x165 -x243 x248 -x284 -x2 -x30 -x59 -x104 -x130 x151 x232 -x249 -x291 x25 -x58 -x81 x96 -x231
0.29/0.31 v -x293 x23 -x97 -x119 -x229 -x310 x75 -x95 -x115 -x289 -x306 -x13 x137 -x175 -x203 x258 -x277 x347 -x12 -x34 x136 x155 -x174
0.29/0.31 v -x202 -x276 -x346 -x11 -x33 -x51 x138 x154 -x173 -x204 -x237 x257 -x275 -x345 -x10 -x35 -x50 -x83 -x102 x139 x156 -x171 -x200
0.29/0.31 v -x236 -x255 x281 -x343 -x32 -x49 -x79 -x101 -x135 x157 -x172 -x201 x238 x274 -x344 -x7 -x31 -x55 -x103 -x117 -x133 x152 -x166
0.29/0.31 v -x198 x239 -x253 x273 -x292 -x8 x48 -x78 -x100 -x116 -x134 -x153 -x167 -x196 x235 -x254 x272 -x287 -x3 -x28 x47 -x80 -x99
0.29/0.31 v -x118 -x128 x150 -x197 x233 -x270 -x29 -x45 -x114 -x129 x148 x234 -x271 -x286 x24 -x46 x76 -x98 -x113 x149 -x230 -x288
0.29/0.31 c SCIP Status : problem is solved [optimal solution found]
0.29/0.31 c Solving Time : 0.24
0.29/0.31 c Original Problem :
0.29/0.31 c Problem name : HOME/instance-2666148-1276479269.opb
0.29/0.31 c Variables : 372 (372 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.31 c Constraints : 421 initial, 421 maximal
0.29/0.31 c Presolved Problem :
0.29/0.31 c Problem name : t_HOME/instance-2666148-1276479269.opb
0.29/0.31 c Variables : 369 (369 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.31 c Constraints : 417 initial, 417 maximal
0.29/0.31 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.31 c trivial : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c probing : 0.01 0 0 0 0 0 0 0 0
0.29/0.31 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c setppc : 0.00 0 0 0 0 0 0 0 0
0.29/0.31 c linear : 0.01 1 2 0 1 0 4 1 0
0.29/0.31 c logicor : 0.01 0 0 0 0 0 0 0 0
0.29/0.31 c root node : - 0 - - 0 - - - -
0.29/0.31 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.31 c integral : 0 0 0 1 0 0 0 0 0 0
0.29/0.31 c knapsack : 71 3 262 1 0 0 0 0 0 0
0.29/0.31 c setppc : 4 3 252 1 0 0 0 0 0 0
0.29/0.31 c logicor : 342 3 258 1 0 0 0 0 0 0
0.29/0.31 c countsols : 0 0 0 1 0 0 0 0 0 0
0.29/0.31 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.31 c integral : 0.00 0.00 0.00 0.00 0.00
0.29/0.31 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.29/0.31 c setppc : 0.00 0.00 0.00 0.00 0.00
0.29/0.31 c logicor : 0.00 0.00 0.00 0.00 0.00
0.29/0.31 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.31 c Propagators : Time Calls Cutoffs DomReds
0.29/0.31 c vbounds : 0.00 2 0 0
0.29/0.31 c rootredcost : 0.00 0 0 0
0.29/0.31 c pseudoobj : 0.00 2 0 0
0.29/0.31 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.31 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.31 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.31 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.31 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.31 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.31 c applied globally : - - - 0 0.0 - - -
0.29/0.31 c applied locally : - - - 0 0.0 - - -
0.29/0.31 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.31 c cut pool : 0.00 2 - - 0 - (maximal pool size: 56)
0.29/0.31 c redcost : 0.00 3 0 0 0 0
0.29/0.31 c impliedbounds : 0.00 2 0 0 0 0
0.29/0.31 c intobj : 0.00 0 0 0 0 0
0.29/0.31 c cgmip : 0.00 0 0 0 0 0
0.29/0.31 c gomory : 0.06 2 0 0 125 0
0.29/0.31 c strongcg : 0.04 2 0 0 154 0
0.29/0.31 c cmir : 0.01 2 0 0 0 0
0.29/0.31 c flowcover : 0.02 2 0 0 0 0
0.29/0.31 c clique : 0.00 2 0 0 0 0
0.29/0.31 c zerohalf : 0.00 0 0 0 0 0
0.29/0.31 c mcf : 0.00 1 0 0 0 0
0.29/0.31 c rapidlearning : 0.03 1 0 0 0 0
0.29/0.31 c Pricers : Time Calls Vars
0.29/0.31 c problem variables: 0.00 0 0
0.29/0.31 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.31 c pscost : 0.00 0 0 0 0 0 0
0.29/0.31 c inference : 0.00 0 0 0 0 0 0
0.29/0.31 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.31 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.31 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.31 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.31 c random : 0.00 0 0 0 0 0 0
0.29/0.31 c relpscost : 0.00 0 0 0 0 0 0
0.29/0.31 c Primal Heuristics : Time Calls Found
0.29/0.31 c LP solutions : 0.00 - 1
0.29/0.31 c pseudo solutions : 0.00 - 0
0.29/0.31 c crossover : 0.00 0 0
0.29/0.31 c trivial : 0.00 2 3
0.29/0.31 c simplerounding : 0.00 0 0
0.29/0.31 c zirounding : 0.00 0 0
0.29/0.31 c rounding : 0.00 2 1
0.29/0.31 c shifting : 0.00 2 0
0.29/0.31 c intshifting : 0.00 0 0
0.29/0.31 c oneopt : 0.00 4 4
0.29/0.31 c twoopt : 0.00 0 0
0.29/0.31 c fixandinfer : 0.00 0 0
0.29/0.31 c feaspump : 0.00 0 0
0.29/0.31 c coefdiving : 0.00 0 0
0.29/0.31 c pscostdiving : 0.00 0 0
0.29/0.31 c fracdiving : 0.00 0 0
0.29/0.31 c veclendiving : 0.00 0 0
0.29/0.31 c intdiving : 0.00 0 0
0.29/0.31 c actconsdiving : 0.00 0 0
0.29/0.31 c objpscostdiving : 0.00 0 0
0.29/0.31 c rootsoldiving : 0.00 0 0
0.29/0.31 c linesearchdiving : 0.00 0 0
0.29/0.31 c guideddiving : 0.00 0 0
0.29/0.31 c octane : 0.00 0 0
0.29/0.31 c rens : 0.00 0 0
0.29/0.31 c rins : 0.00 0 0
0.29/0.31 c localbranching : 0.00 0 0
0.29/0.31 c mutation : 0.00 0 0
0.29/0.31 c dins : 0.00 0 0
0.29/0.31 c undercover : 0.00 0 0
0.29/0.31 c nlp : 0.00 0 0
0.29/0.31 c trysol : 0.00 0 0
0.29/0.31 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.31 c primal LP : 0.00 0 0 0.00 -
0.29/0.31 c dual LP : 0.05 3 429 143.00 8580.00
0.29/0.31 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.31 c barrier LP : 0.00 0 0 0.00 -
0.29/0.31 c diving/probing LP: 0.00 0 0 0.00 -
0.29/0.31 c strong branching : 0.00 0 0 0.00 -
0.29/0.31 c (at root node) : - 0 0 0.00 -
0.29/0.31 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.31 c B&B Tree :
0.29/0.31 c number of runs : 1
0.29/0.31 c nodes : 1
0.29/0.31 c nodes (total) : 1
0.29/0.31 c nodes left : 0
0.29/0.31 c max depth : 0
0.29/0.31 c max depth (total): 0
0.29/0.31 c backtracks : 0 (0.0%)
0.29/0.31 c delayed cutoffs : 0
0.29/0.31 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.29/0.31 c avg switch length: 2.00
0.29/0.31 c switching time : 0.00
0.29/0.31 c Solution :
0.29/0.31 c Solutions found : 9 (9 improvements)
0.29/0.31 c First Solution : +5.43000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.29/0.31 c Primal Bound : +3.00000000000003e+00 (in run 1, after 1 nodes, 0.24 seconds, depth 0, found by <relaxation>)
0.29/0.31 c Dual Bound : +3.00000000000003e+00
0.29/0.31 c Gap : 0.00 %
0.29/0.31 c Root Dual Bound : +3.00000000000003e+00
0.29/0.31 c Root Iterations : 429
0.29/0.32 c Time complete: 0.31.