0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3717736-1338198861.wbo>
0.00/0.00 c original problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 102 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 o 4943
0.00/0.00 c feasible solution found by trivial heuristic, objective value 4.943000e+03
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (round 2) 0 del vars, 1 del conss, 0 add conss, 101 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 51/270 (18.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 0 added constraints, 101 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 101 implications, 0 cliques
0.00/0.01 c presolved problem has 371 variables (270 bin, 0 int, 101 impl, 0 cont) and 202 constraints
0.00/0.01 c 101 constraints of type <linear>
0.00/0.01 c 101 constraints of type <indicator>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # force restart if we have a max FS instance and gap is 1?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/forcerestart = TRUE
0.00/0.01 c
0.00/0.01 c # priority of branching rule <inference>
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 1000]
0.00/0.01 c branching/inference/priority = 1000000
0.00/0.01 c
0.00/0.01 c # frequency offset for calling primal heuristic <coefdiving>
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1]
0.00/0.01 c heuristics/coefdiving/freqofs = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c heuristics/indrounding/freq = 1
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 o 1163
0.00/0.01 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.01 c 6 0.0s| 1 | 0 | 0 | - |1064k| 0 | - | 371 | 202 | 0 | 0 | 0 | 0 | 0 | -- | 1.163000e+03 | Inf
0.00/0.01 o 224
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - |1073k| 0 | - | 371 | 202 | 0 | 0 | 0 | 0 | 0 | -- | 2.240000e+02 | Inf
0.00/0.02 c 0.0s| 1 | 0 | 140 | - |1338k| 0 | 30 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 2.240000e+02 | Inf
0.00/0.02 o 202
0.00/0.02 c 6 0.0s| 1 | 0 | 140 | - |1367k| 0 | 30 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 2.020000e+02 | Inf
0.09/0.10 o 181
0.09/0.10 c y 0.1s| 1 | 0 | 140 | - |1819k| 0 | 30 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.09/0.10 c 0.1s| 1 | 0 | 162 | - |1613k| 0 | 43 | 371 | 357 | 371 | 204 | 2 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.09/0.12 c 0.1s| 1 | 0 | 208 | - |1952k| 0 | 47 | 371 | 357 | 371 | 207 | 5 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.09/0.14 c 0.1s| 1 | 0 | 237 | - |1974k| 0 | 48 | 371 | 357 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.09/0.15 c 0.2s| 1 | 0 | 281 | - |2004k| 0 | 49 | 371 | 357 | 371 | 210 | 8 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.18/0.21 o 52
0.18/0.21 c c 0.2s| 1 | 0 | 864 | - |2146k| 0 | - | 371 | 357 | 371 | 210 | 8 | 0 | 0 | 0.000000e+00 | 5.200000e+01 | Inf
0.18/0.24 c 0.2s| 1 | 0 | 885 | - |2098k| 0 | 49 | 371 | 310 | 371 | 210 | 8 | 2 | 0 | 0.000000e+00 | 5.200000e+01 | Inf
0.18/0.25 c 0.3s| 1 | 2 | 885 | - |2098k| 0 | 49 | 371 | 310 | 371 | 210 | 8 | 2 | 0 | 0.000000e+00 | 5.200000e+01 | Inf
0.18/0.25 c (run 1, node 1) restarting after 94 global fixings of integer variables
0.18/0.25 c
0.18/0.25 c (restart) converted 109 cuts from the global cut pool into linear constraints
0.18/0.25 c
0.18/0.26 c presolving:
0.18/0.26 c (round 1) 94 del vars, 47 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 0 upgd conss, 101 impls, 36 clqs
0.18/0.26 c (round 2) 94 del vars, 50 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 0 upgd conss, 101 impls, 36 clqs
0.18/0.26 c (round 3) 96 del vars, 52 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 0 upgd conss, 101 impls, 36 clqs
0.18/0.26 c (round 4) 96 del vars, 52 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 3 chg coeffs, 98 upgd conss, 101 impls, 36 clqs
0.18/0.26 c presolving (5 rounds):
0.18/0.26 c 96 deleted vars, 52 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 3 changed coefficients
0.18/0.26 c 101 implications, 36 cliques
0.18/0.26 c presolved problem has 275 variables (222 bin, 0 int, 53 impl, 0 cont) and 367 constraints
0.18/0.26 c 53 constraints of type <varbound>
0.18/0.26 c 36 constraints of type <setppc>
0.18/0.26 c 61 constraints of type <linear>
0.18/0.26 c 53 constraints of type <indicator>
0.18/0.26 c 9 constraints of type <logicor>
0.18/0.26 c 155 constraints of type <bounddisjunction>
0.18/0.26 c transformed objective value is always integral (scale: 1)
0.18/0.26 c Presolving Time: 0.01
0.18/0.26 c
0.18/0.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.18/0.27 c 0.3s| 1 | 0 | 1076 | - |1697k| 0 | 44 | 275 | 367 | 275 | 212 | 0 | 2 | 0 | 0.000000e+00 | 5.200000e+01 | Inf
0.18/0.29 c 0.3s| 1 | 0 | 1107 | - |1737k| 0 | 49 | 275 | 367 | 275 | 216 | 4 | 2 | 0 | 0.000000e+00 | 5.200000e+01 | Inf
0.28/0.33 o 33
0.28/0.33 c c 0.3s| 1 | 2 | 1687 | - |1825k| 0 | - | 275 | 367 | 275 | 216 | 4 | 2 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.28/0.35 o 29
0.28/0.35 c p 0.3s| 8 | 9 | 2191 | 211.0 |1790k| 5 | - | 275 | 329 | 275 | 179 | 4 | 4 | 0 | 0.000000e+00 | 2.900000e+01 | Inf
0.28/0.38 o 23
0.28/0.38 c 5 0.4s| 22 | 19 | 2900 | 109.0 |1820k| 9 | 21 | 275 | 336 | 275 | 179 | 4 | 17 | 0 | 0.000000e+00 | 2.300000e+01 | Inf
0.28/0.39 o 3
0.28/0.39 c 5 0.4s| 29 | 15 | 3010 | 86.4 |1828k| 13 | 24 | 275 | 338 | 275 | 179 | 4 | 27 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.28/0.39 c Forcing restart, since 48 binary variables among 53 have been fixed.
0.28/0.39 c (run 2, node 30) performing user restart
0.28/0.39 c
0.28/0.39 c (restart) converted 57 cuts from the global cut pool into linear constraints
0.28/0.39 c
0.28/0.39 c presolving:
0.28/0.39 c (round 1) 102 del vars, 104 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 109 impls, 68 clqs
0.28/0.39 c (round 2) 102 del vars, 111 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 59 upgd conss, 111 impls, 68 clqs
0.39/0.40 c (round 3) 102 del vars, 116 del conss, 0 add conss, 24 chg bounds, 2 chg sides, 2 chg coeffs, 64 upgd conss, 113 impls, 68 clqs
0.39/0.40 c (round 4) 102 del vars, 117 del conss, 0 add conss, 24 chg bounds, 2 chg sides, 2 chg coeffs, 64 upgd conss, 113 impls, 68 clqs
0.39/0.40 c presolving (5 rounds):
0.39/0.40 c 102 deleted vars, 117 deleted constraints, 0 added constraints, 24 tightened bounds, 0 added holes, 2 changed sides, 2 changed coefficients
0.39/0.40 c 113 implications, 68 cliques
0.39/0.40 c presolved problem has 173 variables (171 bin, 0 int, 2 impl, 0 cont) and 281 constraints
0.39/0.40 c 2 constraints of type <varbound>
0.39/0.40 c 11 constraints of type <knapsack>
0.39/0.40 c 71 constraints of type <setppc>
0.39/0.40 c 2 constraints of type <linear>
0.39/0.40 c 2 constraints of type <indicator>
0.39/0.40 c 24 constraints of type <logicor>
0.39/0.40 c 169 constraints of type <bounddisjunction>
0.39/0.40 c transformed objective value is always integral (scale: 1)
0.39/0.40 c Presolving Time: 0.02
0.39/0.40 c
0.39/0.41 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.41 c 0.4s| 1 | 0 | 3086 | - |1825k| 0 | 40 | 173 | 281 | 173 | 107 | 0 | 30 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.39/0.42 c 0.4s| 1 | 0 | 3110 | - |2080k| 0 | 49 | 173 | 281 | 173 | 117 | 10 | 30 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.39/0.45 c 0.5s| 1 | 2 | 3458 | - |2081k| 0 | 49 | 173 | 281 | 173 | 117 | 10 | 31 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.49/0.56 o 1
0.49/0.56 c Forcing restart, since the absolute gap is 1.000000.
0.49/0.56 c Forcing restart, since the absolute gap is 1.000000.
0.49/0.56 c c 0.6s| 84 | 8 | 6084 | 48.1 |2168k| 13 | - | 173 | 400 | 173 | 103 | 10 | 151 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.56 c (run 3, node 84) performing user restart
0.49/0.56 c
0.49/0.56 c (restart) converted 10 cuts from the global cut pool into linear constraints
0.49/0.56 c
0.49/0.57 c presolving:
0.49/0.57 c (round 1) 4 del vars, 14 del conss, 0 add conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 113 impls, 74 clqs
0.49/0.57 c (round 2) 4 del vars, 15 del conss, 0 add conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 119 impls, 74 clqs
0.49/0.58 c (round 3) 4 del vars, 18 del conss, 0 add conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 119 impls, 74 clqs
0.49/0.58 c presolving (4 rounds):
0.49/0.58 c 4 deleted vars, 18 deleted constraints, 0 added constraints, 2 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.58 c 119 implications, 74 cliques
0.49/0.58 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 392 constraints
0.49/0.58 c 15 constraints of type <knapsack>
0.49/0.58 c 77 constraints of type <setppc>
0.49/0.58 c 129 constraints of type <logicor>
0.49/0.58 c 171 constraints of type <bounddisjunction>
0.49/0.58 c transformed objective value is always integral (scale: 1)
0.49/0.58 c Presolving Time: 0.04
0.49/0.58 c
0.49/0.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.58 c 0.6s| 1 | 0 | 6179 | - |1978k| 0 | 48 | 169 | 392 | 169 | 111 | 0 | 151 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.58/0.60 c 0.6s| 1 | 0 | 6205 | - |2272k| 0 | 51 | 169 | 392 | 169 | 120 | 9 | 151 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.58/0.63 c 0.6s| 1 | 2 | 6532 | - |2273k| 0 | 51 | 169 | 394 | 169 | 120 | 9 | 153 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.69/0.75 c 0.7s| 100 | 3 | 8878 | 38.1 |2304k| 12 | - | 169 | 468 | 169 | 101 | 9 | 263 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.69/0.75 c
0.69/0.75 c SCIP Status : problem is solved [optimal solution found]
0.69/0.75 c Solving Time (sec) : 0.75
0.69/0.75 c Solving Nodes : 103 (total of 218 nodes in 4 runs)
0.69/0.75 c Primal Bound : +1.00000000000000e+00 (23 solutions)
0.69/0.75 c Dual Bound : +1.00000000000000e+00
0.69/0.75 c Gap : 0.00 %
0.69/0.75 s OPTIMUM FOUND
0.69/0.75 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
0.69/0.75 v -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.69/0.75 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.69/0.75 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
0.69/0.75 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
0.69/0.75 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
0.69/0.75 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
0.69/0.75 v -x4 -x3 x2 -x1
0.69/0.75 c SCIP Status : problem is solved [optimal solution found]
0.69/0.75 c Total Time : 0.75
0.69/0.75 c solving : 0.75
0.69/0.75 c presolving : 0.04 (included in solving)
0.69/0.75 c reading : 0.00 (included in solving)
0.69/0.75 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.01, average 0.00)
0.69/0.75 c Original Problem :
0.69/0.75 c Problem name : HOME/instance-3717736-1338198861.wbo
0.69/0.75 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.75 c Constraints : 102 initial, 102 maximal
0.69/0.75 c Objective sense : minimize
0.69/0.75 c Presolved Problem :
0.69/0.75 c Problem name : t_HOME/instance-3717736-1338198861.wbo
0.69/0.75 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.75 c Constraints : 392 initial, 501 maximal
0.69/0.75 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.69/0.75 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c trivial : 0.00 0.00 174 0 0 0 0 0 0 0 0
0.69/0.75 c dualfix : 0.00 0.00 1 0 0 0 0 0 0 0 0
0.69/0.75 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.75 c varbound : 0.00 0.00 0 0 0 26 0 28 0 0 0
0.69/0.75 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 2 2
0.69/0.75 c setppc : 0.00 0.00 0 0 0 0 0 10 0 0 0
0.69/0.75 c linear : 0.01 0.00 26 0 0 101 0 110 0 1 3
0.69/0.75 c indicator : 0.00 0.00 1 0 0 0 0 27 0 0 0
0.69/0.75 c logicor : 0.00 0.00 0 0 0 0 0 8 0 0 0
0.69/0.75 c bounddisjunction : 0.00 0.00 0 0 0 0 0 5 0 0 0
0.69/0.75 c root node : - - 214 - - 214 - - - - -
0.69/0.75 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.69/0.75 c integral : 0 0 0 0 134 0 347 0 0 0 0 0 268
0.69/0.75 c knapsack : 15 15 2 1272 0 0 106 334 0 257 0 0 0
0.69/0.75 c setppc : 77 77 3 1624 0 0 294 1596 4 2588 0 0 0
0.69/0.75 c logicor : 129+ 238 3 602 0 0 22 196 11 94 0 0 0
0.69/0.75 c bounddisjunction : 171 171 0 538 0 0 0 3 0 0 0 0 0
0.69/0.75 c countsols : 0 0 0 0 0 0 49 0 0 0 0 0 0
0.69/0.75 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.69/0.75 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c knapsack : 0.05 0.00 0.01 0.04 0.00 0.00 0.00 0.00
0.69/0.75 c setppc : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.69/0.75 c rootredcost : 5 0 0 28
0.69/0.75 c pseudoobj : 1160 41 0 25
0.69/0.75 c vbounds : 66 42 0 32
0.69/0.75 c redcost : 153 0 0 212
0.69/0.75 c probing : 0 0 0 0
0.69/0.75 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.69/0.75 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c redcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c probing : 0.00 0.00 0.00 0.00 0.00
0.69/0.75 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.75 c propagation : 0.00 21 19 69 23.7 1 14.0 -
0.69/0.75 c infeasible LP : 0.01 111 103 418 17.3 0 0.0 0
0.69/0.75 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.75 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.75 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.75 c applied globally : - - - 262 13.5 - - -
0.69/0.75 c applied locally : - - - 6 44.2 - - -
0.69/0.75 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.69/0.75 c cut pool : 0.00 0 - - 0 - (maximal pool size: 75)
0.69/0.75 c closecuts : 0.00 0.00 0 0 0 0 0
0.69/0.75 c impliedbounds : 0.00 0.00 9 0 0 0 0
0.69/0.75 c intobj : 0.00 0.00 0 0 0 0 0
0.69/0.75 c gomory : 0.04 0.00 9 0 0 51 0
0.69/0.75 c cgmip : 0.00 0.00 0 0 0 0 0
0.69/0.75 c strongcg : 0.03 0.00 9 0 0 272 0
0.69/0.75 c cmir : 0.01 0.00 9 0 0 0 0
0.69/0.75 c flowcover : 0.04 0.00 9 0 0 0 0
0.69/0.75 c clique : 0.00 0.00 4 0 0 16 0
0.69/0.75 c zerohalf : 0.00 0.00 0 0 0 0 0
0.69/0.75 c mcf : 0.00 0.00 4 0 0 0 0
0.69/0.75 c oddcycle : 0.00 0.00 0 0 0 0 0
0.69/0.75 c rapidlearning : 0.07 0.00 1 0 0 0 155
0.69/0.75 c Pricers : ExecTime SetupTime Calls Vars
0.69/0.75 c problem variables: 0.00 - 0 0
0.69/0.75 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.69/0.75 c inference : 0.00 0.00 134 0 0 0 0 268
0.69/0.75 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.75 c pscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.75 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.75 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.75 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.75 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.75 c random : 0.00 0.00 0 0 0 0 0 0
0.69/0.75 c Primal Heuristics : ExecTime SetupTime Calls Found
0.69/0.75 c LP solutions : 0.00 - - 0
0.69/0.75 c pseudo solutions : 0.00 - - 0
0.69/0.75 c crossover : 0.00 0.00 0 0
0.69/0.75 c guideddiving : 0.00 0.00 0 0
0.69/0.75 c oneopt : 0.00 0.00 6 0
0.69/0.75 c pscostdiving : 0.01 0.00 2 1
0.69/0.75 c fracdiving : 0.03 0.00 2 0
0.69/0.75 c veclendiving : 0.01 0.00 2 0
0.69/0.75 c objpscostdiving : 0.00 0.00 1 0
0.69/0.75 c rootsoldiving : 0.00 0.00 1 0
0.69/0.75 c linesearchdiving : 0.00 0.00 2 0
0.69/0.75 c smallcard : 0.00 0.00 0 0
0.69/0.75 c trivial : 0.00 0.00 2 1
0.69/0.75 c shiftandpropagate: 0.00 0.00 0 0
0.69/0.75 c simplerounding : 0.00 0.00 142 0
0.69/0.75 c zirounding : 0.00 0.00 1 0
0.69/0.75 c rounding : 0.00 0.00 118 0
0.69/0.75 c shifting : 0.01 0.00 19 4
0.69/0.75 c intshifting : 0.00 0.00 0 0
0.69/0.75 c twoopt : 0.00 0.00 0 0
0.69/0.75 c indoneopt : 0.02 0.00 10 3
0.69/0.75 c indtwoopt : 0.00 0.00 0 0
0.69/0.75 c fixandinfer : 0.00 0.00 0 0
0.69/0.75 c feaspump : 0.00 0.00 0 0
0.69/0.75 c clique : 0.00 0.00 0 0
0.69/0.75 c coefdiving : 0.21 0.00 15 7
0.69/0.75 c indcoefdiving : 0.00 0.00 0 0
0.69/0.75 c indrounding : 0.01 0.00 133 5
0.69/0.75 c nlpdiving : 0.00 0.00 0 0
0.69/0.75 c intdiving : 0.00 0.00 0 0
0.69/0.75 c actconsdiving : 0.00 0.00 0 0
0.69/0.75 c octane : 0.00 0.00 0 0
0.69/0.75 c rens : 0.02 0.00 1 0
0.69/0.75 c rins : 0.00 0.00 0 0
0.69/0.75 c localbranching : 0.00 0.00 0 0
0.69/0.75 c mutation : 0.00 0.00 0 0
0.69/0.75 c dins : 0.00 0.00 0 0
0.69/0.75 c vbounds : 0.00 0.00 0 0
0.69/0.75 c undercover : 0.00 0.00 0 0
0.69/0.75 c subnlp : 0.00 0.00 0 0
0.69/0.75 c trysol : 0.00 0.00 1 1
0.69/0.75 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.69/0.75 c primal LP : 0.00 3 0 0.00 - 0.00 3
0.69/0.75 c dual LP : 0.13 236 5051 22.75 39413.83 0.00 14
0.69/0.75 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.75 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.75 c diving/probing LP: 0.17 1111 3900 3.51 22296.54
0.69/0.75 c strong branching : 0.00 0 0 0.00 -
0.69/0.75 c (at root node) : - 0 0 0.00 -
0.69/0.75 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.75 c B&B Tree :
0.69/0.75 c number of runs : 4
0.69/0.75 c nodes : 103
0.69/0.75 c nodes (total) : 218
0.69/0.75 c nodes left : 0
0.69/0.75 c max depth : 12
0.69/0.75 c max depth (total): 13
0.69/0.75 c backtracks : 25 (24.3%)
0.69/0.75 c delayed cutoffs : 2
0.69/0.75 c repropagations : 106 (366 domain reductions, 2 cutoffs)
0.69/0.75 c avg switch length: 3.48
0.69/0.75 c switching time : 0.01
0.69/0.75 c Solution :
0.69/0.75 c Solutions found : 23 (11 improvements)
0.69/0.75 c First Solution : +4.94300000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.69/0.75 c Primal Bound : +1.00000000000000e+00 (in run 3, after 84 nodes, 0.56 seconds, depth 15, found by <coefdiving>)
0.69/0.75 c Dual Bound : +1.00000000000000e+00
0.69/0.75 c Gap : 0.00 %
0.69/0.75 c Root Dual Bound : +0.00000000000000e+00
0.69/0.75 c Root Iterations : 717
0.69/0.76 c Time complete: 0.75.