0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667489-1276413170.opb>
0.00/0.04 c original problem has 406 variables (406 bin, 0 int, 0 impl, 0 cont) and 520 constraints
0.00/0.04 c problem read
0.00/0.04 c presolving settings loaded
0.04/0.05 o 406
0.04/0.05 c feasible solution found by trivial heuristic, objective value 4.060000e+02
0.04/0.05 c presolving:
0.04/0.06 c (round 1) 5 del vars, 22 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 0 clqs
0.04/0.07 c (round 2) 5 del vars, 37 del conss, 5 chg bounds, 5 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 0 clqs
0.04/0.09 c (round 3) 5 del vars, 98 del conss, 5 chg bounds, 5 chg sides, 0 chg coeffs, 482 upgd conss, 4 impls, 0 clqs
0.04/0.09 c (round 4) 5 del vars, 99 del conss, 5 chg bounds, 5 chg sides, 0 chg coeffs, 483 upgd conss, 4 impls, 0 clqs
0.09/0.10 c (0.0s) probing: 101/401 (25.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.09/0.10 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.09/0.10 c presolving (5 rounds):
0.09/0.10 c 5 deleted vars, 99 deleted constraints, 5 tightened bounds, 0 added holes, 5 changed sides, 0 changed coefficients
0.09/0.10 c 4 implications, 0 cliques
0.09/0.10 c presolved problem has 401 variables (401 bin, 0 int, 0 impl, 0 cont) and 421 constraints
0.09/0.10 c 421 constraints of type <logicor>
0.09/0.10 c transformed objective value is always integral (scale: 1)
0.09/0.10 c Presolving Time: 0.04
0.09/0.10 c - non default parameters ----------------------------------------------------------------------
0.09/0.10 c # SCIP version 1.2.1.2
0.09/0.10 c
0.09/0.10 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.10 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.10 c conflict/interconss = 0
0.09/0.10 c
0.09/0.10 c # should binary conflicts be preferred?
0.09/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10 c conflict/preferbinary = TRUE
0.09/0.10 c
0.09/0.10 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.10 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.10 c constraints/agelimit = 1
0.09/0.10 c
0.09/0.10 c # should enforcement of pseudo solution be disabled?
0.09/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10 c constraints/disableenfops = TRUE
0.09/0.10 c
0.09/0.10 c # frequency for displaying node information lines
0.09/0.10 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.10 c display/freq = 10000
0.09/0.10 c
0.09/0.10 c # maximal time in seconds to run
0.09/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.10 c limits/time = 1799.97
0.09/0.10 c
0.09/0.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.10 c limits/memory = 1620
0.09/0.10 c
0.09/0.10 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.10 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.10 c lp/solvefreq = 0
0.09/0.10 c
0.09/0.10 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.10 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.10 c lp/pricing = a
0.09/0.10 c
0.09/0.10 c # should presolving try to simplify inequalities
0.09/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10 c constraints/linear/simplifyinequalities = TRUE
0.09/0.10 c
0.09/0.10 c # should presolving try to simplify knapsacks
0.09/0.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.10 c
0.09/0.10 c # priority of node selection rule <dfs> in standard mode
0.09/0.10 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.10 c nodeselection/dfs/stdpriority = 1000000
0.09/0.10 c
0.09/0.10 c -----------------------------------------------------------------------------------------------
0.09/0.10 c start solving
0.09/0.10 c
0.09/0.10 o 377
0.09/0.10 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.10 c t 0.0s| 1 | 0 | 0 | - |1914k| 0 | - | 401 | 421 | 0 | 0 | 0 | 0 | 0 | -- | 3.770000e+02 | Inf
0.09/0.11 o 25
0.09/0.11 c b 0.1s| 1 | 0 | 0 | - |2719k| 0 | - | 401 | 421 | 401 | 421 | 0 | 0 | 0 | -- | 2.500000e+01 | Inf
0.09/0.14 c 0.1s| 1 | 0 | 267 | - |2713k| 0 | 38 | 401 | 421 | 401 | 421 | 0 | 0 | 0 | 1.580000e+01 | 2.500000e+01 | 58.23%
0.09/0.14 o 23
0.09/0.14 c b 0.1s| 1 | 0 | 267 | - |2733k| 0 | 38 | 401 | 421 | 401 | 421 | 0 | 0 | 0 | 1.580000e+01 | 2.300000e+01 | 45.57%
0.19/0.26 c 0.2s| 1 | 0 | 311 | - |2959k| 0 | 33 | 401 | 421 | 401 | 423 | 2 | 0 | 0 | 1.600000e+01 | 2.300000e+01 | 43.75%
0.39/0.41 c 0.3s| 1 | 0 | 368 | - |3389k| 0 | 49 | 401 | 421 | 401 | 425 | 4 | 0 | 0 | 1.601429e+01 | 2.300000e+01 | 43.62%
0.49/0.55 c 0.5s| 1 | 0 | 443 | - |4034k| 0 | 32 | 401 | 421 | 401 | 428 | 7 | 0 | 0 | 1.620779e+01 | 2.300000e+01 | 41.91%
0.69/0.75 c 0.7s| 1 | 0 | 498 | - |4706k| 0 | 39 | 401 | 421 | 401 | 429 | 8 | 0 | 0 | 1.635970e+01 | 2.300000e+01 | 40.59%
0.89/0.94 c 0.9s| 1 | 0 | 564 | - |5121k| 0 | 48 | 401 | 421 | 401 | 432 | 11 | 0 | 0 | 1.650667e+01 | 2.300000e+01 | 39.34%
1.00/1.09 c 1.0s| 1 | 0 | 592 | - |5208k| 0 | 47 | 401 | 421 | 401 | 433 | 12 | 0 | 0 | 1.651284e+01 | 2.300000e+01 | 39.29%
1.19/1.29 c 1.2s| 1 | 0 | 638 | - |5228k| 0 | 47 | 401 | 421 | 401 | 434 | 13 | 0 | 0 | 1.654067e+01 | 2.300000e+01 | 39.05%
1.39/1.48 c 1.4s| 1 | 0 | 697 | - |5326k| 0 | 53 | 401 | 421 | 401 | 435 | 14 | 0 | 0 | 1.700000e+01 | 2.300000e+01 | 35.29%
1.59/1.67 c 1.6s| 1 | 0 | 710 | - |5343k| 0 | 52 | 401 | 421 | 401 | 436 | 15 | 0 | 0 | 1.700000e+01 | 2.300000e+01 | 35.29%
1.79/1.89 c 1.8s| 1 | 0 | 742 | - |5378k| 0 | 47 | 401 | 421 | 401 | 437 | 16 | 0 | 0 | 1.700000e+01 | 2.300000e+01 | 35.29%
2.10/2.13 o 18
2.10/2.13 c E 2.0s| 1 | 0 | 742 | - |5383k| 0 | 47 | 401 | 421 | 401 | 437 | 16 | 0 | 0 | 1.700000e+01 | 1.800000e+01 | 5.88%
2.10/2.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.14 c 2.0s| 1 | 0 | 742 | - |5383k| 0 | 47 | 401 | 421 | 401 | 437 | 16 | 0 | 0 | 1.700000e+01 | 1.800000e+01 | 5.88%
2.20/2.29 c 2.2s| 1 | 0 | 742 | - |5340k| 0 | 47 | 401 | 398 | 401 | 370 | 16 | 0 | 0 | 1.700000e+01 | 1.800000e+01 | 5.88%
2.79/2.80 c 2.7s| 1 | 0 | 839 | - |5340k| 0 | 59 | 401 | 398 | 401 | 370 | 16 | 0 | 16 | 1.700000e+01 | 1.800000e+01 | 5.88%
3.20/3.29 c 3.1s| 1 | 0 | 862 | - |5340k| 0 | 52 | 401 | 398 | 401 | 370 | 16 | 0 | 30 | 1.700000e+01 | 1.800000e+01 | 5.88%
3.39/3.44 c 3.3s| 1 | 0 | 885 | - |5434k| 0 | 52 | 401 | 398 | 401 | 371 | 17 | 0 | 30 | 1.700000e+01 | 1.800000e+01 | 5.88%
3.59/3.69 c 3.5s| 1 | 0 | 885 | - |5434k| 0 | - | 401 | 398 | 401 | 371 | 17 | 0 | 42 | 1.700000e+01 | 1.800000e+01 | 5.88%
3.59/3.69 c (run 1, node 1) restarting after 81 global fixings of integer variables
3.59/3.69 c
3.59/3.69 c (restart) converted 17 cuts from the global cut pool into linear constraints
3.59/3.69 c
3.69/3.70 c presolving:
3.69/3.71 c (round 1) 81 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 4 impls, 0 clqs
3.69/3.72 c (round 2) 81 del vars, 71 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 4 impls, 0 clqs
3.69/3.72 c (round 3) 81 del vars, 71 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 16 upgd conss, 4 impls, 0 clqs
3.69/3.75 c (round 4) 81 del vars, 71 del conss, 0 chg bounds, 3 chg sides, 3 chg coeffs, 16 upgd conss, 4 impls, 0 clqs
3.69/3.75 c presolving (5 rounds):
3.69/3.75 c 81 deleted vars, 71 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 3 changed coefficients
3.69/3.75 c 4 implications, 0 cliques
3.69/3.75 c presolved problem has 320 variables (320 bin, 0 int, 0 impl, 0 cont) and 344 constraints
3.69/3.75 c 15 constraints of type <knapsack>
3.69/3.75 c 329 constraints of type <logicor>
3.69/3.75 c transformed objective value is always integral (scale: 1)
3.69/3.75 c Presolving Time: 0.09
3.69/3.75 c
3.69/3.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.69/3.78 c 3.6s| 1 | 0 | 1080 | - |3016k| 0 | 54 | 320 | 344 | 320 | 344 | 0 | 0 | 42 | 1.700000e+01 | 1.800000e+01 | 5.88%
4.09/4.15 c 4.0s| 1 | 0 | 1139 | - |3506k| 0 | 38 | 320 | 344 | 320 | 346 | 2 | 0 | 42 | 1.700000e+01 | 1.800000e+01 | 5.88%
4.30/4.38 c 4.2s| 1 | 0 | 1268 | - |3506k| 0 | - | 320 | 344 | 320 | 346 | 2 | 0 | 52 | 1.800000e+01 | 1.800000e+01 | 0.00%
4.30/4.38 c 4.2s| 1 | 0 | 1268 | - |3506k| 0 | - | 320 | 344 | 320 | 346 | 2 | 0 | 52 | 1.800000e+01 | 1.800000e+01 | 0.00%
4.30/4.38 c
4.30/4.38 c SCIP Status : problem is solved [optimal solution found]
4.30/4.38 c Solving Time (sec) : 4.21
4.30/4.38 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
4.30/4.38 c Primal Bound : +1.80000000000000e+01 (6 solutions)
4.30/4.38 c Dual Bound : +1.80000000000000e+01
4.30/4.38 c Gap : 0.00 %
4.30/4.38 s OPTIMUM FOUND
4.30/4.38 v x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385
4.30/4.38 v -x384 -x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364
4.30/4.38 v -x363 -x362 -x361 -x360 x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343
4.30/4.38 v -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 x328 x327 -x326 -x325 -x324 -x323 -x322
4.30/4.38 v -x321 -x320 -x319 -x318 -x317 -x316 x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301
4.30/4.38 v -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280
4.30/4.38 v -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 x266 -x265 x264 x263 x262 -x261 -x260 -x259
4.30/4.38 v -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 x238
4.30/4.38 v -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217
4.30/4.38 v -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 x205 -x204 -x203 x202 -x201 -x200 -x199 -x198 -x197 -x196
4.30/4.38 v -x195 -x194 -x193 -x192 -x191 x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175
4.30/4.38 v -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154
4.30/4.38 v -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133
4.30/4.38 v -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112
4.30/4.38 v -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90
4.30/4.38 v -x89 -x88 -x87 -x86 -x85 x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64
4.30/4.38 v -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39
4.30/4.38 v -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14
4.30/4.38 v -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 -x2 -x1
4.30/4.38 c SCIP Status : problem is solved [optimal solution found]
4.30/4.38 c Solving Time : 4.21
4.30/4.38 c Original Problem :
4.30/4.38 c Problem name : HOME/instance-2667489-1276413170.opb
4.30/4.38 c Variables : 406 (406 binary, 0 integer, 0 implicit integer, 0 continuous)
4.30/4.38 c Constraints : 520 initial, 520 maximal
4.30/4.38 c Presolved Problem :
4.30/4.38 c Problem name : t_HOME/instance-2667489-1276413170.opb
4.30/4.38 c Variables : 320 (320 binary, 0 integer, 0 implicit integer, 0 continuous)
4.30/4.38 c Constraints : 344 initial, 344 maximal
4.30/4.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.30/4.38 c trivial : 0.00 81 0 0 0 0 0 0 0
4.30/4.38 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.30/4.38 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.30/4.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.30/4.38 c implics : 0.00 0 0 0 0 0 0 0 0
4.30/4.38 c probing : 0.01 0 0 0 0 0 0 0 0
4.30/4.38 c knapsack : 0.03 0 0 0 0 0 0 2 2
4.30/4.38 c linear : 0.03 5 0 0 5 0 38 6 1
4.30/4.38 c logicor : 0.02 0 0 0 0 0 132 0 0
4.30/4.38 c root node : - 86 - - 86 - - - -
4.30/4.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.30/4.38 c integral : 0 0 0 4 0 0 20 0 0 0
4.30/4.38 c knapsack : 15 1 2 0 0 0 0 0 0 0
4.30/4.38 c logicor : 329 15 81 0 0 0 0 0 0 0
4.30/4.38 c countsols : 0 0 0 0 0 0 0 0 0 0
4.30/4.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.30/4.38 c integral : 1.33 0.00 0.00 1.33 0.00
4.30/4.38 c knapsack : 0.18 0.18 0.00 0.00 0.00
4.30/4.38 c logicor : 0.01 0.00 0.01 0.00 0.00
4.30/4.38 c countsols : 0.00 0.00 0.00 0.00 0.00
4.30/4.38 c Propagators : Time Calls Cutoffs DomReds
4.30/4.38 c vbounds : 0.00 3 0 0
4.30/4.38 c rootredcost : 0.00 0 0 0
4.30/4.38 c pseudoobj : 0.00 18 1 0
4.30/4.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.30/4.38 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.30/4.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.30/4.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.30/4.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.30/4.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.30/4.38 c applied globally : - - - 0 0.0 - - -
4.30/4.38 c applied locally : - - - 0 0.0 - - -
4.30/4.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.30/4.38 c cut pool : 0.00 0 - - 0 - (maximal pool size: 65)
4.30/4.38 c redcost : 0.00 15 0 66 0 0
4.30/4.38 c impliedbounds : 0.00 15 0 0 0 0
4.30/4.38 c intobj : 0.00 0 0 0 0 0
4.30/4.38 c cgmip : 0.00 0 0 0 0 0
4.30/4.38 c gomory : 1.05 15 0 0 1714 0
4.30/4.39 c strongcg : 0.92 15 0 0 1882 0
4.30/4.39 c cmir : 0.11 11 0 0 2 0
4.30/4.39 c flowcover : 0.20 11 0 0 2 0
4.30/4.39 c clique : 0.00 2 0 0 0 0
4.30/4.39 c zerohalf : 0.00 0 0 0 0 0
4.30/4.39 c mcf : 0.00 2 0 0 0 0
4.30/4.39 c rapidlearning : 0.00 0 0 0 0 0
4.30/4.39 c Pricers : Time Calls Vars
4.30/4.39 c problem variables: 0.00 0 0
4.30/4.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.30/4.39 c relpscost : 1.33 4 0 20 0 0 0
4.30/4.39 c pscost : 0.00 0 0 0 0 0 0
4.30/4.39 c inference : 0.00 0 0 0 0 0 0
4.30/4.39 c mostinf : 0.00 0 0 0 0 0 0
4.30/4.39 c leastinf : 0.00 0 0 0 0 0 0
4.30/4.39 c fullstrong : 0.00 0 0 0 0 0 0
4.30/4.39 c allfullstrong : 0.00 0 0 0 0 0 0
4.30/4.39 c random : 0.00 0 0 0 0 0 0
4.30/4.39 c Primal Heuristics : Time Calls Found
4.30/4.39 c LP solutions : 0.00 - 0
4.30/4.39 c pseudo solutions : 0.00 - 0
4.30/4.39 c oneopt : 0.01 4 2
4.30/4.39 c trivial : 0.00 2 3
4.30/4.39 c simplerounding : 0.00 16 0
4.30/4.39 c zirounding : 0.00 1 0
4.30/4.39 c rounding : 0.00 16 0
4.30/4.39 c shifting : 0.01 16 0
4.30/4.39 c intshifting : 0.00 0 0
4.30/4.39 c twoopt : 0.00 0 0
4.30/4.39 c fixandinfer : 0.00 0 0
4.30/4.39 c feaspump : 0.00 0 0
4.30/4.39 c coefdiving : 0.00 0 0
4.30/4.39 c pscostdiving : 0.00 0 0
4.30/4.39 c fracdiving : 0.00 0 0
4.30/4.39 c veclendiving : 0.00 0 0
4.30/4.39 c intdiving : 0.00 0 0
4.30/4.39 c actconsdiving : 0.00 0 0
4.30/4.39 c objpscostdiving : 0.00 0 0
4.30/4.39 c rootsoldiving : 0.00 0 0
4.30/4.39 c linesearchdiving : 0.00 0 0
4.30/4.39 c guideddiving : 0.00 0 0
4.30/4.39 c octane : 0.00 0 0
4.30/4.39 c rens : 0.09 1 1
4.30/4.39 c rins : 0.00 0 0
4.30/4.39 c localbranching : 0.00 0 0
4.30/4.39 c mutation : 0.00 0 0
4.30/4.39 c crossover : 0.00 0 0
4.30/4.39 c dins : 0.00 0 0
4.30/4.39 c undercover : 0.00 0 0
4.30/4.39 c nlp : 0.00 0 0
4.30/4.39 c trysol : 0.00 0 0
4.30/4.39 c LP : Time Calls Iterations Iter/call Iter/sec
4.30/4.39 c primal LP : 0.00 0 0 0.00 -
4.30/4.39 c dual LP : 0.16 17 1268 74.59 7925.00
4.30/4.39 c lex dual LP : 0.00 0 0 0.00 -
4.30/4.39 c barrier LP : 0.00 0 0 0.00 -
4.30/4.39 c diving/probing LP: 0.00 0 0 0.00 -
4.30/4.39 c strong branching : 1.33 52 7429 142.87 5585.71
4.30/4.39 c (at root node) : - 52 7429 142.87 -
4.30/4.39 c conflict analysis: 0.00 0 0 0.00 -
4.30/4.39 c B&B Tree :
4.30/4.39 c number of runs : 2
4.30/4.39 c nodes : 1
4.30/4.39 c nodes (total) : 2
4.30/4.39 c nodes left : 0
4.30/4.39 c max depth : 0
4.30/4.39 c max depth (total): 0
4.30/4.39 c backtracks : 0 (0.0%)
4.30/4.39 c delayed cutoffs : 0
4.30/4.39 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.30/4.39 c avg switch length: 2.00
4.30/4.39 c switching time : 0.00
4.30/4.39 c Solution :
4.30/4.39 c Solutions found : 6 (5 improvements)
4.30/4.39 c First Solution : +4.06000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
4.30/4.39 c Primal Bound : +1.80000000000000e+01 (in run 1, after 1 nodes, 2.01 seconds, depth 0, found by <rens>)
4.30/4.39 c Dual Bound : +1.80000000000000e+01
4.30/4.39 c Gap : 0.00 %
4.30/4.39 c Root Dual Bound : +1.80000000000000e+01
4.30/4.39 c Root Iterations : 1268
4.30/4.40 c Time complete: 4.39.