0.03/0.04 c SCIP version 1.1.0.7
0.03/0.04 c LP-Solver Clp 1.8.2
0.03/0.04 c user parameter file <scip.set> not found - using default parameters
0.03/0.04 c read problem <HOME/instance-1870623-1245214083.opb>
0.03/0.04 c original problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 constraints
0.03/0.07 c No objective function, only one solution is needed.
0.03/0.07 c start presolving problem
0.03/0.07 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 601 upgd conss, 20256 impls, 400 clqs
0.29/0.39 c presolving (2 rounds):
0.29/0.39 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 20256 implications, 400 cliques
0.29/0.39 c presolved problem has 2882 variables (2882 bin, 0 int, 0 impl, 0 cont) and 3084 constraints
0.29/0.39 c 1 constraints of type <knapsack>
0.29/0.39 c 400 constraints of type <setppc>
0.29/0.39 c 2482 constraints of type <and>
0.29/0.39 c 1 constraints of type <linear>
0.29/0.39 c 200 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.15
0.29/0.39 c SATUNSAT-NLC
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/flowcover/freq = c -1
0.29/0.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/cmir/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/veclendiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/simplerounding/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/shifting/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/rounding/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/rootsoldiving/freq = c -1
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/rens/nodesofs = c 2000
0.29/0.39 c # minimum percentage of integer variables that have to be fixable
0.29/0.39 c # [type: real, range: [0,1], default: 0.5]
0.29/0.39 c heuristics/rens/minfixingrate = c 0.3
0.29/0.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/rens/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/pscostdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/oneopt/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39 c # [type: real, range: [0,1], default: 0.01]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/objpscostdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/linesearchdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/intshifting/freq = c -1
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/guideddiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/fracdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/feaspump/freq = c -1
0.29/0.39 c # minimum percentage of integer variables that have to be fixed
0.29/0.39 c # [type: real, range: [0,1], default: 0.666]
0.29/0.39 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39 c # [type: real, range: [0,1], default: 0.1]
0.29/0.39 c heuristics/crossover/nodesquot = c 0.15
0.29/0.39 c # number of nodes without incumbent change that heuristic should wait
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/crossover/nodesofs = c 750
0.29/0.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39 c heuristics/crossover/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/coefdiving/freq = c -1
0.29/0.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c presolving/probing/maxrounds = c 0
0.29/0.39 c # should presolving try to simplify knapsacks
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39 c constraints/knapsack/disaggregation = c FALSE
0.29/0.39 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.39 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = c 5
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = c 1
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = c 1
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = c 1620
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = c 1791
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = c 10000
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving problem
0.29/0.39 c
0.39/0.49 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.49 c 0.3s| 1 | 0 | 215 | 12M| 0 | 138 |2882 |3084 |3084 |2882 |5566 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.89/0.92 c 0.7s| 1 | 0 | 236 | 12M| 0 | 139 |2882 |3084 |3084 |2882 |5567 | 1 | 0 | 0 | 8.000000e+01 | -- | Inf
1.89/1.95 c 1.7s| 1 | 0 | 315 | 12M| 0 | 169 |2882 |3084 |3084 |2882 |5569 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
6.60/6.68 c 6.4s| 1 | 2 | 315 | 12M| 0 | 169 |2882 |3084 |3084 |2882 |5569 | 3 | 0 | 33 | 8.000000e+01 | -- | Inf
36.57/36.69 c *36.3s| 354 | 305 | 29959 | 14M| 51 | - |2882 |3094 |1803 |2882 |1400 |8560 | 10 |3073 | 8.000000e+01 | 8.700000e+01 | 8.75%
36.57/36.69 c
36.57/36.69 c SCIP Status : solving was interrupted [solution limit reached]
36.57/36.69 c Solving Time (sec) : 36.33
36.57/36.69 c Solving Nodes : 354
36.57/36.69 c Primal Bound : +8.70000000000000e+01 (1 solutions)
36.57/36.69 c Dual Bound : +8.00000000000002e+01
36.57/36.69 c Gap : 8.75 %
36.67/36.70 c NODE 354
36.67/36.70 c DUAL BOUND 80
36.67/36.70 c PRIMAL BOUND 87
36.67/36.70 c GAP 0.0875
36.67/36.70 s SATISFIABLE
36.67/36.70 v -x313 x342 -x248 -x392 -x390 -x358 -x297 -x348 -x254 -x386 -x286 -x345 -x376 -x231 -x294 -x280 -x360 -x382 -x332 -x255 -x323 -x321
36.67/36.70 v x359 -x343 -x224 -x353 -x256 -x391 -x239 -x237 -x300 -x370 -x349 -x335 -x305 -x317 -x377 -x395 -x361 -x367 -x299 -x267 -x238
36.67/36.70 v -x352 -x233 -x218 -x283 -x269 -x344 -x388 -x217 -x289 x380 x356 -x322 -x216 x339 x319 -x312 -x246 x350 -x347 -x249 -x271
36.67/36.70 v -x272 x329 -x308 -x284 -x307 -x366 -x354 x334 x275 -x310 x372 -x232 -x362 -x315 -x236 -x241 -x220 -x290 -x281 -x375 -x262 -x302
36.67/36.70 v -x253 -x318 -x303 -x298 -x210 -x234 -x295 -x213 -x340 -x245 -x261 -x400 -x355 -x252 -x389 -x379 -x277 x208 x276 -x266 -x219
36.67/36.70 v -x351 -x244 -x365 x215 -x346 x207 -x301 -x264 -x235 x314 -x247 x328 -x285 -x326 -x306 x206 -x398 -x288 -x279 x278 -x265 x258
36.67/36.70 v -x242 -x226 -x282 -x397 -x357 x381 -x292 -x214 x205 x393 -x311 -x296 x274 x240 -x225 x221 x371 -x325 -x338 -x385 -x320 -x374
36.67/36.70 v x399 -x309 -x209 -x257 -x270 -x259 -x223 x330 -x203 x396 -x273 -x251 -x243 -x204 -x268 -x324 -x263 -x331 -x383 x230 x368 x369
36.67/36.70 v -x212 -x202 -x211 x337 -x373 x227 -x341 -x327 x364 -x260 -x291 -x228 x363 -x201 x333 -x304 -x229 x222 -x250 -x293 -x387 x336
36.67/36.70 v -x394 -x316 -x378 -x287 -x384 -x200 -x199 -x198 -x197 -x196 -x195 x194 -x193 x192 -x191 -x190 -x189 -x188 -x187 x186 -x185
36.67/36.70 v x184 -x183 x182 -x181 -x180 x179 -x178 -x177 -x176 x175 -x174 -x173 -x172 -x171 x170 -x169 -x168 -x167 x166 -x165 -x164 -x163
36.67/36.70 v -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 x143 -x142
36.67/36.70 v x141 x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 x124 -x123 x122 -x121 -x120
36.67/36.70 v -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 x110 -x109 x108 -x107 -x106 -x105 -x104 -x103 x102 -x101 -x100 -x99
36.67/36.70 v -x98 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
36.67/36.70 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
36.67/36.70 v -x46 -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
36.67/36.70 v -x19 x18 -x17 -x16 -x15 -x14 -x13 x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
36.67/36.70 c SCIP Status : solving was interrupted [solution limit reached]
36.67/36.70 c Solving Time : 36.33
36.67/36.70 c Original Problem :
36.67/36.70 c Problem name : HOME/instance-1870623-1245214083.opb
36.67/36.70 c Variables : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
36.67/36.70 c Constraints : 3084 initial, 3084 maximal
36.67/36.70 c Presolved Problem :
36.67/36.70 c Problem name : t_HOME/instance-1870623-1245214083.opb
36.67/36.70 c Variables : 2882 (2882 binary, 0 integer, 0 implicit integer, 0 continuous)
36.67/36.70 c Constraints : 3084 initial, 3094 maximal
36.67/36.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
36.67/36.70 c trivial : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c implics : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c probing : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c knapsack : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c setppc : 0.01 0 0 0 0 0 0 0 0
36.67/36.70 c and : 0.11 0 0 0 0 0 0 0 0
36.67/36.70 c linear : 0.02 0 0 0 0 0 0 0 0
36.67/36.70 c logicor : 0.00 0 0 0 0 0 0 0 0
36.67/36.70 c root node : - 0 - - 0 - - - -
36.67/36.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
36.67/36.70 c integral : 0 0 0 358 0 0 0 0 0 686
36.67/36.70 c knapsack : 1 3 1001 15 0 0 0 0 0 0
36.67/36.70 c setppc : 400 3 1001 15 0 10 1095 0 0 0
36.67/36.70 c and : 2482 346 991 15 0 0 12841 8557 0 0
36.67/36.70 c linear : 1 3 991 1 0 0 0 0 0 0
36.67/36.70 c logicor : 200+ 3 299 1 0 0 226 0 0 0
36.67/36.70 c countsols : 0 0 0 1 0 0 0 0 0 0
36.67/36.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
36.67/36.70 c integral : 16.25 0.00 0.00 16.25 0.00
36.67/36.70 c knapsack : 0.00 0.00 0.00 0.00 0.00
36.67/36.70 c setppc : 0.05 0.00 0.05 0.00 0.00
36.67/36.70 c and : 0.84 0.67 0.15 0.02 0.00
36.67/36.70 c linear : 0.02 0.00 0.02 0.00 0.00
36.67/36.70 c logicor : 0.01 0.00 0.01 0.00 0.00
36.67/36.70 c countsols : 0.00 0.00 0.00 0.00 0.00
36.67/36.70 c Propagators : Time Calls Cutoffs DomReds
36.67/36.70 c rootredcost : 0.00 0 0 0
36.67/36.70 c pseudoobj : 0.29 1002 0 0
36.67/36.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
36.67/36.70 c propagation : 0.00 10 10 10 3.0 0 0.0 -
36.67/36.70 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
36.67/36.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
36.67/36.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
36.67/36.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
36.67/36.70 c applied globally : - - - 10 3.0 - - -
36.67/36.70 c applied locally : - - - 0 0.0 - - -
36.67/36.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
36.67/36.70 c cut pool : 0.00 2 - - 1 - (maximal pool size: 10)
36.67/36.70 c redcost : 0.07 346 0 0 0 0
36.67/36.70 c impliedbounds : 0.00 3 0 0 0 0
36.67/36.70 c intobj : 0.00 0 0 0 0 0
36.67/36.70 c gomory : 2.11 3 0 0 1000 0
36.67/36.70 c strongcg : 1.29 3 0 0 1000 0
36.67/36.70 c cmir : 0.00 0 0 0 0 0
36.67/36.70 c flowcover : 0.00 0 0 0 0 0
36.67/36.70 c clique : 0.02 3 0 0 0 0
36.67/36.70 c zerohalf : 0.00 0 0 0 0 0
36.67/36.70 c mcf : 0.01 1 0 0 0 0
36.67/36.70 c Pricers : Time Calls Vars
36.67/36.70 c problem variables: 0.00 0 0
36.67/36.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
36.67/36.70 c relpscost : 16.24 343 0 0 0 0 686
36.67/36.70 c pscost : 0.00 0 0 0 0 0 0
36.67/36.70 c inference : 0.00 0 0 0 0 0 0
36.67/36.70 c mostinf : 0.00 0 0 0 0 0 0
36.67/36.70 c leastinf : 0.00 0 0 0 0 0 0
36.67/36.70 c fullstrong : 0.00 0 0 0 0 0 0
36.67/36.70 c allfullstrong : 0.00 0 0 0 0 0 0
36.67/36.70 c random : 0.00 0 0 0 0 0 0
36.67/36.70 c Primal Heuristics : Time Calls Found
36.67/36.70 c LP solutions : 0.00 - 1
36.67/36.70 c pseudo solutions : 0.00 - 0
36.67/36.70 c simplerounding : 0.00 0 0
36.67/36.70 c rounding : 0.00 0 0
36.67/36.70 c shifting : 0.00 0 0
36.67/36.70 c intshifting : 0.00 0 0
36.67/36.70 c oneopt : 0.00 0 0
36.67/36.70 c fixandinfer : 0.00 0 0
36.67/36.70 c feaspump : 0.00 0 0
36.67/36.70 c coefdiving : 0.00 0 0
36.67/36.70 c pscostdiving : 0.00 0 0
36.67/36.70 c fracdiving : 0.00 0 0
36.67/36.70 c veclendiving : 0.00 0 0
36.67/36.70 c intdiving : 0.00 0 0
36.67/36.70 c actconsdiving : 0.00 0 0
36.67/36.70 c objpscostdiving : 0.00 0 0
36.67/36.70 c rootsoldiving : 0.00 0 0
36.67/36.70 c linesearchdiving : 0.00 0 0
36.67/36.70 c guideddiving : 0.00 0 0
36.67/36.70 c octane : 0.00 0 0
36.67/36.70 c rens : 0.00 0 0
36.67/36.70 c rins : 0.00 0 0
36.67/36.70 c localbranching : 0.00 0 0
36.67/36.70 c mutation : 0.00 0 0
36.67/36.70 c crossover : 0.00 0 0
36.67/36.70 c dins : 0.00 0 0
36.67/36.70 c LP : Time Calls Iterations Iter/call Iter/sec
36.67/36.70 c primal LP : 5.76 0 0 0.00 0.00
36.67/36.70 c dual LP : 8.38 703 29959 42.62 3575.06
36.67/36.70 c barrier LP : 0.00 0 0 0.00 -
36.67/36.70 c diving/probing LP: 0.00 0 0 0.00 -
36.67/36.70 c strong branching : 16.17 3073 59655 19.41 3689.24
36.67/36.70 c (at root node) : - 33 3630 110.00 -
36.67/36.70 c conflict analysis: 0.00 0 0 0.00 -
36.67/36.70 c B&B Tree :
36.67/36.70 c number of runs : 1
36.67/36.70 c nodes : 354
36.67/36.70 c nodes (total) : 354
36.67/36.70 c nodes left : 305
36.67/36.70 c max depth : 51
36.67/36.70 c max depth (total): 51
36.67/36.70 c backtracks : 13 (3.7%)
36.67/36.70 c delayed cutoffs : 0
36.67/36.70 c repropagations : 80 (156 domain reductions, 0 cutoffs)
36.67/36.70 c avg switch length: 2.44
36.67/36.70 c switching time : 5.94
36.67/36.70 c Solution :
36.67/36.70 c Solutions found : 1 (1 improvements)
36.67/36.70 c Primal Bound : +8.70000000000000e+01 (in run 1, after 354 nodes, 36.33 seconds, depth 51, found by <relaxation>)
36.67/36.70 c Dual Bound : +8.00000000000002e+01
36.67/36.70 c Gap : 8.75 %
36.67/36.70 c Root Dual Bound : +8.00000000000002e+01
36.67/36.75 c Time complete: 36.73.