0.02/0.04 c SCIP version 1.1.0.7
0.02/0.04 c LP-Solver Clp 1.8.2
0.02/0.04 c user parameter file <scip.set> not found - using default parameters
0.02/0.04 c read problem <HOME/instance-1868311-1245120630.opb>
0.02/0.04 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.05 c No objective function, only one solution is needed.
0.02/0.05 c start presolving problem
0.02/0.05 c presolving:
0.02/0.09 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.10/0.10 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.10/0.11 c presolving (3 rounds):
0.10/0.11 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.11 c 242 implications, 22 cliques
0.10/0.11 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.10/0.11 c 1 constraints of type <knapsack>
0.10/0.11 c 22 constraints of type <setppc>
0.10/0.11 c 2541 constraints of type <logicor>
0.10/0.11 c transformed objective value is always integral (scale: 1)
0.10/0.11 c Presolving Time: 0.05
0.10/0.11 c SATUNSAT-LIN
0.10/0.11 c -----------------------------------------------------------------------------------------------
0.10/0.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.11 c separating/flowcover/freq = c -1
0.10/0.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.11 c separating/cmir/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/veclendiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/veclendiving/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.11 c heuristics/simplerounding/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/shifting/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.11 c heuristics/rounding/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.11 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.10/0.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.11 c heuristics/rootsoldiving/freq = c -1
0.10/0.11 c # number of nodes added to the contingent of the total nodes
0.10/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.11 c heuristics/rens/nodesofs = c 2000
0.10/0.11 c # minimum percentage of integer variables that have to be fixable
0.10/0.11 c # [type: real, range: [0,1], default: 0.5]
0.10/0.11 c heuristics/rens/minfixingrate = c 0.3
0.10/0.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.11 c heuristics/rens/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/pscostdiving/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.11 c heuristics/oneopt/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.11 c # [type: real, range: [0,1], default: 0.01]
0.10/0.11 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.10/0.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.11 c heuristics/objpscostdiving/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/linesearchdiving/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/intshifting/freq = c -1
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/intdiving/maxlpiterquot = c 0.075
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/guideddiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/guideddiving/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/fracdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/fracdiving/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/feaspump/maxlpiterofs = c 2000
0.10/0.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.11 c heuristics/feaspump/freq = c -1
0.10/0.11 c # minimum percentage of integer variables that have to be fixed
0.10/0.11 c # [type: real, range: [0,1], default: 0.666]
0.10/0.11 c heuristics/crossover/minfixingrate = c 0.5
0.10/0.11 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.11 c # [type: real, range: [0,1], default: 0.1]
0.10/0.11 c heuristics/crossover/nodesquot = c 0.15
0.10/0.11 c # number of nodes without incumbent change that heuristic should wait
0.10/0.11 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.11 c heuristics/crossover/nwaitingnodes = c 100
0.10/0.11 c # number of nodes added to the contingent of the total nodes
0.10/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.11 c heuristics/crossover/nodesofs = c 750
0.10/0.11 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.11 c heuristics/crossover/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/coefdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/coefdiving/freq = c -1
0.10/0.11 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c presolving/probing/maxrounds = c 0
0.10/0.11 c # should presolving try to simplify knapsacks
0.10/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.11 c constraints/knapsack/simplifyinequalities = c TRUE
0.10/0.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.11 c constraints/knapsack/disaggregation = c FALSE
0.10/0.11 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c constraints/knapsack/maxnumcardlift = c 0
0.10/0.11 c # should presolving try to simplify inequalities
0.10/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.11 c constraints/linear/simplifyinequalities = c TRUE
0.10/0.11 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c separating/maxroundsroot = c 5
0.10/0.11 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.11 c separating/maxrounds = c 1
0.10/0.11 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c limits/solutions = c 1
0.10/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.11 c limits/memory = c 1620
0.10/0.11 c # maximal time in seconds to run
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.11 c limits/time = c 1791
0.10/0.11 c # frequency for displaying node information lines
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.11 c display/freq = c 10000
0.10/0.11 c -----------------------------------------------------------------------------------------------
0.10/0.11 c start solving problem
0.10/0.11 c
0.10/0.13 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.13 c 0.1s| 1 | 0 | 61 |3513k| 0 | 33 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 93 |3632k| 0 | 36 | 231 |2564 |2564 | 231 |2572 | 8 | 0 | 0 | 1.100000e+01 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 140 |3893k| 0 | 44 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 240 |4154k| 0 | 43 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
0.60/0.63 c 0.6s| 1 | 0 | 286 |4298k| 0 | 45 | 231 |2564 |2564 | 231 |2586 | 22 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 464 |4549k| 0 | 52 | 231 |2564 |2564 | 231 |2591 | 27 | 0 | 0 | 1.100000e+01 | -- | Inf
1.49/1.54 c 1.5s| 1 | 2 | 464 |4549k| 0 | 52 | 231 |2564 |2564 | 231 |2591 | 27 | 0 | 19 | 1.100000e+01 | -- | Inf
49.86/49.99 c *49.6s| 2236 | 433 | 85468 |5793k| 57 | - | 231 |2740 | 843 | 231 |2569 | 27 | 296 |1312 | 1.300000e+01 | 2.200000e+01 | 69.23%
49.86/49.99 c
49.86/49.99 c SCIP Status : solving was interrupted [solution limit reached]
49.86/49.99 c Solving Time (sec) : 49.56
49.86/49.99 c Solving Nodes : 2236
49.86/49.99 c Primal Bound : +2.20000000000000e+01 (1 solutions)
49.86/49.99 c Dual Bound : +1.30000000000000e+01
49.86/49.99 c Gap : 69.23 %
49.86/49.99 c NODE 2236
49.86/49.99 c DUAL BOUND 13
49.86/49.99 c PRIMAL BOUND 22
49.86/49.99 c GAP 0.692308
49.86/49.99 s SATISFIABLE
49.86/49.99 v -x221 -x211 -x201 -x191 -x181 -x171 x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220
49.86/49.99 v -x199 -x189 -x179 -x169 -x159 x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 x168 -x158 -x148 -x138 -x128 -x228 -x218 x208
49.86/49.99 v -x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 x126 -x226 -x216 -x206 -x196
49.86/49.99 v -x186 -x176 -x155 -x145 x135 -x125 -x225 -x215 -x205 -x195 x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 x194 -x184 -x174
49.86/49.99 v -x164 -x154 -x133 -x123 -x223 x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 x222 -x212 -x202 -x192 -x182 -x172 -x162
49.86/49.99 v -x152 -x142 -x132 x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
49.86/49.99 v x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82 -x81 -x80
49.86/49.99 v -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 x69 -x68 -x67 -x66 -x65 -x64 x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54
49.86/49.99 v -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 x35 -x34 -x33 x32 -x31 -x30 -x29
49.86/49.99 v -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x11 -x21 -x10 -x20 -x9 -x19 -x8 -x18 -x7 x17 -x6 -x16 -x5 -x15 -x4 -x14 -x3 -x13 -x2 -x12
49.86/49.99 v x1
49.86/49.99 c SCIP Status : solving was interrupted [solution limit reached]
49.86/49.99 c Solving Time : 49.56
49.86/49.99 c Original Problem :
49.86/49.99 c Problem name : HOME/instance-1868311-1245120630.opb
49.86/49.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
49.86/49.99 c Constraints : 2707 initial, 2707 maximal
49.86/49.99 c Presolved Problem :
49.86/49.99 c Problem name : t_HOME/instance-1868311-1245120630.opb
49.86/49.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
49.86/49.99 c Constraints : 2564 initial, 2742 maximal
49.86/49.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
49.86/49.99 c trivial : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c implics : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c probing : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c knapsack : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c setppc : 0.00 0 0 0 0 0 0 0 0
49.86/49.99 c linear : 0.02 0 0 0 0 0 143 0 0
49.86/49.99 c logicor : 0.02 0 0 0 0 0 0 0 0
49.86/49.99 c root node : - 0 - - 0 - - - -
49.86/49.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
49.86/49.99 c integral : 0 0 0 1538 0 36 334 0 0 2674
49.86/49.99 c knapsack : 1 5 5057 1 0 24 5239 0 0 0
49.86/49.99 c setppc : 22 5 5044 1 0 68 14385 0 0 0
49.86/49.99 c logicor : 2541+ 5 4432 1 0 23 15612 0 0 0
49.86/49.99 c countsols : 0 0 0 1 0 0 0 0 0 0
49.86/49.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
49.86/49.99 c integral : 27.67 0.00 0.00 27.67 0.00
49.86/49.99 c knapsack : 0.03 0.00 0.03 0.00 0.00
49.86/49.99 c setppc : 0.06 0.00 0.06 0.00 0.00
49.86/49.99 c logicor : 0.28 0.00 0.28 0.00 0.00
49.86/49.99 c countsols : 0.00 0.00 0.00 0.00 0.00
49.86/49.99 c Propagators : Time Calls Cutoffs DomReds
49.86/49.99 c rootredcost : 0.00 0 0 0
49.86/49.99 c pseudoobj : 0.08 5070 0 0
49.86/49.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
49.86/49.99 c propagation : 0.04 115 114 589 19.4 2 31.5 -
49.86/49.99 c infeasible LP : 0.04 753 0 0 0.0 0 0.0 0
49.86/49.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
49.86/49.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
49.86/49.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
49.86/49.99 c applied globally : - - - 294 17.3 - - -
49.86/49.99 c applied locally : - - - 2 34.0 - - -
49.86/49.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
49.86/49.99 c cut pool : 0.00 4 - - 0 - (maximal pool size: 492)
49.86/49.99 c redcost : 0.01 1388 0 0 0 0
49.86/49.99 c impliedbounds : 0.00 5 0 0 0 0
49.86/49.99 c intobj : 0.00 0 0 0 0 0
49.86/49.99 c gomory : 0.32 5 0 0 2500 0
49.86/49.99 c strongcg : 0.24 5 0 0 2500 0
49.86/49.99 c cmir : 0.00 0 0 0 0 0
49.86/49.99 c flowcover : 0.00 0 0 0 0 0
49.86/49.99 c clique : 0.00 5 0 0 0 0
49.86/49.99 c zerohalf : 0.00 0 0 0 0 0
49.86/49.99 c mcf : 0.00 1 0 0 0 0
49.86/49.99 c Pricers : Time Calls Vars
49.86/49.99 c problem variables: 0.00 0 0
49.86/49.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
49.86/49.99 c relpscost : 27.66 1537 36 334 0 0 2674
49.86/49.99 c pscost : 0.00 0 0 0 0 0 0
49.86/49.99 c inference : 0.00 0 0 0 0 0 0
49.86/49.99 c mostinf : 0.00 0 0 0 0 0 0
49.86/49.99 c leastinf : 0.00 0 0 0 0 0 0
49.86/49.99 c fullstrong : 0.00 0 0 0 0 0 0
49.86/49.99 c allfullstrong : 0.00 0 0 0 0 0 0
49.86/49.99 c random : 0.00 0 0 0 0 0 0
49.86/49.99 c Primal Heuristics : Time Calls Found
49.86/49.99 c LP solutions : 0.00 - 1
49.86/49.99 c pseudo solutions : 0.00 - 0
49.86/49.99 c simplerounding : 0.00 0 0
49.86/49.99 c rounding : 0.00 0 0
49.86/49.99 c shifting : 0.00 0 0
49.86/49.99 c intshifting : 0.00 0 0
49.86/49.99 c oneopt : 0.00 0 0
49.86/49.99 c fixandinfer : 0.00 0 0
49.86/49.99 c feaspump : 0.00 0 0
49.86/49.99 c coefdiving : 0.00 0 0
49.86/49.99 c pscostdiving : 0.00 0 0
49.86/49.99 c fracdiving : 0.00 0 0
49.86/49.99 c veclendiving : 0.00 0 0
49.86/49.99 c intdiving : 0.00 0 0
49.86/49.99 c actconsdiving : 0.00 0 0
49.86/49.99 c objpscostdiving : 0.00 0 0
49.86/49.99 c rootsoldiving : 0.00 0 0
49.86/49.99 c linesearchdiving : 0.00 0 0
49.86/49.99 c guideddiving : 0.00 0 0
49.86/49.99 c octane : 0.00 0 0
49.86/49.99 c rens : 0.00 0 0
49.86/49.99 c rins : 0.00 0 0
49.86/49.99 c localbranching : 0.00 0 0
49.86/49.99 c mutation : 0.00 0 0
49.86/49.99 c crossover : 0.00 0 0
49.86/49.99 c dins : 0.00 0 0
49.86/49.99 c LP : Time Calls Iterations Iter/call Iter/sec
49.86/49.99 c primal LP : 0.02 0 0 0.00 0.00
49.86/49.99 c dual LP : 19.75 2292 85468 37.29 4327.49
49.86/49.99 c barrier LP : 0.00 0 0 0.00 -
49.86/49.99 c diving/probing LP: 0.00 0 0 0.00 -
49.86/49.99 c strong branching : 27.62 1312 113297 86.35 4101.99
49.86/49.99 c (at root node) : - 19 2537 133.53 -
49.86/49.99 c conflict analysis: 0.00 0 0 0.00 -
49.86/49.99 c B&B Tree :
49.86/49.99 c number of runs : 1
49.86/49.99 c nodes : 2236
49.86/49.99 c nodes (total) : 2236
49.86/49.99 c nodes left : 433
49.86/49.99 c max depth : 57
49.86/49.99 c max depth (total): 57
49.86/49.99 c backtracks : 174 (7.8%)
49.86/49.99 c delayed cutoffs : 6
49.86/49.99 c repropagations : 190 (579 domain reductions, 6 cutoffs)
49.86/49.99 c avg switch length: 2.69
49.86/49.99 c switching time : 0.26
49.86/49.99 c Solution :
49.86/49.99 c Solutions found : 1 (1 improvements)
49.86/49.99 c Primal Bound : +2.20000000000000e+01 (in run 1, after 2236 nodes, 49.56 seconds, depth 21, found by <relaxation>)
49.86/49.99 c Dual Bound : +1.30000000000000e+01
49.86/49.99 c Gap : 69.23 %
49.86/49.99 c Root Dual Bound : +1.10000000000000e+01
49.96/50.00 c Time complete: 49.96.