0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver Clp 1.8.2
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1867995-1245114105.opb>
0.00/0.02 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 573 constraints
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c start presolving problem
0.01/0.02 c presolving:
0.01/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.01/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.01/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.01/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.01/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.01/0.06 c presolving (6 rounds):
0.01/0.06 c 20 deleted vars, 29 deleted constraints, 12 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.06 c 6476 implications, 6 cliques
0.01/0.06 c presolved problem has 246 variables (246 bin, 0 int, 0 impl, 0 cont) and 544 constraints
0.01/0.06 c 162 constraints of type <knapsack>
0.01/0.06 c 382 constraints of type <logicor>
0.01/0.06 c transformed objective value is always integral (scale: 1)
0.01/0.06 c Presolving Time: 0.03
0.01/0.06 c SATUNSAT-LIN
0.01/0.06 c -----------------------------------------------------------------------------------------------
0.01/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/flowcover/freq = c -1
0.01/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/cmir/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/veclendiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.01/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/veclendiving/freq = c -1
0.01/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/simplerounding/freq = c -1
0.01/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/shifting/freq = c -1
0.01/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/rounding/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.01/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/rootsoldiving/freq = c -1
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/rens/nodesofs = c 2000
0.01/0.06 c # minimum percentage of integer variables that have to be fixable
0.01/0.06 c # [type: real, range: [0,1], default: 0.5]
0.01/0.06 c heuristics/rens/minfixingrate = c 0.3
0.01/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/rens/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.01/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/pscostdiving/freq = c -1
0.01/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/oneopt/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.06 c # [type: real, range: [0,1], default: 0.01]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.01/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/objpscostdiving/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.01/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/linesearchdiving/freq = c -1
0.01/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/intshifting/freq = c -1
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/intdiving/maxlpiterquot = c 0.075
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/guideddiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.01/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/guideddiving/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/fracdiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.01/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/fracdiving/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/feaspump/maxlpiterofs = c 2000
0.01/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/feaspump/freq = c -1
0.01/0.06 c # minimum percentage of integer variables that have to be fixed
0.01/0.06 c # [type: real, range: [0,1], default: 0.666]
0.01/0.06 c heuristics/crossover/minfixingrate = c 0.5
0.01/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.06 c # [type: real, range: [0,1], default: 0.1]
0.01/0.06 c heuristics/crossover/nodesquot = c 0.15
0.01/0.06 c # number of nodes without incumbent change that heuristic should wait
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.06 c heuristics/crossover/nwaitingnodes = c 100
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/crossover/nodesofs = c 750
0.01/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.06 c heuristics/crossover/freq = c -1
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/coefdiving/maxlpiterofs = c 1500
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.01/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/coefdiving/freq = c -1
0.01/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c presolving/probing/maxrounds = c 0
0.01/0.06 c # should presolving try to simplify knapsacks
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/knapsack/simplifyinequalities = c TRUE
0.01/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.06 c constraints/knapsack/disaggregation = c FALSE
0.01/0.06 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c constraints/knapsack/maxnumcardlift = c 0
0.01/0.06 c # should presolving try to simplify inequalities
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/linear/simplifyinequalities = c TRUE
0.01/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c separating/maxroundsroot = c 5
0.01/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.06 c separating/maxrounds = c 1
0.01/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c limits/solutions = c 1
0.01/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/memory = c 1620
0.01/0.06 c # maximal time in seconds to run
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/time = c 1791
0.01/0.06 c # frequency for displaying node information lines
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.06 c display/freq = c 10000
0.01/0.06 c -----------------------------------------------------------------------------------------------
0.01/0.06 c start solving problem
0.01/0.06 c
0.09/0.11 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.11 c 0.1s| 1 | 0 | 391 |1725k| 0 | 181 | 246 | 544 | 544 | 246 | 538 | 0 | 0 | 0 | 3.845928e+01 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 1067 |3649k| 0 | 216 | 246 | 544 | 544 | 246 | 818 | 280 | 0 | 0 | 4.605301e+01 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 1404 |5572k| 0 | 216 | 246 | 544 | 544 | 246 | 944 | 406 | 0 | 0 | 4.709615e+01 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 1556 |6407k| 0 | 222 | 246 | 544 | 544 | 246 | 995 | 457 | 0 | 0 | 4.718203e+01 | -- | Inf
1.29/1.35 c 1.3s| 1 | 0 | 1634 |7284k| 0 | 217 | 246 | 544 | 544 | 246 | 997 | 459 | 0 | 0 | 4.720662e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 1720 |8291k| 0 | 219 | 246 | 544 | 544 | 246 |1001 | 463 | 0 | 0 | 4.724178e+01 | -- | Inf
4.09/4.19 c 4.1s| 1 | 2 | 1720 |8292k| 0 | 219 | 246 | 544 | 544 | 246 |1001 | 463 | 0 | 50 | 4.724178e+01 | -- | Inf
110.24/110.36 c * 110s| 4423 | 930 |383890 | 10M| 43 | - | 246 |1118 | 82 | 246 | 830 | 463 |1008 |1717 | 5.253145e+01 | 7.000000e+01 | 33.25%
110.24/110.36 c
110.24/110.36 c SCIP Status : solving was interrupted [solution limit reached]
110.24/110.36 c Solving Time (sec) : 109.75
110.24/110.36 c Solving Nodes : 4423
110.24/110.36 c Primal Bound : +7.00000000000000e+01 (1 solutions)
110.24/110.36 c Dual Bound : +5.25314464155263e+01
110.24/110.36 c Gap : 33.25 %
110.24/110.36 c NODE 4423
110.24/110.36 c DUAL BOUND 52.5314
110.24/110.36 c PRIMAL BOUND 70
110.24/110.36 c GAP 0.332535
110.24/110.36 s SATISFIABLE
110.24/110.36 v x265 -x266 -x263 x264 x261 -x262 -x259 x260 x257 -x258 -x255 x256 -x253 -x254 -x251 x252 -x249 x250 -x247 -x248 -x245 -x246 x243
110.24/110.36 v -x244 -x241 x242 x239 -x240 -x237 x238 x235 -x236 -x233 x234 x231 -x232 -x229 x230 x227 -x228 -x225 x226 x223 -x224 -x221 x222
110.24/110.36 v -x219 -x220 -x217 x218 -x215 x216 -x213 -x214 -x211 -x212 x209 -x210 -x207 x208 x205 -x206 -x203 x204 x201 -x202 -x199 x200
110.24/110.36 v -x197 x198 x195 -x196 x193 -x194 x191 -x192 -x189 x190 x187 -x188 x185 -x186 x183 -x184 -x181 x182 -x179 x180 x177 -x178 x175
110.24/110.36 v -x176 x173 -x174 -x171 x172 x169 -x170 -x167 x168 x165 -x166 -x163 x164 -x162 -x160 -x158 -x156 -x154 -x152 -x150 -x148 -x146
110.24/110.36 v -x144 -x142 x140 -x138 -x136 -x134 x132 -x130 -x128 -x126 x124 -x122 x120 -x118 x116 -x114 x112 -x110 -x108 -x106 x104 -x102
110.24/110.36 v -x100 -x98 x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76 -x74 -x72 -x70 x68 -x66 -x64 -x62 x60 -x58 -x56 -x54 -x52
110.24/110.36 v -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
110.24/110.36 v -x159 -x157 -x155 x153 -x151 -x149 -x147 x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 -x125 -x123 -x121 -x119
110.24/110.36 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
110.24/110.36 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 -x19
110.24/110.36 v x17 -x15 -x13 -x11 x9 -x7 -x5 -x3 x1
110.24/110.36 c SCIP Status : solving was interrupted [solution limit reached]
110.24/110.36 c Solving Time : 109.75
110.24/110.36 c Original Problem :
110.24/110.36 c Problem name : HOME/instance-1867995-1245114105.opb
110.24/110.36 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
110.24/110.36 c Constraints : 573 initial, 573 maximal
110.24/110.36 c Presolved Problem :
110.24/110.36 c Problem name : t_HOME/instance-1867995-1245114105.opb
110.24/110.36 c Variables : 246 (246 binary, 0 integer, 0 implicit integer, 0 continuous)
110.24/110.36 c Constraints : 544 initial, 1129 maximal
110.24/110.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
110.24/110.36 c trivial : 0.00 0 0 0 0 0 0 0 0
110.24/110.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
110.24/110.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
110.24/110.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
110.24/110.36 c implics : 0.00 0 8 0 0 0 0 0 0
110.24/110.36 c probing : 0.00 0 0 0 0 0 0 0 0
110.24/110.36 c knapsack : 0.01 0 0 0 0 0 0 0 0
110.24/110.36 c linear : 0.02 12 0 0 12 0 29 0 0
110.24/110.36 c logicor : 0.00 0 0 0 0 0 0 0 0
110.24/110.36 c root node : - 0 - - 0 - - - -
110.24/110.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
110.24/110.36 c integral : 0 0 0 2757 0 9 80 0 0 5436
110.24/110.36 c knapsack : 162 5 16167 1 0 923 53465 284 0 0
110.24/110.36 c logicor : 382+ 5 12713 1 0 257 28116 0 0 0
110.24/110.36 c countsols : 0 0 0 1 0 0 0 0 0 0
110.24/110.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
110.24/110.36 c integral : 36.15 0.00 0.00 36.15 0.00
110.24/110.36 c knapsack : 0.30 0.00 0.30 0.00 0.00
110.24/110.36 c logicor : 0.38 0.00 0.38 0.00 0.00
110.24/110.36 c countsols : 0.00 0.00 0.00 0.00 0.00
110.24/110.36 c Propagators : Time Calls Cutoffs DomReds
110.24/110.36 c rootredcost : 0.00 0 0 0
110.24/110.36 c pseudoobj : 0.31 16256 0 0
110.24/110.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
110.24/110.36 c propagation : 0.09 549 531 3525 39.7 16 11.2 -
110.24/110.36 c infeasible LP : 0.00 575 0 0 0.0 0 0.0 0
110.24/110.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
110.24/110.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
110.24/110.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
110.24/110.36 c applied globally : - - - 1000 13.9 - - -
110.24/110.36 c applied locally : - - - 8 42.5 - - -
110.24/110.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
110.24/110.36 c cut pool : 0.01 4 - - 93 - (maximal pool size: 2068)
110.24/110.36 c redcost : 0.00 2740 0 0 0 0
110.24/110.36 c impliedbounds : 0.00 5 0 0 632 0
110.24/110.36 c intobj : 0.00 0 0 0 0 0
110.24/110.36 c gomory : 0.56 5 0 0 101 0
110.24/110.36 c strongcg : 0.51 5 0 0 1582 0
110.24/110.36 c cmir : 0.00 0 0 0 0 0
110.24/110.36 c flowcover : 0.00 0 0 0 0 0
110.24/110.36 c clique : 0.00 5 0 0 12 0
110.24/110.36 c zerohalf : 0.00 0 0 0 0 0
110.24/110.36 c mcf : 0.01 1 0 0 0 0
110.24/110.36 c Pricers : Time Calls Vars
110.24/110.36 c problem variables: 0.00 0 0
110.24/110.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
110.24/110.36 c relpscost : 36.14 2756 9 80 0 0 5436
110.24/110.36 c pscost : 0.00 0 0 0 0 0 0
110.24/110.36 c inference : 0.00 0 0 0 0 0 0
110.24/110.36 c mostinf : 0.00 0 0 0 0 0 0
110.24/110.36 c leastinf : 0.00 0 0 0 0 0 0
110.24/110.36 c fullstrong : 0.00 0 0 0 0 0 0
110.24/110.36 c allfullstrong : 0.00 0 0 0 0 0 0
110.24/110.36 c random : 0.00 0 0 0 0 0 0
110.24/110.36 c Primal Heuristics : Time Calls Found
110.24/110.36 c LP solutions : 0.00 - 1
110.24/110.36 c pseudo solutions : 0.00 - 0
110.24/110.36 c simplerounding : 0.00 0 0
110.24/110.36 c rounding : 0.00 0 0
110.24/110.36 c shifting : 0.00 0 0
110.24/110.36 c intshifting : 0.00 0 0
110.24/110.36 c oneopt : 0.00 0 0
110.24/110.36 c fixandinfer : 0.00 0 0
110.24/110.36 c feaspump : 0.00 0 0
110.24/110.36 c coefdiving : 0.00 0 0
110.24/110.36 c pscostdiving : 0.00 0 0
110.24/110.36 c fracdiving : 0.00 0 0
110.24/110.36 c veclendiving : 0.00 0 0
110.24/110.36 c intdiving : 0.00 0 0
110.24/110.36 c actconsdiving : 0.00 0 0
110.24/110.36 c objpscostdiving : 0.00 0 0
110.24/110.36 c rootsoldiving : 0.00 0 0
110.24/110.36 c linesearchdiving : 0.00 0 0
110.24/110.36 c guideddiving : 0.00 0 0
110.24/110.36 c octane : 0.00 0 0
110.24/110.36 c rens : 0.00 0 0
110.24/110.36 c rins : 0.00 0 0
110.24/110.36 c localbranching : 0.00 0 0
110.24/110.36 c mutation : 0.00 0 0
110.24/110.36 c crossover : 0.00 0 0
110.24/110.36 c dins : 0.00 0 0
110.24/110.36 c LP : Time Calls Iterations Iter/call Iter/sec
110.24/110.36 c primal LP : 0.03 0 0 0.00 0.00
110.24/110.36 c dual LP : 70.34 3337 383890 115.04 5457.63
110.24/110.36 c barrier LP : 0.00 0 0 0.00 -
110.24/110.36 c diving/probing LP: 0.00 0 0 0.00 -
110.24/110.36 c strong branching : 35.93 1717 172954 100.73 4813.64
110.24/110.36 c (at root node) : - 50 8400 168.00 -
110.24/110.36 c conflict analysis: 0.00 0 0 0.00 -
110.24/110.36 c B&B Tree :
110.24/110.36 c number of runs : 1
110.24/110.36 c nodes : 4423
110.24/110.36 c nodes (total) : 4423
110.24/110.36 c nodes left : 930
110.24/110.36 c max depth : 43
110.24/110.36 c max depth (total): 43
110.24/110.36 c backtracks : 745 (16.8%)
110.24/110.36 c delayed cutoffs : 67
110.24/110.36 c repropagations : 1243 (4182 domain reductions, 60 cutoffs)
110.24/110.36 c avg switch length: 5.01
110.24/110.36 c switching time : 0.52
110.24/110.36 c Solution :
110.24/110.36 c Solutions found : 1 (1 improvements)
110.24/110.36 c Primal Bound : +7.00000000000000e+01 (in run 1, after 4423 nodes, 109.75 seconds, depth 13, found by <relaxation>)
110.24/110.36 c Dual Bound : +5.25314464155263e+01
110.24/110.36 c Gap : 33.25 %
110.24/110.36 c Root Dual Bound : +4.72417799927525e+01
110.24/110.37 c Time complete: 110.31.