0.04/0.05 c SCIP version 1.1.0.7
0.04/0.05 c LP-Solver Clp 1.8.2
0.04/0.05 c user parameter file <scip.set> not found - using default parameters
0.04/0.05 c read problem <HOME/instance-1868361-1245122251.opb>
0.04/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.04/0.06 c No objective function, only one solution is needed.
0.04/0.06 c start presolving problem
0.04/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.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 61 |3513k| 0 | 38 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 138 |3751k| 0 | 58 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.66 c 0.6s| 1 | 0 | 192 |3879k| 0 | 61 | 231 |2564 |2564 | 231 |2574 | 10 | 0 | 0 | 1.100000e+01 | -- | Inf
0.99/1.07 c 1.0s| 1 | 0 | 316 |3988k| 0 | 53 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 493 |4071k| 0 | 50 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
1.79/1.85 c 1.8s| 1 | 0 | 712 |4419k| 0 | 45 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 0 | 1.100000e+01 | -- | Inf
2.79/2.86 c 2.8s| 1 | 2 | 712 |4419k| 0 | 45 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 18 | 1.100000e+01 | -- | Inf
133.44/133.51 c 133s| 10000 | 1638 |337304 |8516k| 59 | 30 | 231 |3059 |1720 | 231 |2571 | 19 |1507 |2055 | 1.400000e+01 | -- | Inf
205.82/205.99 c * 205s| 17759 | 2414 |578328 | 10M| 59 | - | 231 |3314 | 415 | 231 |2571 | 19 |2935 |2377 | 1.400000e+01 | 2.200000e+01 | 57.14%
205.82/205.99 c
205.82/205.99 c SCIP Status : solving was interrupted [solution limit reached]
205.82/205.99 c Solving Time (sec) : 204.60
205.82/205.99 c Solving Nodes : 17759
205.82/205.99 c Primal Bound : +2.20000000000000e+01 (1 solutions)
205.82/205.99 c Dual Bound : +1.40000000000000e+01
205.82/205.99 c Gap : 57.14 %
205.82/205.99 c NODE 17759
205.82/205.99 c DUAL BOUND 14
205.82/205.99 c PRIMAL BOUND 22
205.82/205.99 c GAP 0.571429
205.82/205.99 s SATISFIABLE
205.82/205.99 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 x151 -x141 -x131 -x231 x210 -x200 -x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220
205.82/205.99 v -x199 x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 x138 -x128 -x228 -x218 -x208
205.82/205.99 v -x198 x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
205.82/205.99 v -x186 -x176 -x155 -x145 -x135 x125 -x225 -x215 -x205 -x195 -x185 -x175 x165 -x144 -x134 -x124 -x224 x214 -x204 -x194 -x184 -x174
205.82/205.99 v -x164 -x154 -x133 -x123 x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 x192 -x182 -x172 -x162
205.82/205.99 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 x109 -x108 -x107 -x106 -x105 -x104
205.82/205.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
205.82/205.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
205.82/205.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
205.82/205.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
205.82/205.99 v -x1
205.82/205.99 c SCIP Status : solving was interrupted [solution limit reached]
205.82/205.99 c Solving Time : 204.60
205.82/205.99 c Original Problem :
205.82/205.99 c Problem name : HOME/instance-1868361-1245122251.opb
205.82/205.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
205.82/205.99 c Constraints : 2707 initial, 2707 maximal
205.82/205.99 c Presolved Problem :
205.82/205.99 c Problem name : t_HOME/instance-1868361-1245122251.opb
205.82/205.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
205.82/205.99 c Constraints : 2564 initial, 3315 maximal
205.82/205.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
205.82/205.99 c trivial : 0.01 0 0 0 0 0 0 0 0
205.82/205.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
205.82/205.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
205.82/205.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
205.82/205.99 c implics : 0.00 0 0 0 0 0 0 0 0
205.82/205.99 c probing : 0.00 0 0 0 0 0 0 0 0
205.82/205.99 c knapsack : 0.00 0 0 0 0 0 0 0 0
205.82/205.99 c setppc : 0.00 0 0 0 0 0 0 0 0
205.82/205.99 c linear : 0.02 0 0 0 0 0 143 0 0
205.82/205.99 c logicor : 0.03 0 0 0 0 0 0 0 0
205.82/205.99 c root node : - 0 - - 0 - - - -
205.82/205.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
205.82/205.99 c integral : 0 0 0 10626 0 113 733 0 0 20278
205.82/205.99 c knapsack : 1 5 39194 1 0 212 51386 0 0 0
205.82/205.99 c setppc : 22 5 39052 1 0 724 105444 0 0 0
205.82/205.99 c logicor : 2541+ 5 33828 1 0 260 124356 0 0 0
205.82/205.99 c countsols : 0 0 0 1 0 0 0 0 0 0
205.82/205.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
205.82/205.99 c integral : 43.32 0.00 0.00 43.32 0.00
205.82/205.99 c knapsack : 0.24 0.00 0.24 0.00 0.00
205.82/205.99 c setppc : 0.50 0.00 0.50 0.00 0.00
205.82/205.99 c logicor : 2.27 0.00 2.27 0.00 0.00
205.82/205.99 c countsols : 0.00 0.00 0.00 0.00 0.00
205.82/205.99 c Propagators : Time Calls Cutoffs DomReds
205.82/205.99 c rootredcost : 0.05 0 0 0
205.82/205.99 c pseudoobj : 0.57 39267 0 0
205.82/205.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
205.82/205.99 c propagation : 0.10 1196 1195 6058 18.9 16 14.1 -
205.82/205.99 c infeasible LP : 0.20 6416 0 0 0.0 0 0.0 0
205.82/205.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
205.82/205.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
205.82/205.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
205.82/205.99 c applied globally : - - - 2924 16.4 - - -
205.82/205.99 c applied locally : - - - 11 33.3 - - -
205.82/205.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
205.82/205.99 c cut pool : 0.00 4 - - 18 - (maximal pool size: 317)
205.82/205.99 c redcost : 0.19 10291 0 0 0 0
205.82/205.99 c impliedbounds : 0.00 5 0 0 0 0
205.82/206.00 c intobj : 0.00 0 0 0 0 0
205.82/206.00 c gomory : 0.92 5 0 0 1697 0
205.82/206.00 c strongcg : 0.52 5 0 0 2500 0
205.82/206.00 c cmir : 0.00 0 0 0 0 0
205.82/206.00 c flowcover : 0.00 0 0 0 0 0
205.82/206.00 c clique : 0.00 5 0 0 0 0
205.82/206.00 c zerohalf : 0.00 0 0 0 0 0
205.82/206.00 c mcf : 0.00 1 0 0 0 0
205.82/206.00 c Pricers : Time Calls Vars
205.82/206.00 c problem variables: 0.00 0 0
205.82/206.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
205.82/206.00 c relpscost : 43.29 10625 113 733 0 0 20278
205.82/206.00 c pscost : 0.00 0 0 0 0 0 0
205.82/206.00 c inference : 0.00 0 0 0 0 0 0
205.82/206.00 c mostinf : 0.00 0 0 0 0 0 0
205.82/206.00 c leastinf : 0.00 0 0 0 0 0 0
205.82/206.00 c fullstrong : 0.00 0 0 0 0 0 0
205.82/206.00 c allfullstrong : 0.00 0 0 0 0 0 0
205.82/206.00 c random : 0.00 0 0 0 0 0 0
205.82/206.00 c Primal Heuristics : Time Calls Found
205.82/206.00 c LP solutions : 0.00 - 1
205.82/206.00 c pseudo solutions : 0.00 - 0
205.82/206.00 c simplerounding : 0.00 0 0
205.82/206.00 c rounding : 0.00 0 0
205.82/206.00 c shifting : 0.00 0 0
205.82/206.00 c intshifting : 0.00 0 0
205.82/206.00 c oneopt : 0.00 0 0
205.82/206.00 c fixandinfer : 0.00 0 0
205.82/206.00 c feaspump : 0.00 0 0
205.82/206.00 c coefdiving : 0.00 0 0
205.82/206.00 c pscostdiving : 0.00 0 0
205.82/206.00 c fracdiving : 0.00 0 0
205.82/206.00 c veclendiving : 0.00 0 0
205.82/206.00 c intdiving : 0.00 0 0
205.82/206.00 c actconsdiving : 0.00 0 0
205.82/206.00 c objpscostdiving : 0.00 0 0
205.82/206.00 c rootsoldiving : 0.00 0 0
205.82/206.00 c linesearchdiving : 0.00 0 0
205.82/206.00 c guideddiving : 0.00 0 0
205.82/206.00 c octane : 0.00 0 0
205.82/206.00 c rens : 0.00 0 0
205.82/206.00 c rins : 0.00 0 0
205.82/206.00 c localbranching : 0.00 0 0
205.82/206.00 c mutation : 0.00 0 0
205.82/206.00 c crossover : 0.00 0 0
205.82/206.00 c dins : 0.00 0 0
205.82/206.00 c LP : Time Calls Iterations Iter/call Iter/sec
205.82/206.00 c primal LP : 0.02 0 0 0.00 0.00
205.82/206.00 c dual LP : 146.74 17004 578328 34.01 3941.17
205.82/206.00 c barrier LP : 0.00 0 0 0.00 -
205.82/206.00 c diving/probing LP: 0.00 0 0 0.00 -
205.82/206.00 c strong branching : 42.90 2377 177835 74.81 4145.34
205.82/206.00 c (at root node) : - 18 3310 183.89 -
205.82/206.00 c conflict analysis: 0.00 0 0 0.00 -
205.82/206.00 c B&B Tree :
205.82/206.00 c number of runs : 1
205.82/206.00 c nodes : 17759
205.82/206.00 c nodes (total) : 17759
205.82/206.00 c nodes left : 2414
205.82/206.00 c max depth : 59
205.82/206.00 c max depth (total): 59
205.82/206.00 c backtracks : 1554 (8.8%)
205.82/206.00 c delayed cutoffs : 106
205.82/206.00 c repropagations : 2063 (7055 domain reductions, 106 cutoffs)
205.82/206.00 c avg switch length: 3.32
205.82/206.00 c switching time : 2.40
205.82/206.00 c Solution :
205.82/206.00 c Solutions found : 1 (1 improvements)
205.82/206.00 c Primal Bound : +2.20000000000000e+01 (in run 1, after 17759 nodes, 204.60 seconds, depth 37, found by <relaxation>)
205.82/206.00 c Dual Bound : +1.40000000000000e+01
205.82/206.00 c Gap : 57.14 %
205.82/206.00 c Root Dual Bound : +1.10000000000000e+01
205.92/206.02 c Time complete: 205.95.