0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2666021-1276353496.opb>
0.00/0.01 c original problem has 319 variables (319 bin, 0 int, 0 impl, 0 cont) and 6 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 23554
0.00/0.02 c feasible solution found by trivial heuristic, objective value 2.355400e+04
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 0 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 101/319 (31.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (2 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 0 implications, 0 cliques
0.00/0.04 c presolved problem has 319 variables (319 bin, 0 int, 0 impl, 0 cont) and 6 constraints
0.00/0.04 c 6 constraints of type <knapsack>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.01
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1800
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c t 0.0s| 1 | 0 | 15 | - |1185k| 0 | 5 | 319 | 6 | 319 | 6 | 0 | 0 | 0 | 2.909311e+02 | 2.355400e+04 |7996.08%
0.00/0.04 o 510
0.00/0.04 c r 0.0s| 1 | 0 | 15 | - |1189k| 0 | 5 | 319 | 6 | 319 | 6 | 0 | 0 | 0 | 2.909311e+02 | 5.100000e+02 | 75.30%
0.00/0.04 o 446
0.00/0.04 c R 0.0s| 1 | 0 | 15 | - |1192k| 0 | 5 | 319 | 6 | 319 | 6 | 0 | 0 | 0 | 2.909311e+02 | 4.460000e+02 | 53.30%
0.00/0.04 o 434
0.00/0.04 c s 0.0s| 1 | 0 | 15 | - |1196k| 0 | 5 | 319 | 6 | 319 | 6 | 0 | 0 | 0 | 2.909311e+02 | 4.340000e+02 | 49.18%
0.09/0.13 c 0.1s| 1 | 0 | 17 | - |1254k| 0 | 7 | 319 | 6 | 319 | 7 | 1 | 0 | 0 | 2.910214e+02 | 4.340000e+02 | 49.13%
0.09/0.13 o 308
0.09/0.13 c b 0.1s| 1 | 0 | 17 | - |1258k| 0 | 7 | 319 | 6 | 319 | 7 | 1 | 0 | 0 | 2.910214e+02 | 3.080000e+02 | 5.83%
0.09/0.13 o 307
0.09/0.13 c R 0.1s| 1 | 0 | 17 | - |1260k| 0 | 7 | 319 | 6 | 319 | 7 | 1 | 0 | 0 | 2.910214e+02 | 3.070000e+02 | 5.49%
0.09/0.18 c 0.1s| 1 | 0 | 18 | - |1293k| 0 | 7 | 319 | 6 | 319 | 8 | 2 | 0 | 0 | 2.911333e+02 | 3.070000e+02 | 5.45%
0.19/0.23 c 0.2s| 1 | 0 | 19 | - |1315k| 0 | 8 | 319 | 6 | 319 | 9 | 3 | 0 | 0 | 2.911568e+02 | 3.070000e+02 | 5.44%
0.19/0.28 c 0.3s| 1 | 0 | 23 | - |1326k| 0 | 7 | 319 | 6 | 319 | 10 | 4 | 0 | 0 | 2.913876e+02 | 3.070000e+02 | 5.36%
0.29/0.33 c 0.3s| 1 | 0 | 26 | - |1355k| 0 | 11 | 319 | 6 | 319 | 11 | 5 | 0 | 0 | 2.915337e+02 | 3.070000e+02 | 5.31%
0.29/0.39 c 0.4s| 1 | 0 | 33 | - |1375k| 0 | 12 | 319 | 6 | 319 | 13 | 7 | 0 | 0 | 2.939312e+02 | 3.070000e+02 | 4.45%
0.39/0.45 c 0.4s| 1 | 0 | 39 | - |1434k| 0 | 13 | 319 | 6 | 319 | 14 | 8 | 0 | 0 | 2.945344e+02 | 3.070000e+02 | 4.23%
0.49/0.52 c 0.5s| 1 | 0 | 41 | - |1466k| 0 | 14 | 319 | 6 | 319 | 15 | 9 | 0 | 0 | 2.945809e+02 | 3.070000e+02 | 4.22%
0.49/0.59 c 0.6s| 1 | 0 | 42 | - |1486k| 0 | 14 | 319 | 6 | 319 | 16 | 10 | 0 | 0 | 2.945884e+02 | 3.070000e+02 | 4.21%
0.59/0.66 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.66 c 0.6s| 1 | 0 | 48 | - |1497k| 0 | 15 | 319 | 6 | 319 | 17 | 11 | 0 | 0 | 2.946245e+02 | 3.070000e+02 | 4.20%
0.69/0.71 c 0.7s| 1 | 0 | 53 | - |1507k| 0 | 15 | 319 | 6 | 319 | 18 | 12 | 0 | 0 | 2.946492e+02 | 3.070000e+02 | 4.19%
0.69/0.76 c 0.7s| 1 | 0 | 56 | - |1520k| 0 | 17 | 319 | 6 | 319 | 19 | 13 | 0 | 0 | 2.947209e+02 | 3.070000e+02 | 4.17%
0.79/0.81 c 0.8s| 1 | 0 | 64 | - |1541k| 0 | 15 | 319 | 6 | 319 | 20 | 14 | 0 | 0 | 2.952796e+02 | 3.070000e+02 | 3.97%
0.79/0.86 c 0.8s| 1 | 0 | 71 | - |1549k| 0 | 15 | 319 | 6 | 319 | 21 | 15 | 0 | 0 | 2.957766e+02 | 3.070000e+02 | 3.79%
0.89/0.91 c 0.9s| 1 | 0 | 77 | - |1566k| 0 | 17 | 319 | 6 | 319 | 22 | 16 | 0 | 0 | 2.957920e+02 | 3.070000e+02 | 3.79%
0.89/0.96 c 0.9s| 1 | 0 | 80 | - |1579k| 0 | 18 | 319 | 6 | 319 | 23 | 17 | 0 | 0 | 2.958022e+02 | 3.070000e+02 | 3.79%
1.00/1.01 c 1.0s| 1 | 0 | 89 | - |1585k| 0 | 14 | 319 | 6 | 319 | 24 | 18 | 0 | 0 | 2.960983e+02 | 3.070000e+02 | 3.68%
1.00/1.06 c 1.0s| 1 | 0 | 91 | - |1594k| 0 | 16 | 319 | 6 | 319 | 25 | 19 | 0 | 0 | 2.961023e+02 | 3.070000e+02 | 3.68%
1.10/1.11 c 1.1s| 1 | 0 | 99 | - |1609k| 0 | 16 | 319 | 6 | 319 | 26 | 20 | 0 | 0 | 2.961266e+02 | 3.070000e+02 | 3.67%
1.10/1.16 c 1.1s| 1 | 0 | 104 | - |1620k| 0 | 17 | 319 | 6 | 319 | 27 | 21 | 0 | 0 | 2.961351e+02 | 3.070000e+02 | 3.67%
1.19/1.21 c 1.2s| 1 | 0 | 108 | - |1634k| 0 | 17 | 319 | 6 | 319 | 28 | 22 | 0 | 0 | 2.961394e+02 | 3.070000e+02 | 3.67%
1.19/1.25 c 1.2s| 1 | 0 | 110 | - |1645k| 0 | 18 | 319 | 6 | 319 | 29 | 23 | 0 | 0 | 2.961564e+02 | 3.070000e+02 | 3.66%
1.29/1.39 c 1.3s| 1 | 0 | 110 | - |1654k| 0 | - | 319 | 6 | 319 | 29 | 23 | 0 | 18 | 2.961564e+02 | 3.070000e+02 | 3.66%
1.29/1.39 c (run 1, node 1) restarting after 226 global fixings of integer variables
1.29/1.39 c
1.29/1.39 c (restart) converted 11 cuts from the global cut pool into linear constraints
1.29/1.39 c
1.29/1.39 c presolving:
1.29/1.39 c (round 1) 226 del vars, 0 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
1.39/1.40 c (round 2) 226 del vars, 0 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 11 upgd conss, 0 impls, 0 clqs
1.39/1.40 c presolving (3 rounds):
1.39/1.40 c 226 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.39/1.40 c 0 implications, 0 cliques
1.39/1.40 c presolved problem has 93 variables (93 bin, 0 int, 0 impl, 0 cont) and 17 constraints
1.39/1.40 c 14 constraints of type <knapsack>
1.39/1.40 c 3 constraints of type <logicor>
1.39/1.40 c transformed objective value is always integral (scale: 1)
1.39/1.40 c Presolving Time: 0.02
1.39/1.40 c
1.39/1.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.40 c 1.3s| 1 | 0 | 152 | - |1236k| 0 | 12 | 93 | 17 | 93 | 17 | 0 | 0 | 18 | 2.955105e+02 | 3.070000e+02 | 3.89%
1.39/1.42 c 1.4s| 1 | 0 | 162 | - |1261k| 0 | 12 | 93 | 17 | 93 | 20 | 3 | 0 | 18 | 2.961730e+02 | 3.070000e+02 | 3.66%
1.39/1.43 c 1.4s| 1 | 2 | 162 | - |1267k| 0 | 12 | 93 | 17 | 93 | 20 | 3 | 0 | 30 | 2.961730e+02 | 3.070000e+02 | 3.66%
1.89/1.93 c
1.89/1.93 c SCIP Status : problem is solved [optimal solution found]
1.89/1.93 c Solving Time (sec) : 1.75
1.89/1.93 c Solving Nodes : 215 (total of 216 nodes in 2 runs)
1.89/1.93 c Primal Bound : +3.07000000000000e+02 (293 solutions)
1.89/1.93 c Dual Bound : +3.07000000000000e+02
1.89/1.93 c Gap : 0.00 %
1.89/1.94 s OPTIMUM FOUND
1.89/1.94 v -x246 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x221
1.89/1.94 v -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x199
1.89/1.94 v -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x177 -x176
1.89/1.94 v -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x155 -x154 -x153
1.89/1.94 v -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x133 -x132 -x131 -x130
1.89/1.94 v -x129 -x128 -x127 -x126 -x125 -x124 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x110 -x109 -x108 -x107 -x106
1.89/1.94 v -x105 -x104 -x103 -x102 -x101 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80
1.89/1.94 v -x79 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x55 -x54 -x53 -x52
1.89/1.94 v -x51 -x50 -x49 -x48 -x47 -x46 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25
1.89/1.94 v x24 -x22 x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x319 -x318 -x317 -x316 -x315
1.89/1.94 v -x314 -x313 -x312 -x311 -x310 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x297 -x296 -x295 -x294 -x293 -x292
1.89/1.94 v -x291 -x290 x289 -x288 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 x278 -x277 -x275 -x274 -x273 -x272 -x271 -x270 -x269
1.89/1.94 v -x268 -x267 -x266 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x245
1.89/1.94 v -x234 -x223 -x211 -x200 -x189 -x178 -x167 -x156 -x145 -x134 -x123 -x112 -x100 -x89 -x78 -x67 -x56 -x45 -x34 -x23 -x12 -x1
1.89/1.94 v -x309 -x298 -x287 -x276 -x265 x254 -x222 -x111
1.89/1.94 c SCIP Status : problem is solved [optimal solution found]
1.89/1.94 c Solving Time : 1.75
1.89/1.94 c Original Problem :
1.89/1.94 c Problem name : HOME/instance-2666021-1276353496.opb
1.89/1.94 c Variables : 319 (319 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.94 c Constraints : 6 initial, 6 maximal
1.89/1.94 c Presolved Problem :
1.89/1.94 c Problem name : t_HOME/instance-2666021-1276353496.opb
1.89/1.94 c Variables : 93 (93 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.94 c Constraints : 17 initial, 20 maximal
1.89/1.94 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.94 c trivial : 0.00 226 0 0 0 0 0 0 0
1.89/1.94 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.89/1.94 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.94 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.94 c implics : 0.00 0 0 0 0 0 0 0 0
1.89/1.94 c probing : 0.00 0 0 0 0 0 0 0 0
1.89/1.94 c knapsack : 0.02 0 0 0 0 0 0 0 0
1.89/1.94 c linear : 0.00 0 0 0 0 0 0 1 0
1.89/1.94 c logicor : 0.00 0 0 0 0 0 0 0 0
1.89/1.94 c root node : - 254 - - 254 - - - -
1.89/1.94 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.94 c integral : 0 0 0 273 0 20 212 0 0 214
1.89/1.94 c knapsack : 14 24 788 0 0 14 54 116 0 0
1.89/1.94 c logicor : 3+ 1 169 0 0 0 4 0 0 0
1.89/1.94 c countsols : 0 0 0 0 0 0 0 0 0 0
1.89/1.94 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.94 c integral : 0.25 0.00 0.00 0.25 0.00
1.89/1.94 c knapsack : 0.99 0.99 0.00 0.00 0.00
1.89/1.94 c logicor : 0.00 0.00 0.00 0.00 0.00
1.89/1.94 c countsols : 0.00 0.00 0.00 0.00 0.00
1.89/1.94 c Propagators : Time Calls Cutoffs DomReds
1.89/1.94 c vbounds : 0.00 3 0 0
1.89/1.94 c rootredcost : 0.00 0 0 0
1.89/1.94 c pseudoobj : 0.02 628 5 59
1.89/1.94 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.94 c propagation : 0.00 18 17 19 49.0 0 0.0 -
1.89/1.94 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.94 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.94 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.94 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.94 c applied globally : - - - 3 24.3 - - -
1.89/1.94 c applied locally : - - - 14 53.3 - - -
1.89/1.94 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.94 c cut pool : 0.00 0 - - 0 - (maximal pool size: 12)
1.89/1.94 c redcost : 0.02 376 0 1700 0 0
1.89/1.94 c impliedbounds : 0.00 24 0 0 0 0
1.89/1.94 c intobj : 0.00 0 0 0 0 0
1.89/1.94 c cgmip : 0.00 0 0 0 0 0
1.89/1.94 c gomory : 0.01 24 0 0 0 0
1.89/1.94 c strongcg : 0.05 21 0 0 3 0
1.89/1.94 c cmir : 0.00 11 0 0 4 0
1.89/1.94 c flowcover : 0.15 11 0 0 80 0
1.89/1.94 c clique : 0.00 2 0 0 0 0
1.89/1.94 c zerohalf : 0.00 0 0 0 0 0
1.89/1.94 c mcf : 0.00 2 0 0 0 0
1.89/1.94 c rapidlearning : 0.03 1 0 0 0 0
1.89/1.94 c Pricers : Time Calls Vars
1.89/1.94 c problem variables: 0.00 0 0
1.89/1.94 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.94 c relpscost : 0.25 273 20 212 0 0 214
1.89/1.94 c pscost : 0.00 0 0 0 0 0 0
1.89/1.94 c inference : 0.00 0 0 0 0 0 0
1.89/1.94 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.94 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.94 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.94 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.94 c random : 0.00 0 0 0 0 0 0
1.89/1.94 c Primal Heuristics : Time Calls Found
1.89/1.94 c LP solutions : 0.00 - 0
1.89/1.94 c pseudo solutions : 0.00 - 0
1.89/1.94 c linesearchdiving : 0.00 0 0
1.89/1.94 c guideddiving : 0.00 0 0
1.89/1.94 c feaspump : 0.00 0 0
1.89/1.94 c oneopt : 0.00 2 1
1.89/1.94 c coefdiving : 0.00 1 5
1.89/1.94 c pscostdiving : 0.00 1 0
1.89/1.94 c fracdiving : 0.00 1 0
1.89/1.94 c veclendiving : 0.00 1 2
1.89/1.94 c rootsoldiving : 0.00 1 2
1.89/1.94 c trivial : 0.01 2 3
1.89/1.94 c simplerounding : 0.00 322 164
1.89/1.94 c zirounding : 0.00 128 103
1.89/1.94 c rounding : 0.00 322 2
1.89/1.94 c shifting : 0.00 53 7
1.89/1.94 c intshifting : 0.00 0 0
1.89/1.94 c twoopt : 0.00 0 0
1.89/1.94 c fixandinfer : 0.00 0 0
1.89/1.94 c intdiving : 0.00 0 0
1.89/1.94 c actconsdiving : 0.00 0 0
1.89/1.94 c objpscostdiving : 0.00 1 3
1.89/1.94 c octane : 0.00 0 0
1.89/1.94 c rens : 0.03 1 1
1.89/1.94 c rins : 0.00 0 0
1.89/1.94 c localbranching : 0.00 0 0
1.89/1.94 c mutation : 0.00 0 0
1.89/1.94 c crossover : 0.01 1 0
1.89/1.94 c dins : 0.00 0 0
1.89/1.94 c undercover : 0.00 0 0
1.89/1.94 c nlp : 0.00 0 0
1.89/1.94 c trysol : 0.00 0 0
1.89/1.94 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.94 c primal LP : 0.00 0 0 0.00 -
1.89/1.94 c dual LP : 0.10 395 2092 5.30 20920.00
1.89/1.94 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.94 c barrier LP : 0.00 0 0 0.00 -
1.89/1.94 c diving/probing LP: 0.00 22 91 4.14 -
1.89/1.94 c strong branching : 0.23 498 6689 13.43 29082.61
1.89/1.94 c (at root node) : - 30 754 25.13 -
1.89/1.94 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.94 c B&B Tree :
1.89/1.94 c number of runs : 2
1.89/1.94 c nodes : 215
1.89/1.94 c nodes (total) : 216
1.89/1.94 c nodes left : 0
1.89/1.94 c max depth : 23
1.89/1.94 c max depth (total): 23
1.89/1.94 c backtracks : 33 (15.3%)
1.89/1.94 c delayed cutoffs : 0
1.89/1.94 c repropagations : 6 (4 domain reductions, 0 cutoffs)
1.89/1.94 c avg switch length: 2.60
1.89/1.94 c switching time : 0.02
1.89/1.94 c Solution :
1.89/1.94 c Solutions found : 293 (6 improvements)
1.89/1.94 c First Solution : +2.35540000000000e+04 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.89/1.94 c Primal Bound : +3.07000000000000e+02 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <rounding>)
1.89/1.94 c Dual Bound : +3.07000000000000e+02
1.89/1.94 c Gap : 0.00 %
1.89/1.94 c Root Dual Bound : +2.96173016143014e+02
1.89/1.94 c Root Iterations : 162
1.89/1.94 c Time complete: 1.94.