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-3717756-1338198881.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.01 o 4943
0.00/0.01 c feasible solution found by trivial heuristic, objective value 4.943000e+03
0.00/0.01 c presolving:
0.00/0.01 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 207
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - |1073k| 0 | - | 371 | 202 | 0 | 0 | 0 | 0 | 0 | -- | 2.070000e+02 | Inf
0.00/0.02 c 0.0s| 1 | 0 | 185 | - |1338k| 0 | 40 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 2.070000e+02 | Inf
0.00/0.02 o 176
0.00/0.02 c 6 0.0s| 1 | 0 | 185 | - |1374k| 0 | 40 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.760000e+02 | Inf
0.09/0.10 o 160
0.09/0.10 c y 0.1s| 1 | 0 | 185 | - |1455k| 0 | 40 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.600000e+02 | Inf
0.09/0.11 c 0.1s| 1 | 0 | 206 | - |1535k| 0 | 45 | 371 | 373 | 371 | 203 | 1 | 0 | 0 | 0.000000e+00 | 1.600000e+02 | Inf
0.09/0.12 c 0.1s| 1 | 0 | 232 | - |1620k| 0 | 47 | 371 | 373 | 371 | 204 | 2 | 0 | 0 | 0.000000e+00 | 1.600000e+02 | Inf
0.09/0.14 c 0.1s| 1 | 0 | 259 | - |1706k| 0 | 47 | 371 | 373 | 371 | 205 | 3 | 0 | 0 | 0.000000e+00 | 1.600000e+02 | Inf
0.09/0.15 c 0.1s| 1 | 0 | 282 | - |1728k| 0 | 47 | 371 | 373 | 371 | 206 | 4 | 0 | 0 | 0.000000e+00 | 1.600000e+02 | Inf
0.09/0.16 c 0.2s| 1 | 0 | 307 | - |1749k| 0 | 48 | 371 | 373 | 371 | 207 | 5 | 0 | 0 | 0.000000e+00 | 1.600000e+02 | Inf
0.19/0.21 o 46
0.19/0.21 c c 0.2s| 1 | 0 | 682 | - |1891k| 0 | - | 371 | 373 | 371 | 207 | 5 | 0 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.19/0.23 c 0.2s| 1 | 0 | 749 | - |1837k| 0 | 48 | 371 | 316 | 371 | 207 | 5 | 1 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.19/0.25 c 0.2s| 1 | 2 | 749 | - |1837k| 0 | 48 | 371 | 316 | 371 | 207 | 5 | 1 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.19/0.25 c (run 1, node 1) restarting after 114 global fixings of integer variables
0.19/0.25 c
0.19/0.25 c (restart) converted 106 cuts from the global cut pool into linear constraints
0.19/0.25 c
0.19/0.25 c presolving:
0.19/0.25 c (round 1) 114 del vars, 57 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 103 impls, 42 clqs
0.19/0.25 c (round 2) 114 del vars, 63 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 103 impls, 42 clqs
0.19/0.25 c (round 3) 116 del vars, 65 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 103 impls, 42 clqs
0.19/0.25 c (round 4) 116 del vars, 65 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 96 upgd conss, 103 impls, 42 clqs
0.19/0.26 c (round 5) 116 del vars, 65 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 1 chg coeffs, 96 upgd conss, 103 impls, 42 clqs
0.19/0.26 c presolving (6 rounds):
0.19/0.26 c 116 deleted vars, 65 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 1 changed coefficients
0.19/0.26 c 103 implications, 42 cliques
0.19/0.26 c presolved problem has 255 variables (212 bin, 0 int, 43 impl, 0 cont) and 357 constraints
0.19/0.26 c 43 constraints of type <varbound>
0.19/0.26 c 2 constraints of type <knapsack>
0.19/0.26 c 43 constraints of type <setppc>
0.19/0.26 c 47 constraints of type <linear>
0.19/0.26 c 43 constraints of type <indicator>
0.19/0.26 c 8 constraints of type <logicor>
0.19/0.26 c 171 constraints of type <bounddisjunction>
0.19/0.26 c transformed objective value is always integral (scale: 1)
0.19/0.26 c Presolving Time: 0.01
0.19/0.26 c
0.19/0.26 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.26 c 0.3s| 1 | 0 | 842 | - |1786k| 0 | 40 | 255 | 357 | 255 | 186 | 0 | 1 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.19/0.28 c 0.3s| 1 | 0 | 862 | - |2111k| 0 | 43 | 255 | 357 | 255 | 188 | 2 | 1 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.28/0.31 c 0.3s| 1 | 2 | 1227 | - |2113k| 0 | 43 | 255 | 357 | 255 | 188 | 2 | 1 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.28/0.31 o 40
0.28/0.31 c r 0.3s| 4 | 3 | 1408 | 247.0 |2138k| 3 | 2 | 255 | 357 | 255 | 154 | 2 | 1 | 0 | 0.000000e+00 | 4.000000e+01 | Inf
0.28/0.34 o 33
0.28/0.34 c r 0.3s| 15 | 13 | 1940 | 101.3 |2181k| 5 | 2 | 255 | 350 | 255 | 154 | 2 | 4 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.39/0.48 o 14
0.39/0.48 c 5 0.5s| 60 | 34 | 5574 | 85.9 |2266k| 18 | 38 | 255 | 339 | 255 | 154 | 2 | 7 | 0 | 0.000000e+00 | 1.400000e+01 | Inf
0.49/0.53 o 1
0.49/0.53 c Forcing restart, since the absolute gap is 1.000000.
0.49/0.53 c Forcing restart, since the absolute gap is 1.000000.
0.49/0.53 c o 0.5s| 77 | 43 | 6719 | 81.8 |2303k| 18 | 0 | 255 | 311 | 255 | 154 | 2 | 26 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.53 c (run 2, node 77) performing user restart
0.49/0.53 c
0.49/0.53 c (restart) converted 45 cuts from the global cut pool into linear constraints
0.49/0.53 c
0.49/0.53 c presolving:
0.49/0.53 c (round 1) 62 del vars, 31 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 105 impls, 60 clqs
0.49/0.53 c (round 2) 62 del vars, 32 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 105 impls, 60 clqs
0.49/0.54 c (round 3) 62 del vars, 45 del conss, 0 add conss, 0 chg bounds, 3 chg sides, 3 chg coeffs, 48 upgd conss, 105 impls, 60 clqs
0.49/0.54 c (round 4) 62 del vars, 45 del conss, 0 add conss, 12 chg bounds, 3 chg sides, 3 chg coeffs, 48 upgd conss, 105 impls, 60 clqs
0.49/0.54 c (round 5) 86 del vars, 69 del conss, 0 add conss, 24 chg bounds, 3 chg sides, 3 chg coeffs, 48 upgd conss, 109 impls, 68 clqs
0.49/0.54 c (round 6) 86 del vars, 69 del conss, 0 add conss, 24 chg bounds, 3 chg sides, 3 chg coeffs, 60 upgd conss, 109 impls, 68 clqs
0.49/0.55 c presolving (7 rounds):
0.49/0.55 c 86 deleted vars, 69 deleted constraints, 0 added constraints, 24 tightened bounds, 0 added holes, 3 changed sides, 3 changed coefficients
0.49/0.55 c 109 implications, 68 cliques
0.49/0.55 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 287 constraints
0.49/0.55 c 8 constraints of type <knapsack>
0.49/0.55 c 72 constraints of type <setppc>
0.49/0.55 c 31 constraints of type <logicor>
0.49/0.55 c 176 constraints of type <bounddisjunction>
0.49/0.55 c transformed objective value is always integral (scale: 1)
0.49/0.55 c Presolving Time: 0.03
0.49/0.55 c
0.49/0.55 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.55 c 0.5s| 1 | 0 | 6826 | - |1838k| 0 | 45 | 169 | 287 | 169 | 100 | 0 | 26 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.56 c 0.6s| 1 | 0 | 6873 | - |2085k| 0 | 51 | 169 | 287 | 169 | 111 | 11 | 26 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.59 c 0.6s| 1 | 2 | 7186 | - |2085k| 0 | 51 | 169 | 287 | 169 | 111 | 11 | 27 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.69/0.72 c 0.7s| 100 | 5 | 10091 | 53.8 |2141k| 19 | - | 169 | 388 | 169 | 104 | 11 | 129 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.69/0.74 c
0.69/0.74 c SCIP Status : problem is solved [optimal solution found]
0.69/0.74 c Solving Time (sec) : 0.74
0.69/0.74 c Solving Nodes : 131 (total of 209 nodes in 3 runs)
0.69/0.74 c Primal Bound : +1.00000000000000e+00 (30 solutions)
0.69/0.74 c Dual Bound : +1.00000000000000e+00
0.69/0.74 c Gap : 0.00 %
0.69/0.74 s OPTIMUM FOUND
0.69/0.74 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.74 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.74 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.74 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.74 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.74 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.74 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.74 v -x4 x3 -x2 -x1
0.69/0.74 c SCIP Status : problem is solved [optimal solution found]
0.69/0.74 c Total Time : 0.74
0.69/0.74 c solving : 0.74
0.69/0.74 c presolving : 0.03 (included in solving)
0.69/0.74 c reading : 0.00 (included in solving)
0.69/0.74 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.69/0.74 c Original Problem :
0.69/0.74 c Problem name : HOME/instance-3717756-1338198881.wbo
0.69/0.74 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 102 initial, 102 maximal
0.69/0.74 c Objective sense : minimize
0.69/0.74 c Presolved Problem :
0.69/0.74 c Problem name : t_HOME/instance-3717756-1338198881.wbo
0.69/0.74 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.74 c Constraints : 287 initial, 423 maximal
0.69/0.74 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.69/0.74 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c trivial : 0.00 0.00 188 0 0 0 0 0 0 0 0
0.69/0.74 c dualfix : 0.00 0.00 1 0 0 0 0 0 0 0 0
0.69/0.74 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c pseudoobj : 0.00 0.00 0 0 0 12 0 0 0 0 0
0.69/0.74 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c varbound : 0.00 0.00 0 0 0 12 0 24 0 0 0
0.69/0.74 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 4 4
0.69/0.74 c setppc : 0.00 0.00 0 0 0 0 0 1 0 0 0
0.69/0.74 c linear : 0.01 0.00 12 0 0 101 0 97 0 1 0
0.69/0.74 c indicator : 0.00 0.00 1 0 0 0 0 13 0 0 0
0.69/0.74 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c bounddisjunction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.74 c root node : - - 177 - - 177 - - - - -
0.69/0.74 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.69/0.74 c integral : 0 0 0 0 135 0 341 0 0 0 0 0 270
0.69/0.74 c knapsack : 8 8 2 1761 0 0 291 31 3 103 0 0 0
0.69/0.74 c setppc : 72 72 2 1758 0 0 260 1149 3 2544 0 0 0
0.69/0.74 c logicor : 31+ 167 2 446 0 0 46 233 2 73 0 0 0
0.69/0.74 c bounddisjunction : 176 176 0 456 0 0 0 0 0 0 0 0 0
0.69/0.74 c countsols : 0 0 0 0 0 0 57 0 0 0 0 0 0
0.69/0.74 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.69/0.74 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c knapsack : 0.03 0.00 0.00 0.02 0.00 0.00 0.00 0.00
0.69/0.74 c setppc : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.69/0.74 c rootredcost : 3 0 0 21
0.69/0.74 c pseudoobj : 1034 14 1 27
0.69/0.74 c vbounds : 66 19 0 36
0.69/0.74 c redcost : 179 0 0 886
0.69/0.74 c probing : 0 0 0 0
0.69/0.74 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.69/0.74 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c redcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c probing : 0.00 0.00 0.00 0.00 0.00
0.69/0.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.74 c propagation : 0.00 14 14 53 41.4 0 0.0 -
0.69/0.74 c infeasible LP : 0.00 77 69 260 13.6 0 0.0 0
0.69/0.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.74 c applied globally : - - - 155 12.2 - - -
0.69/0.74 c applied locally : - - - 9 45.4 - - -
0.69/0.74 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.69/0.74 c cut pool : 0.00 0 - - 0 - (maximal pool size: 63)
0.69/0.74 c closecuts : 0.00 0.00 0 0 0 0 0
0.69/0.74 c impliedbounds : 0.00 0.00 9 0 0 0 0
0.69/0.74 c intobj : 0.00 0.00 0 0 0 0 0
0.69/0.74 c gomory : 0.04 0.00 9 0 0 36 0
0.69/0.74 c cgmip : 0.00 0.00 0 0 0 0 0
0.69/0.74 c strongcg : 0.03 0.00 9 0 0 178 0
0.69/0.74 c cmir : 0.01 0.00 9 0 0 0 0
0.69/0.74 c flowcover : 0.03 0.00 9 0 0 0 0
0.69/0.74 c clique : 0.00 0.00 3 0 0 6 0
0.69/0.74 c zerohalf : 0.00 0.00 0 0 0 0 0
0.69/0.74 c mcf : 0.00 0.00 3 0 0 0 0
0.69/0.74 c oddcycle : 0.00 0.00 0 0 0 0 0
0.69/0.74 c rapidlearning : 0.07 0.00 1 0 0 0 171
0.69/0.74 c Pricers : ExecTime SetupTime Calls Vars
0.69/0.74 c problem variables: 0.00 - 0 0
0.69/0.74 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.69/0.74 c inference : 0.00 0.00 135 0 0 0 0 270
0.69/0.74 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c pscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c random : 0.00 0.00 0 0 0 0 0 0
0.69/0.74 c Primal Heuristics : ExecTime SetupTime Calls Found
0.69/0.74 c LP solutions : 0.00 - - 0
0.69/0.74 c pseudo solutions : 0.00 - - 0
0.69/0.74 c crossover : 0.00 0.00 0 0
0.69/0.74 c oneopt : 0.00 0.00 6 0
0.69/0.74 c pscostdiving : 0.01 0.00 2 0
0.69/0.74 c fracdiving : 0.01 0.00 2 1
0.69/0.74 c veclendiving : 0.01 0.00 2 1
0.69/0.74 c rootsoldiving : 0.00 0.00 1 2
0.69/0.74 c linesearchdiving : 0.01 0.00 2 0
0.69/0.74 c guideddiving : 0.00 0.00 2 0
0.69/0.74 c objpscostdiving : 0.02 0.00 2 3
0.69/0.74 c smallcard : 0.00 0.00 0 0
0.69/0.74 c trivial : 0.00 0.00 2 1
0.69/0.74 c shiftandpropagate: 0.00 0.00 0 0
0.69/0.74 c simplerounding : 0.00 0.00 143 3
0.69/0.74 c zirounding : 0.00 0.00 5 0
0.69/0.74 c rounding : 0.00 0.00 125 0
0.69/0.74 c shifting : 0.01 0.00 18 5
0.69/0.74 c intshifting : 0.00 0.00 0 0
0.69/0.74 c twoopt : 0.00 0.00 0 0
0.69/0.74 c indtwoopt : 0.00 0.00 0 0
0.69/0.74 c indoneopt : 0.02 0.00 8 3
0.69/0.74 c fixandinfer : 0.00 0.00 0 0
0.69/0.74 c feaspump : 0.00 0.00 0 0
0.69/0.74 c clique : 0.00 0.00 0 0
0.69/0.74 c coefdiving : 0.21 0.00 11 1
0.69/0.74 c indrounding : 0.01 0.00 134 2
0.69/0.74 c indcoefdiving : 0.00 0.00 0 0
0.69/0.74 c nlpdiving : 0.00 0.00 0 0
0.69/0.74 c intdiving : 0.00 0.00 0 0
0.69/0.74 c actconsdiving : 0.00 0.00 0 0
0.69/0.74 c octane : 0.00 0.00 0 0
0.69/0.74 c rens : 0.02 0.00 1 0
0.69/0.74 c rins : 0.00 0.00 0 0
0.69/0.74 c localbranching : 0.00 0.00 0 0
0.69/0.74 c mutation : 0.00 0.00 0 0
0.69/0.74 c dins : 0.00 0.00 0 0
0.69/0.74 c vbounds : 0.00 0.00 0 0
0.69/0.74 c undercover : 0.00 0.00 0 0
0.69/0.74 c subnlp : 0.00 0.00 0 0
0.69/0.74 c trysol : 0.00 0.00 8 7
0.69/0.74 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.69/0.74 c primal LP : 0.00 2 0 0.00 - 0.00 2
0.69/0.74 c dual LP : 0.16 255 6065 28.21 39058.73 0.00 40
0.69/0.74 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.74 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.74 c diving/probing LP: 0.18 1143 4675 4.09 25345.07
0.69/0.74 c strong branching : 0.00 0 0 0.00 -
0.69/0.74 c (at root node) : - 0 0 0.00 -
0.69/0.74 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.74 c B&B Tree :
0.69/0.74 c number of runs : 3
0.69/0.74 c nodes : 131
0.69/0.74 c nodes (total) : 209
0.69/0.74 c nodes left : 0
0.69/0.74 c max depth : 19
0.69/0.74 c max depth (total): 19
0.69/0.74 c backtracks : 16 (12.2%)
0.69/0.74 c delayed cutoffs : 0
0.69/0.74 c repropagations : 232 (160 domain reductions, 0 cutoffs)
0.69/0.74 c avg switch length: 4.82
0.69/0.74 c switching time : 0.01
0.69/0.74 c Solution :
0.69/0.74 c Solutions found : 30 (10 improvements)
0.69/0.74 c First Solution : +4.94300000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.69/0.74 c Primal Bound : +1.00000000000000e+00 (in run 2, after 77 nodes, 0.53 seconds, depth 11, found by <objpscostdiving>)
0.69/0.74 c Dual Bound : +1.00000000000000e+00
0.69/0.74 c Gap : 0.00 %
0.69/0.74 c Root Dual Bound : +0.00000000000000e+00
0.69/0.74 c Root Iterations : 574
0.69/0.75 c Time complete: 0.73.