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-1867985-1245113795.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 470 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.02 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.03 c (round 2) 13 del vars, 17 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.03 c (round 3) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.04 c (round 4) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 256 impls, 0 clqs
0.00/0.05 c (round 5) 19 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.00/0.05 c presolving (6 rounds):
0.00/0.05 c 19 deleted vars, 27 deleted constraints, 11 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 4704 implications, 6 cliques
0.00/0.05 c presolved problem has 201 variables (201 bin, 0 int, 0 impl, 0 cont) and 443 constraints
0.00/0.05 c 129 constraints of type <knapsack>
0.00/0.05 c 314 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c SATUNSAT-LIN
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = c -1
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = c -1
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = c 2000
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = c 0.3
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = c -1
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = c -1
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = c -1
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = c 0.15
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = c 750
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = c -1
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = c -1
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = c 0
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = c FALSE
0.00/0.05 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = c 5
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = c 1
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = c 1
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = c 1620
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = c 1791
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = c 10000
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving problem
0.00/0.05 c
0.06/0.09 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.06/0.09 c 0.1s| 1 | 0 | 355 |1401k| 0 | 152 | 201 | 443 | 443 | 201 | 437 | 0 | 0 | 0 | 3.098560e+01 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 900 |2637k| 0 | 177 | 201 | 443 | 443 | 201 | 655 | 218 | 0 | 0 | 3.712497e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 1173 |4208k| 0 | 175 | 201 | 443 | 443 | 201 | 724 | 287 | 0 | 0 | 3.856130e+01 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 1301 |5249k| 0 | 179 | 201 | 443 | 443 | 201 | 761 | 324 | 0 | 0 | 3.879277e+01 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 1364 |5565k| 0 | 179 | 201 | 443 | 443 | 201 | 765 | 328 | 0 | 0 | 3.900249e+01 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 1434 |6168k| 0 | 177 | 201 | 443 | 443 | 201 | 772 | 335 | 0 | 0 | 3.903598e+01 | -- | Inf
1.79/1.82 c 1.8s| 1 | 2 | 1434 |6168k| 0 | 177 | 201 | 443 | 443 | 201 | 772 | 335 | 0 | 19 | 3.903598e+01 | -- | Inf
20.08/20.17 c *20.0s| 510 | 43 | 27390 |6463k| 18 | - | 201 | 697 | 32 | 201 | 650 | 335 | 264 |1105 | 4.131377e+01 | 5.600000e+01 | 35.55%
20.08/20.17 c
20.08/20.17 c SCIP Status : solving was interrupted [solution limit reached]
20.08/20.17 c Solving Time (sec) : 20.03
20.08/20.17 c Solving Nodes : 510
20.08/20.17 c Primal Bound : +5.60000000000000e+01 (1 solutions)
20.08/20.17 c Dual Bound : +4.13137665146448e+01
20.08/20.17 c Gap : 35.55 %
20.08/20.17 c NODE 510
20.08/20.17 c DUAL BOUND 41.3138
20.08/20.17 c PRIMAL BOUND 56
20.08/20.17 c GAP 0.35548
20.08/20.17 s SATISFIABLE
20.08/20.17 v x219 -x220 -x217 x218 -x215 x216 -x213 x214 -x211 -x212 -x209 -x210 -x207 -x208 -x205 -x206 x203 -x204 -x201 -x202 x199 -x200 -x197
20.08/20.17 v -x198 x195 -x196 x193 -x194 x191 -x192 -x189 x190 -x187 x188 -x185 x186 -x183 x184 -x181 x182 -x179 -x180 -x177 x178 -x175
20.08/20.17 v -x176 x173 -x174 x171 -x172 x169 -x170 -x167 x168 -x165 x166 x163 -x164 -x161 x162 x159 -x160 x157 -x158 x155 -x156 -x153
20.08/20.17 v x154 -x151 x152 x149 -x150 x147 -x148 -x145 x146 x143 -x144 x141 -x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 -x131 x132
20.08/20.17 v -x129 x130 -x128 x126 -x124 -x122 -x120 x118 x116 -x114 x112 -x110 x108 -x106 -x104 x102 x100 -x98 -x96 x94 -x92 -x90 -x88 -x86
20.08/20.17 v -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
20.08/20.17 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
20.08/20.17 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
20.08/20.17 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
20.08/20.17 v -x13 -x11 x9 x7 -x5 -x3 x1
20.08/20.17 c SCIP Status : solving was interrupted [solution limit reached]
20.08/20.17 c Solving Time : 20.03
20.08/20.17 c Original Problem :
20.08/20.17 c Problem name : HOME/instance-1867985-1245113795.opb
20.08/20.17 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
20.08/20.17 c Constraints : 470 initial, 470 maximal
20.08/20.17 c Presolved Problem :
20.08/20.17 c Problem name : t_HOME/instance-1867985-1245113795.opb
20.08/20.17 c Variables : 201 (201 binary, 0 integer, 0 implicit integer, 0 continuous)
20.08/20.17 c Constraints : 443 initial, 697 maximal
20.08/20.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
20.08/20.17 c trivial : 0.00 0 0 0 0 0 0 0 0
20.08/20.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
20.08/20.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
20.08/20.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
20.08/20.17 c implics : 0.00 0 8 0 0 0 0 0 0
20.08/20.17 c probing : 0.00 0 0 0 0 0 0 0 0
20.08/20.17 c knapsack : 0.00 0 0 0 0 0 0 0 0
20.08/20.17 c linear : 0.02 11 0 0 11 0 27 0 0
20.08/20.17 c logicor : 0.00 0 0 0 0 0 0 0 0
20.08/20.17 c root node : - 0 - - 0 - - - -
20.08/20.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
20.08/20.17 c integral : 0 0 0 322 0 3 71 0 0 588
20.08/20.17 c knapsack : 129 5 2163 1 0 181 5525 191 0 0
20.08/20.17 c logicor : 314+ 5 1554 1 0 38 3330 0 0 0
20.08/20.17 c countsols : 0 0 0 1 0 0 0 0 0 0
20.08/20.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
20.08/20.17 c integral : 14.76 0.00 0.00 14.76 0.00
20.08/20.17 c knapsack : 0.05 0.00 0.05 0.00 0.00
20.08/20.17 c logicor : 0.03 0.00 0.03 0.00 0.00
20.08/20.17 c countsols : 0.00 0.00 0.00 0.00 0.00
20.08/20.17 c Propagators : Time Calls Cutoffs DomReds
20.08/20.17 c rootredcost : 0.00 0 0 0
20.08/20.17 c pseudoobj : 0.04 2171 0 0
20.08/20.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
20.08/20.17 c propagation : 0.03 219 172 994 43.3 7 20.6 -
20.08/20.17 c infeasible LP : 0.00 29 0 0 0.0 0 0.0 0
20.08/20.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
20.08/20.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
20.08/20.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
20.08/20.17 c applied globally : - - - 256 14.8 - - -
20.08/20.17 c applied locally : - - - 8 51.5 - - -
20.08/20.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
20.08/20.17 c cut pool : 0.01 4 - - 20 - (maximal pool size: 1687)
20.08/20.17 c redcost : 0.00 312 0 0 0 0
20.08/20.17 c impliedbounds : 0.02 5 0 0 475 0
20.08/20.17 c intobj : 0.00 0 0 0 0 0
20.08/20.17 c gomory : 0.36 5 0 0 88 0
20.08/20.17 c strongcg : 0.36 5 0 0 1358 0
20.08/20.17 c cmir : 0.00 0 0 0 0 0
20.08/20.17 c flowcover : 0.00 0 0 0 0 0
20.08/20.17 c clique : 0.00 5 0 0 12 0
20.08/20.17 c zerohalf : 0.00 0 0 0 0 0
20.08/20.17 c mcf : 0.00 1 0 0 0 0
20.08/20.17 c Pricers : Time Calls Vars
20.08/20.17 c problem variables: 0.00 0 0
20.08/20.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
20.08/20.17 c relpscost : 14.76 321 3 71 0 0 588
20.08/20.17 c pscost : 0.00 0 0 0 0 0 0
20.08/20.17 c inference : 0.00 0 0 0 0 0 0
20.08/20.17 c mostinf : 0.00 0 0 0 0 0 0
20.08/20.17 c leastinf : 0.00 0 0 0 0 0 0
20.08/20.17 c fullstrong : 0.00 0 0 0 0 0 0
20.08/20.17 c allfullstrong : 0.00 0 0 0 0 0 0
20.08/20.17 c random : 0.00 0 0 0 0 0 0
20.08/20.17 c Primal Heuristics : Time Calls Found
20.08/20.17 c LP solutions : 0.00 - 1
20.08/20.17 c pseudo solutions : 0.00 - 0
20.08/20.17 c simplerounding : 0.00 0 0
20.08/20.17 c rounding : 0.00 0 0
20.08/20.17 c shifting : 0.00 0 0
20.08/20.17 c intshifting : 0.00 0 0
20.08/20.17 c oneopt : 0.00 0 0
20.08/20.17 c fixandinfer : 0.00 0 0
20.08/20.17 c feaspump : 0.00 0 0
20.08/20.17 c coefdiving : 0.00 0 0
20.08/20.17 c pscostdiving : 0.00 0 0
20.08/20.17 c fracdiving : 0.00 0 0
20.08/20.17 c veclendiving : 0.00 0 0
20.08/20.17 c intdiving : 0.00 0 0
20.08/20.17 c actconsdiving : 0.00 0 0
20.08/20.17 c objpscostdiving : 0.00 0 0
20.08/20.17 c rootsoldiving : 0.00 0 0
20.08/20.17 c linesearchdiving : 0.00 0 0
20.08/20.17 c guideddiving : 0.00 0 0
20.08/20.17 c octane : 0.00 0 0
20.08/20.17 c rens : 0.00 0 0
20.08/20.17 c rins : 0.00 0 0
20.08/20.17 c localbranching : 0.00 0 0
20.08/20.17 c mutation : 0.00 0 0
20.08/20.17 c crossover : 0.00 0 0
20.08/20.17 c dins : 0.00 0 0
20.08/20.17 c LP : Time Calls Iterations Iter/call Iter/sec
20.08/20.17 c primal LP : 0.02 0 0 0.00 0.00
20.08/20.17 c dual LP : 4.24 356 27390 76.94 6459.91
20.08/20.17 c barrier LP : 0.00 0 0 0.00 -
20.08/20.17 c diving/probing LP: 0.00 0 0 0.00 -
20.08/20.17 c strong branching : 14.74 1105 92388 83.61 6267.84
20.08/20.17 c (at root node) : - 19 3124 164.42 -
20.08/20.17 c conflict analysis: 0.00 0 0 0.00 -
20.08/20.17 c B&B Tree :
20.08/20.17 c number of runs : 1
20.08/20.17 c nodes : 510
20.08/20.17 c nodes (total) : 510
20.08/20.17 c nodes left : 43
20.08/20.17 c max depth : 18
20.08/20.17 c max depth (total): 18
20.08/20.17 c backtracks : 76 (14.9%)
20.08/20.17 c delayed cutoffs : 36
20.08/20.17 c repropagations : 290 (1383 domain reductions, 36 cutoffs)
20.08/20.17 c avg switch length: 3.21
20.08/20.17 c switching time : 0.04
20.08/20.17 c Solution :
20.08/20.17 c Solutions found : 1 (1 improvements)
20.08/20.17 c Primal Bound : +5.60000000000000e+01 (in run 1, after 510 nodes, 20.03 seconds, depth 14, found by <relaxation>)
20.08/20.17 c Dual Bound : +4.13137665146448e+01
20.08/20.17 c Gap : 35.55 %
20.08/20.17 c Root Dual Bound : +3.90359821628849e+01
20.08/20.18 c Time complete: 20.17.