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