0.03/0.05 c SCIP version 1.1.0.7
0.03/0.05 c LP-Solver SoPlex 1.4.1
0.03/0.05 c user parameter file <scip.set> not found - using default parameters
0.03/0.05 c read problem <HOME/instance-1868212-1245116000.opb>
0.03/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.03/0.06 c No objective function, only one solution is needed.
0.03/0.06 c start presolving problem
0.03/0.06 c presolving:
0.09/0.10 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.09/0.11 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.09/0.12 c presolving (3 rounds):
0.09/0.12 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 242 implications, 22 cliques
0.09/0.12 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.12 c 1 constraints of type <knapsack>
0.09/0.12 c 22 constraints of type <setppc>
0.09/0.12 c 2541 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.06
0.09/0.12 c SATUNSAT-LIN
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/intshifting/freq = c -1
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/guideddiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/fracdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 1620
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 c
0.09/0.15 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 0 | 77 |3513k| 0 | 34 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 103 |3670k| 0 | 39 | 231 |2564 |2564 | 231 |2570 | 6 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 126 |3881k| 0 | 39 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.87 c 0.8s| 1 | 0 | 141 |3950k| 0 | 41 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
1.19/1.22 c 1.1s| 1 | 0 | 164 |4019k| 0 | 43 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
1.49/1.59 c 1.5s| 1 | 0 | 178 |4036k| 0 | 45 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
4.09/4.11 c 4.0s| 1 | 2 | 178 |4037k| 0 | 45 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 33 | 1.100000e+01 | -- | Inf
132.89/133.00 c 132s| 10000 | 1399 |219754 |8647k| 63 | 33 | 231 |4779 |1051 | 231 |2574 | 15 |5288 |2304 | 1.400000e+01 | -- | Inf
138.90/138.99 c * 138s| 10684 | 1470 |233993 |8901k| 63 | - | 231 |4988 | 951 | 231 |2574 | 15 |5676 |2304 | 1.400000e+01 | 2.200000e+01 | 57.14%
138.90/138.99 c
138.90/138.99 c SCIP Status : solving was interrupted [solution limit reached]
138.90/138.99 c Solving Time (sec) : 137.80
138.90/138.99 c Solving Nodes : 10684
138.90/138.99 c Primal Bound : +2.20000000000000e+01 (1 solutions)
138.90/138.99 c Dual Bound : +1.40000000000000e+01
138.90/138.99 c Gap : 57.14 %
138.90/138.99 c NODE 10684
138.90/138.99 c DUAL BOUND 14
138.90/138.99 c PRIMAL BOUND 22
138.90/138.99 c GAP 0.571429
138.90/138.99 s SATISFIABLE
138.90/138.99 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 x160 -x150 -x140 -x130 -x230 -x220
138.90/138.99 v -x199 x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
138.90/138.99 v -x198 -x177 -x167 -x157 -x147 -x137 x127 -x227 -x217 x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 x226 -x216 -x206 -x196
138.90/138.99 v -x186 -x176 -x155 -x145 -x135 -x125 -x225 -x215 -x205 x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 x214 -x204 -x194 -x184 -x174
138.90/138.99 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 x162
138.90/138.99 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
138.90/138.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
138.90/138.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
138.90/138.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
138.90/138.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
138.90/138.99 v -x1
138.90/138.99 c SCIP Status : solving was interrupted [solution limit reached]
138.90/138.99 c Solving Time : 137.80
138.90/138.99 c Original Problem :
138.90/138.99 c Problem name : HOME/instance-1868212-1245116000.opb
138.90/138.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
138.90/138.99 c Constraints : 2707 initial, 2707 maximal
138.90/138.99 c Presolved Problem :
138.90/138.99 c Problem name : t_HOME/instance-1868212-1245116000.opb
138.90/138.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
138.90/138.99 c Constraints : 2564 initial, 4988 maximal
138.90/138.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
138.90/138.99 c trivial : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c implics : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c probing : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c knapsack : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c setppc : 0.00 0 0 0 0 0 0 0 0
138.90/138.99 c linear : 0.03 0 0 0 0 0 143 0 0
138.90/138.99 c logicor : 0.03 0 0 0 0 0 0 0 0
138.90/138.99 c root node : - 0 - - 0 - - - -
138.90/138.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
138.90/138.99 c integral : 0 0 0 6388 0 34 581 0 0 12228
138.90/138.99 c knapsack : 1 5 35615 1 0 146 34833 0 0 0
138.90/138.99 c setppc : 22 5 35530 1 0 401 64265 0 0 0
138.90/138.99 c logicor : 2541+ 5 21317 1 0 142 80601 0 0 0
138.90/138.99 c countsols : 0 0 0 1 0 0 0 0 0 0
138.90/138.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
138.90/138.99 c integral : 39.85 0.00 0.00 39.85 0.00
138.90/138.99 c knapsack : 0.08 0.00 0.08 0.00 0.00
138.90/138.99 c setppc : 0.29 0.00 0.29 0.00 0.00
138.90/138.99 c logicor : 2.14 0.00 2.14 0.00 0.00
138.90/138.99 c countsols : 0.00 0.00 0.00 0.00 0.00
138.90/138.99 c Propagators : Time Calls Cutoffs DomReds
138.90/138.99 c rootredcost : 0.04 0 0 0
138.90/138.99 c pseudoobj : 0.53 35679 0 0
138.90/138.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
138.90/138.99 c propagation : 0.05 689 686 3634 22.4 7 18.3 -
138.90/138.99 c infeasible LP : 1.58 3921 3703 21879 35.3 39 17.4 0
138.90/138.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
138.90/138.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
138.90/138.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
138.90/138.99 c applied globally : - - - 5164 18.6 - - -
138.90/138.99 c applied locally : - - - 512 35.6 - - -
138.90/138.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
138.90/138.99 c cut pool : 0.00 4 - - 4 - (maximal pool size: 189)
138.90/138.99 c redcost : 0.10 6173 0 0 0 0
138.90/138.99 c impliedbounds : 0.00 5 0 0 0 0
138.90/138.99 c intobj : 0.00 0 0 0 0 0
138.90/138.99 c gomory : 0.80 5 0 0 732 0
138.90/138.99 c strongcg : 0.58 5 0 0 1233 0
138.90/138.99 c cmir : 0.00 0 0 0 0 0
138.90/138.99 c flowcover : 0.00 0 0 0 0 0
138.90/138.99 c clique : 0.00 5 0 0 0 0
138.90/138.99 c zerohalf : 0.00 0 0 0 0 0
138.90/138.99 c mcf : 0.00 1 0 0 0 0
138.90/138.99 c Pricers : Time Calls Vars
138.90/138.99 c problem variables: 0.00 0 0
138.90/138.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
138.90/138.99 c relpscost : 39.84 6387 34 581 0 0 12228
138.90/138.99 c pscost : 0.00 0 0 0 0 0 0
138.90/138.99 c inference : 0.00 0 0 0 0 0 0
138.90/138.99 c mostinf : 0.00 0 0 0 0 0 0
138.90/138.99 c leastinf : 0.00 0 0 0 0 0 0
138.90/138.99 c fullstrong : 0.00 0 0 0 0 0 0
138.90/138.99 c allfullstrong : 0.00 0 0 0 0 0 0
138.90/138.99 c random : 0.00 0 0 0 0 0 0
138.90/138.99 c Primal Heuristics : Time Calls Found
138.90/138.99 c LP solutions : 0.00 - 1
138.90/138.99 c pseudo solutions : 0.00 - 0
138.90/138.99 c simplerounding : 0.00 0 0
138.90/138.99 c rounding : 0.00 0 0
138.90/138.99 c shifting : 0.00 0 0
138.90/138.99 c intshifting : 0.00 0 0
138.90/138.99 c oneopt : 0.00 0 0
138.90/138.99 c fixandinfer : 0.00 0 0
138.90/138.99 c feaspump : 0.00 0 0
138.90/138.99 c coefdiving : 0.00 0 0
138.90/138.99 c pscostdiving : 0.00 0 0
138.90/138.99 c fracdiving : 0.00 0 0
138.90/138.99 c veclendiving : 0.00 0 0
138.90/138.99 c intdiving : 0.00 0 0
138.90/138.99 c actconsdiving : 0.00 0 0
138.90/138.99 c objpscostdiving : 0.00 0 0
138.90/138.99 c rootsoldiving : 0.00 0 0
138.90/138.99 c linesearchdiving : 0.00 0 0
138.90/138.99 c guideddiving : 0.00 0 0
138.90/138.99 c octane : 0.00 0 0
138.90/138.99 c rens : 0.00 0 0
138.90/138.99 c rins : 0.00 0 0
138.90/138.99 c localbranching : 0.00 0 0
138.90/138.99 c mutation : 0.00 0 0
138.90/138.99 c crossover : 0.00 0 0
138.90/138.99 c dins : 0.00 0 0
138.90/138.99 c LP : Time Calls Iterations Iter/call Iter/sec
138.90/138.99 c primal LP : 0.00 0 0 0.00 -
138.90/138.99 c dual LP : 83.63 10303 233993 22.71 2797.96
138.90/138.99 c barrier LP : 0.00 0 0 0.00 -
138.90/138.99 c diving/probing LP: 0.00 0 0 0.00 -
138.90/138.99 c strong branching : 39.59 2304 100921 43.80 2549.15
138.90/138.99 c (at root node) : - 33 6148 186.30 -
138.90/138.99 c conflict analysis: 0.00 0 0 0.00 -
138.90/138.99 c B&B Tree :
138.90/138.99 c number of runs : 1
138.90/138.99 c nodes : 10684
138.90/138.99 c nodes (total) : 10684
138.90/138.99 c nodes left : 1470
138.90/138.99 c max depth : 63
138.90/138.99 c max depth (total): 63
138.90/138.99 c backtracks : 863 (8.1%)
138.90/138.99 c delayed cutoffs : 75
138.90/138.99 c repropagations : 10384 (14231 domain reductions, 75 cutoffs)
138.90/138.99 c avg switch length: 4.21
138.90/138.99 c switching time : 1.78
138.90/138.99 c Solution :
138.90/138.99 c Solutions found : 1 (1 improvements)
138.90/138.99 c Primal Bound : +2.20000000000000e+01 (in run 1, after 10684 nodes, 137.80 seconds, depth 29, found by <relaxation>)
138.90/138.99 c Dual Bound : +1.40000000000000e+01
138.90/138.99 c Gap : 57.14 %
138.90/138.99 c Root Dual Bound : +1.10000000000000e+01
139.00/139.02 c Time complete: 139.02.