0.00/0.09 c SCIP version 1.1.0.7
0.00/0.09 c LP-Solver SoPlex 1.4.1
0.00/0.09 c user parameter file <scip.set> not found - using default parameters
0.00/0.09 c read problem <HOME/instance-1884957-1245260865.opb>
0.00/0.09 c original problem has 340 variables (340 bin, 0 int, 0 impl, 0 cont) and 5967 constraints
0.10/0.10 c No objective function, only one solution is needed.
0.10/0.10 c start presolving problem
0.10/0.10 c presolving:
0.10/0.18 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5967 upgd conss, 11900 impls, 0 clqs
0.10/0.19 c presolving (2 rounds):
0.10/0.19 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.19 c 11900 implications, 0 cliques
0.10/0.19 c presolved problem has 340 variables (340 bin, 0 int, 0 impl, 0 cont) and 5967 constraints
0.10/0.19 c 5967 constraints of type <logicor>
0.10/0.19 c transformed objective value is always integral (scale: 1)
0.10/0.19 c Presolving Time: 0.08
0.10/0.19 c PURESAT
0.10/0.19 c -----------------------------------------------------------------------------------------------
0.10/0.19 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.19 c separating/flowcover/freq = c -1
0.10/0.19 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.19 c separating/cmir/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/veclendiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.19 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.10/0.19 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/veclendiving/freq = c -1
0.10/0.19 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.19 c heuristics/simplerounding/freq = c -1
0.10/0.19 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/shifting/freq = c -1
0.10/0.19 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.19 c heuristics/rounding/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.19 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.10/0.19 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.19 c heuristics/rootsoldiving/freq = c -1
0.10/0.19 c # number of nodes added to the contingent of the total nodes
0.10/0.19 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.19 c heuristics/rens/nodesofs = c 2000
0.10/0.19 c # minimum percentage of integer variables that have to be fixable
0.10/0.19 c # [type: real, range: [0,1], default: 0.5]
0.10/0.19 c heuristics/rens/minfixingrate = c 0.3
0.10/0.19 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.19 c heuristics/rens/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.19 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.10/0.19 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/pscostdiving/freq = c -1
0.10/0.19 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.19 c heuristics/oneopt/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.19 c # [type: real, range: [0,1], default: 0.01]
0.10/0.19 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.10/0.19 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.19 c heuristics/objpscostdiving/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.19 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.10/0.19 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/linesearchdiving/freq = c -1
0.10/0.19 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/intshifting/freq = c -1
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.19 c heuristics/intdiving/maxlpiterquot = c 0.075
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/guideddiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.19 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.10/0.19 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/guideddiving/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/fracdiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.19 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.10/0.19 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/fracdiving/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/feaspump/maxlpiterofs = c 2000
0.10/0.19 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.19 c heuristics/feaspump/freq = c -1
0.10/0.19 c # minimum percentage of integer variables that have to be fixed
0.10/0.19 c # [type: real, range: [0,1], default: 0.666]
0.10/0.19 c heuristics/crossover/minfixingrate = c 0.5
0.10/0.19 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.19 c # [type: real, range: [0,1], default: 0.1]
0.10/0.19 c heuristics/crossover/nodesquot = c 0.15
0.10/0.19 c # number of nodes without incumbent change that heuristic should wait
0.10/0.19 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.19 c heuristics/crossover/nwaitingnodes = c 100
0.10/0.19 c # number of nodes added to the contingent of the total nodes
0.10/0.19 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.19 c heuristics/crossover/nodesofs = c 750
0.10/0.19 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.19 c heuristics/crossover/freq = c -1
0.10/0.19 c # additional number of allowed LP iterations
0.10/0.19 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.19 c heuristics/coefdiving/maxlpiterofs = c 1500
0.10/0.19 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.19 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.19 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.10/0.19 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.19 c heuristics/coefdiving/freq = c -1
0.10/0.19 c # priority of node selection rule <dfs> in standard mode
0.10/0.19 c # [type: int, range: [-536870912,536870911], default: 0]
0.10/0.19 c nodeselection/dfs/stdpriority = c 1000000
0.10/0.19 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.19 c presolving/probing/maxrounds = c 0
0.10/0.19 c # should presolving try to simplify knapsacks
0.10/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.19 c constraints/knapsack/simplifyinequalities = c TRUE
0.10/0.19 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.19 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.19 c constraints/knapsack/disaggregation = c FALSE
0.10/0.19 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.19 c constraints/knapsack/maxnumcardlift = c 0
0.10/0.19 c # should presolving try to simplify inequalities
0.10/0.19 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.19 c constraints/linear/simplifyinequalities = c TRUE
0.10/0.19 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.19 c separating/maxroundsroot = c 5
0.10/0.19 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.19 c separating/maxrounds = c 1
0.10/0.19 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.10/0.19 c # [type: char, range: {lafpsqd}, default: l]
0.10/0.19 c lp/pricing = c a
0.10/0.19 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.19 c lp/solvefreq = c 0
0.10/0.19 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.19 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.20 c limits/solutions = c 1
0.10/0.20 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.20 c limits/memory = c 1620
0.10/0.20 c # maximal time in seconds to run
0.10/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.20 c limits/time = c 1791
0.10/0.20 c # frequency for displaying node information lines
0.10/0.20 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.20 c display/freq = c 10000
0.10/0.20 c # should enforcement of pseudo solution be disabled?
0.10/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.20 c constraints/disableenfops = c TRUE
0.10/0.20 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.10/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.20 c constraints/agelimit = c 1
0.10/0.20 c # should binary conflicts be preferred?
0.10/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.20 c conflict/preferbinary = c TRUE
0.10/0.20 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.10/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.20 c conflict/interconss = c 0
0.10/0.20 c -----------------------------------------------------------------------------------------------
0.10/0.20 c start solving problem
0.10/0.20 c
0.19/0.23 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.23 c 0.1s| 1 | 0 | 34 |7403k| 0 | 34 | 340 |5967 |5967 | 340 |5967 | 0 | 0 | 0 | 1.700000e+01 | -- | Inf
0.39/0.41 c 0.3s| 1 | 0 | 105 |7405k| 0 | 30 | 340 |5967 |5967 | 340 |5970 | 3 | 0 | 0 | 1.700000e+01 | -- | Inf
0.49/0.57 c 0.5s| 1 | 0 | 148 |7421k| 0 | 26 | 340 |5967 |5967 | 340 |5974 | 7 | 0 | 0 | 1.700000e+01 | -- | Inf
0.69/0.78 c 0.7s| 1 | 0 | 207 |7504k| 0 | 22 | 340 |5967 |5967 | 340 |5980 | 13 | 0 | 0 | 1.700000e+01 | -- | Inf
0.89/0.99 c 0.9s| 1 | 0 | 280 |7615k| 0 | 20 | 340 |5967 |5967 | 340 |5985 | 18 | 0 | 0 | 1.700000e+01 | -- | Inf
1.29/1.30 c 1.2s| 1 | 0 | 433 |7829k| 0 | 0 | 340 |5967 |5967 | 340 |5989 | 22 | 0 | 0 | 1.700000e+01 | -- | Inf
1.29/1.30 c * 1.2s| 1 | 0 | 433 |7834k| 0 | - | 340 |5967 |5967 | 340 |5989 | 22 | 0 | 0 | 1.700000e+01 | 1.700000e+01 | 0.00%
1.29/1.30 c
1.29/1.30 c SCIP Status : problem is solved [optimal solution found]
1.29/1.30 c Solving Time (sec) : 1.16
1.29/1.30 c Solving Nodes : 1
1.29/1.30 c Primal Bound : +1.70000000000000e+01 (1 solutions)
1.29/1.30 c Dual Bound : +1.70000000000000e+01
1.29/1.30 c Gap : 0.00 %
1.29/1.30 c NODE 1
1.29/1.30 c DUAL BOUND 17
1.29/1.30 c PRIMAL BOUND 17
1.29/1.30 c GAP 0
1.29/1.30 s SATISFIABLE
1.29/1.30 v -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319
1.29/1.30 v -x318 -x317 -x316 x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 x299 -x298
1.29/1.30 v -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277
1.29/1.30 v -x276 -x275 -x274 -x273 -x272 x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256
1.29/1.30 v -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235
1.29/1.30 v -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 x221 -x220 -x219 x218 -x217 -x216 -x215 -x214
1.29/1.30 v -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 x194 -x193
1.29/1.30 v -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172
1.29/1.30 v -x171 -x170 -x169 -x168 x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151
1.29/1.30 v -x150 -x149 -x148 -x147 -x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130
1.29/1.30 v -x129 x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109
1.29/1.30 v -x108 -x107 -x106 -x105 -x104 -x103 x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86
1.29/1.30 v -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61
1.29/1.30 v -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35
1.29/1.30 v -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 x12 -x11 -x10
1.29/1.30 v -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.29/1.30 c SCIP Status : problem is solved [optimal solution found]
1.29/1.30 c Solving Time : 1.16
1.29/1.30 c Original Problem :
1.29/1.30 c Problem name : HOME/instance-1884957-1245260865.opb
1.29/1.30 c Variables : 340 (340 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.30 c Constraints : 5967 initial, 5967 maximal
1.29/1.30 c Presolved Problem :
1.29/1.30 c Problem name : t_HOME/instance-1884957-1245260865.opb
1.29/1.30 c Variables : 340 (340 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.30 c Constraints : 5967 initial, 5967 maximal
1.29/1.30 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.30 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.30 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.30 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.30 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.30 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.30 c probing : 0.00 0 0 0 0 0 0 0 0
1.29/1.30 c logicor : 0.03 0 0 0 0 0 0 0 0
1.29/1.30 c root node : - 0 - - 0 - - - -
1.29/1.30 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.30 c integral : 0 0 0 1 0 0 0 0 0 0
1.29/1.30 c logicor : 5967 5 1 1 0 0 0 0 0 0
1.29/1.30 c countsols : 0 0 0 1 0 0 0 0 0 0
1.29/1.30 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.30 c integral : 0.00 0.00 0.00 0.00 0.00
1.29/1.30 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.30 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.30 c Propagators : Time Calls Cutoffs DomReds
1.29/1.30 c rootredcost : 0.00 0 0 0
1.29/1.30 c pseudoobj : 0.00 2 0 0
1.29/1.30 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.30 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.30 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.30 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.30 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.30 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.30 c applied globally : - - - 0 0.0 - - -
1.29/1.30 c applied locally : - - - 0 0.0 - - -
1.29/1.30 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.30 c cut pool : 0.00 4 - - 0 - (maximal pool size: 184)
1.29/1.30 c redcost : 0.00 5 0 0 0 0
1.29/1.30 c impliedbounds : 0.00 5 0 0 0 0
1.29/1.30 c intobj : 0.00 0 0 0 0 0
1.29/1.30 c gomory : 0.40 5 0 0 2239 0
1.29/1.30 c strongcg : 0.38 5 0 0 2500 0
1.29/1.30 c cmir : 0.00 0 0 0 0 0
1.29/1.30 c flowcover : 0.00 0 0 0 0 0
1.29/1.30 c clique : 0.00 5 0 0 10 0
1.29/1.30 c zerohalf : 0.00 0 0 0 0 0
1.29/1.30 c mcf : 0.01 1 0 0 0 0
1.29/1.30 c Pricers : Time Calls Vars
1.29/1.30 c problem variables: 0.00 0 0
1.29/1.30 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.30 c pscost : 0.00 0 0 0 0 0 0
1.29/1.30 c inference : 0.00 0 0 0 0 0 0
1.29/1.30 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.30 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.30 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.30 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.30 c random : 0.00 0 0 0 0 0 0
1.29/1.30 c relpscost : 0.00 0 0 0 0 0 0
1.29/1.30 c Primal Heuristics : Time Calls Found
1.29/1.30 c LP solutions : 0.00 - 1
1.29/1.30 c pseudo solutions : 0.00 - 0
1.29/1.30 c simplerounding : 0.00 0 0
1.29/1.30 c rounding : 0.00 0 0
1.29/1.30 c shifting : 0.00 0 0
1.29/1.30 c intshifting : 0.00 0 0
1.29/1.30 c oneopt : 0.00 0 0
1.29/1.30 c fixandinfer : 0.00 0 0
1.29/1.30 c feaspump : 0.00 0 0
1.29/1.30 c coefdiving : 0.00 0 0
1.29/1.30 c pscostdiving : 0.00 0 0
1.29/1.30 c fracdiving : 0.00 0 0
1.29/1.30 c veclendiving : 0.00 0 0
1.29/1.30 c intdiving : 0.00 0 0
1.29/1.30 c actconsdiving : 0.00 0 0
1.29/1.30 c objpscostdiving : 0.00 0 0
1.29/1.30 c rootsoldiving : 0.00 0 0
1.29/1.30 c linesearchdiving : 0.00 0 0
1.29/1.30 c guideddiving : 0.00 0 0
1.29/1.30 c octane : 0.00 0 0
1.29/1.30 c rens : 0.00 0 0
1.29/1.30 c rins : 0.00 0 0
1.29/1.30 c localbranching : 0.00 0 0
1.29/1.30 c mutation : 0.00 0 0
1.29/1.30 c crossover : 0.00 0 0
1.29/1.30 c dins : 0.00 0 0
1.29/1.30 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.30 c primal LP : 0.00 0 0 0.00 -
1.29/1.30 c dual LP : 0.24 6 433 72.17 1804.17
1.29/1.30 c barrier LP : 0.00 0 0 0.00 -
1.29/1.30 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.30 c strong branching : 0.00 0 0 0.00 -
1.29/1.30 c (at root node) : - 0 0 0.00 -
1.29/1.30 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.30 c B&B Tree :
1.29/1.30 c number of runs : 1
1.29/1.30 c nodes : 1
1.29/1.30 c nodes (total) : 1
1.29/1.30 c nodes left : 0
1.29/1.30 c max depth : 0
1.29/1.30 c max depth (total): 0
1.29/1.30 c backtracks : 0 (0.0%)
1.29/1.30 c delayed cutoffs : 0
1.29/1.30 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.30 c avg switch length: 2.00
1.29/1.30 c switching time : 0.00
1.29/1.30 c Solution :
1.29/1.30 c Solutions found : 1 (1 improvements)
1.29/1.30 c Primal Bound : +1.70000000000000e+01 (in run 1, after 1 nodes, 1.16 seconds, depth 0, found by <relaxation>)
1.29/1.30 c Dual Bound : +1.70000000000000e+01
1.29/1.30 c Gap : 0.00 %
1.29/1.30 c Root Dual Bound : +1.70000000000000e+01
1.29/1.33 c Time complete: 1.32.