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-3717742-1338198868.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 5033
0.00/0.01 c feasible solution found by trivial heuristic, objective value 5.033000e+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 1228
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.228000e+03 | Inf
0.00/0.01 o 250
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - |1073k| 0 | - | 371 | 202 | 0 | 0 | 0 | 0 | 0 | -- | 2.500000e+02 | Inf
0.01/0.02 c 0.0s| 1 | 0 | 163 | - |1338k| 0 | 42 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 2.500000e+02 | Inf
0.01/0.02 o 103
0.01/0.02 c 6 0.0s| 1 | 0 | 163 | - |1374k| 0 | 42 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.01/0.06 c 0.1s| 1 | 0 | 176 | - |1389k| 0 | 44 | 371 | 202 | 371 | 203 | 1 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.01/0.08 c 0.1s| 1 | 0 | 195 | - |1470k| 0 | 45 | 371 | 202 | 371 | 204 | 2 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.01/0.09 c 0.1s| 1 | 0 | 217 | - |1527k| 0 | 46 | 371 | 202 | 371 | 205 | 3 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.09/0.10 c 0.1s| 1 | 0 | 232 | - |1587k| 0 | 47 | 371 | 202 | 371 | 206 | 4 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.09/0.12 c 0.1s| 1 | 0 | 244 | - |1599k| 0 | 48 | 371 | 202 | 371 | 207 | 5 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.09/0.17 o 98
0.09/0.17 c c 0.2s| 1 | 0 | 829 | - |1737k| 0 | - | 371 | 202 | 371 | 207 | 5 | 0 | 0 | 0.000000e+00 | 9.800000e+01 | Inf
0.09/0.20 c 0.2s| 1 | 0 | 862 | - |1694k| 0 | 48 | 371 | 202 | 371 | 207 | 5 | 1 | 0 | 0.000000e+00 | 9.800000e+01 | Inf
0.18/0.20 o 70
0.18/0.20 c 6 0.2s| 1 | 0 | 862 | - |1707k| 0 | 48 | 371 | 202 | 371 | 207 | 5 | 1 | 0 | 0.000000e+00 | 7.000000e+01 | Inf
0.18/0.21 c 0.2s| 1 | 0 | 862 | - |1703k| 0 | 48 | 371 | 202 | 371 | 207 | 5 | 1 | 0 | 0.000000e+00 | 7.000000e+01 | Inf
0.18/0.21 o 49
0.18/0.21 c 6 0.2s| 1 | 0 | 862 | - |1717k| 0 | 48 | 371 | 202 | 371 | 207 | 5 | 1 | 0 | 0.000000e+00 | 4.900000e+01 | Inf
0.18/0.23 c 0.2s| 1 | 2 | 862 | - |1711k| 0 | 48 | 371 | 202 | 371 | 207 | 5 | 1 | 0 | 0.000000e+00 | 4.900000e+01 | Inf
0.18/0.23 c (run 1, node 1) restarting after 36 global fixings of integer variables
0.18/0.23 c
0.18/0.23 c (restart) converted 106 cuts from the global cut pool into linear constraints
0.18/0.23 c
0.18/0.23 c presolving:
0.18/0.23 c (round 1) 70 del vars, 69 del conss, 0 add conss, 34 chg bounds, 0 chg sides, 4 chg coeffs, 0 upgd conss, 101 impls, 1 clqs
0.18/0.23 c (round 2) 70 del vars, 72 del conss, 0 add conss, 34 chg bounds, 1 chg sides, 4 chg coeffs, 0 upgd conss, 105 impls, 24 clqs
0.18/0.23 c (round 3) 72 del vars, 74 del conss, 0 add conss, 34 chg bounds, 1 chg sides, 4 chg coeffs, 0 upgd conss, 105 impls, 24 clqs
0.18/0.23 c (round 4) 72 del vars, 74 del conss, 0 add conss, 34 chg bounds, 1 chg sides, 4 chg coeffs, 99 upgd conss, 105 impls, 24 clqs
0.18/0.23 c (round 5) 72 del vars, 74 del conss, 0 add conss, 34 chg bounds, 3 chg sides, 6 chg coeffs, 99 upgd conss, 105 impls, 24 clqs
0.18/0.24 c (round 6) 72 del vars, 74 del conss, 0 add conss, 48 chg bounds, 3 chg sides, 6 chg coeffs, 99 upgd conss, 105 impls, 24 clqs
0.18/0.24 c (round 7) 100 del vars, 102 del conss, 0 add conss, 62 chg bounds, 3 chg sides, 6 chg coeffs, 99 upgd conss, 107 impls, 34 clqs
0.18/0.24 c (round 8) 100 del vars, 104 del conss, 0 add conss, 62 chg bounds, 4 chg sides, 6 chg coeffs, 99 upgd conss, 107 impls, 34 clqs
0.18/0.24 c (round 9) 102 del vars, 106 del conss, 0 add conss, 62 chg bounds, 4 chg sides, 6 chg coeffs, 115 upgd conss, 107 impls, 34 clqs
0.18/0.24 c (round 10) 102 del vars, 106 del conss, 0 add conss, 62 chg bounds, 7 chg sides, 9 chg coeffs, 115 upgd conss, 107 impls, 34 clqs
0.18/0.24 c presolving (11 rounds):
0.18/0.24 c 102 deleted vars, 106 deleted constraints, 0 added constraints, 62 tightened bounds, 0 added holes, 7 changed sides, 9 changed coefficients
0.18/0.24 c 107 implications, 34 cliques
0.18/0.24 c presolved problem has 269 variables (219 bin, 0 int, 50 impl, 0 cont) and 202 constraints
0.18/0.24 c 50 constraints of type <varbound>
0.18/0.24 c 4 constraints of type <knapsack>
0.18/0.24 c 37 constraints of type <setppc>
0.18/0.24 c 51 constraints of type <linear>
0.18/0.24 c 50 constraints of type <indicator>
0.18/0.24 c 10 constraints of type <logicor>
0.18/0.24 c transformed objective value is always integral (scale: 1)
0.18/0.24 c Presolving Time: 0.02
0.18/0.24 c
0.18/0.25 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.25 c 0.3s| 1 | 0 | 1003 | - |1736k| 0 | 41 | 269 | 202 | 269 | 201 | 0 | 1 | 0 | 0.000000e+00 | 4.900000e+01 | Inf
0.18/0.27 c 0.3s| 1 | 0 | 1046 | - |1808k| 0 | 44 | 269 | 202 | 269 | 205 | 4 | 1 | 0 | 0.000000e+00 | 4.900000e+01 | Inf
0.29/0.31 c 0.3s| 1 | 2 | 1630 | - |1837k| 0 | 44 | 269 | 202 | 269 | 205 | 4 | 1 | 0 | 0.000000e+00 | 4.900000e+01 | Inf
0.29/0.32 o 34
0.29/0.32 c 5 0.3s| 5 | 6 | 2155 | 345.4 |1861k| 4 | 32 | 269 | 202 | 269 | 165 | 4 | 1 | 0 | 0.000000e+00 | 3.400000e+01 | Inf
0.29/0.34 o 30
0.29/0.34 c p 0.3s| 6 | 7 | 2353 | 320.8 |1900k| 5 | - | 269 | 202 | 269 | 165 | 4 | 1 | 0 | 0.000000e+00 | 3.000000e+01 | Inf
0.29/0.35 o 11
0.29/0.35 c v 0.4s| 9 | 8 | 2751 | 258.1 |1910k| 5 | - | 269 | 175 | 269 | 165 | 4 | 16 | 0 | 0.000000e+00 | 1.100000e+01 | Inf
0.29/0.39 o 10
0.29/0.39 c r 0.4s| 25 | 10 | 3743 | 132.6 |1936k| 6 | 1 | 269 | 159 | 269 | 165 | 4 | 30 | 0 | 0.000000e+00 | 1.000000e+01 | Inf
0.38/0.47 o 1
0.38/0.47 c Forcing restart, since the absolute gap is 1.000000.
0.38/0.47 c Forcing restart, since the absolute gap is 1.000000.
0.38/0.47 c 5 0.5s| 56 | 6 | 5843 | 96.7 |1940k| 9 | - | 269 | 164 | 269 | 165 | 4 | 42 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.38/0.47 c (run 2, node 56) performing user restart
0.38/0.47 c
0.38/0.47 c (restart) converted 54 cuts from the global cut pool into linear constraints
0.38/0.47 c
0.38/0.47 c presolving:
0.38/0.47 c (round 1) 77 del vars, 41 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 109 impls, 63 clqs
0.38/0.48 c (round 2) 77 del vars, 46 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 44 upgd conss, 109 impls, 63 clqs
0.38/0.48 c (round 3) 77 del vars, 60 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 49 upgd conss, 109 impls, 63 clqs
0.38/0.48 c (round 4) 77 del vars, 60 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 49 upgd conss, 109 impls, 63 clqs
0.38/0.48 c (round 5) 101 del vars, 85 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 49 upgd conss, 109 impls, 70 clqs
0.38/0.48 c (round 6) 101 del vars, 86 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 68 upgd conss, 109 impls, 70 clqs
0.38/0.48 c (round 7) 101 del vars, 92 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 69 upgd conss, 109 impls, 70 clqs
0.38/0.49 c presolving (8 rounds):
0.38/0.49 c 101 deleted vars, 92 deleted constraints, 0 added constraints, 24 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.38/0.49 c 109 implications, 70 cliques
0.38/0.49 c presolved problem has 168 variables (168 bin, 0 int, 0 impl, 0 cont) and 126 constraints
0.38/0.49 c 8 constraints of type <knapsack>
0.38/0.49 c 74 constraints of type <setppc>
0.38/0.49 c 33 constraints of type <logicor>
0.38/0.49 c 11 constraints of type <bounddisjunction>
0.38/0.49 c transformed objective value is always integral (scale: 1)
0.38/0.49 c Presolving Time: 0.03
0.38/0.49 c
0.38/0.49 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.38/0.49 c 0.5s| 1 | 0 | 5944 | - |1792k| 0 | 43 | 168 | 126 | 168 | 99 | 0 | 42 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.50 c 0.5s| 1 | 0 | 5984 | - |2029k| 0 | 47 | 168 | 126 | 168 | 109 | 10 | 42 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.53 c 0.5s| 1 | 2 | 6289 | - |2030k| 0 | 47 | 168 | 127 | 168 | 109 | 10 | 43 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.55 c
0.49/0.55 c SCIP Status : problem is solved [optimal solution found]
0.49/0.55 c Solving Time (sec) : 0.55
0.49/0.55 c Solving Nodes : 28 (total of 85 nodes in 3 runs)
0.49/0.55 c Primal Bound : +1.00000000000000e+00 (37 solutions)
0.49/0.55 c Dual Bound : +1.00000000000000e+00
0.49/0.55 c Gap : 0.00 %
0.49/0.55 s OPTIMUM FOUND
0.49/0.55 v -x169 -x168 x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
0.49/0.55 v -x147 -x146 x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.49/0.55 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.49/0.55 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.49/0.55 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.49/0.55 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.49/0.55 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.49/0.55 v x4 -x3 -x2 -x1
0.49/0.55 c SCIP Status : problem is solved [optimal solution found]
0.49/0.55 c Total Time : 0.55
0.49/0.55 c solving : 0.55
0.49/0.55 c presolving : 0.03 (included in solving)
0.49/0.55 c reading : 0.00 (included in solving)
0.49/0.55 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.49/0.55 c Original Problem :
0.49/0.55 c Problem name : HOME/instance-3717742-1338198868.wbo
0.49/0.55 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.55 c Constraints : 102 initial, 102 maximal
0.49/0.55 c Objective sense : minimize
0.49/0.55 c Presolved Problem :
0.49/0.55 c Problem name : t_HOME/instance-3717742-1338198868.wbo
0.49/0.55 c Variables : 168 (168 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.55 c Constraints : 126 initial, 150 maximal
0.49/0.55 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.55 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c trivial : 0.00 0.00 139 0 0 0 0 0 0 0 0
0.49/0.55 c dualfix : 0.00 0.00 2 0 0 0 0 0 0 0 0
0.49/0.55 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c pseudoobj : 0.00 0.00 0 0 0 26 0 0 0 0 0
0.49/0.55 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.55 c varbound : 0.00 0.00 0 0 0 26 0 39 0 0 0
0.49/0.55 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 5 5
0.49/0.55 c setppc : 0.00 0.00 0 0 0 0 0 8 0 0 0
0.49/0.55 c linear : 0.01 0.00 60 0 0 135 0 86 0 2 4
0.49/0.55 c indicator : 0.00 0.00 2 0 0 0 0 62 0 0 0
0.49/0.55 c logicor : 0.00 0.00 0 0 0 0 0 2 0 0 0
0.49/0.55 c bounddisjunction : 0.00 0.00 0 0 0 0 0 2 0 0 0
0.49/0.55 c root node : - - 161 - - 161 - - - - -
0.49/0.55 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.49/0.55 c integral : 0 0 0 0 56 0 270 0 0 0 0 0 112
0.49/0.55 c knapsack : 8 8 2 725 0 0 14 49 1 146 0 0 0
0.49/0.55 c setppc : 74 74 2 747 0 0 213 337 1 628 0 0 0
0.49/0.55 c logicor : 33+ 57 4 293 0 0 20 32 4 15 0 0 0
0.49/0.55 c bounddisjunction : 11 11 0 106 0 0 0 1 0 0 0 0 0
0.49/0.55 c countsols : 0 0 0 0 0 0 66 0 0 0 0 0 0
0.49/0.55 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.49/0.55 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c knapsack : 0.02 0.00 0.01 0.01 0.00 0.00 0.00 0.00
0.49/0.55 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.49/0.55 c rootredcost : 4 0 0 16
0.49/0.55 c pseudoobj : 747 17 1 63
0.49/0.55 c vbounds : 75 29 0 49
0.49/0.55 c redcost : 81 0 0 263
0.49/0.55 c probing : 0 0 0 0
0.49/0.55 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.49/0.55 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c redcost : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c probing : 0.00 0.00 0.00 0.00 0.00
0.49/0.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.55 c propagation : 0.00 17 17 83 23.8 0 0.0 -
0.49/0.55 c infeasible LP : 0.00 21 19 58 13.7 0 0.0 0
0.49/0.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.55 c applied globally : - - - 63 12.4 - - -
0.49/0.55 c applied locally : - - - 3 37.0 - - -
0.49/0.55 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.49/0.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 60)
0.49/0.55 c closecuts : 0.00 0.00 0 0 0 0 0
0.49/0.55 c impliedbounds : 0.00 0.00 10 0 0 0 0
0.49/0.55 c intobj : 0.00 0.00 0 0 0 0 0
0.49/0.55 c gomory : 0.04 0.00 10 0 0 13 0
0.49/0.55 c cgmip : 0.00 0.00 0 0 0 0 0
0.49/0.55 c strongcg : 0.03 0.00 10 0 0 108 0
0.49/0.55 c cmir : 0.02 0.00 10 0 0 0 0
0.49/0.55 c flowcover : 0.04 0.00 10 0 0 0 0
0.49/0.55 c clique : 0.00 0.00 3 0 0 8 0
0.49/0.55 c zerohalf : 0.00 0.00 0 0 0 0 0
0.49/0.55 c mcf : 0.00 0.00 3 0 0 0 0
0.49/0.55 c oddcycle : 0.00 0.00 0 0 0 0 0
0.49/0.55 c rapidlearning : 0.03 0.00 1 0 0 0 0
0.49/0.55 c Pricers : ExecTime SetupTime Calls Vars
0.49/0.55 c problem variables: 0.00 - 0 0
0.49/0.55 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.49/0.55 c inference : 0.00 0.00 56 0 0 0 0 112
0.49/0.55 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.49/0.55 c pscost : 0.00 0.00 0 0 0 0 0 0
0.49/0.55 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.49/0.55 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.49/0.55 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.49/0.55 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.49/0.55 c random : 0.00 0.00 0 0 0 0 0 0
0.49/0.55 c Primal Heuristics : ExecTime SetupTime Calls Found
0.49/0.55 c LP solutions : 0.00 - - 0
0.49/0.55 c pseudo solutions : 0.00 - - 0
0.49/0.55 c crossover : 0.00 0.00 0 0
0.49/0.55 c oneopt : 0.00 0.00 7 0
0.49/0.55 c pscostdiving : 0.02 0.00 2 1
0.49/0.55 c guideddiving : 0.00 0.00 2 0
0.49/0.55 c fracdiving : 0.01 0.00 3 1
0.49/0.55 c veclendiving : 0.03 0.00 3 1
0.49/0.55 c linesearchdiving : 0.01 0.00 3 1
0.49/0.55 c objpscostdiving : 0.01 0.00 2 0
0.49/0.55 c rootsoldiving : 0.01 0.00 2 2
0.49/0.55 c smallcard : 0.00 0.00 0 0
0.49/0.55 c trivial : 0.00 0.00 2 1
0.49/0.55 c shiftandpropagate: 0.00 0.00 0 0
0.49/0.55 c simplerounding : 0.00 0.00 65 1
0.49/0.55 c zirounding : 0.00 0.00 2 0
0.49/0.55 c rounding : 0.00 0.00 65 0
0.49/0.55 c shifting : 0.00 0.00 11 8
0.49/0.55 c intshifting : 0.00 0.00 0 0
0.49/0.55 c twoopt : 0.00 0.00 0 0
0.49/0.55 c indtwoopt : 0.00 0.00 0 0
0.49/0.55 c indoneopt : 0.03 0.00 10 5
0.49/0.55 c fixandinfer : 0.00 0.00 0 0
0.49/0.55 c feaspump : 0.00 0.00 0 0
0.49/0.55 c clique : 0.00 0.00 0 0
0.49/0.55 c indrounding : 0.00 0.00 56 3
0.49/0.55 c coefdiving : 0.10 0.00 3 5
0.49/0.55 c indcoefdiving : 0.00 0.00 0 0
0.49/0.55 c nlpdiving : 0.00 0.00 0 0
0.49/0.55 c intdiving : 0.00 0.00 0 0
0.49/0.55 c actconsdiving : 0.00 0.00 0 0
0.49/0.55 c octane : 0.00 0.00 0 0
0.49/0.55 c rens : 0.02 0.00 1 0
0.49/0.55 c rins : 0.00 0.00 0 0
0.49/0.55 c localbranching : 0.00 0.00 0 0
0.49/0.55 c mutation : 0.00 0.00 0 0
0.49/0.55 c dins : 0.00 0.00 0 0
0.49/0.55 c vbounds : 0.00 0.00 0 0
0.49/0.55 c undercover : 0.00 0.00 0 0
0.49/0.55 c subnlp : 0.00 0.00 0 0
0.49/0.55 c trysol : 0.00 0.00 9 8
0.49/0.55 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.49/0.55 c primal LP : 0.00 2 0 0.00 - 0.00 2
0.49/0.55 c dual LP : 0.08 114 2946 31.68 37322.79 0.00 21
0.49/0.55 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.55 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.49/0.55 c diving/probing LP: 0.15 622 4010 6.45 27458.23
0.49/0.55 c strong branching : 0.00 0 0 0.00 -
0.49/0.55 c (at root node) : - 0 0 0.00 -
0.49/0.55 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.55 c B&B Tree :
0.49/0.55 c number of runs : 3
0.49/0.55 c nodes : 28
0.49/0.55 c nodes (total) : 85
0.49/0.55 c nodes left : 0
0.49/0.55 c max depth : 7
0.49/0.55 c max depth (total): 9
0.49/0.55 c backtracks : 14 (50.0%)
0.49/0.55 c delayed cutoffs : 1
0.49/0.55 c repropagations : 27 (217 domain reductions, 1 cutoffs)
0.49/0.55 c avg switch length: 3.57
0.49/0.55 c switching time : 0.00
0.49/0.55 c Solution :
0.49/0.55 c Solutions found : 37 (12 improvements)
0.49/0.55 c First Solution : +5.03300000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.49/0.55 c Primal Bound : +1.00000000000000e+00 (in run 2, after 56 nodes, 0.47 seconds, depth 9, found by <indrounding>)
0.49/0.55 c Dual Bound : +1.00000000000000e+00
0.49/0.55 c Gap : 0.00 %
0.49/0.55 c Root Dual Bound : +0.00000000000000e+00
0.49/0.55 c Root Iterations : 569
0.49/0.56 c Time complete: 0.54.