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-2666060-1276413375.opb>
0.00/0.04 c original problem has 349 variables (349 bin, 0 int, 0 impl, 0 cont) and 707 constraints
0.00/0.04 c problem read
0.00/0.04 c presolving settings loaded
0.00/0.05 o 349
0.00/0.05 c feasible solution found by trivial heuristic, objective value 3.490000e+02
0.00/0.05 c presolving:
0.05/0.07 c (round 1) 1 del vars, 2 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 0 clqs
0.09/0.11 c (round 2) 1 del vars, 120 del conss, 1 chg bounds, 4 chg sides, 0 chg coeffs, 696 upgd conss, 4 impls, 0 clqs
0.09/0.11 c (round 3) 5 del vars, 128 del conss, 1 chg bounds, 4 chg sides, 0 chg coeffs, 696 upgd conss, 4 impls, 0 clqs
0.09/0.12 c (0.1s) probing: 101/344 (29.4%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.09/0.12 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.09/0.12 c presolving (4 rounds):
0.09/0.12 c 5 deleted vars, 128 deleted constraints, 1 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
0.09/0.12 c 4 implications, 0 cliques
0.09/0.12 c presolved problem has 344 variables (344 bin, 0 int, 0 impl, 0 cont) and 579 constraints
0.09/0.12 c 579 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.06
0.09/0.12 c - non default parameters ----------------------------------------------------------------------
0.09/0.12 c # SCIP version 1.2.1.2
0.09/0.12 c
0.09/0.12 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c conflict/interconss = 0
0.09/0.12 c
0.09/0.12 c # should binary conflicts be preferred?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c conflict/preferbinary = TRUE
0.09/0.12 c
0.09/0.12 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c constraints/agelimit = 1
0.09/0.12 c
0.09/0.12 c # should enforcement of pseudo solution be disabled?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/disableenfops = TRUE
0.09/0.12 c
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = 10000
0.09/0.12 c
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = 1799.97
0.09/0.12 c
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = 1620
0.09/0.12 c
0.09/0.12 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c lp/solvefreq = 0
0.09/0.12 c
0.09/0.12 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.09/0.12 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.12 c lp/pricing = a
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # priority of node selection rule <dfs> in standard mode
0.09/0.12 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.12 c nodeselection/dfs/stdpriority = 1000000
0.09/0.12 c
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving
0.09/0.12 c
0.09/0.12 o 345
0.09/0.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.12 c t 0.1s| 1 | 0 | 0 | - |1956k| 0 | - | 344 | 579 | 0 | 0 | 0 | 0 | 0 | -- | 3.450000e+02 | Inf
0.09/0.12 o 309
0.09/0.12 c t 0.1s| 1 | 0 | 0 | - |1960k| 0 | - | 344 | 579 | 0 | 0 | 0 | 0 | 0 | -- | 3.090000e+02 | Inf
0.09/0.13 o 24
0.09/0.13 c b 0.1s| 1 | 0 | 0 | - |2828k| 0 | - | 344 | 579 | 344 | 579 | 0 | 0 | 0 | -- | 2.400000e+01 | Inf
0.09/0.13 c 0.1s| 1 | 0 | 71 | - |2824k| 0 | 42 | 344 | 579 | 344 | 579 | 0 | 0 | 0 | 1.323214e+01 | 2.400000e+01 | 81.38%
0.09/0.14 o 21
0.09/0.14 c b 0.1s| 1 | 0 | 71 | - |2840k| 0 | 42 | 344 | 579 | 344 | 579 | 0 | 0 | 0 | 1.323214e+01 | 2.100000e+01 | 58.70%
0.19/0.24 c 0.2s| 1 | 0 | 101 | - |3007k| 0 | 32 | 344 | 579 | 344 | 583 | 4 | 0 | 0 | 1.382127e+01 | 2.100000e+01 | 51.94%
0.19/0.24 o 20
0.19/0.24 c b 0.2s| 1 | 0 | 101 | - |3016k| 0 | 32 | 344 | 579 | 344 | 583 | 4 | 0 | 0 | 1.382127e+01 | 2.000000e+01 | 44.70%
0.29/0.35 c 0.3s| 1 | 0 | 135 | - |3195k| 0 | 32 | 344 | 579 | 344 | 587 | 8 | 0 | 0 | 1.406661e+01 | 2.000000e+01 | 42.18%
0.39/0.45 c 0.4s| 1 | 0 | 155 | - |3397k| 0 | 23 | 344 | 579 | 344 | 591 | 12 | 0 | 0 | 1.448471e+01 | 2.000000e+01 | 38.08%
0.49/0.53 c 0.5s| 1 | 0 | 192 | - |3455k| 0 | 42 | 344 | 579 | 344 | 594 | 15 | 0 | 0 | 1.473299e+01 | 2.000000e+01 | 35.75%
0.59/0.62 c 0.5s| 1 | 0 | 254 | - |3468k| 0 | 37 | 344 | 579 | 344 | 595 | 16 | 0 | 0 | 1.477452e+01 | 2.000000e+01 | 35.37%
0.69/0.72 c 0.6s| 1 | 0 | 269 | - |3542k| 0 | 38 | 344 | 579 | 344 | 596 | 17 | 0 | 0 | 1.500000e+01 | 2.000000e+01 | 33.33%
0.79/0.86 c 0.8s| 1 | 0 | 281 | - |4146k| 0 | 38 | 344 | 579 | 344 | 597 | 18 | 0 | 0 | 1.500000e+01 | 2.000000e+01 | 33.33%
0.88/1.00 c 0.9s| 1 | 0 | 324 | - |4604k| 0 | 28 | 344 | 579 | 344 | 598 | 19 | 0 | 0 | 1.500000e+01 | 2.000000e+01 | 33.33%
1.00/1.09 c 1.0s| 1 | 0 | 341 | - |4815k| 0 | 32 | 344 | 579 | 344 | 600 | 21 | 0 | 0 | 1.500000e+01 | 2.000000e+01 | 33.33%
1.10/1.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.16 c 1.1s| 1 | 0 | 345 | - |4851k| 0 | 10 | 344 | 579 | 344 | 601 | 22 | 0 | 0 | 1.500000e+01 | 2.000000e+01 | 33.33%
1.10/1.16 o 19
1.10/1.16 c R 1.1s| 1 | 0 | 345 | - |4856k| 0 | 10 | 344 | 579 | 344 | 601 | 22 | 0 | 0 | 1.500000e+01 | 1.900000e+01 | 26.67%
1.10/1.16 o 18
1.10/1.16 c s 1.1s| 1 | 0 | 345 | - |4860k| 0 | 10 | 344 | 579 | 344 | 601 | 22 | 0 | 0 | 1.500000e+01 | 1.800000e+01 | 20.00%
1.10/1.18 c 1.1s| 1 | 0 | 347 | - |4881k| 0 | 8 | 344 | 579 | 344 | 601 | 23 | 0 | 0 | 1.500000e+01 | 1.800000e+01 | 20.00%
1.10/1.18 o 15
1.10/1.18 c b 1.1s| 1 | 0 | 347 | - |4890k| 0 | - | 344 | 579 | 344 | 601 | 23 | 0 | 0 | 1.500000e+01 | 1.500000e+01 | 0.00%
1.10/1.18 c 1.1s| 1 | 0 | 347 | - |4885k| 0 | - | 344 | 579 | 344 | 601 | 23 | 0 | 0 | 1.500000e+01 | 1.500000e+01 | 0.00%
1.10/1.18 c
1.10/1.18 c SCIP Status : problem is solved [optimal solution found]
1.10/1.18 c Solving Time (sec) : 1.10
1.10/1.18 c Solving Nodes : 1
1.10/1.18 c Primal Bound : +1.50000000000000e+01 (9 solutions)
1.10/1.18 c Dual Bound : +1.50000000000000e+01
1.10/1.18 c Gap : 0.00 %
1.10/1.19 s OPTIMUM FOUND
1.10/1.19 v -x349 -x348 x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328
1.10/1.19 v -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307
1.10/1.19 v -x306 -x305 x304 -x303 -x302 x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286
1.10/1.19 v -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 x269 -x268 -x267 -x266 -x265
1.10/1.19 v -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 x248 -x247 -x246 -x245 -x244
1.10/1.19 v -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223
1.10/1.19 v -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202
1.10/1.19 v -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181
1.10/1.19 v -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161
1.10/1.19 v -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140
1.10/1.19 v -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119
1.10/1.19 v x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98
1.10/1.19 v -x97 -x96 -x95 x94 -x93 -x92 -x91 -x90 -x89 x88 -x87 -x86 -x85 -x84 -x83 x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72
1.10/1.19 v -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
1.10/1.19 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
1.10/1.19 v -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.10/1.19 c SCIP Status : problem is solved [optimal solution found]
1.10/1.19 c Solving Time : 1.10
1.10/1.19 c Original Problem :
1.10/1.19 c Problem name : HOME/instance-2666060-1276413375.opb
1.10/1.19 c Variables : 349 (349 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.19 c Constraints : 707 initial, 707 maximal
1.10/1.19 c Presolved Problem :
1.10/1.19 c Problem name : t_HOME/instance-2666060-1276413375.opb
1.10/1.19 c Variables : 344 (344 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.19 c Constraints : 579 initial, 579 maximal
1.10/1.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.10/1.19 c trivial : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c dualfix : 0.00 4 0 0 0 0 0 0 0
1.10/1.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c implics : 0.00 0 0 0 0 0 0 0 0
1.10/1.19 c probing : 0.01 0 0 0 0 0 0 0 0
1.10/1.19 c linear : 0.03 1 0 0 1 0 11 4 0
1.10/1.19 c logicor : 0.02 0 0 0 0 0 117 0 0
1.10/1.19 c root node : - 0 - - 0 - - - -
1.10/1.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.10/1.19 c integral : 0 0 0 0 0 0 0 0 0 0
1.10/1.19 c logicor : 579 11 54 0 0 0 0 0 0 0
1.10/1.19 c countsols : 0 0 0 0 0 0 0 0 0 0
1.10/1.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.10/1.19 c integral : 0.00 0.00 0.00 0.00 0.00
1.10/1.19 c logicor : 0.00 0.00 0.00 0.00 0.00
1.10/1.19 c countsols : 0.00 0.00 0.00 0.00 0.00
1.10/1.19 c Propagators : Time Calls Cutoffs DomReds
1.10/1.19 c vbounds : 0.00 2 0 0
1.10/1.19 c rootredcost : 0.00 0 0 0
1.10/1.19 c pseudoobj : 0.00 8 0 0
1.10/1.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.10/1.19 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.19 c applied globally : - - - 0 0.0 - - -
1.10/1.19 c applied locally : - - - 0 0.0 - - -
1.10/1.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.10/1.19 c cut pool : 0.01 10 - - 55 - (maximal pool size: 348)
1.10/1.19 c redcost : 0.00 11 0 0 0 0
1.10/1.19 c impliedbounds : 0.00 11 0 0 0 0
1.10/1.19 c intobj : 0.00 0 0 0 0 0
1.10/1.19 c cgmip : 0.00 0 0 0 0 0
1.10/1.19 c gomory : 0.39 11 0 0 2033 0
1.10/1.19 c strongcg : 0.29 11 0 0 1765 0
1.10/1.19 c cmir : 0.10 10 0 0 3 0
1.10/1.19 c flowcover : 0.15 10 0 0 2 0
1.10/1.19 c clique : 0.00 1 0 0 0 0
1.10/1.19 c zerohalf : 0.00 0 0 0 0 0
1.10/1.19 c mcf : 0.00 1 0 0 0 0
1.10/1.19 c rapidlearning : 0.00 0 0 0 0 0
1.10/1.19 c Pricers : Time Calls Vars
1.10/1.19 c problem variables: 0.00 0 0
1.10/1.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.10/1.19 c pscost : 0.00 0 0 0 0 0 0
1.10/1.19 c inference : 0.00 0 0 0 0 0 0
1.10/1.19 c mostinf : 0.00 0 0 0 0 0 0
1.10/1.19 c leastinf : 0.00 0 0 0 0 0 0
1.10/1.19 c fullstrong : 0.00 0 0 0 0 0 0
1.10/1.19 c allfullstrong : 0.00 0 0 0 0 0 0
1.10/1.19 c random : 0.00 0 0 0 0 0 0
1.10/1.19 c relpscost : 0.00 0 0 0 0 0 0
1.10/1.19 c Primal Heuristics : Time Calls Found
1.10/1.19 c LP solutions : 0.00 - 0
1.10/1.19 c pseudo solutions : 0.00 - 0
1.10/1.19 c trivial : 0.00 2 3
1.10/1.19 c simplerounding : 0.00 11 0
1.10/1.19 c zirounding : 0.00 0 0
1.10/1.19 c rounding : 0.00 11 1
1.10/1.19 c shifting : 0.01 11 1
1.10/1.19 c intshifting : 0.00 0 0
1.10/1.19 c oneopt : 0.00 5 4
1.10/1.19 c twoopt : 0.00 0 0
1.10/1.19 c fixandinfer : 0.00 0 0
1.10/1.19 c feaspump : 0.00 0 0
1.10/1.19 c coefdiving : 0.00 0 0
1.10/1.19 c pscostdiving : 0.00 0 0
1.10/1.19 c fracdiving : 0.00 0 0
1.10/1.19 c veclendiving : 0.00 0 0
1.10/1.19 c intdiving : 0.00 0 0
1.10/1.19 c actconsdiving : 0.00 0 0
1.10/1.19 c objpscostdiving : 0.00 0 0
1.10/1.19 c rootsoldiving : 0.00 0 0
1.10/1.19 c linesearchdiving : 0.00 0 0
1.10/1.19 c guideddiving : 0.00 0 0
1.10/1.19 c octane : 0.00 0 0
1.10/1.19 c rens : 0.00 0 0
1.10/1.19 c rins : 0.00 0 0
1.10/1.19 c localbranching : 0.00 0 0
1.10/1.19 c mutation : 0.00 0 0
1.10/1.19 c crossover : 0.00 0 0
1.10/1.19 c dins : 0.00 0 0
1.10/1.19 c undercover : 0.00 0 0
1.10/1.19 c nlp : 0.00 0 0
1.10/1.19 c trysol : 0.00 0 0
1.10/1.19 c LP : Time Calls Iterations Iter/call Iter/sec
1.10/1.19 c primal LP : 0.01 0 0 0.00 0.00
1.10/1.19 c dual LP : 0.04 12 347 28.92 8675.00
1.10/1.19 c lex dual LP : 0.00 0 0 0.00 -
1.10/1.19 c barrier LP : 0.00 0 0 0.00 -
1.10/1.19 c diving/probing LP: 0.00 0 0 0.00 -
1.10/1.19 c strong branching : 0.00 0 0 0.00 -
1.10/1.19 c (at root node) : - 0 0 0.00 -
1.10/1.19 c conflict analysis: 0.00 0 0 0.00 -
1.10/1.19 c B&B Tree :
1.10/1.19 c number of runs : 1
1.10/1.19 c nodes : 1
1.10/1.19 c nodes (total) : 1
1.10/1.19 c nodes left : 0
1.10/1.19 c max depth : 0
1.10/1.19 c max depth (total): 0
1.10/1.19 c backtracks : 0 (0.0%)
1.10/1.19 c delayed cutoffs : 0
1.10/1.19 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.10/1.19 c avg switch length: 2.00
1.10/1.19 c switching time : 0.00
1.10/1.19 c Solution :
1.10/1.19 c Solutions found : 9 (9 improvements)
1.10/1.19 c First Solution : +3.49000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.10/1.19 c Primal Bound : +1.50000000000000e+01 (in run 1, after 1 nodes, 1.10 seconds, depth 0, found by <oneopt>)
1.10/1.19 c Dual Bound : +1.50000000000000e+01
1.10/1.19 c Gap : 0.00 %
1.10/1.19 c Root Dual Bound : +1.50000000000000e+01
1.10/1.19 c Root Iterations : 347
1.19/1.20 c Time complete: 1.19.