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-3717759-1338198865.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 204
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - |1073k| 0 | - | 371 | 202 | 0 | 0 | 0 | 0 | 0 | -- | 2.040000e+02 | Inf
0.00/0.02 c 0.0s| 1 | 0 | 156 | - |1338k| 0 | 37 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 2.040000e+02 | Inf
0.00/0.02 o 150
0.00/0.02 c 6 0.0s| 1 | 0 | 156 | - |1374k| 0 | 37 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.500000e+02 | Inf
0.09/0.11 o 133
0.09/0.11 c y 0.1s| 1 | 0 | 156 | - |1828k| 0 | 37 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.330000e+02 | Inf
0.09/0.11 c 0.1s| 1 | 0 | 170 | - |1737k| 0 | 45 | 371 | 387 | 371 | 203 | 1 | 0 | 0 | 0.000000e+00 | 1.330000e+02 | Inf
0.09/0.13 c 0.1s| 1 | 0 | 183 | - |1855k| 0 | 45 | 371 | 387 | 371 | 205 | 3 | 0 | 0 | 0.000000e+00 | 1.330000e+02 | Inf
0.09/0.14 c 0.1s| 1 | 0 | 201 | - |1951k| 0 | 47 | 371 | 387 | 371 | 206 | 4 | 0 | 0 | 0.000000e+00 | 1.330000e+02 | Inf
0.09/0.16 c 0.2s| 1 | 0 | 219 | - |2016k| 0 | 50 | 371 | 387 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 1.330000e+02 | Inf
0.19/0.21 o 88
0.19/0.21 c c 0.2s| 1 | 0 | 756 | - |2173k| 0 | - | 371 | 387 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 8.800000e+01 | Inf
0.19/0.22 o 77
0.19/0.22 c c 0.2s| 1 | 0 | 771 | - |2188k| 0 | - | 371 | 387 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 7.700000e+01 | Inf
0.19/0.22 o 66
0.19/0.22 c c 0.2s| 1 | 0 | 778 | - |2201k| 0 | - | 371 | 387 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 6.600000e+01 | Inf
0.19/0.24 c 0.2s| 1 | 0 | 778 | - |2119k| 0 | 50 | 371 | 355 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 6.600000e+01 | Inf
0.19/0.25 o 59
0.19/0.25 c 6 0.2s| 1 | 0 | 778 | - |2133k| 0 | 50 | 371 | 355 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 5.900000e+01 | Inf
0.19/0.26 c 0.3s| 1 | 0 | 778 | - |2137k| 0 | 50 | 371 | 355 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 5.900000e+01 | Inf
0.19/0.26 o 46
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 6 0.3s| 1 | 0 | 778 | - |2151k| 0 | 50 | 371 | 355 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.19/0.28 c 0.3s| 1 | 2 | 778 | - |2145k| 0 | 50 | 371 | 355 | 371 | 208 | 6 | 0 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.19/0.28 c (run 1, node 1) restarting after 71 global fixings of integer variables
0.19/0.28 c
0.19/0.28 c (restart) converted 107 cuts from the global cut pool into linear constraints
0.19/0.28 c
0.19/0.28 c presolving:
0.19/0.28 c (round 1) 78 del vars, 46 del conss, 0 add conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 101 impls, 27 clqs
0.19/0.28 c (round 2) 78 del vars, 48 del conss, 0 add conss, 7 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 101 impls, 32 clqs
0.19/0.28 c (round 3) 80 del vars, 50 del conss, 0 add conss, 7 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 101 impls, 32 clqs
0.19/0.28 c (round 4) 80 del vars, 50 del conss, 0 add conss, 7 chg bounds, 1 chg sides, 0 chg coeffs, 99 upgd conss, 101 impls, 32 clqs
0.19/0.29 c (round 5) 80 del vars, 50 del conss, 0 add conss, 25 chg bounds, 1 chg sides, 0 chg coeffs, 99 upgd conss, 101 impls, 32 clqs
0.19/0.29 c (round 6) 116 del vars, 86 del conss, 0 add conss, 43 chg bounds, 1 chg sides, 0 chg coeffs, 99 upgd conss, 103 impls, 42 clqs
0.19/0.29 c (round 7) 116 del vars, 86 del conss, 0 add conss, 43 chg bounds, 1 chg sides, 0 chg coeffs, 117 upgd conss, 103 impls, 42 clqs
0.19/0.29 c presolving (8 rounds):
0.19/0.29 c 116 deleted vars, 86 deleted constraints, 0 added constraints, 43 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.19/0.29 c 103 implications, 42 cliques
0.19/0.29 c presolved problem has 255 variables (212 bin, 0 int, 43 impl, 0 cont) and 376 constraints
0.19/0.29 c 43 constraints of type <varbound>
0.19/0.29 c 1 constraints of type <knapsack>
0.19/0.29 c 43 constraints of type <setppc>
0.19/0.29 c 49 constraints of type <linear>
0.19/0.29 c 43 constraints of type <indicator>
0.19/0.29 c 12 constraints of type <logicor>
0.19/0.29 c 185 constraints of type <bounddisjunction>
0.19/0.29 c transformed objective value is always integral (scale: 1)
0.19/0.29 c Presolving Time: 0.01
0.19/0.29 c
0.28/0.30 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.28/0.30 c 0.3s| 1 | 0 | 893 | - |1833k| 0 | 44 | 255 | 376 | 255 | 191 | 0 | 0 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.28/0.31 c 0.3s| 1 | 0 | 913 | - |2120k| 0 | 44 | 255 | 376 | 255 | 193 | 2 | 0 | 0 | 0.000000e+00 | 4.600000e+01 | Inf
0.28/0.34 o 21
0.28/0.34 c c 0.3s| 1 | 2 | 1364 | - |2194k| 0 | - | 255 | 376 | 255 | 193 | 2 | 0 | 0 | 0.000000e+00 | 2.100000e+01 | Inf
0.39/0.42 o 19
0.39/0.42 c c 0.4s| 37 | 24 | 3727 | 91.2 |2228k| 10 | - | 255 | 345 | 255 | 158 | 2 | 12 | 0 | 0.000000e+00 | 1.900000e+01 | Inf
0.39/0.43 o 16
0.39/0.43 c S 0.4s| 49 | 28 | 3964 | 73.7 |2241k| 14 | 0 | 255 | 334 | 255 | 158 | 2 | 13 | 0 | 0.000000e+00 | 1.600000e+01 | Inf
0.39/0.46 o 15
0.39/0.46 c 5 0.5s| 56 | 27 | 4443 | 73.0 |2248k| 14 | 24 | 255 | 322 | 255 | 158 | 2 | 14 | 0 | 0.000000e+00 | 1.500000e+01 | Inf
0.39/0.46 o 13
0.39/0.46 c 6 0.5s| 57 | 24 | 4443 | 71.7 |2255k| 14 | - | 255 | 322 | 0 | 0 | 2 | 14 | 0 | 0.000000e+00 | 1.300000e+01 | Inf
0.49/0.53 o 3
0.49/0.53 c c 0.5s| 90 | 8 | 5772 | 60.2 |2233k| 14 | - | 255 | 324 | 255 | 158 | 2 | 17 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.49/0.53 c Forcing restart, since 39 binary variables among 43 have been fixed.
0.49/0.53 c (run 2, node 90) 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) 82 del vars, 61 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 109 impls, 66 clqs
0.49/0.54 c (round 2) 82 del vars, 65 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 42 upgd conss, 109 impls, 66 clqs
0.49/0.54 c (round 3) 82 del vars, 68 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 46 upgd conss, 111 impls, 66 clqs
0.49/0.54 c (round 4) 82 del vars, 69 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 46 upgd conss, 111 impls, 66 clqs
0.49/0.54 c presolving (5 rounds):
0.49/0.54 c 82 deleted vars, 69 deleted constraints, 0 added constraints, 10 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.54 c 111 implications, 66 cliques
0.49/0.54 c presolved problem has 173 variables (171 bin, 0 int, 2 impl, 0 cont) and 306 constraints
0.49/0.54 c 2 constraints of type <varbound>
0.49/0.54 c 7 constraints of type <knapsack>
0.49/0.54 c 70 constraints of type <setppc>
0.49/0.54 c 4 constraints of type <linear>
0.49/0.54 c 2 constraints of type <indicator>
0.49/0.54 c 23 constraints of type <logicor>
0.49/0.54 c 198 constraints of type <bounddisjunction>
0.49/0.54 c transformed objective value is always integral (scale: 1)
0.49/0.54 c Presolving Time: 0.02
0.49/0.54 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 | 5879 | - |1872k| 0 | 43 | 173 | 306 | 173 | 106 | 0 | 23 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.49/0.56 c 0.6s| 1 | 0 | 5905 | - |2119k| 0 | 53 | 173 | 306 | 173 | 117 | 11 | 23 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.49/0.59 c 0.6s| 1 | 2 | 6337 | - |2121k| 0 | 53 | 173 | 306 | 173 | 117 | 11 | 25 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.58/0.65 c
0.58/0.65 c SCIP Status : problem is solved [optimal solution found]
0.58/0.65 c Solving Time (sec) : 0.65
0.58/0.65 c Solving Nodes : 75 (total of 166 nodes in 3 runs)
0.58/0.65 c Primal Bound : +3.00000000000000e+00 (32 solutions)
0.58/0.65 c Dual Bound : +3.00000000000000e+00
0.58/0.65 c Gap : 0.00 %
0.58/0.65 s OPTIMUM FOUND
0.58/0.65 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
0.58/0.65 v -x147 -x146 -x145 -x144 -x143 x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.58/0.65 v -x126 -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.58/0.65 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.58/0.65 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
0.58/0.65 v -x56 -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.58/0.65 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.58/0.65 v -x4 -x3 -x2 -x1
0.58/0.65 c SCIP Status : problem is solved [optimal solution found]
0.58/0.65 c Total Time : 0.65
0.58/0.65 c solving : 0.65
0.58/0.65 c presolving : 0.02 (included in solving)
0.58/0.65 c reading : 0.00 (included in solving)
0.58/0.65 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.58/0.65 c Original Problem :
0.58/0.65 c Problem name : HOME/instance-3717759-1338198865.wbo
0.58/0.65 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.58/0.65 c Constraints : 102 initial, 102 maximal
0.58/0.65 c Objective sense : minimize
0.58/0.65 c Presolved Problem :
0.58/0.65 c Problem name : t_HOME/instance-3717759-1338198865.wbo
0.58/0.65 c Variables : 173 (171 binary, 0 integer, 2 implicit integer, 0 continuous)
0.58/0.65 c Constraints : 306 initial, 371 maximal
0.58/0.65 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.58/0.65 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c trivial : 0.00 0.00 161 0 0 0 0 0 0 0 0
0.58/0.65 c dualfix : 0.00 0.00 1 0 0 0 0 0 0 0 0
0.58/0.65 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c pseudoobj : 0.00 0.00 0 0 0 18 0 0 0 0 0
0.58/0.65 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c varbound : 0.00 0.00 0 0 0 28 0 30 0 0 0
0.58/0.65 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c setppc : 0.00 0.00 0 0 0 0 0 2 0 0 0
0.58/0.65 c linear : 0.01 0.00 35 0 0 108 0 88 0 1 0
0.58/0.65 c indicator : 0.00 0.00 1 0 0 0 0 36 0 0 0
0.58/0.65 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c bounddisjunction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.58/0.65 c root node : - - 223 - - 223 - - - - -
0.58/0.65 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.58/0.65 c integral : 0 0 0 0 102 0 359 0 0 0 0 0 204
0.58/0.65 c varbound : 2 2 2 1115 0 0 0 9 0 49 0 0 0
0.58/0.65 c knapsack : 7 7 2 1116 0 0 297 29 2 66 0 0 0
0.58/0.65 c setppc : 70 70 2 1114 0 0 252 872 1 1719 0 0 0
0.58/0.65 c linear : 4 4 9 1322 0 0 151 136 9 302 0 0 0
0.58/0.65 c indicator : 2 2 0 1312 0 0 97 5 0 36 0 0 0
0.58/0.65 c logicor : 23+ 92 2 401 0 0 50 107 7 57 0 0 0
0.58/0.65 c bounddisjunction : 198 198 0 429 0 0 0 3 2 1 0 0 0
0.58/0.65 c countsols : 0 0 0 0 0 0 60 0 0 0 0 0 0
0.58/0.65 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.58/0.65 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c varbound : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c knapsack : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
0.58/0.65 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c linear : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c indicator : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.58/0.65 c rootredcost : 5 0 0 6
0.58/0.65 c pseudoobj : 1380 15 0 26
0.58/0.65 c vbounds : 68 21 1 45
0.58/0.65 c redcost : 145 0 0 733
0.58/0.65 c probing : 0 0 0 0
0.58/0.65 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.58/0.65 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c redcost : 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c probing : 0.00 0.00 0.00 0.00 0.00
0.58/0.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.58/0.65 c propagation : 0.00 22 20 87 28.4 0 0.0 -
0.58/0.65 c infeasible LP : 0.00 38 32 96 12.4 0 0.0 0
0.58/0.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.58/0.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.58/0.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.58/0.65 c applied globally : - - - 92 11.4 - - -
0.58/0.65 c applied locally : - - - 5 49.6 - - -
0.58/0.65 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.58/0.65 c cut pool : 0.00 0 - - 0 - (maximal pool size: 67)
0.58/0.65 c closecuts : 0.00 0.00 0 0 0 0 0
0.58/0.65 c impliedbounds : 0.00 0.00 9 0 0 0 0
0.58/0.65 c intobj : 0.00 0.00 0 0 0 0 0
0.58/0.65 c gomory : 0.04 0.00 9 0 0 53 0
0.58/0.65 c cgmip : 0.00 0.00 0 0 0 0 0
0.58/0.65 c strongcg : 0.03 0.00 9 0 0 230 0
0.58/0.65 c cmir : 0.01 0.00 9 0 0 0 0
0.58/0.65 c flowcover : 0.04 0.00 9 0 0 0 0
0.58/0.65 c clique : 0.00 0.00 3 0 0 8 0
0.58/0.65 c zerohalf : 0.00 0.00 0 0 0 0 0
0.58/0.65 c mcf : 0.00 0.00 3 0 0 0 0
0.58/0.65 c oddcycle : 0.00 0.00 0 0 0 0 0
0.58/0.65 c rapidlearning : 0.08 0.00 1 0 0 0 185
0.58/0.65 c Pricers : ExecTime SetupTime Calls Vars
0.58/0.65 c problem variables: 0.00 - 0 0
0.58/0.65 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.58/0.65 c inference : 0.00 0.00 102 0 0 0 0 204
0.58/0.65 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.58/0.65 c pscost : 0.00 0.00 0 0 0 0 0 0
0.58/0.65 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.58/0.65 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.58/0.65 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.58/0.65 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.58/0.65 c random : 0.00 0.00 0 0 0 0 0 0
0.58/0.65 c Primal Heuristics : ExecTime SetupTime Calls Found
0.58/0.65 c LP solutions : 0.00 - - 0
0.58/0.65 c pseudo solutions : 0.00 - - 0
0.58/0.65 c crossover : 0.00 0.00 0 0
0.58/0.65 c guideddiving : 0.00 0.00 0 0
0.58/0.65 c oneopt : 0.00 0.00 8 0
0.58/0.65 c pscostdiving : 0.00 0.00 1 0
0.58/0.65 c fracdiving : 0.00 0.00 1 0
0.58/0.65 c veclendiving : 0.01 0.00 1 1
0.58/0.65 c linesearchdiving : 0.00 0.00 1 0
0.58/0.65 c indoneopt : 0.02 0.00 12 6
0.58/0.65 c objpscostdiving : 0.01 0.00 1 0
0.58/0.65 c rootsoldiving : 0.00 0.00 1 1
0.58/0.65 c smallcard : 0.00 0.00 0 0
0.58/0.65 c trivial : 0.00 0.00 2 1
0.58/0.65 c shiftandpropagate: 0.00 0.00 0 0
0.58/0.65 c simplerounding : 0.00 0.00 109 0
0.58/0.65 c zirounding : 0.00 0.00 6 0
0.58/0.65 c rounding : 0.00 0.00 103 0
0.58/0.65 c shifting : 0.01 0.00 17 5
0.58/0.65 c intshifting : 0.00 0.00 0 0
0.58/0.65 c twoopt : 0.00 0.00 0 0
0.58/0.65 c indtwoopt : 0.00 0.00 0 0
0.58/0.65 c fixandinfer : 0.00 0.00 0 0
0.58/0.65 c feaspump : 0.00 0.00 0 0
0.58/0.65 c clique : 0.00 0.00 0 0
0.58/0.65 c coefdiving : 0.17 0.00 13 8
0.58/0.65 c indrounding : 0.01 0.00 102 4
0.58/0.65 c indcoefdiving : 0.00 0.00 0 0
0.58/0.65 c nlpdiving : 0.00 0.00 0 0
0.58/0.65 c intdiving : 0.00 0.00 0 0
0.58/0.65 c actconsdiving : 0.00 0.00 0 0
0.58/0.65 c octane : 0.00 0.00 0 0
0.58/0.65 c rens : 0.03 0.00 1 0
0.58/0.65 c rins : 0.00 0.00 0 0
0.58/0.65 c localbranching : 0.00 0.00 0 0
0.58/0.65 c mutation : 0.00 0.00 0 0
0.58/0.65 c dins : 0.00 0.00 0 0
0.58/0.65 c vbounds : 0.00 0.00 0 0
0.58/0.65 c undercover : 0.00 0.00 0 0
0.58/0.65 c subnlp : 0.00 0.00 0 0
0.58/0.65 c trysol : 0.00 0.00 6 5
0.58/0.65 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.58/0.65 c primal LP : 0.00 2 0 0.00 - 0.00 2
0.58/0.65 c dual LP : 0.12 205 4480 26.99 38268.36 0.00 39
0.58/0.65 c lex dual LP : 0.00 0 0 0.00 -
0.58/0.65 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.58/0.65 c diving/probing LP: 0.15 795 3487 4.39 23909.76
0.58/0.65 c strong branching : 0.00 0 0 0.00 -
0.58/0.65 c (at root node) : - 0 0 0.00 -
0.58/0.65 c conflict analysis: 0.00 0 0 0.00 -
0.58/0.65 c B&B Tree :
0.58/0.65 c number of runs : 3
0.58/0.65 c nodes : 75
0.58/0.65 c nodes (total) : 166
0.58/0.65 c nodes left : 0
0.58/0.65 c max depth : 15
0.58/0.65 c max depth (total): 15
0.58/0.65 c backtracks : 26 (34.7%)
0.58/0.65 c delayed cutoffs : 2
0.58/0.65 c repropagations : 63 (339 domain reductions, 1 cutoffs)
0.58/0.65 c avg switch length: 3.39
0.58/0.65 c switching time : 0.01
0.58/0.65 c Solution :
0.58/0.65 c Solutions found : 32 (16 improvements)
0.58/0.65 c First Solution : +4.94300000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.58/0.65 c Primal Bound : +3.00000000000000e+00 (in run 2, after 90 nodes, 0.53 seconds, depth 29, found by <coefdiving>)
0.58/0.65 c Dual Bound : +3.00000000000000e+00
0.58/0.65 c Gap : 0.00 %
0.58/0.65 c Root Dual Bound : +0.00000000000000e+00
0.58/0.65 c Root Iterations : 487
0.58/0.66 c Time complete: 0.65.