0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1]
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-2705359-1278572939.wbo>
0.00/0.00 c original problem has 221 variables (195 bin, 0 int, 26 impl, 0 cont) and 128 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 49 clqs
0.00/0.00 c (round 2) 0 del vars, 17 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 49 clqs
0.00/0.01 c (round 3) 2 del vars, 19 del conss, 24 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 49 clqs
0.00/0.01 c (round 4) 4 del vars, 19 del conss, 24 chg bounds, 2 chg sides, 0 chg coeffs, 61 upgd conss, 8 impls, 49 clqs
0.00/0.02 c (0.0s) probing: 101/193 (52.3%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 4 deleted vars, 19 deleted constraints, 24 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.00/0.02 c 37 implications, 49 cliques
0.00/0.02 c presolved problem has 217 variables (193 bin, 0 int, 24 impl, 0 cont) and 109 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 53 constraints of type <setppc>
0.00/0.02 c 24 constraints of type <linear>
0.00/0.02 c 24 constraints of type <indicator>
0.00/0.02 c 7 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1790
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 3420
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 39 | - | 965k| 0 | 35 | 217 | 109 | 217 | 61 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 70 | - |1285k| 0 | 49 | 217 | 109 | 217 | 81 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 122 | - |1404k| 0 | 60 | 217 | 109 | 217 | 94 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 179 | - |1416k| 0 | 64 | 217 | 109 | 217 | 98 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 217 | - |1422k| 0 | 66 | 217 | 109 | 217 | 102 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 264 | - |1424k| 0 | 65 | 217 | 109 | 217 | 104 | 43 | 0 | 0 | 0.000000e+00 | -- | Inf
0.40/0.46 c 0.5s| 1 | 0 | 328 | - |1424k| 0 | 64 | 217 | 109 | 217 | 104 | 43 | 0 | 17 | 0.000000e+00 | -- | Inf
0.69/0.72 c 0.7s| 1 | 0 | 356 | - |1424k| 0 | 64 | 217 | 109 | 217 | 104 | 43 | 0 | 34 | 0.000000e+00 | -- | Inf
0.89/0.98 c 1.0s| 1 | 0 | 360 | - |1424k| 0 | 64 | 217 | 109 | 217 | 104 | 43 | 0 | 51 | 0.000000e+00 | -- | Inf
1.20/1.21 c 1.2s| 1 | 0 | 450 | - |1424k| 0 | 61 | 217 | 109 | 217 | 104 | 43 | 0 | 65 | 0.000000e+00 | -- | Inf
1.20/1.23 c 1.2s| 1 | 0 | 461 | - |1427k| 0 | 63 | 217 | 109 | 217 | 105 | 44 | 0 | 65 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.5s| 1 | 0 | 469 | - |1427k| 0 | 63 | 217 | 109 | 217 | 97 | 44 | 0 | 79 | 0.000000e+00 | -- | Inf
1.39/1.46 c 1.5s| 1 | 0 | 477 | - |1428k| 0 | 64 | 217 | 109 | 217 | 98 | 45 | 0 | 79 | 0.000000e+00 | -- | Inf
1.59/1.60 c 1.6s| 1 | 0 | 495 | - |1428k| 0 | 63 | 217 | 109 | 217 | 98 | 45 | 0 | 88 | 0.000000e+00 | -- | Inf
1.59/1.61 c 1.6s| 1 | 0 | 500 | - |1429k| 0 | 65 | 217 | 109 | 217 | 100 | 47 | 0 | 88 | 0.000000e+00 | -- | Inf
1.69/1.72 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.72 c 1.7s| 1 | 0 | 506 | - |1429k| 0 | 64 | 217 | 109 | 217 | 100 | 47 | 0 | 95 | 0.000000e+00 | -- | Inf
1.69/1.75 c 1.7s| 1 | 2 | 506 | - |1430k| 0 | 64 | 217 | 109 | 217 | 100 | 47 | 0 | 96 | 0.000000e+00 | -- | Inf
1.69/1.75 c (run 1, node 1) restarting after 18 global fixings of integer variables
1.69/1.75 c
1.69/1.75 c (restart) converted 25 cuts from the global cut pool into linear constraints
1.69/1.75 c
1.69/1.75 c presolving:
1.69/1.75 c (round 1) 18 del vars, 0 del conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 39 impls, 58 clqs
1.69/1.75 c (round 2) 18 del vars, 0 del conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 48 upgd conss, 39 impls, 58 clqs
1.69/1.76 c presolving (3 rounds):
1.69/1.76 c 18 deleted vars, 0 deleted constraints, 10 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.69/1.76 c 39 implications, 58 cliques
1.69/1.76 c presolved problem has 199 variables (175 bin, 0 int, 24 impl, 0 cont) and 158 constraints
1.69/1.76 c 24 constraints of type <varbound>
1.69/1.76 c 15 constraints of type <knapsack>
1.69/1.76 c 63 constraints of type <setppc>
1.69/1.76 c 25 constraints of type <linear>
1.69/1.76 c 24 constraints of type <indicator>
1.69/1.76 c 7 constraints of type <logicor>
1.69/1.76 c transformed objective value is always integral (scale: 1)
1.69/1.76 c Presolving Time: 0.02
1.69/1.76 c
1.69/1.76 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.76 c 1.8s| 1 | 0 | 608 | - |1227k| 0 | 47 | 199 | 158 | 199 | 110 | 0 | 0 | 96 | 0.000000e+00 | -- | Inf
1.69/1.79 c 1.8s| 1 | 0 | 764 | - |1263k| 0 | 50 | 199 | 158 | 199 | 118 | 8 | 0 | 96 | 0.000000e+00 | -- | Inf
1.89/1.95 c 2.0s| 1 | 0 | 794 | - |1262k| 0 | 50 | 199 | 157 | 199 | 118 | 8 | 0 | 130 | 0.000000e+00 | -- | Inf
1.99/2.05 c 2.0s| 1 | 0 | 826 | - |1262k| 0 | 47 | 199 | 157 | 199 | 118 | 8 | 0 | 147 | 0.000000e+00 | -- | Inf
1.99/2.09 c 2.1s| 1 | 0 | 856 | - |1262k| 0 | 50 | 199 | 157 | 199 | 118 | 8 | 0 | 155 | 0.000000e+00 | -- | Inf
2.10/2.15 c 2.1s| 1 | 0 | 897 | - |1262k| 0 | 51 | 199 | 157 | 199 | 118 | 8 | 0 | 167 | 0.000000e+00 | -- | Inf
2.10/2.19 c 2.2s| 1 | 0 | 928 | - |1262k| 0 | 48 | 199 | 157 | 199 | 118 | 8 | 0 | 175 | 0.000000e+00 | -- | Inf
2.20/2.21 c 2.2s| 1 | 0 | 940 | - |1262k| 0 | 49 | 199 | 156 | 199 | 118 | 8 | 0 | 181 | 0.000000e+00 | -- | Inf
2.20/2.24 c 2.2s| 1 | 0 | 952 | - |1261k| 0 | 49 | 199 | 153 | 199 | 118 | 8 | 0 | 186 | 0.000000e+00 | -- | Inf
2.20/2.25 c 2.2s| 1 | 0 | 959 | - |1260k| 0 | 48 | 199 | 152 | 199 | 118 | 8 | 0 | 188 | 0.000000e+00 | -- | Inf
2.20/2.26 c 2.3s| 1 | 0 | 963 | - |1260k| 0 | 48 | 199 | 152 | 199 | 118 | 8 | 0 | 190 | 0.000000e+00 | -- | Inf
2.20/2.26 c 2.3s| 1 | 2 | 963 | - |1261k| 0 | 48 | 199 | 152 | 199 | 118 | 8 | 0 | 191 | 0.000000e+00 | -- | Inf
2.20/2.27 o 1060
2.20/2.27 c y 2.3s| 2 | 1 | 1084 | 121.0 |1267k| 1 | 1 | 199 | 152 | 199 | 77 | 8 | 0 | 191 | 0.000000e+00 | 1.060000e+03 | Inf
2.20/2.27 o 135
2.20/2.27 c * 2.3s| 3 | 2 | 1096 | 66.5 |1271k| 2 | - | 199 | 152 | 199 | 78 | 9 | 0 | 191 | 0.000000e+00 | 1.350000e+02 | Inf
2.29/2.32 o 130
2.29/2.32 c r 2.3s| 6 | 1 | 1268 | 61.0 |1285k| 2 | 1 | 199 | 152 | 199 | 79 | 11 | 0 | 205 | 0.000000e+00 | 1.300000e+02 | Inf
2.59/2.67 o 106
2.59/2.67 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.59/2.67 c r 2.7s| 29 | 2 | 2445 | 52.9 |1311k| 11 | 1 | 199 | 166 | 199 | 82 | 18 | 14 | 458 | 0.000000e+00 | 1.060000e+02 | Inf
2.79/2.84 o 78
2.79/2.84 c r 2.8s| 40 | 3 | 3012 | 52.5 |1327k| 13 | 1 | 199 | 172 | 199 | 84 | 28 | 20 | 596 | 0.000000e+00 | 7.800000e+01 | Inf
2.89/2.92 c
2.89/2.92 c SCIP Status : problem is solved [optimal solution found]
2.89/2.92 c Solving Time (sec) : 2.91
2.89/2.92 c Solving Nodes : 44 (total of 45 nodes in 2 runs)
2.89/2.92 c Primal Bound : +7.80000000000000e+01 (8 solutions)
2.89/2.92 c Dual Bound : +7.80000000000000e+01
2.89/2.92 c Gap : 0.00 %
2.89/2.92 s OPTIMUM FOUND
2.89/2.92 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 x148
2.89/2.92 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 -x128 -x127
2.89/2.92 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
2.89/2.92 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 -x91 -x90 -x89 -x88 x87 -x86 -x85 -x84 -x83 -x82
2.89/2.92 v -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
2.89/2.92 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
2.89/2.92 v x30 -x29 -x28 -x27 -x26 -x25 -x24 x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5
2.89/2.92 v -x4 -x3 -x2 -x1
2.89/2.92 c SCIP Status : problem is solved [optimal solution found]
2.89/2.92 c Solving Time : 2.91
2.89/2.92 c Original Problem :
2.89/2.92 c Problem name : HOME/instance-2705359-1278572939.wbo
2.89/2.92 c Variables : 221 (195 binary, 0 integer, 26 implicit integer, 0 continuous)
2.89/2.92 c Constraints : 128 initial, 128 maximal
2.89/2.92 c Presolved Problem :
2.89/2.92 c Problem name : t_HOME/instance-2705359-1278572939.wbo
2.89/2.92 c Variables : 199 (175 binary, 0 integer, 24 implicit integer, 0 continuous)
2.89/2.92 c Constraints : 158 initial, 175 maximal
2.89/2.92 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.89/2.92 c trivial : 0.00 18 0 0 0 0 0 0 0
2.89/2.92 c dualfix : 0.00 4 0 0 0 0 0 0 0
2.89/2.92 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.89/2.92 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.89/2.92 c implics : 0.00 0 0 0 0 0 0 0 0
2.89/2.92 c probing : 0.01 0 0 0 0 0 0 0 0
2.89/2.92 c varbound : 0.00 0 0 0 0 0 0 0 0
2.89/2.92 c knapsack : 0.01 0 0 0 0 0 0 0 0
2.89/2.92 c setppc : 0.00 0 0 0 0 0 0 0 0
2.89/2.92 c linear : 0.00 0 0 0 34 0 17 2 0
2.89/2.92 c indicator : 0.00 0 0 0 0 0 2 0 0
2.89/2.92 c logicor : 0.00 0 0 0 0 0 0 0 0
2.89/2.92 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
2.89/2.92 c root node : - 115 - - 115 - - - -
2.89/2.92 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.89/2.92 c integral : 0 0 0 99 0 3 200 0 0 46
2.89/2.92 c varbound : 24 1 223 17 0 0 97 10 0 0
2.89/2.92 c knapsack : 15 14 431 7 0 1 19 0 0 0
2.89/2.92 c setppc : 63 14 430 7 0 1 432 0 0 0
2.89/2.92 c linear : 25 14 429 7 0 0 89 19 0 0
2.89/2.92 c indicator : 24 0 429 17 0 0 9 0 0 0
2.89/2.92 c logicor : 7+ 14 154 1 0 1 12 0 0 0
2.89/2.92 c bounddisjunction : 0+ 0 15 0 0 0 1 0 0 0
2.89/2.92 c countsols : 0 0 0 1 0 0 0 0 0 0
2.89/2.92 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.89/2.92 c integral : 2.47 0.00 0.00 2.47 0.00
2.89/2.92 c varbound : 0.00 0.00 0.00 0.00 0.00
2.89/2.92 c knapsack : 0.03 0.01 0.02 0.00 0.00
2.89/2.92 c setppc : 0.00 0.00 0.00 0.00 0.00
2.89/2.92 c linear : 0.00 0.00 0.00 0.00 0.00
2.89/2.92 c indicator : 0.00 0.00 0.00 0.00 0.00
2.89/2.92 c logicor : 0.00 0.00 0.00 0.00 0.00
2.89/2.92 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
2.89/2.92 c countsols : 0.00 0.00 0.00 0.00 0.00
2.89/2.92 c Propagators : Time Calls Cutoffs DomReds
2.89/2.92 c vbounds : 0.00 70 0 63
2.89/2.92 c rootredcost : 0.00 5 0 6
2.89/2.92 c pseudoobj : 0.00 238 3 75
2.89/2.92 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.89/2.92 c propagation : 0.00 5 5 14 30.5 0 0.0 -
2.89/2.92 c infeasible LP : 0.00 9 9 21 13.6 0 0.0 0
2.89/2.92 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.92 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.92 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.92 c applied globally : - - - 26 14.3 - - -
2.89/2.92 c applied locally : - - - 0 0.0 - - -
2.89/2.92 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.89/2.92 c cut pool : 0.00 0 - - 0 - (maximal pool size: 9)
2.89/2.92 c redcost : 0.00 105 0 348 0 0
2.89/2.92 c impliedbounds : 0.00 14 0 0 0 0
2.89/2.92 c intobj : 0.00 0 0 0 0 0
2.89/2.92 c cgmip : 0.00 0 0 0 0 0
2.89/2.92 c gomory : 0.04 14 0 0 45 0
2.89/2.92 c strongcg : 0.04 14 0 0 79 0
2.89/2.92 c cmir : 0.03 11 0 0 0 0
2.89/2.92 c flowcover : 0.11 11 0 0 0 0
2.89/2.92 c clique : 0.00 14 0 0 17 0
2.89/2.92 c zerohalf : 0.00 0 0 0 0 0
2.89/2.92 c mcf : 0.00 2 0 0 0 0
2.89/2.92 c rapidlearning : 0.01 1 0 0 0 0
2.89/2.92 c Pricers : Time Calls Vars
2.89/2.92 c problem variables: 0.00 0 0
2.89/2.92 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.89/2.92 c relpscost : 2.47 82 3 200 0 0 46
2.89/2.92 c pscost : 0.00 0 0 0 0 0 0
2.89/2.92 c inference : 0.00 0 0 0 0 0 0
2.89/2.92 c mostinf : 0.00 0 0 0 0 0 0
2.89/2.92 c leastinf : 0.00 0 0 0 0 0 0
2.89/2.92 c fullstrong : 0.00 0 0 0 0 0 0
2.89/2.92 c allfullstrong : 0.00 0 0 0 0 0 0
2.89/2.92 c random : 0.00 0 0 0 0 0 0
2.89/2.92 c Primal Heuristics : Time Calls Found
2.89/2.92 c LP solutions : 0.00 - 1
2.89/2.92 c pseudo solutions : 0.00 - 0
2.89/2.92 c crossover : 0.00 0 0
2.89/2.92 c coefdiving : 0.00 0 0
2.89/2.92 c pscostdiving : 0.00 0 0
2.89/2.92 c fracdiving : 0.00 0 0
2.89/2.92 c veclendiving : 0.00 0 0
2.89/2.92 c objpscostdiving : 0.00 0 0
2.89/2.92 c rootsoldiving : 0.00 0 0
2.89/2.92 c linesearchdiving : 0.00 0 0
2.89/2.92 c guideddiving : 0.00 0 0
2.89/2.92 c oneopt : 0.00 4 0
2.89/2.92 c trivial : 0.00 2 0
2.89/2.92 c simplerounding : 0.00 36 3
2.89/2.92 c zirounding : 0.00 26 0
2.89/2.92 c rounding : 0.00 98 0
2.89/2.92 c shifting : 0.02 43 0
2.89/2.92 c intshifting : 0.00 0 0
2.89/2.92 c twoopt : 0.00 0 0
2.89/2.92 c fixandinfer : 0.00 0 0
2.89/2.92 c feaspump : 0.00 1 0
2.89/2.92 c intdiving : 0.00 0 0
2.89/2.92 c actconsdiving : 0.00 0 0
2.89/2.92 c octane : 0.00 0 0
2.89/2.92 c rens : 0.03 1 0
2.89/2.92 c rins : 0.00 0 0
2.89/2.92 c localbranching : 0.00 0 0
2.89/2.92 c mutation : 0.00 0 0
2.89/2.92 c dins : 0.00 0 0
2.89/2.92 c undercover : 0.00 0 0
2.89/2.92 c nlp : 0.00 0 0
2.89/2.92 c trysol : 0.00 9 4
2.89/2.92 c LP : Time Calls Iterations Iter/call Iter/sec
2.89/2.92 c primal LP : 0.00 0 0 0.00 -
2.89/2.92 c dual LP : 0.09 128 3311 25.87 36805.25
2.89/2.92 c lex dual LP : 0.00 0 0 0.00 -
2.89/2.92 c barrier LP : 0.00 0 0 0.00 -
2.89/2.92 c diving/probing LP: 0.00 1 11 11.00 -
2.89/2.92 c strong branching : 2.46 655 92630 141.42 37585.49
2.89/2.92 c (at root node) : - 191 63672 333.36 -
2.89/2.92 c conflict analysis: 0.00 0 0 0.00 -
2.89/2.92 c B&B Tree :
2.89/2.92 c number of runs : 2
2.89/2.92 c nodes : 44
2.89/2.92 c nodes (total) : 45
2.89/2.92 c nodes left : 0
2.89/2.92 c max depth : 13
2.89/2.92 c max depth (total): 13
2.89/2.92 c backtracks : 8 (18.2%)
2.89/2.92 c delayed cutoffs : 1
2.89/2.92 c repropagations : 15 (55 domain reductions, 1 cutoffs)
2.89/2.92 c avg switch length: 2.64
2.89/2.92 c switching time : 0.00
2.89/2.92 c Solution :
2.89/2.92 c Solutions found : 8 (5 improvements)
2.89/2.92 c First Solution : +1.06000000000000e+03 (in run 2, after 2 nodes, 2.27 seconds, depth 1, found by <trysol>)
2.89/2.92 c Primal Bound : +7.80000000000000e+01 (in run 2, after 40 nodes, 2.83 seconds, depth 13, found by <simplerounding>)
2.89/2.92 c Dual Bound : +7.80000000000000e+01
2.89/2.92 c Gap : 0.00 %
2.89/2.92 c Root Dual Bound : +0.00000000000000e+00
2.89/2.92 c Root Iterations : 963
2.89/2.92 c Time complete: 2.92.