0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1867994-1245114082.opb>
0.00/0.02 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 573 constraints
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.00/0.03 c (round 2) 14 del vars, 18 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.00/0.03 c (round 3) 14 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 302 impls, 0 clqs
0.02/0.05 c (round 4) 14 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 544 upgd conss, 302 impls, 0 clqs
0.02/0.05 c (round 5) 20 del vars, 29 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 544 upgd conss, 6476 impls, 6 clqs
0.02/0.06 c presolving (6 rounds):
0.02/0.06 c 20 deleted vars, 29 deleted constraints, 12 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.06 c 6476 implications, 6 cliques
0.02/0.06 c presolved problem has 246 variables (246 bin, 0 int, 0 impl, 0 cont) and 544 constraints
0.02/0.06 c 162 constraints of type <knapsack>
0.02/0.06 c 382 constraints of type <logicor>
0.02/0.06 c transformed objective value is always integral (scale: 1)
0.02/0.06 c Presolving Time: 0.03
0.02/0.06 c SATUNSAT-LIN
0.02/0.06 c -----------------------------------------------------------------------------------------------
0.02/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c separating/flowcover/freq = c -1
0.02/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c separating/cmir/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/veclendiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.02/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/veclendiving/freq = c -1
0.02/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/simplerounding/freq = c -1
0.02/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/shifting/freq = c -1
0.02/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/rounding/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.06 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.02/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.06 c heuristics/rootsoldiving/freq = c -1
0.02/0.06 c # number of nodes added to the contingent of the total nodes
0.02/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.06 c heuristics/rens/nodesofs = c 2000
0.02/0.06 c # minimum percentage of integer variables that have to be fixable
0.02/0.06 c # [type: real, range: [0,1], default: 0.5]
0.02/0.06 c heuristics/rens/minfixingrate = c 0.3
0.02/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c heuristics/rens/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.02/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/pscostdiving/freq = c -1
0.02/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/oneopt/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.06 c # [type: real, range: [0,1], default: 0.01]
0.02/0.06 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.02/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.06 c heuristics/objpscostdiving/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.02/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/linesearchdiving/freq = c -1
0.02/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/intshifting/freq = c -1
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/intdiving/maxlpiterquot = c 0.075
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/guideddiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.02/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/guideddiving/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/fracdiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.02/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/fracdiving/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/feaspump/maxlpiterofs = c 2000
0.02/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.06 c heuristics/feaspump/freq = c -1
0.02/0.06 c # minimum percentage of integer variables that have to be fixed
0.02/0.06 c # [type: real, range: [0,1], default: 0.666]
0.02/0.06 c heuristics/crossover/minfixingrate = c 0.5
0.02/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.06 c # [type: real, range: [0,1], default: 0.1]
0.02/0.06 c heuristics/crossover/nodesquot = c 0.15
0.02/0.06 c # number of nodes without incumbent change that heuristic should wait
0.02/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.06 c heuristics/crossover/nwaitingnodes = c 100
0.02/0.06 c # number of nodes added to the contingent of the total nodes
0.02/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.06 c heuristics/crossover/nodesofs = c 750
0.02/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.06 c heuristics/crossover/freq = c -1
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/coefdiving/maxlpiterofs = c 1500
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.02/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/coefdiving/freq = c -1
0.02/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c presolving/probing/maxrounds = c 0
0.02/0.06 c # should presolving try to simplify knapsacks
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/knapsack/simplifyinequalities = c TRUE
0.02/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.06 c constraints/knapsack/disaggregation = c FALSE
0.02/0.06 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c constraints/knapsack/maxnumcardlift = c 0
0.02/0.06 c # should presolving try to simplify inequalities
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/linear/simplifyinequalities = c TRUE
0.02/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c separating/maxroundsroot = c 5
0.02/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.06 c separating/maxrounds = c 1
0.02/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c limits/solutions = c 1
0.02/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/memory = c 1620
0.02/0.06 c # maximal time in seconds to run
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/time = c 1791
0.02/0.06 c # frequency for displaying node information lines
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.06 c display/freq = c 10000
0.02/0.06 c -----------------------------------------------------------------------------------------------
0.02/0.06 c start solving problem
0.02/0.06 c
0.09/0.18 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.18 c 0.1s| 1 | 0 | 1024 |1725k| 0 | 175 | 246 | 544 | 544 | 246 | 538 | 0 | 0 | 0 | 3.845928e+01 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 1692 |3549k| 0 | 214 | 246 | 544 | 544 | 246 | 921 | 383 | 0 | 0 | 4.571453e+01 | -- | Inf
1.00/1.02 c 1.0s| 1 | 0 | 2074 |5679k| 0 | 220 | 246 | 544 | 544 | 246 |1022 | 484 | 0 | 0 | 4.649851e+01 | -- | Inf
1.29/1.32 c 1.3s| 1 | 0 | 2193 |7414k| 0 | 222 | 246 | 544 | 544 | 246 |1026 | 488 | 0 | 0 | 4.658770e+01 | -- | Inf
1.59/1.66 c 1.6s| 1 | 0 | 2288 |8985k| 0 | 221 | 246 | 544 | 544 | 246 |1029 | 491 | 0 | 0 | 4.661156e+01 | -- | Inf
1.89/1.99 c 1.9s| 1 | 0 | 2394 | 10M| 0 | 222 | 246 | 544 | 544 | 246 |1033 | 495 | 0 | 0 | 4.663739e+01 | -- | Inf
14.29/14.32 c 14.2s| 1 | 2 | 2394 | 10M| 0 | 222 | 246 | 544 | 544 | 246 |1033 | 495 | 0 | 41 | 4.663739e+01 | -- | Inf
35.98/36.09 c *35.7s| 108 | 18 | 8382 | 10M| 17 | - | 246 | 559 | 38 | 246 | 805 | 495 | 15 | 918 | 4.784231e+01 | 6.800000e+01 | 42.13%
35.98/36.09 c
35.98/36.09 c SCIP Status : solving was interrupted [solution limit reached]
35.98/36.09 c Solving Time (sec) : 35.72
35.98/36.09 c Solving Nodes : 108
35.98/36.09 c Primal Bound : +6.80000000000000e+01 (1 solutions)
35.98/36.09 c Dual Bound : +4.78423075675305e+01
35.98/36.09 c Gap : 42.13 %
35.98/36.10 c NODE 108
35.98/36.10 c DUAL BOUND 47.8423
35.98/36.10 c PRIMAL BOUND 68
35.98/36.10 c GAP 0.421336
35.98/36.10 s SATISFIABLE
35.98/36.10 v x265 -x266 -x263 x264 x261 -x262 -x259 -x260 x257 -x258 -x255 x256 -x253 -x254 -x251 x252 -x249 x250 -x247 -x248 -x245 x246 x243
35.98/36.10 v -x244 -x241 -x242 x239 -x240 -x237 x238 x235 -x236 -x233 x234 x231 -x232 -x229 x230 x227 -x228 -x225 x226 -x223 -x224 -x221
35.98/36.10 v x222 -x219 -x220 -x217 x218 -x215 x216 -x213 -x214 -x211 x212 -x209 -x210 -x207 x208 x205 -x206 -x203 x204 x201 -x202 -x199
35.98/36.10 v x200 -x197 x198 x195 -x196 x193 -x194 x191 -x192 x189 -x190 x187 -x188 -x185 x186 x183 -x184 -x181 x182 -x179 x180 x177 -x178
35.98/36.10 v -x175 x176 x173 -x174 x171 -x172 x169 -x170 -x167 x168 x165 -x166 -x163 x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148
35.98/36.10 v -x146 -x144 -x142 x140 -x138 x136 -x134 -x132 -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106
35.98/36.10 v x104 -x102 x100 -x98 -x96 -x94 -x92 -x90 x88 -x86 x84 -x82 x80 -x78 x76 -x74 -x72 -x70 x68 -x66 x64 -x62 -x60 -x58 -x56 -x54
35.98/36.10 v -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36 -x34 x32 -x30 x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 x161
35.98/36.10 v -x159 -x157 -x155 -x153 -x151 x149 -x147 x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 x125 -x123 -x121 -x119
35.98/36.10 v -x117 -x115 x113 -x111 x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71
35.98/36.10 v -x69 -x67 -x65 -x63 -x61 -x59 -x57 -x55 x53 -x51 -x49 -x47 -x45 -x43 x41 -x39 x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21
35.98/36.10 v -x19 x17 -x15 -x13 -x11 -x9 -x7 x5 -x3 x1
35.98/36.10 c SCIP Status : solving was interrupted [solution limit reached]
35.98/36.10 c Solving Time : 35.72
35.98/36.10 c Original Problem :
35.98/36.10 c Problem name : HOME/instance-1867994-1245114082.opb
35.98/36.10 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
35.98/36.10 c Constraints : 573 initial, 573 maximal
35.98/36.10 c Presolved Problem :
35.98/36.10 c Problem name : t_HOME/instance-1867994-1245114082.opb
35.98/36.10 c Variables : 246 (246 binary, 0 integer, 0 implicit integer, 0 continuous)
35.98/36.10 c Constraints : 544 initial, 559 maximal
35.98/36.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
35.98/36.10 c trivial : 0.00 0 0 0 0 0 0 0 0
35.98/36.10 c dualfix : 0.00 0 0 0 0 0 0 0 0
35.98/36.10 c boundshift : 0.00 0 0 0 0 0 0 0 0
35.98/36.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0
35.98/36.10 c implics : 0.00 0 8 0 0 0 0 0 0
35.98/36.10 c probing : 0.00 0 0 0 0 0 0 0 0
35.98/36.10 c knapsack : 0.00 0 0 0 0 0 0 0 0
35.98/36.10 c linear : 0.02 12 0 0 12 0 29 0 0
35.98/36.10 c logicor : 0.01 0 0 0 0 0 0 0 0
35.98/36.10 c root node : - 0 - - 0 - - - -
35.98/36.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
35.98/36.10 c integral : 0 0 0 97 0 2 80 0 0 126
35.98/36.10 c knapsack : 162 5 419 1 0 27 1214 233 0 0
35.98/36.10 c logicor : 382+ 5 335 1 0 3 619 0 0 0
35.98/36.10 c countsols : 0 0 0 1 0 0 0 0 0 0
35.98/36.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
35.98/36.10 c integral : 32.14 0.00 0.00 32.14 0.00
35.98/36.10 c knapsack : 0.00 0.00 0.00 0.00 0.00
35.98/36.10 c logicor : 0.01 0.00 0.01 0.00 0.00
36.07/36.10 c countsols : 0.00 0.00 0.00 0.00 0.00
36.07/36.10 c Propagators : Time Calls Cutoffs DomReds
36.07/36.10 c rootredcost : 0.00 0 0 0
36.07/36.10 c pseudoobj : 0.00 425 0 0
36.07/36.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
36.07/36.10 c propagation : 0.00 12 9 57 39.8 1 56.0 -
36.07/36.10 c infeasible LP : 0.00 12 0 0 0.0 0 0.0 0
36.07/36.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
36.07/36.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
36.07/36.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
36.07/36.10 c applied globally : - - - 15 13.3 - - -
36.07/36.10 c applied locally : - - - 0 0.0 - - -
36.07/36.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
36.07/36.10 c cut pool : 0.00 4 - - 137 - (maximal pool size: 2493)
36.07/36.10 c redcost : 0.01 79 0 0 0 0
36.07/36.10 c impliedbounds : 0.00 5 0 0 636 0
36.07/36.10 c intobj : 0.00 0 0 0 0 0
36.07/36.10 c gomory : 0.61 5 0 0 58 0
36.07/36.10 c strongcg : 0.58 5 0 0 2248 0
36.07/36.10 c cmir : 0.00 0 0 0 0 0
36.07/36.10 c flowcover : 0.00 0 0 0 0 0
36.07/36.10 c clique : 0.00 5 0 0 13 0
36.07/36.10 c zerohalf : 0.00 0 0 0 0 0
36.07/36.10 c mcf : 0.00 1 0 0 0 0
36.07/36.10 c Pricers : Time Calls Vars
36.07/36.10 c problem variables: 0.00 0 0
36.07/36.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
36.07/36.10 c relpscost : 32.14 96 2 80 0 0 126
36.07/36.10 c pscost : 0.00 0 0 0 0 0 0
36.07/36.10 c inference : 0.00 0 0 0 0 0 0
36.07/36.10 c mostinf : 0.00 0 0 0 0 0 0
36.07/36.10 c leastinf : 0.00 0 0 0 0 0 0
36.07/36.10 c fullstrong : 0.00 0 0 0 0 0 0
36.07/36.10 c allfullstrong : 0.00 0 0 0 0 0 0
36.07/36.10 c random : 0.00 0 0 0 0 0 0
36.07/36.10 c Primal Heuristics : Time Calls Found
36.07/36.10 c LP solutions : 0.00 - 1
36.07/36.10 c pseudo solutions : 0.00 - 0
36.07/36.10 c simplerounding : 0.00 0 0
36.07/36.10 c rounding : 0.00 0 0
36.07/36.10 c shifting : 0.00 0 0
36.07/36.10 c intshifting : 0.00 0 0
36.07/36.10 c oneopt : 0.00 0 0
36.07/36.10 c fixandinfer : 0.00 0 0
36.07/36.10 c feaspump : 0.00 0 0
36.07/36.10 c coefdiving : 0.00 0 0
36.07/36.10 c pscostdiving : 0.00 0 0
36.07/36.10 c fracdiving : 0.00 0 0
36.07/36.10 c veclendiving : 0.00 0 0
36.07/36.10 c intdiving : 0.00 0 0
36.07/36.10 c actconsdiving : 0.00 0 0
36.07/36.10 c objpscostdiving : 0.00 0 0
36.07/36.10 c rootsoldiving : 0.00 0 0
36.07/36.10 c linesearchdiving : 0.00 0 0
36.07/36.10 c guideddiving : 0.00 0 0
36.07/36.10 c octane : 0.00 0 0
36.07/36.10 c rens : 0.00 0 0
36.07/36.10 c rins : 0.00 0 0
36.07/36.10 c localbranching : 0.00 0 0
36.07/36.10 c mutation : 0.00 0 0
36.07/36.10 c crossover : 0.00 0 0
36.07/36.10 c dins : 0.00 0 0
36.07/36.10 c LP : Time Calls Iterations Iter/call Iter/sec
36.07/36.10 c primal LP : 0.00 0 0 0.00 -
36.07/36.10 c dual LP : 2.24 114 8382 73.53 3741.96
36.07/36.10 c barrier LP : 0.00 0 0 0.00 -
36.07/36.10 c diving/probing LP: 0.00 0 0 0.00 -
36.07/36.10 c strong branching : 32.12 918 108489 118.18 3377.62
36.07/36.10 c (at root node) : - 41 28596 697.46 -
36.07/36.10 c conflict analysis: 0.00 0 0 0.00 -
36.07/36.10 c B&B Tree :
36.07/36.10 c number of runs : 1
36.07/36.10 c nodes : 108
36.07/36.10 c nodes (total) : 108
36.07/36.10 c nodes left : 18
36.07/36.10 c max depth : 17
36.07/36.10 c max depth (total): 17
36.07/36.10 c backtracks : 13 (12.0%)
36.07/36.10 c delayed cutoffs : 0
36.07/36.10 c repropagations : 12 (27 domain reductions, 0 cutoffs)
36.07/36.10 c avg switch length: 2.08
36.07/36.10 c switching time : 0.01
36.07/36.10 c Solution :
36.07/36.10 c Solutions found : 1 (1 improvements)
36.07/36.10 c Primal Bound : +6.80000000000000e+01 (in run 1, after 108 nodes, 35.72 seconds, depth 14, found by <relaxation>)
36.07/36.10 c Dual Bound : +4.78423075675305e+01
36.07/36.10 c Gap : 42.13 %
36.07/36.10 c Root Dual Bound : +4.66373887198557e+01
36.07/36.11 c Time complete: 36.09.