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-2666102-1276448573.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 300 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
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, 1 chg coeffs, 0 upgd conss, 208 impls, 0 clqs
0.00/0.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 300 upgd conss, 208 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.03 c 208 implications, 0 cliques
0.00/0.03 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 300 constraints
0.00/0.03 c 300 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1799.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/0.03 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.04 c
0.00/0.06 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.06 c 0.0s| 1 | 0 | 316 | - |1001k| 0 | 199 | 200 | 300 | 200 | 300 | 0 | 0 | 0 | 6.685101e+01 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 332 | - |2362k| 0 | 199 | 200 | 300 | 200 | 301 | 1 | 0 | 0 | 6.696037e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 351 | - |3737k| 0 | 199 | 200 | 300 | 200 | 302 | 2 | 0 | 0 | 6.700576e+01 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 365 | - |5059k| 0 | 200 | 200 | 300 | 200 | 303 | 3 | 0 | 0 | 6.705489e+01 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 389 | - |6451k| 0 | 200 | 200 | 300 | 200 | 304 | 4 | 0 | 0 | 6.713004e+01 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 426 | - |7863k| 0 | 200 | 200 | 300 | 200 | 305 | 5 | 0 | 0 | 6.716794e+01 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 476 | - |9185k| 0 | 198 | 200 | 300 | 200 | 307 | 7 | 0 | 0 | 6.721850e+01 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 530 | - | 10M| 0 | 198 | 200 | 300 | 200 | 308 | 8 | 0 | 0 | 6.726106e+01 | -- | Inf
1.00/1.01 c 1.0s| 1 | 0 | 543 | - | 11M| 0 | 197 | 200 | 300 | 200 | 309 | 9 | 0 | 0 | 6.727703e+01 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 569 | - | 12M| 0 | 196 | 200 | 300 | 200 | 310 | 10 | 0 | 0 | 6.728331e+01 | -- | Inf
1.19/1.26 c 1.2s| 1 | 0 | 622 | - | 13M| 0 | 199 | 200 | 300 | 200 | 311 | 11 | 0 | 0 | 6.729573e+01 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 639 | - | 13M| 0 | 199 | 200 | 300 | 200 | 312 | 12 | 0 | 0 | 6.729861e+01 | -- | Inf
1.39/1.47 c 1.4s| 1 | 0 | 705 | - | 13M| 0 | 196 | 200 | 300 | 200 | 314 | 14 | 0 | 0 | 6.733600e+01 | -- | Inf
1.49/1.58 c 1.5s| 1 | 0 | 741 | - | 14M| 0 | 196 | 200 | 300 | 200 | 315 | 15 | 0 | 0 | 6.737177e+01 | -- | Inf
1.59/1.69 c 1.6s| 1 | 0 | 792 | - | 14M| 0 | 197 | 200 | 300 | 200 | 316 | 16 | 0 | 0 | 6.739211e+01 | -- | Inf
1.69/1.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.78 c 1.7s| 1 | 0 | 819 | - | 14M| 0 | 197 | 200 | 300 | 200 | 317 | 17 | 0 | 0 | 6.739757e+01 | -- | Inf
1.79/1.88 c 1.8s| 1 | 0 | 854 | - | 14M| 0 | 197 | 200 | 300 | 200 | 318 | 18 | 0 | 0 | 6.740101e+01 | -- | Inf
1.89/1.98 c 1.9s| 1 | 0 | 872 | - | 14M| 0 | 197 | 200 | 300 | 200 | 318 | 19 | 0 | 0 | 6.740252e+01 | -- | Inf
3.89/3.96 c 3.9s| 1 | 0 | 964 | - | 14M| 0 | 193 | 200 | 299 | 200 | 318 | 19 | 0 | 59 | 6.752062e+01 | -- | Inf
3.99/4.07 c 4.0s| 1 | 0 | 1017 | - | 14M| 0 | 195 | 200 | 299 | 200 | 319 | 20 | 0 | 59 | 6.757246e+01 | -- | Inf
4.69/4.71 c 4.6s| 1 | 0 | 1223 | - | 14M| 0 | 175 | 200 | 285 | 200 | 319 | 20 | 0 | 81 | 7.064405e+01 | -- | Inf
4.79/4.81 c 4.7s| 1 | 0 | 1251 | - | 15M| 0 | 171 | 200 | 285 | 200 | 320 | 21 | 0 | 81 | 7.072768e+01 | -- | Inf
5.29/5.33 c 5.2s| 1 | 0 | 1462 | - | 15M| 0 | 161 | 200 | 273 | 200 | 320 | 21 | 0 | 105 | 7.267159e+01 | -- | Inf
5.39/5.41 c 5.2s| 1 | 0 | 1754 | - | 15M| 0 | 130 | 200 | 273 | 200 | 319 | 23 | 0 | 105 | 7.765987e+01 | -- | Inf
5.69/5.74 c 5.6s| 1 | 0 | 1863 | - | 15M| 0 | 119 | 200 | 271 | 200 | 319 | 23 | 0 | 123 | 7.891688e+01 | -- | Inf
5.69/5.79 c 5.6s| 1 | 0 | 1912 | - | 16M| 0 | 123 | 200 | 271 | 200 | 321 | 25 | 0 | 123 | 7.908780e+01 | -- | Inf
5.89/5.97 c 5.8s| 1 | 0 | 2045 | - | 15M| 0 | 41 | 200 | 129 | 200 | 321 | 25 | 0 | 134 | 9.162500e+01 | -- | Inf
5.89/5.98 c 5.8s| 1 | 0 | 2092 | - | 15M| 0 | 0 | 200 | 129 | 200 | 325 | 29 | 0 | 134 | 1.000000e+02 | -- | Inf
5.89/5.98 c (run 1, node 1) restarting after 144 global fixings of integer variables
5.89/5.98 c
5.89/5.98 c (restart) converted 25 cuts from the global cut pool into linear constraints
5.89/5.98 c
5.89/5.99 c presolving:
5.89/5.99 c (round 1) 147 del vars, 83 del conss, 4 chg bounds, 0 chg sides, 49 chg coeffs, 0 upgd conss, 306 impls, 0 clqs
5.89/6.00 c (round 2) 157 del vars, 99 del conss, 4 chg bounds, 0 chg sides, 49 chg coeffs, 0 upgd conss, 310 impls, 0 clqs
5.99/6.00 c (round 3) 164 del vars, 108 del conss, 5 chg bounds, 0 chg sides, 49 chg coeffs, 0 upgd conss, 324 impls, 0 clqs
5.99/6.00 c (round 4) 166 del vars, 112 del conss, 5 chg bounds, 0 chg sides, 49 chg coeffs, 2 upgd conss, 330 impls, 0 clqs
5.99/6.00 c (round 5) 172 del vars, 119 del conss, 5 chg bounds, 0 chg sides, 49 chg coeffs, 2 upgd conss, 340 impls, 0 clqs
5.99/6.01 c (round 6) 175 del vars, 123 del conss, 5 chg bounds, 0 chg sides, 49 chg coeffs, 2 upgd conss, 348 impls, 0 clqs
5.99/6.01 c (round 7) 178 del vars, 128 del conss, 5 chg bounds, 0 chg sides, 49 chg coeffs, 2 upgd conss, 362 impls, 0 clqs
5.99/6.01 c (round 8) 181 del vars, 131 del conss, 5 chg bounds, 0 chg sides, 49 chg coeffs, 2 upgd conss, 368 impls, 0 clqs
5.99/6.01 c (round 9) 186 del vars, 139 del conss, 5 chg bounds, 2 chg sides, 52 chg coeffs, 2 upgd conss, 368 impls, 0 clqs
5.99/6.02 c (round 10) 188 del vars, 142 del conss, 6 chg bounds, 2 chg sides, 52 chg coeffs, 2 upgd conss, 381 impls, 0 clqs
5.99/6.02 c (round 11) 190 del vars, 145 del conss, 6 chg bounds, 2 chg sides, 52 chg coeffs, 2 upgd conss, 389 impls, 0 clqs
5.99/6.02 c (round 12) 195 del vars, 150 del conss, 6 chg bounds, 2 chg sides, 52 chg coeffs, 2 upgd conss, 395 impls, 0 clqs
5.99/6.02 c (round 13) 198 del vars, 153 del conss, 6 chg bounds, 2 chg sides, 52 chg coeffs, 2 upgd conss, 395 impls, 0 clqs
5.99/6.02 c presolving (14 rounds):
5.99/6.02 c 200 deleted vars, 155 deleted constraints, 6 tightened bounds, 0 added holes, 2 changed sides, 52 changed coefficients
5.99/6.02 c 395 implications, 0 cliques
5.99/6.02 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
5.99/6.02 c transformed objective value is always integral (scale: 1)
5.99/6.02 c Presolving Time: 0.02
5.99/6.02 c
5.99/6.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
5.99/6.02 c 5.8s| 1 | 0 | 2092 | - | 826k| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 134 | 1.000000e+02 | -- | Inf
5.99/6.02 o 100
5.99/6.02 c * 5.8s| 1 | 0 | 2092 | - | 826k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 134 | 1.000000e+02 | 1.000000e+02 | 0.00%
5.99/6.02 c
5.99/6.02 c SCIP Status : problem is solved [optimal solution found]
5.99/6.02 c Solving Time (sec) : 5.81
5.99/6.02 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
5.99/6.02 c Primal Bound : +1.00000000000000e+02 (1 solutions)
5.99/6.02 c Dual Bound : +1.00000000000000e+02
5.99/6.02 c Gap : 0.00 %
5.99/6.02 s OPTIMUM FOUND
5.99/6.02 v -x200 x199 -x198 x197 x196 -x195 x194 -x193 x192 -x191 -x190 x189 x188 -x187 x186 -x185 x184 -x183 x182 -x181 -x180 x179 x178 -x177
5.99/6.02 v x176 -x175 x174 -x173 -x172 x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 -x160 x159 x158 -x157 -x156 x155
5.99/6.02 v x154 -x153 -x152 x151 -x150 x149 x148 -x147 x146 -x145 x144 -x143 x142 -x141 -x140 x139 x138 -x137 x136 -x135 -x134 x133 -x132
5.99/6.02 v x131 -x130 x129 -x128 x127 x126 -x125 x124 -x123 -x122 x121 x120 -x119 x118 -x117 -x116 x115 x114 -x113 -x112 x111 -x110 x109
5.99/6.02 v x108 -x107 x106 -x105 -x104 x103 x102 -x101 x100 -x99 x98 -x97 -x96 x95 x94 -x93 -x92 x91 -x90 x89 -x88 x87 -x86 x85 x84
5.99/6.02 v -x83 x82 -x81 x80 -x79 x78 -x77 x76 -x75 x74 -x73 x72 -x71 x70 -x69 -x68 x67 -x66 x65 x64 -x63 x62 -x61 -x60 x59 x58 -x57 x56
5.99/6.02 v -x55 x54 -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 x28
5.99/6.02 v -x27 -x26 x25 -x24 x23 -x22 x21 x20 -x19 x18 -x17 x16 -x15 -x14 x13 -x12 x11 x10 -x9 -x8 x7 x6 -x5 -x4 x3 -x2 x1
5.99/6.02 c SCIP Status : problem is solved [optimal solution found]
5.99/6.02 c Solving Time : 5.81
5.99/6.02 c Original Problem :
5.99/6.02 c Problem name : HOME/instance-2666102-1276448573.opb
5.99/6.02 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
5.99/6.02 c Constraints : 300 initial, 300 maximal
5.99/6.02 c Presolved Problem :
5.99/6.02 c Problem name : t_HOME/instance-2666102-1276448573.opb
5.99/6.02 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
5.99/6.02 c Constraints : 0 initial, 0 maximal
5.99/6.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.99/6.02 c trivial : 0.00 148 0 0 0 0 0 0 0
5.99/6.02 c dualfix : 0.00 4 0 0 0 0 0 0 0
5.99/6.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.99/6.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.99/6.02 c implics : 0.00 0 0 0 0 0 0 0 0
5.99/6.02 c probing : 0.01 0 0 0 0 0 0 0 0
5.99/6.02 c knapsack : 0.00 0 0 0 0 0 1 2 3
5.99/6.02 c setppc : 0.00 1 0 0 0 0 1 0 0
5.99/6.02 c linear : 0.00 2 0 0 2 0 23 0 50
5.99/6.02 c logicor : 0.00 45 0 0 4 0 130 0 0
5.99/6.02 c root node : - 144 - - 144 - - - -
5.99/6.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.99/6.02 c integral : 0 0 0 7 0 0 14 0 0 0
5.99/6.02 c countsols : 0 0 0 2 0 0 0 0 0 0
5.99/6.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.99/6.02 c integral : 3.34 0.00 0.00 3.34 0.00
5.99/6.02 c countsols : 0.00 0.00 0.00 0.00 0.00
5.99/6.02 c Propagators : Time Calls Cutoffs DomReds
5.99/6.02 c vbounds : 0.00 3 0 0
5.99/6.02 c rootredcost : 0.00 0 0 0
5.99/6.02 c pseudoobj : 0.00 89 0 0
5.99/6.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.99/6.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.99/6.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.99/6.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.99/6.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.99/6.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.99/6.02 c applied globally : - - - 0 0.0 - - -
5.99/6.02 c applied locally : - - - 0 0.0 - - -
5.99/6.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.99/6.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.99/6.02 c redcost : 0.00 23 0 0 0 0
5.99/6.02 c impliedbounds : 0.01 23 0 0 0 0
5.99/6.02 c intobj : 0.00 0 0 0 0 0
5.99/6.02 c cgmip : 0.00 0 0 0 0 0
5.99/6.02 c gomory : 0.98 23 0 0 341 0
5.99/6.02 c strongcg : 0.96 20 0 0 3128 0
5.99/6.02 c cmir : 0.02 10 0 0 0 0
5.99/6.02 c flowcover : 0.07 10 0 0 0 0
5.99/6.02 c clique : 0.00 1 0 0 0 0
5.99/6.02 c zerohalf : 0.00 0 0 0 0 0
5.99/6.02 c mcf : 0.00 1 0 0 0 0
5.99/6.02 c rapidlearning : 0.00 0 0 0 0 0
5.99/6.02 c Pricers : Time Calls Vars
5.99/6.02 c problem variables: 0.00 0 0
5.99/6.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.99/6.02 c relpscost : 3.34 5 0 14 0 0 0
5.99/6.02 c pscost : 0.00 0 0 0 0 0 0
5.99/6.02 c inference : 0.00 0 0 0 0 0 0
5.99/6.02 c mostinf : 0.00 0 0 0 0 0 0
5.99/6.02 c leastinf : 0.00 0 0 0 0 0 0
5.99/6.02 c fullstrong : 0.00 0 0 0 0 0 0
5.99/6.02 c allfullstrong : 0.00 0 0 0 0 0 0
5.99/6.02 c random : 0.00 0 0 0 0 0 0
5.99/6.02 c Primal Heuristics : Time Calls Found
5.99/6.02 c LP solutions : 0.00 - 1
5.99/6.02 c pseudo solutions : 0.00 - 0
5.99/6.02 c oneopt : 0.00 0 0
5.99/6.02 c feaspump : 0.00 1 0
5.99/6.02 c trivial : 0.00 2 0
5.99/6.02 c simplerounding : 0.00 0 0
5.99/6.02 c zirounding : 0.00 1 0
5.99/6.02 c rounding : 0.01 27 0
5.99/6.02 c shifting : 0.05 27 0
5.99/6.02 c intshifting : 0.00 0 0
5.99/6.02 c twoopt : 0.00 0 0
5.99/6.02 c fixandinfer : 0.00 0 0
5.99/6.02 c coefdiving : 0.00 0 0
5.99/6.02 c pscostdiving : 0.00 0 0
5.99/6.02 c fracdiving : 0.00 0 0
5.99/6.02 c veclendiving : 0.00 0 0
5.99/6.02 c intdiving : 0.00 0 0
5.99/6.02 c actconsdiving : 0.00 0 0
5.99/6.02 c objpscostdiving : 0.00 0 0
5.99/6.02 c rootsoldiving : 0.00 0 0
5.99/6.02 c linesearchdiving : 0.00 0 0
5.99/6.02 c guideddiving : 0.00 0 0
5.99/6.02 c octane : 0.00 0 0
5.99/6.02 c rens : 0.00 0 0
5.99/6.02 c rins : 0.00 0 0
5.99/6.02 c localbranching : 0.00 0 0
5.99/6.02 c mutation : 0.00 0 0
5.99/6.02 c crossover : 0.00 0 0
5.99/6.02 c dins : 0.00 0 0
5.99/6.02 c undercover : 0.00 0 0
5.99/6.02 c nlp : 0.00 0 0
5.99/6.02 c trysol : 0.00 0 0
5.99/6.02 c LP : Time Calls Iterations Iter/call Iter/sec
5.99/6.02 c primal LP : 0.00 0 0 0.00 -
5.99/6.02 c dual LP : 0.29 28 2092 74.71 7213.79
5.99/6.02 c lex dual LP : 0.00 0 0 0.00 -
5.99/6.02 c barrier LP : 0.00 0 0 0.00 -
5.99/6.02 c diving/probing LP: 0.00 0 0 0.00 -
5.99/6.02 c strong branching : 3.34 134 24234 180.85 7255.69
5.99/6.02 c (at root node) : - 134 24234 180.85 -
5.99/6.02 c conflict analysis: 0.00 0 0 0.00 -
5.99/6.02 c B&B Tree :
5.99/6.02 c number of runs : 2
5.99/6.02 c nodes : 1
5.99/6.02 c nodes (total) : 2
5.99/6.02 c nodes left : 0
5.99/6.02 c max depth : 0
5.99/6.02 c max depth (total): 0
5.99/6.02 c backtracks : 0 (0.0%)
5.99/6.02 c delayed cutoffs : 0
5.99/6.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
5.99/6.02 c avg switch length: 2.00
5.99/6.02 c switching time : 0.00
5.99/6.02 c Solution :
5.99/6.02 c Solutions found : 1 (1 improvements)
5.99/6.02 c First Solution : +1.00000000000000e+02 (in run 2, after 1 nodes, 5.81 seconds, depth 0, found by <relaxation>)
5.99/6.02 c Primal Bound : +1.00000000000000e+02 (in run 2, after 1 nodes, 5.81 seconds, depth 0, found by <relaxation>)
5.99/6.02 c Dual Bound : +1.00000000000000e+02
5.99/6.02 c Gap : 0.00 %
5.99/6.02 c Root Dual Bound : +1.00000000000000e+02
5.99/6.02 c Root Iterations : 2092
5.99/6.03 c Time complete: 6.03.