0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667539-1276451219.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 260 constraints
0.00/0.02 c problem read
0.00/0.02 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, 260 upgd conss, 208 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 101/200 (50.5%) - 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 (3 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.04 c 208 implications, 0 cliques
0.00/0.04 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 260 constraints
0.00/0.04 c 260 constraints of type <logicor>
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 # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
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 = 1799.99
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/0.04 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.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
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 # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
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.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 | 410 | - | 975k| 0 | 168 | 200 | 260 | 200 | 260 | 0 | 0 | 0 | 6.272445e+01 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 956 | - |1609k| 0 | 169 | 200 | 260 | 200 | 263 | 3 | 0 | 0 | 6.316650e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 1010 | - |2484k| 0 | 163 | 200 | 260 | 200 | 266 | 6 | 0 | 0 | 6.344137e+01 | -- | Inf
0.29/0.37 c 0.3s| 1 | 0 | 1050 | - |2787k| 0 | 165 | 200 | 260 | 200 | 268 | 8 | 0 | 0 | 6.360207e+01 | -- | Inf
0.39/0.46 c 0.4s| 1 | 0 | 1111 | - |3079k| 0 | 167 | 200 | 260 | 200 | 270 | 10 | 0 | 0 | 6.381730e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 1135 | - |3430k| 0 | 164 | 200 | 260 | 200 | 271 | 11 | 0 | 0 | 6.386002e+01 | -- | Inf
0.59/0.66 c 0.6s| 1 | 0 | 1196 | - |4253k| 0 | 171 | 200 | 260 | 200 | 274 | 14 | 0 | 0 | 6.402677e+01 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 1218 | - |4625k| 0 | 170 | 200 | 260 | 200 | 276 | 16 | 0 | 0 | 6.409129e+01 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 1276 | - |4959k| 0 | 170 | 200 | 260 | 200 | 278 | 18 | 0 | 0 | 6.426987e+01 | -- | Inf
0.88/0.95 c 0.9s| 1 | 0 | 1342 | - |5696k| 0 | 174 | 200 | 260 | 200 | 281 | 21 | 0 | 0 | 6.458012e+01 | -- | Inf
0.99/1.03 c 1.0s| 1 | 0 | 1411 | - |6051k| 0 | 175 | 200 | 260 | 200 | 284 | 24 | 0 | 0 | 6.477154e+01 | -- | Inf
1.10/1.11 c 1.1s| 1 | 0 | 1440 | - |6452k| 0 | 178 | 200 | 260 | 200 | 284 | 25 | 0 | 0 | 6.480156e+01 | -- | Inf
1.10/1.19 c 1.1s| 1 | 0 | 1483 | - |6840k| 0 | 175 | 200 | 260 | 200 | 285 | 26 | 0 | 0 | 6.482152e+01 | -- | Inf
1.19/1.28 c 1.2s| 1 | 0 | 1527 | - |7725k| 0 | 176 | 200 | 260 | 200 | 286 | 27 | 0 | 0 | 6.483129e+01 | -- | Inf
1.29/1.38 c 1.3s| 1 | 0 | 1568 | - |8610k| 0 | 175 | 200 | 260 | 200 | 288 | 29 | 0 | 0 | 6.484569e+01 | -- | Inf
1.38/1.49 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.38/1.49 c 1.4s| 1 | 0 | 1660 | - |9485k| 0 | 167 | 200 | 260 | 200 | 289 | 30 | 0 | 0 | 6.489862e+01 | -- | Inf
1.49/1.57 c 1.5s| 1 | 0 | 1691 | - |9811k| 0 | 173 | 200 | 260 | 200 | 290 | 31 | 0 | 0 | 6.490803e+01 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 1714 | - | 10M| 0 | 169 | 200 | 260 | 200 | 286 | 32 | 0 | 0 | 6.491000e+01 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 1786 | - | 10M| 0 | 179 | 200 | 260 | 200 | 288 | 34 | 0 | 0 | 6.496626e+01 | -- | Inf
1.79/1.82 c 1.8s| 1 | 0 | 1824 | - | 10M| 0 | 179 | 200 | 260 | 200 | 290 | 36 | 0 | 0 | 6.497718e+01 | -- | Inf
1.88/1.91 c 1.8s| 1 | 0 | 1889 | - | 10M| 0 | 173 | 200 | 260 | 200 | 293 | 39 | 0 | 0 | 6.514278e+01 | -- | Inf
1.88/1.95 c 1.9s| 1 | 0 | 1929 | - | 10M| 0 | 173 | 200 | 260 | 200 | 294 | 40 | 0 | 0 | 6.520534e+01 | -- | Inf
2.59/2.69 c 2.6s| 1 | 0 | 2010 | - | 10M| 0 | 161 | 200 | 259 | 200 | 294 | 40 | 0 | 35 | 6.547832e+01 | -- | Inf
2.69/2.73 c 2.6s| 1 | 0 | 2030 | - | 10M| 0 | 153 | 200 | 259 | 200 | 288 | 41 | 0 | 35 | 6.553100e+01 | -- | Inf
3.30/3.38 c 3.3s| 1 | 0 | 2154 | - | 10M| 0 | 144 | 200 | 242 | 200 | 288 | 41 | 0 | 66 | 6.871507e+01 | -- | Inf
3.39/3.46 c 3.4s| 1 | 0 | 2439 | - | 11M| 0 | 57 | 200 | 242 | 200 | 292 | 45 | 0 | 66 | 8.366667e+01 | -- | Inf
3.49/3.54 c 3.4s| 1 | 0 | 2471 | - | 11M| 0 | 24 | 200 | 193 | 200 | 292 | 45 | 0 | 88 | 9.175000e+01 | -- | Inf
3.49/3.55 c 3.4s| 1 | 0 | 2501 | - | 11M| 0 | 0 | 200 | 68 | 200 | 171 | 55 | 0 | 88 | 1.000000e+02 | -- | Inf
3.49/3.55 c (run 1, node 1) restarting after 176 global fixings of integer variables
3.49/3.55 c
3.49/3.55 c (restart) converted 14 cuts from the global cut pool into linear constraints
3.49/3.55 c
3.49/3.55 c presolving:
3.49/3.55 c (round 1) 180 del vars, 56 del conss, 2 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 222 impls, 0 clqs
3.49/3.56 c (round 2) 185 del vars, 61 del conss, 2 chg bounds, 1 chg sides, 1 chg coeffs, 5 upgd conss, 232 impls, 0 clqs
3.49/3.56 c (round 3) 187 del vars, 63 del conss, 2 chg bounds, 1 chg sides, 1 chg coeffs, 5 upgd conss, 238 impls, 0 clqs
3.49/3.56 c (round 4) 189 del vars, 65 del conss, 2 chg bounds, 1 chg sides, 1 chg coeffs, 5 upgd conss, 252 impls, 0 clqs
3.49/3.57 c (round 5) 193 del vars, 70 del conss, 2 chg bounds, 1 chg sides, 1 chg coeffs, 5 upgd conss, 252 impls, 0 clqs
3.49/3.57 c (round 6) 196 del vars, 76 del conss, 2 chg bounds, 7 chg sides, 12 chg coeffs, 5 upgd conss, 264 impls, 0 clqs
3.49/3.57 c (round 7) 198 del vars, 82 del conss, 2 chg bounds, 7 chg sides, 12 chg coeffs, 5 upgd conss, 264 impls, 0 clqs
3.49/3.57 c (round 8) 199 del vars, 83 del conss, 2 chg bounds, 7 chg sides, 12 chg coeffs, 5 upgd conss, 264 impls, 0 clqs
3.49/3.58 c presolving (9 rounds):
3.49/3.58 c 200 deleted vars, 84 deleted constraints, 2 tightened bounds, 0 added holes, 7 changed sides, 12 changed coefficients
3.49/3.58 c 264 implications, 0 cliques
3.49/3.58 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
3.49/3.58 c transformed objective value is always integral (scale: 1)
3.49/3.58 c Presolving Time: 0.02
3.49/3.58 c
3.49/3.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.49/3.58 c 3.5s| 1 | 0 | 2501 | - | 740k| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 88 | 1.000000e+02 | -- | Inf
3.49/3.58 o 100
3.49/3.58 c * 3.5s| 1 | 0 | 2501 | - | 740k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 88 | 1.000000e+02 | 1.000000e+02 | 0.00%
3.49/3.58 c
3.49/3.58 c SCIP Status : problem is solved [optimal solution found]
3.49/3.58 c Solving Time (sec) : 3.45
3.49/3.58 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
3.49/3.58 c Primal Bound : +1.00000000000000e+02 (1 solutions)
3.49/3.58 c Dual Bound : +1.00000000000000e+02
3.49/3.58 c Gap : 0.00 %
3.49/3.58 s OPTIMUM FOUND
3.49/3.58 v -x200 x199 x198 -x197 x196 -x195 x194 -x193 x192 -x191 -x190 x189 x188 -x187 -x186 x185 x184 -x183 x182 -x181 -x180 x179 -x178
3.49/3.58 v x177 -x176 x175 x174 -x173 x172 -x171 x170 -x169 -x168 x167 -x166 x165 -x164 x163 -x162 x161 x160 -x159 -x158 x157 -x156 x155
3.49/3.58 v x154 -x153 x152 -x151 x150 -x149 -x148 x147 -x146 x145 x144 -x143 -x142 x141 x140 -x139 -x138 x137 -x136 x135 x134 -x133 x132
3.49/3.58 v -x131 -x130 x129 x128 -x127 x126 -x125 x124 -x123 x122 -x121 x120 -x119 -x118 x117 -x116 x115 -x114 x113 x112 -x111 x110 -x109
3.49/3.58 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
3.49/3.58 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
3.49/3.58 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
3.49/3.58 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
3.49/3.58 c SCIP Status : problem is solved [optimal solution found]
3.49/3.58 c Solving Time : 3.45
3.49/3.58 c Original Problem :
3.49/3.58 c Problem name : HOME/instance-2667539-1276451219.opb
3.49/3.58 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
3.49/3.58 c Constraints : 260 initial, 260 maximal
3.49/3.58 c Presolved Problem :
3.49/3.58 c Problem name : t_HOME/instance-2667539-1276451219.opb
3.49/3.58 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
3.49/3.58 c Constraints : 0 initial, 0 maximal
3.49/3.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.49/3.58 c trivial : 0.00 176 0 0 0 0 0 0 0
3.49/3.58 c dualfix : 0.00 2 0 0 0 0 0 0 0
3.49/3.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.49/3.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.49/3.58 c implics : 0.00 0 0 0 0 0 0 0 0
3.49/3.58 c probing : 0.01 0 0 0 0 0 0 0 0
3.49/3.58 c knapsack : 0.00 1 0 0 0 0 5 6 11
3.49/3.58 c setppc : 0.00 0 0 0 0 0 2 0 0
3.49/3.58 c linear : 0.00 2 0 0 2 0 9 1 2
3.49/3.58 c logicor : 0.00 19 0 0 0 0 68 0 0
3.49/3.58 c root node : - 176 - - 176 - - - -
3.49/3.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.49/3.58 c integral : 0 0 0 5 0 0 10 0 0 0
3.49/3.58 c countsols : 0 0 0 2 0 0 0 0 0 0
3.49/3.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.49/3.58 c integral : 1.34 0.00 0.00 1.34 0.00
3.49/3.58 c countsols : 0.00 0.00 0.00 0.00 0.00
3.49/3.58 c Propagators : Time Calls Cutoffs DomReds
3.49/3.58 c vbounds : 0.00 3 0 0
3.49/3.58 c rootredcost : 0.00 0 0 0
3.49/3.58 c pseudoobj : 0.01 155 0 0
3.49/3.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.49/3.58 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.49/3.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.49/3.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.49/3.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.49/3.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.49/3.58 c applied globally : - - - 0 0.0 - - -
3.49/3.58 c applied locally : - - - 0 0.0 - - -
3.49/3.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.49/3.58 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.49/3.58 c redcost : 0.00 25 0 0 0 0
3.49/3.58 c impliedbounds : 0.00 25 0 0 0 0
3.49/3.58 c intobj : 0.00 0 0 0 0 0
3.49/3.58 c cgmip : 0.00 0 0 0 0 0
3.49/3.58 c gomory : 0.78 25 0 0 777 0
3.49/3.58 c strongcg : 0.69 20 0 0 3102 0
3.49/3.58 c cmir : 0.03 10 0 0 0 0
3.49/3.58 c flowcover : 0.14 10 0 0 0 0
3.49/3.58 c clique : 0.00 1 0 0 0 0
3.49/3.58 c zerohalf : 0.00 0 0 0 0 0
3.49/3.58 c mcf : 0.00 1 0 0 0 0
3.49/3.58 c rapidlearning : 0.00 0 0 0 0 0
3.49/3.58 c Pricers : Time Calls Vars
3.49/3.58 c problem variables: 0.00 0 0
3.49/3.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.49/3.58 c relpscost : 1.34 3 0 10 0 0 0
3.49/3.58 c pscost : 0.00 0 0 0 0 0 0
3.49/3.58 c inference : 0.00 0 0 0 0 0 0
3.49/3.58 c mostinf : 0.00 0 0 0 0 0 0
3.49/3.58 c leastinf : 0.00 0 0 0 0 0 0
3.49/3.58 c fullstrong : 0.00 0 0 0 0 0 0
3.49/3.58 c allfullstrong : 0.00 0 0 0 0 0 0
3.49/3.58 c random : 0.00 0 0 0 0 0 0
3.49/3.58 c Primal Heuristics : Time Calls Found
3.49/3.58 c LP solutions : 0.00 - 1
3.49/3.58 c pseudo solutions : 0.00 - 0
3.49/3.58 c oneopt : 0.00 0 0
3.49/3.58 c feaspump : 0.05 1 0
3.49/3.58 c trivial : 0.00 2 0
3.49/3.58 c simplerounding : 0.00 0 0
3.49/3.58 c zirounding : 0.00 1 0
3.49/3.58 c rounding : 0.00 27 0
3.49/3.58 c shifting : 0.02 27 0
3.49/3.58 c intshifting : 0.00 0 0
3.49/3.58 c twoopt : 0.00 0 0
3.49/3.58 c fixandinfer : 0.00 0 0
3.49/3.58 c coefdiving : 0.00 0 0
3.49/3.58 c pscostdiving : 0.00 0 0
3.49/3.58 c fracdiving : 0.00 0 0
3.49/3.58 c veclendiving : 0.00 0 0
3.49/3.58 c intdiving : 0.00 0 0
3.49/3.58 c actconsdiving : 0.00 0 0
3.49/3.58 c objpscostdiving : 0.00 0 0
3.49/3.58 c rootsoldiving : 0.00 0 0
3.49/3.58 c linesearchdiving : 0.00 0 0
3.49/3.58 c guideddiving : 0.00 0 0
3.49/3.58 c octane : 0.00 0 0
3.49/3.58 c rens : 0.01 0 0
3.49/3.58 c rins : 0.00 0 0
3.49/3.58 c localbranching : 0.00 0 0
3.49/3.58 c mutation : 0.00 0 0
3.49/3.58 c crossover : 0.00 0 0
3.49/3.58 c dins : 0.00 0 0
3.49/3.58 c undercover : 0.00 0 0
3.49/3.58 c nlp : 0.00 0 0
3.49/3.58 c trysol : 0.00 0 0
3.49/3.58 c LP : Time Calls Iterations Iter/call Iter/sec
3.49/3.58 c primal LP : 0.01 0 0 0.00 0.00
3.49/3.58 c dual LP : 0.26 28 2009 71.75 7726.92
3.49/3.58 c lex dual LP : 0.00 0 0 0.00 -
3.49/3.58 c barrier LP : 0.00 0 0 0.00 -
3.49/3.58 c diving/probing LP: 0.05 30 492 16.40 9840.00
3.49/3.58 c strong branching : 1.34 88 8627 98.03 6438.06
3.49/3.58 c (at root node) : - 88 8627 98.03 -
3.49/3.58 c conflict analysis: 0.00 0 0 0.00 -
3.49/3.58 c B&B Tree :
3.49/3.58 c number of runs : 2
3.49/3.58 c nodes : 1
3.49/3.58 c nodes (total) : 2
3.49/3.58 c nodes left : 0
3.49/3.58 c max depth : 0
3.49/3.58 c max depth (total): 0
3.49/3.58 c backtracks : 0 (0.0%)
3.49/3.58 c delayed cutoffs : 0
3.49/3.58 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.49/3.58 c avg switch length: 2.00
3.49/3.58 c switching time : 0.00
3.49/3.58 c Solution :
3.49/3.58 c Solutions found : 1 (1 improvements)
3.49/3.58 c First Solution : +1.00000000000000e+02 (in run 2, after 1 nodes, 3.45 seconds, depth 0, found by <relaxation>)
3.49/3.58 c Primal Bound : +1.00000000000000e+02 (in run 2, after 1 nodes, 3.45 seconds, depth 0, found by <relaxation>)
3.49/3.58 c Dual Bound : +1.00000000000000e+02
3.49/3.58 c Gap : 0.00 %
3.49/3.58 c Root Dual Bound : +1.00000000000000e+02
3.49/3.58 c Root Iterations : 2501
3.49/3.59 c Time complete: 3.58.