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-2667381-1276327795.opb>
0.00/0.02 c original problem has 338 variables (338 bin, 0 int, 0 impl, 0 cont) and 270 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 270 upgd conss, 0 impls, 30 clqs
0.00/0.04 c presolving (2 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 0 implications, 30 cliques
0.00/0.04 c presolved problem has 338 variables (338 bin, 0 int, 0 impl, 0 cont) and 270 constraints
0.00/0.04 c 30 constraints of type <setppc>
0.00/0.04 c 240 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.01
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1799.99
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c limits/solutions = 1
0.00/0.04 c
0.00/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.04 c separating/maxrounds = 1
0.00/0.04 c
0.00/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/maxroundsroot = 5
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.04 c constraints/knapsack/disaggregation = FALSE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c presolving/probing/maxrounds = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/coefdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.04 c heuristics/crossover/freq = -1
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/crossover/nodesofs = 750
0.00/0.04 c
0.00/0.04 c # number of nodes without incumbent change that heuristic should wait
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.04 c heuristics/crossover/nwaitingnodes = 100
0.00/0.04 c
0.00/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.04 c # [type: real, range: [0,1], default: 0.1]
0.00/0.04 c heuristics/crossover/nodesquot = 0.15
0.00/0.04 c
0.00/0.04 c # minimum percentage of integer variables that have to be fixed
0.00/0.04 c # [type: real, range: [0,1], default: 0.666]
0.00/0.04 c heuristics/crossover/minfixingrate = 0.5
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/feaspump/freq = -1
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/fracdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/guideddiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/intshifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/linesearchdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/nlp/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/objpscostdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.04 c # [type: real, range: [0,1], default: 0.01]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/oneopt/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/pscostdiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/rens/freq = -1
0.00/0.04 c
0.00/0.04 c # minimum percentage of integer variables that have to be fixable
0.00/0.04 c # [type: real, range: [0,1], default: 0.5]
0.00/0.04 c heuristics/rens/minfixingrate = 0.3
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/rens/nodesofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/rootsoldiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/rounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.04/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.05 c 0.0s| 1 | 0 | 117 | - |1342k| 0 | 87 | 338 | 270 | 338 | 270 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 308 | - |1583k| 0 | 106 | 338 | 270 | 338 | 278 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.25 c 0.2s| 1 | 0 | 576 | - |1790k| 0 | 97 | 338 | 270 | 338 | 286 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.2s| 1 | 0 | 689 | - |2085k| 0 | 73 | 338 | 270 | 338 | 295 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 781 | - |2298k| 0 | 61 | 338 | 270 | 338 | 303 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 841 | - |2373k| 0 | 46 | 338 | 270 | 338 | 310 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.41 c 0.3s| 1 | 2 | 841 | - |2373k| 0 | 46 | 338 | 270 | 338 | 310 | 40 | 0 | 18 | 0.000000e+00 | -- | Inf
0.49/0.55 c * 0.5s| 9 | 0 | 922 | 10.1 |2419k| 8 | - | 338 | 270 | 338 | 288 | 40 | 0 | 105 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.49/0.55 c
0.49/0.55 c SCIP Status : problem is solved [optimal solution found]
0.49/0.55 c Solving Time (sec) : 0.48
0.49/0.55 c Solving Nodes : 9
0.49/0.55 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.49/0.55 c Dual Bound : +0.00000000000000e+00
0.49/0.55 c Gap : 0.00 %
0.49/0.55 s SATISFIABLE
0.49/0.55 v -x132 -x131 -x128 -x178 -x171 -x130 -x120 -x113 -x106 -x164 x163 -x160 -x151 -x155 -x152 -x210 -x208 -x205 x200 -x196 -x176 -x198
0.49/0.55 v -x13 x12 -x10 -x8 -x6 -x199 -x122 -x206 -x107 -x204 -x180 -x2 -x153 -x133 -x27 -x19 -x18 -x17 -x23 -x9 -x123 -x162 -x129 -x127
0.49/0.55 v -x14 -x207 -x179 -x117 -x126 -x134 -x20 -x209 -x5 x173 -x167 -x165 -x4 -x202 -x28 -x154 -x60 -x59 -x57 -x56 -x55 -x54 -x53
0.49/0.55 v -x52 -x51 -x50 -x48 -x47 -x158 -x58 -x15 -x203 -x112 -x90 -x88 x86 -x85 -x84 -x83 -x81 -x77 -x76 x119 -x197 -x7 -x115 -x149
0.49/0.55 v -x148 -x147 -x146 -x143 -x139 -x138 -x137 -x136 x135 -x124 -x108 -x239 x238 -x237 -x236 -x235 -x234 -x233 -x74 -x73 -x71 -x70
0.49/0.55 v x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x170 -x193 -x192 -x191 -x189 -x187 -x186 -x185 -x184 x183 -x182 -x181 -x121 -x29
0.49/0.55 v -x16 -x175 -x78 -x166 -x3 -x89 -x116 -x161 -x142 -x82 -x87 -x46 -x114 -x232 -x231 -x230 -x229 -x228 -x227 x226 -x1 -x111
0.49/0.55 v -x24 -x11 -x306 -x305 -x304 x303 -x302 -x301 -x300 -x299 -x26 -x80 -x144 -x159 -x177 -x79 -x150 x145 -x169 -x30 -x105 -x103 -x102
0.49/0.55 v -x101 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 x91 -x110 -x195 -x190 -x290 -x289 -x288 -x287 -x286 -x285 -x284 x283 -x174
0.49/0.55 v -x194 -x172 -x100 -x338 -x337 -x336 -x335 -x334 x333 -x332 -x331 -x75 -x314 -x313 x312 -x311 -x310 -x309 -x308 -x307 -x72 -x246
0.49/0.55 v -x245 -x244 x243 -x242 -x241 -x240 -x168 x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x104 -x21 -x140 -x201 -x298 -x297
0.49/0.55 v -x296 -x295 -x294 -x293 x292 -x291 -x25 x22 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 x212
0.49/0.55 v -x211 x49 -x253 -x252 -x251 -x250 x249 -x248 -x247 -x109 -x322 -x321 -x320 -x319 x318 -x317 -x316 -x315 -x118 -x141 -x260
0.49/0.55 v -x259 x258 -x257 -x256 -x255 -x254 -x125 -x274 -x273 -x272 -x271 -x270 x269 -x268 -x157 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38
0.49/0.55 v -x37 x36 -x35 -x34 -x33 -x32 -x31 -x282 x281 -x280 -x279 -x278 -x277 -x276 -x275 -x188 x267 -x266 -x265 -x264 -x263 -x262
0.49/0.55 v -x261 -x156
0.49/0.55 c SCIP Status : problem is solved [optimal solution found]
0.49/0.55 c Solving Time : 0.48
0.49/0.55 c Original Problem :
0.49/0.55 c Problem name : HOME/instance-2667381-1276327795.opb
0.49/0.55 c Variables : 338 (338 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.55 c Constraints : 270 initial, 270 maximal
0.49/0.55 c Presolved Problem :
0.49/0.55 c Problem name : t_HOME/instance-2667381-1276327795.opb
0.49/0.55 c Variables : 338 (338 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.55 c Constraints : 270 initial, 270 maximal
0.49/0.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.55 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c probing : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c setppc : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.55 c root node : - 0 - - 0 - - - -
0.49/0.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.55 c integral : 0 0 0 9 0 0 0 0 0 16
0.49/0.55 c setppc : 30 5 17 1 0 0 90 0 0 0
0.49/0.55 c logicor : 240 5 8 1 0 0 0 0 0 0
0.49/0.55 c countsols : 0 0 0 1 0 0 0 0 0 0
0.49/0.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.55 c integral : 0.17 0.00 0.00 0.17 0.00
0.49/0.55 c setppc : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c Propagators : Time Calls Cutoffs DomReds
0.49/0.55 c vbounds : 0.00 1 0 0
0.49/0.55 c rootredcost : 0.00 0 0 0
0.49/0.55 c pseudoobj : 0.00 0 0 0
0.49/0.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.55 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.55 c applied globally : - - - 0 0.0 - - -
0.49/0.55 c applied locally : - - - 0 0.0 - - -
0.49/0.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.55 c cut pool : 0.00 4 - - 0 - (maximal pool size: 340)
0.49/0.55 c redcost : 0.00 13 0 0 0 0
0.49/0.55 c impliedbounds : 0.00 5 0 0 0 0
0.49/0.55 c intobj : 0.00 0 0 0 0 0
0.49/0.55 c cgmip : 0.00 0 0 0 0 0
0.49/0.55 c gomory : 0.09 5 0 0 937 0
0.49/0.55 c strongcg : 0.09 5 0 0 1110 0
0.49/0.55 c cmir : 0.00 0 0 0 0 0
0.49/0.55 c flowcover : 0.00 0 0 0 0 0
0.49/0.55 c clique : 0.00 5 0 0 0 0
0.49/0.55 c zerohalf : 0.00 0 0 0 0 0
0.49/0.55 c mcf : 0.00 1 0 0 0 0
0.49/0.55 c rapidlearning : 0.02 1 0 0 0 0
0.49/0.55 c Pricers : Time Calls Vars
0.49/0.55 c problem variables: 0.00 0 0
0.49/0.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.55 c relpscost : 0.17 8 0 0 0 0 16
0.49/0.55 c pscost : 0.00 0 0 0 0 0 0
0.49/0.55 c inference : 0.00 0 0 0 0 0 0
0.49/0.55 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.55 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.55 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.55 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.55 c random : 0.00 0 0 0 0 0 0
0.49/0.55 c Primal Heuristics : Time Calls Found
0.49/0.55 c LP solutions : 0.00 - 1
0.49/0.55 c pseudo solutions : 0.00 - 0
0.49/0.55 c trivial : 0.00 1 0
0.49/0.55 c simplerounding : 0.00 0 0
0.49/0.55 c zirounding : 0.00 0 0
0.49/0.55 c rounding : 0.00 0 0
0.49/0.55 c shifting : 0.00 0 0
0.49/0.55 c intshifting : 0.00 0 0
0.49/0.55 c oneopt : 0.00 0 0
0.49/0.55 c twoopt : 0.00 0 0
0.49/0.55 c fixandinfer : 0.00 0 0
0.49/0.55 c feaspump : 0.00 0 0
0.49/0.55 c coefdiving : 0.00 0 0
0.49/0.55 c pscostdiving : 0.00 0 0
0.49/0.55 c fracdiving : 0.00 0 0
0.49/0.55 c veclendiving : 0.00 0 0
0.49/0.55 c intdiving : 0.00 0 0
0.49/0.55 c actconsdiving : 0.00 0 0
0.49/0.55 c objpscostdiving : 0.00 0 0
0.49/0.55 c rootsoldiving : 0.00 0 0
0.49/0.55 c linesearchdiving : 0.00 0 0
0.49/0.55 c guideddiving : 0.00 0 0
0.49/0.55 c octane : 0.00 0 0
0.49/0.55 c rens : 0.00 0 0
0.49/0.55 c rins : 0.00 0 0
0.49/0.55 c localbranching : 0.00 0 0
0.49/0.55 c mutation : 0.00 0 0
0.49/0.55 c crossover : 0.00 0 0
0.49/0.55 c dins : 0.00 0 0
0.49/0.55 c undercover : 0.00 0 0
0.49/0.55 c nlp : 0.00 0 0
0.49/0.55 c trysol : 0.00 0 0
0.49/0.55 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.55 c primal LP : 0.00 0 0 0.00 -
0.49/0.55 c dual LP : 0.07 14 922 65.86 13171.43
0.49/0.55 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.55 c barrier LP : 0.00 0 0 0.00 -
0.49/0.55 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.55 c strong branching : 0.17 105 1321 12.58 7770.59
0.49/0.55 c (at root node) : - 18 309 17.17 -
0.49/0.55 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.55 c B&B Tree :
0.49/0.55 c number of runs : 1
0.49/0.55 c nodes : 9
0.49/0.55 c nodes (total) : 9
0.49/0.55 c nodes left : 0
0.49/0.55 c max depth : 8
0.49/0.55 c max depth (total): 8
0.49/0.55 c backtracks : 0 (0.0%)
0.49/0.55 c delayed cutoffs : 0
0.49/0.55 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.55 c avg switch length: 2.00
0.49/0.55 c switching time : 0.00
0.49/0.55 c Solution :
0.49/0.55 c Solutions found : 1 (1 improvements)
0.49/0.55 c First Solution : +0.00000000000000e+00 (in run 1, after 9 nodes, 0.48 seconds, depth 8, found by <relaxation>)
0.49/0.55 c Primal Bound : +0.00000000000000e+00 (in run 1, after 9 nodes, 0.48 seconds, depth 8, found by <relaxation>)
0.49/0.55 c Dual Bound : +0.00000000000000e+00
0.49/0.55 c Gap : 0.00 %
0.49/0.55 c Root Dual Bound : +0.00000000000000e+00
0.49/0.55 c Root Iterations : 841
0.49/0.56 c Time complete: 0.55.