0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1867990-1245114040.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 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, 332 upgd conss, 252 impls, 0 clqs
0.01/0.03 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.01/0.03 c presolving (3 rounds):
0.01/0.03 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 5244 implications, 0 cliques
0.01/0.03 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.01/0.03 c 130 constraints of type <knapsack>
0.01/0.03 c 202 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 | 141 |1260k| 0 | 76 | 212 | 332 | 332 | 212 | 324 | 0 | 0 | 0 | 2.700000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 283 |1936k| 0 | 162 | 212 | 332 | 332 | 212 | 522 | 198 | 0 | 0 | 2.881257e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 447 |3212k| 0 | 204 | 212 | 332 | 332 | 212 | 747 | 423 | 0 | 0 | 3.060000e+01 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 583 |4486k| 0 | 203 | 212 | 332 | 332 | 212 | 748 | 424 | 0 | 0 | 3.078934e+01 | -- | Inf
0.49/0.57 c 0.5s| 1 | 0 | 674 |4913k| 0 | 202 | 212 | 332 | 332 | 212 | 750 | 426 | 0 | 0 | 3.091516e+01 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 708 |4923k| 0 | 203 | 212 | 332 | 332 | 212 | 752 | 428 | 0 | 0 | 3.095365e+01 | -- | Inf
3.48/3.58 c 3.5s| 1 | 2 | 708 |4924k| 0 | 203 | 212 | 332 | 332 | 212 | 752 | 428 | 0 | 24 | 3.095365e+01 | -- | Inf
17.18/17.23 c *16.9s| 1315 | 348 | 25107 |5907k| 33 | - | 212 | 939 | 49 | 212 | 510 | 428 | 625 |1808 | 3.243158e+01 | 5.500000e+01 | 69.59%
17.18/17.23 c
17.18/17.23 c SCIP Status : solving was interrupted [solution limit reached]
17.18/17.23 c Solving Time (sec) : 16.95
17.18/17.23 c Solving Nodes : 1315
17.18/17.23 c Primal Bound : +5.50000000000000e+01 (1 solutions)
17.18/17.23 c Dual Bound : +3.24315755632856e+01
17.18/17.23 c Gap : 69.59 %
17.18/17.24 c NODE 1315
17.18/17.24 c DUAL BOUND 32.4316
17.18/17.24 c PRIMAL BOUND 55
17.18/17.24 c GAP 0.695878
17.18/17.24 s SATISFIABLE
17.18/17.24 v -x219 x220 -x217 x218 -x215 x216 -x213 -x214 -x211 x212 -x209 -x210 -x207 x208 -x205 -x206 -x203 -x204 -x201 -x202 x199 -x200 x197
17.18/17.24 v -x198 -x195 x196 x193 -x194 -x191 x192 x189 -x190 -x187 x188 x185 -x186 -x183 x184 -x181 x182 -x179 -x180 -x177 -x178 -x175
17.18/17.24 v -x176 x173 -x174 -x171 -x172 x169 -x170 x167 -x168 x165 -x166 -x163 x164 x161 -x162 -x159 x160 -x157 x158 -x155 x156 x153
17.18/17.24 v -x154 x151 -x152 -x149 x150 x147 -x148 x145 -x146 x143 -x144 x141 -x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 -x131 x132
17.18/17.24 v -x129 x130 -x128 -x126 -x124 x122 x120 -x118 x116 -x114 -x112 -x110 -x108 x106 -x104 -x102 -x100 x98 -x96 -x94 -x92 -x90 x88
17.18/17.24 v -x86 x84 -x82 -x80 -x78 -x76 x74 -x72 -x70 -x68 x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36
17.18/17.24 v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 -x119 -x117 -x115
17.18/17.24 v -x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67
17.18/17.24 v -x65 -x63 x61 -x59 -x57 -x55 x53 -x51 -x49 x47 -x45 x43 -x41 -x39 -x37 -x35 -x33 -x31 x29 -x27 -x25 -x23 x21 -x19 -x17 x15
17.18/17.24 v -x13 x11 -x9 -x7 x5 -x3 -x1
17.18/17.24 c SCIP Status : solving was interrupted [solution limit reached]
17.18/17.24 c Solving Time : 16.95
17.18/17.24 c Original Problem :
17.18/17.24 c Problem name : HOME/instance-1867990-1245114040.opb
17.18/17.24 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
17.18/17.24 c Constraints : 332 initial, 332 maximal
17.18/17.24 c Presolved Problem :
17.18/17.24 c Problem name : t_HOME/instance-1867990-1245114040.opb
17.18/17.24 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
17.18/17.24 c Constraints : 332 initial, 941 maximal
17.18/17.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
17.18/17.24 c trivial : 0.00 0 0 0 0 0 0 0 0
17.18/17.24 c dualfix : 0.00 0 0 0 0 0 0 0 0
17.18/17.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
17.18/17.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
17.18/17.24 c implics : 0.00 0 8 0 0 0 0 0 0
17.18/17.24 c probing : 0.00 0 0 0 0 0 0 0 0
17.18/17.24 c knapsack : 0.00 0 0 0 0 0 0 0 0
17.18/17.24 c logicor : 0.01 0 0 0 0 0 0 0 0
17.18/17.24 c root node : - 0 - - 0 - - - -
17.18/17.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
17.18/17.24 c integral : 0 0 0 942 0 5 166 0 0 1726
17.18/17.24 c knapsack : 130 5 4708 0 0 438 13694 180 0 0
17.18/17.24 c logicor : 202+ 5 2746 1 0 11 6742 0 0 0
17.18/17.24 c countsols : 0 0 0 1 0 0 0 0 0 0
17.18/17.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
17.18/17.24 c integral : 12.32 0.00 0.00 12.32 0.00
17.18/17.24 c knapsack : 0.13 0.00 0.13 0.00 0.00
17.18/17.24 c logicor : 0.06 0.00 0.06 0.00 0.00
17.18/17.24 c countsols : 0.00 0.00 0.00 0.00 0.00
17.18/17.24 c Propagators : Time Calls Cutoffs DomReds
17.18/17.24 c rootredcost : 0.00 0 0 0
17.18/17.24 c pseudoobj : 0.07 4723 0 0
17.18/17.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
17.18/17.24 c propagation : 0.06 439 383 2377 45.6 3 48.0 -
17.18/17.24 c infeasible LP : 0.01 35 0 0 0.0 0 0.0 0
17.18/17.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
17.18/17.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
17.18/17.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
17.18/17.24 c applied globally : - - - 625 16.5 - - -
17.18/17.24 c applied locally : - - - 0 0.0 - - -
17.18/17.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
17.18/17.24 c cut pool : 0.01 4 - - 164 - (maximal pool size: 1638)
17.18/17.24 c redcost : 0.02 890 0 0 0 0
17.18/17.24 c impliedbounds : 0.00 5 0 0 568 0
17.18/17.24 c intobj : 0.00 0 0 0 0 0
17.18/17.24 c gomory : 0.25 5 0 0 299 0
17.18/17.24 c strongcg : 0.23 5 0 0 1126 0
17.18/17.24 c cmir : 0.00 0 0 0 0 0
17.18/17.24 c flowcover : 0.00 0 0 0 0 0
17.18/17.24 c clique : 0.00 1 0 0 0 0
17.18/17.24 c zerohalf : 0.00 0 0 0 0 0
17.18/17.24 c mcf : 0.00 1 0 0 0 0
17.18/17.24 c Pricers : Time Calls Vars
17.18/17.24 c problem variables: 0.00 0 0
17.18/17.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
17.18/17.24 c relpscost : 12.32 941 5 166 0 0 1726
17.18/17.24 c pscost : 0.00 0 0 0 0 0 0
17.18/17.24 c inference : 0.00 0 0 0 0 0 0
17.18/17.24 c mostinf : 0.00 0 0 0 0 0 0
17.18/17.24 c leastinf : 0.00 0 0 0 0 0 0
17.18/17.24 c fullstrong : 0.00 0 0 0 0 0 0
17.18/17.24 c allfullstrong : 0.00 0 0 0 0 0 0
17.18/17.24 c random : 0.00 0 0 0 0 0 0
17.18/17.24 c Primal Heuristics : Time Calls Found
17.18/17.24 c LP solutions : 0.00 - 1
17.18/17.24 c pseudo solutions : 0.00 - 0
17.18/17.24 c simplerounding : 0.00 0 0
17.18/17.24 c rounding : 0.00 0 0
17.18/17.24 c shifting : 0.00 0 0
17.18/17.24 c intshifting : 0.00 0 0
17.18/17.24 c oneopt : 0.00 0 0
17.18/17.24 c fixandinfer : 0.00 0 0
17.18/17.24 c feaspump : 0.00 0 0
17.18/17.24 c coefdiving : 0.00 0 0
17.18/17.24 c pscostdiving : 0.00 0 0
17.18/17.24 c fracdiving : 0.00 0 0
17.18/17.24 c veclendiving : 0.00 0 0
17.18/17.24 c intdiving : 0.00 0 0
17.18/17.24 c actconsdiving : 0.00 0 0
17.18/17.24 c objpscostdiving : 0.00 0 0
17.18/17.24 c rootsoldiving : 0.00 0 0
17.18/17.24 c linesearchdiving : 0.00 0 0
17.18/17.24 c guideddiving : 0.00 0 0
17.18/17.24 c octane : 0.00 0 0
17.18/17.24 c rens : 0.00 0 0
17.18/17.24 c rins : 0.00 0 0
17.18/17.24 c localbranching : 0.00 0 0
17.18/17.24 c mutation : 0.00 0 0
17.18/17.24 c crossover : 0.00 0 0
17.18/17.24 c dins : 0.00 0 0
17.18/17.24 c LP : Time Calls Iterations Iter/call Iter/sec
17.18/17.24 c primal LP : 0.00 0 0 0.00 -
17.18/17.24 c dual LP : 3.60 982 25107 25.57 6974.17
17.18/17.24 c barrier LP : 0.00 0 0 0.00 -
17.18/17.24 c diving/probing LP: 0.00 0 0 0.00 -
17.18/17.24 c strong branching : 12.29 1808 69569 38.48 5660.62
17.18/17.24 c (at root node) : - 24 9271 386.29 -
17.18/17.24 c conflict analysis: 0.00 0 0 0.00 -
17.18/17.24 c B&B Tree :
17.18/17.24 c number of runs : 1
17.18/17.24 c nodes : 1315
17.18/17.24 c nodes (total) : 1315
17.18/17.24 c nodes left : 348
17.18/17.24 c max depth : 33
17.18/17.24 c max depth (total): 33
17.18/17.24 c backtracks : 100 (7.6%)
17.18/17.24 c delayed cutoffs : 38
17.18/17.24 c repropagations : 840 (1946 domain reductions, 38 cutoffs)
17.18/17.24 c avg switch length: 3.05
17.18/17.24 c switching time : 0.05
17.18/17.24 c Solution :
17.18/17.24 c Solutions found : 1 (1 improvements)
17.18/17.24 c Primal Bound : +5.50000000000000e+01 (in run 1, after 1315 nodes, 16.95 seconds, depth 17, found by <relaxation>)
17.18/17.24 c Dual Bound : +3.24315755632856e+01
17.18/17.24 c Gap : 69.59 %
17.18/17.24 c Root Dual Bound : +3.09536504329791e+01
17.18/17.25 c Time complete: 17.23.