0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1867999-1245114303.opb>
0.00/0.01 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 401 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) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 298 impls, 0 clqs
0.00/0.04 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 7146 implications, 0 cliques
0.00/0.04 c presolved problem has 258 variables (258 bin, 0 int, 0 impl, 0 cont) and 401 constraints
0.00/0.04 c 164 constraints of type <knapsack>
0.00/0.04 c 237 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.02
0.00/0.04 c SATUNSAT-LIN
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 = c -1
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c -1
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 = c -1
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 = c -1
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 = c 1500
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 = c 0.015
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 = c -1
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 = c 2000
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 = c 0.3
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c -1
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 = c 1500
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 = c 0.015
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c -1
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 = c 0.075
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 2000
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 = c -1
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 = c 0.5
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 = c 0.15
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 = c 100
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 = c 750
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 0
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 = c TRUE
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 = c FALSE
0.00/0.04 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c constraints/knapsack/maxnumcardlift = c 0
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 = c TRUE
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 = c 5
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 = c 1
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 = c 1
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 = c 1620
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 = c 1791
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 = c 10000
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving problem
0.00/0.04 c
0.05/0.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.06 c 0.0s| 1 | 0 | 181 |1532k| 0 | 94 | 258 | 401 | 401 | 258 | 393 | 0 | 0 | 0 | 3.466667e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 343 |2362k| 0 | 135 | 258 | 401 | 401 | 258 | 605 | 212 | 0 | 0 | 3.623621e+01 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 611 |3639k| 0 | 246 | 258 | 401 | 401 | 258 | 874 | 481 | 0 | 0 | 3.895682e+01 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 711 |5659k| 0 | 247 | 258 | 401 | 401 | 258 | 879 | 486 | 0 | 0 | 3.904203e+01 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 873 |6288k| 0 | 244 | 258 | 401 | 401 | 258 | 881 | 488 | 0 | 0 | 3.915574e+01 | -- | Inf
0.99/1.00 c 1.0s| 1 | 0 | 1058 |6346k| 0 | 249 | 258 | 401 | 401 | 258 | 882 | 489 | 0 | 0 | 3.920634e+01 | -- | Inf
1.99/2.00 c 1.9s| 1 | 2 | 1058 |6347k| 0 | 249 | 258 | 401 | 401 | 258 | 882 | 489 | 0 | 23 | 3.920634e+01 | -- | Inf
29.78/29.83 c *29.6s| 2392 | 1017 | 92237 |8326k| 49 | - | 258 | 518 | 30 | 258 | 625 | 489 | 183 |1686 | 4.415243e+01 | 6.700000e+01 | 51.75%
29.78/29.83 c
29.78/29.83 c SCIP Status : solving was interrupted [solution limit reached]
29.78/29.83 c Solving Time (sec) : 29.59
29.78/29.83 c Solving Nodes : 2392
29.78/29.83 c Primal Bound : +6.70000000000000e+01 (1 solutions)
29.78/29.83 c Dual Bound : +4.41524318628288e+01
29.78/29.83 c Gap : 51.75 %
29.78/29.83 c NODE 2392
29.78/29.83 c DUAL BOUND 44.1524
29.78/29.83 c PRIMAL BOUND 67
29.78/29.83 c GAP 0.51747
29.78/29.83 s SATISFIABLE
29.78/29.83 v x265 -x266 -x263 x264 -x261 -x262 -x259 x260 -x257 -x258 -x255 x256 -x253 -x254 -x251 x252 -x249 -x250 x247 -x248 -x245 -x246 x243
29.78/29.83 v -x244 -x241 x242 x239 -x240 -x237 x238 x235 -x236 -x233 x234 x231 -x232 -x229 x230 x227 -x228 -x225 x226 x223 -x224 -x221
29.78/29.83 v x222 x219 -x220 -x217 -x218 -x215 -x216 x213 -x214 -x211 -x212 x209 -x210 -x207 -x208 x205 -x206 -x203 x204 x201 -x202 -x199
29.78/29.83 v x200 -x197 x198 x195 -x196 -x193 x194 x191 -x192 -x189 x190 x187 -x188 -x185 x186 x183 -x184 x181 -x182 x179 -x180 x177 -x178
29.78/29.83 v x175 -x176 x173 -x174 -x171 x172 x169 -x170 -x167 x168 x165 -x166 -x163 x164 -x162 x160 -x158 x156 -x154 x152 -x150 x148 -x146
29.78/29.83 v -x144 -x142 -x140 -x138 -x136 -x134 -x132 -x130 x128 -x126 x124 -x122 x120 -x118 x116 -x114 x112 -x110 -x108 -x106 -x104
29.78/29.83 v -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
29.78/29.83 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
29.78/29.83 v -x161 -x159 -x157 -x155 -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 -x131 -x129 -x127 -x125 -x123 -x121
29.78/29.83 v -x119 -x117 -x115 -x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 x89 -x87 x85 -x83 x81 -x79 x77 -x75 -x73
29.78/29.83 v -x71 -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
29.78/29.83 v -x19 x17 -x15 x13 -x11 x9 -x7 x5 -x3 -x1
29.78/29.83 c SCIP Status : solving was interrupted [solution limit reached]
29.78/29.83 c Solving Time : 29.59
29.78/29.83 c Original Problem :
29.78/29.83 c Problem name : HOME/instance-1867999-1245114303.opb
29.78/29.83 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
29.78/29.83 c Constraints : 401 initial, 401 maximal
29.78/29.83 c Presolved Problem :
29.78/29.83 c Problem name : t_HOME/instance-1867999-1245114303.opb
29.78/29.83 c Variables : 258 (258 binary, 0 integer, 0 implicit integer, 0 continuous)
29.78/29.83 c Constraints : 401 initial, 518 maximal
29.78/29.83 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
29.78/29.83 c trivial : 0.00 0 0 0 0 0 0 0 0
29.78/29.83 c dualfix : 0.00 0 0 0 0 0 0 0 0
29.78/29.83 c boundshift : 0.00 0 0 0 0 0 0 0 0
29.78/29.83 c inttobinary : 0.00 0 0 0 0 0 0 0 0
29.78/29.83 c implics : 0.00 0 8 0 0 0 0 0 0
29.78/29.83 c probing : 0.00 0 0 0 0 0 0 0 0
29.78/29.83 c knapsack : 0.01 0 0 0 0 0 0 0 0
29.78/29.83 c logicor : 0.00 0 0 0 0 0 0 0 0
29.78/29.83 c root node : - 0 - - 0 - - - -
29.78/29.83 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
29.78/29.83 c integral : 0 0 0 1762 0 4 40 0 0 3486
29.78/29.83 c knapsack : 164 5 6400 0 0 542 28114 195 0 0
29.78/29.83 c logicor : 237+ 5 4305 1 0 18 10826 0 0 0
29.78/29.83 c countsols : 0 0 0 1 0 0 0 0 0 0
29.78/29.83 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
29.78/29.83 c integral : 14.92 0.00 0.00 14.92 0.00
29.78/29.83 c knapsack : 0.15 0.00 0.15 0.00 0.00
29.78/29.83 c logicor : 0.07 0.00 0.07 0.00 0.00
29.78/29.83 c countsols : 0.00 0.00 0.00 0.00 0.00
29.78/29.83 c Propagators : Time Calls Cutoffs DomReds
29.78/29.83 c rootredcost : 0.01 0 0 0
29.78/29.83 c pseudoobj : 0.07 6441 0 0
29.78/29.83 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
29.78/29.83 c propagation : 0.04 88 85 537 44.7 0 0.0 -
29.78/29.83 c infeasible LP : 0.00 85 0 0 0.0 0 0.0 0
29.78/29.83 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
29.78/29.83 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
29.78/29.83 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
29.78/29.83 c applied globally : - - - 182 18.0 - - -
29.78/29.83 c applied locally : - - - 1 31.0 - - -
29.78/29.83 c Separators : Time Calls Cutoffs DomReds Cuts Conss
29.78/29.83 c cut pool : 0.00 4 - - 285 - (maximal pool size: 1941)
29.78/29.83 c redcost : 0.04 1754 0 0 0 0
29.78/29.83 c impliedbounds : 0.00 5 0 0 608 0
29.78/29.83 c intobj : 0.00 0 0 0 0 0
29.78/29.83 c gomory : 0.33 5 0 0 303 0
29.78/29.83 c strongcg : 0.33 5 0 0 1314 0
29.78/29.83 c cmir : 0.00 0 0 0 0 0
29.78/29.83 c flowcover : 0.00 0 0 0 0 0
29.78/29.83 c clique : 0.01 1 0 0 0 0
29.78/29.83 c zerohalf : 0.00 0 0 0 0 0
29.78/29.83 c mcf : 0.00 1 0 0 0 0
29.78/29.83 c Pricers : Time Calls Vars
29.78/29.83 c problem variables: 0.00 0 0
29.78/29.83 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
29.78/29.83 c relpscost : 14.92 1761 4 40 0 0 3486
29.78/29.83 c pscost : 0.00 0 0 0 0 0 0
29.78/29.83 c inference : 0.00 0 0 0 0 0 0
29.78/29.83 c mostinf : 0.00 0 0 0 0 0 0
29.78/29.83 c leastinf : 0.00 0 0 0 0 0 0
29.78/29.83 c fullstrong : 0.00 0 0 0 0 0 0
29.78/29.83 c allfullstrong : 0.00 0 0 0 0 0 0
29.78/29.83 c random : 0.00 0 0 0 0 0 0
29.78/29.83 c Primal Heuristics : Time Calls Found
29.78/29.83 c LP solutions : 0.00 - 1
29.78/29.83 c pseudo solutions : 0.00 - 0
29.78/29.83 c simplerounding : 0.00 0 0
29.78/29.83 c rounding : 0.00 0 0
29.78/29.83 c shifting : 0.00 0 0
29.78/29.83 c intshifting : 0.00 0 0
29.78/29.83 c oneopt : 0.00 0 0
29.78/29.83 c fixandinfer : 0.00 0 0
29.78/29.83 c feaspump : 0.00 0 0
29.78/29.83 c coefdiving : 0.00 0 0
29.78/29.83 c pscostdiving : 0.00 0 0
29.78/29.83 c fracdiving : 0.00 0 0
29.78/29.83 c veclendiving : 0.00 0 0
29.78/29.83 c intdiving : 0.00 0 0
29.78/29.83 c actconsdiving : 0.00 0 0
29.78/29.83 c objpscostdiving : 0.00 0 0
29.78/29.83 c rootsoldiving : 0.00 0 0
29.78/29.83 c linesearchdiving : 0.00 0 0
29.78/29.83 c guideddiving : 0.00 0 0
29.78/29.83 c octane : 0.00 0 0
29.78/29.83 c rens : 0.00 0 0
29.78/29.83 c rins : 0.00 0 0
29.78/29.83 c localbranching : 0.00 0 0
29.78/29.83 c mutation : 0.00 0 0
29.78/29.83 c crossover : 0.00 0 0
29.78/29.83 c dins : 0.00 0 0
29.78/29.83 c LP : Time Calls Iterations Iter/call Iter/sec
29.78/29.83 c primal LP : 0.02 0 0 0.00 0.00
29.78/29.83 c dual LP : 13.08 1852 92237 49.80 7051.76
29.78/29.83 c barrier LP : 0.00 0 0 0.00 -
29.78/29.83 c diving/probing LP: 0.00 0 0 0.00 -
29.78/29.83 c strong branching : 14.82 1686 96411 57.18 6505.47
29.78/29.83 c (at root node) : - 23 3768 163.83 -
29.78/29.83 c conflict analysis: 0.00 0 0 0.00 -
29.78/29.83 c B&B Tree :
29.78/29.83 c number of runs : 1
29.78/29.83 c nodes : 2392
29.78/29.83 c nodes (total) : 2392
29.78/29.83 c nodes left : 1017
29.78/29.83 c max depth : 49
29.78/29.83 c max depth (total): 49
29.78/29.83 c backtracks : 280 (11.7%)
29.78/29.83 c delayed cutoffs : 1
29.78/29.83 c repropagations : 342 (386 domain reductions, 1 cutoffs)
29.78/29.83 c avg switch length: 4.03
29.78/29.83 c switching time : 0.17
29.78/29.83 c Solution :
29.78/29.83 c Solutions found : 1 (1 improvements)
29.78/29.83 c Primal Bound : +6.70000000000000e+01 (in run 1, after 2392 nodes, 29.59 seconds, depth 19, found by <relaxation>)
29.78/29.83 c Dual Bound : +4.41524318628288e+01
29.78/29.83 c Gap : 51.75 %
29.78/29.83 c Root Dual Bound : +3.92063397129186e+01
29.78/29.84 c Time complete: 29.83.