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