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