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-3717755-1338198876.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 | 207 | - |1338k| 0 | 41 | 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 | 207 | - |1374k| 0 | 41 | 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 | 207 | - |1577k| 0 | 41 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.09/0.10 c 0.1s| 1 | 0 | 217 | - |1575k| 0 | 42 | 371 | 359 | 371 | 204 | 2 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.09/0.11 c 0.1s| 1 | 0 | 234 | - |1609k| 0 | 44 | 371 | 359 | 371 | 205 | 3 | 0 | 0 | 0.000000e+00 | 1.810000e+02 | Inf
0.09/0.16 o 47
0.09/0.16 c c 0.2s| 1 | 0 | 662 | - |1742k| 0 | - | 371 | 359 | 371 | 205 | 3 | 0 | 0 | 0.000000e+00 | 4.700000e+01 | Inf
0.09/0.16 o 33
0.09/0.16 c c 0.2s| 1 | 0 | 701 | - |1753k| 0 | - | 371 | 359 | 371 | 205 | 3 | 0 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.09/0.18 c 0.2s| 1 | 0 | 701 | - |1697k| 0 | 44 | 371 | 292 | 371 | 205 | 3 | 2 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.19/0.20 c 0.2s| 1 | 2 | 701 | - |1697k| 0 | 44 | 371 | 292 | 371 | 205 | 3 | 2 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.19/0.20 c (run 1, node 1) restarting after 134 global fixings of integer variables
0.19/0.20 c
0.19/0.20 c (restart) converted 104 cuts from the global cut pool into linear constraints
0.19/0.20 c
0.19/0.20 c presolving:
0.19/0.20 c (round 1) 134 del vars, 67 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 105 impls, 47 clqs
0.19/0.20 c (round 2) 134 del vars, 78 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 105 impls, 47 clqs
0.19/0.20 c (round 3) 136 del vars, 80 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 105 impls, 47 clqs
0.19/0.20 c (round 4) 136 del vars, 80 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 93 upgd conss, 105 impls, 47 clqs
0.19/0.20 c presolving (5 rounds):
0.19/0.20 c 136 deleted vars, 80 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.19/0.20 c 105 implications, 47 cliques
0.19/0.20 c presolved problem has 235 variables (202 bin, 0 int, 33 impl, 0 cont) and 316 constraints
0.19/0.20 c 33 constraints of type <varbound>
0.19/0.20 c 4 constraints of type <knapsack>
0.19/0.20 c 49 constraints of type <setppc>
0.19/0.20 c 33 constraints of type <linear>
0.19/0.20 c 33 constraints of type <indicator>
0.19/0.20 c 7 constraints of type <logicor>
0.19/0.20 c 157 constraints of type <bounddisjunction>
0.19/0.20 c transformed objective value is always integral (scale: 1)
0.19/0.20 c Presolving Time: 0.01
0.19/0.20 c
0.19/0.21 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.21 c 0.2s| 1 | 0 | 844 | - |1675k| 0 | 42 | 235 | 316 | 235 | 159 | 0 | 2 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.19/0.23 c 0.2s| 1 | 0 | 878 | - |2039k| 0 | 47 | 235 | 316 | 235 | 167 | 8 | 2 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.19/0.26 c 0.3s| 1 | 2 | 1407 | - |2045k| 0 | 47 | 235 | 318 | 235 | 167 | 8 | 5 | 0 | 0.000000e+00 | 3.300000e+01 | Inf
0.19/0.27 o 26
0.19/0.27 c 5 0.3s| 4 | 5 | 1654 | 310.8 |2061k| 3 | 27 | 235 | 318 | 235 | 140 | 8 | 5 | 0 | 0.000000e+00 | 2.600000e+01 | Inf
0.19/0.27 o 15
0.19/0.27 c 6 0.3s| 5 | 4 | 1654 | 248.6 |2072k| 4 | - | 235 | 318 | 0 | 0 | 8 | 5 | 0 | 0.000000e+00 | 1.500000e+01 | Inf
0.29/0.30 o 13
0.29/0.30 c f 0.3s| 25 | 10 | 2474 | 82.5 |2082k| 9 | - | 235 | 287 | 235 | 140 | 8 | 16 | 0 | 0.000000e+00 | 1.300000e+01 | Inf
0.29/0.35 o 3
0.29/0.35 c r 0.3s| 51 | 6 | 3840 | 67.2 |2095k| 11 | 1 | 235 | 302 | 235 | 140 | 8 | 32 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.29/0.35 c Forcing restart, since 30 binary variables among 33 have been fixed.
0.29/0.35 c (run 2, node 51) performing user restart
0.29/0.35 c
0.29/0.35 c (restart) converted 39 cuts from the global cut pool into linear constraints
0.29/0.35 c
0.29/0.35 c presolving:
0.29/0.35 c (round 1) 62 del vars, 53 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 2 upgd conss, 115 impls, 67 clqs
0.29/0.35 c (round 2) 62 del vars, 56 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 35 upgd conss, 115 impls, 67 clqs
0.29/0.35 c (round 3) 62 del vars, 60 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 38 upgd conss, 115 impls, 67 clqs
0.29/0.36 c presolving (4 rounds):
0.29/0.36 c 62 deleted vars, 60 deleted constraints, 0 added constraints, 10 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.36 c 115 implications, 67 cliques
0.29/0.36 c presolved problem has 173 variables (171 bin, 0 int, 2 impl, 0 cont) and 283 constraints
0.29/0.36 c 2 constraints of type <varbound>
0.29/0.36 c 9 constraints of type <knapsack>
0.29/0.36 c 72 constraints of type <setppc>
0.29/0.36 c 2 constraints of type <linear>
0.29/0.36 c 2 constraints of type <indicator>
0.29/0.36 c 39 constraints of type <logicor>
0.29/0.36 c 157 constraints of type <bounddisjunction>
0.29/0.36 c transformed objective value is always integral (scale: 1)
0.29/0.36 c Presolving Time: 0.02
0.29/0.36 c
0.29/0.36 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.36 c 0.4s| 1 | 0 | 3952 | - |1729k| 0 | 43 | 173 | 283 | 173 | 99 | 0 | 34 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.29/0.38 c 0.4s| 1 | 0 | 3983 | - |2075k| 0 | 47 | 173 | 283 | 173 | 110 | 11 | 34 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.39/0.41 c 0.4s| 1 | 2 | 4236 | - |2076k| 0 | 47 | 173 | 284 | 173 | 110 | 11 | 36 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.39/0.42 o 1
0.39/0.42 c Forcing restart, since the absolute gap is 1.000000.
0.39/0.42 c Forcing restart, since the absolute gap is 1.000000.
0.39/0.42 c r 0.4s| 12 | 3 | 4660 | 65.2 |2097k| 4 | - | 173 | 289 | 173 | 96 | 11 | 41 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.39/0.42 c (run 3, node 12) performing user restart
0.39/0.42 c
0.39/0.42 c (restart) converted 8 cuts from the global cut pool into linear constraints
0.39/0.42 c
0.39/0.42 c presolving:
0.39/0.42 c (round 1) 0 del vars, 1 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 116 impls, 70 clqs
0.39/0.43 c (round 2) 1 del vars, 5 del conss, 0 add conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 116 impls, 70 clqs
0.39/0.43 c (round 3) 1 del vars, 5 del conss, 0 add conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 116 impls, 70 clqs
0.39/0.43 c (round 4) 5 del vars, 9 del conss, 0 add conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 116 impls, 72 clqs
0.39/0.44 c (round 5) 5 del vars, 9 del conss, 0 add conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 116 impls, 72 clqs
0.39/0.44 c presolving (6 rounds):
0.39/0.44 c 5 deleted vars, 9 deleted constraints, 0 added constraints, 5 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.44 c 116 implications, 72 cliques
0.39/0.44 c presolved problem has 168 variables (168 bin, 0 int, 0 impl, 0 cont) and 288 constraints
0.39/0.44 c 12 constraints of type <knapsack>
0.39/0.44 c 77 constraints of type <setppc>
0.39/0.44 c 42 constraints of type <logicor>
0.39/0.44 c 157 constraints of type <bounddisjunction>
0.39/0.44 c transformed objective value is always integral (scale: 1)
0.39/0.44 c Presolving Time: 0.04
0.39/0.44 c
0.39/0.44 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.44 c 0.4s| 1 | 0 | 4784 | - |1777k| 0 | 43 | 168 | 288 | 168 | 101 | 0 | 41 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.39/0.47 c 0.5s| 1 | 0 | 4806 | - |1913k| 0 | 51 | 168 | 288 | 168 | 110 | 9 | 41 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.39/0.49 c 0.5s| 1 | 2 | 5016 | - |1914k| 0 | 51 | 168 | 288 | 168 | 110 | 9 | 43 | 0 | 0.000000e+00 | 1.000000e+00 | Inf
0.49/0.50 c
0.49/0.50 c SCIP Status : problem is solved [optimal solution found]
0.49/0.50 c Solving Time (sec) : 0.51
0.49/0.50 c Solving Nodes : 17 (total of 81 nodes in 4 runs)
0.49/0.50 c Primal Bound : +1.00000000000000e+00 (18 solutions)
0.49/0.50 c Dual Bound : +1.00000000000000e+00
0.49/0.50 c Gap : 0.00 %
0.49/0.50 s OPTIMUM FOUND
0.49/0.50 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.50 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.50 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.50 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.50 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.49/0.50 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.49/0.50 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.50 v -x4 -x3 x2 -x1
0.49/0.50 c SCIP Status : problem is solved [optimal solution found]
0.49/0.50 c Total Time : 0.51
0.49/0.50 c solving : 0.51
0.49/0.50 c presolving : 0.04 (included in solving)
0.49/0.50 c reading : 0.00 (included in solving)
0.49/0.50 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.49/0.50 c Original Problem :
0.49/0.50 c Problem name : HOME/instance-3717755-1338198876.wbo
0.49/0.50 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.50 c Constraints : 102 initial, 102 maximal
0.49/0.50 c Objective sense : minimize
0.49/0.50 c Presolved Problem :
0.49/0.50 c Problem name : t_HOME/instance-3717755-1338198876.wbo
0.49/0.50 c Variables : 168 (168 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.50 c Constraints : 288 initial, 288 maximal
0.49/0.50 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.50 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c trivial : 0.00 0.00 189 0 0 0 0 0 0 0 0
0.49/0.50 c dualfix : 0.00 0.00 1 0 0 0 0 0 0 0 0
0.49/0.50 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c pseudoobj : 0.00 0.00 0 0 0 2 0 0 0 0 0
0.49/0.50 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c varbound : 0.00 0.00 0 0 0 12 0 16 0 0 0
0.49/0.50 c knapsack : 0.02 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c setppc : 0.00 0.00 0 0 0 0 0 2 0 0 0
0.49/0.50 c linear : 0.01 0.00 12 0 0 101 0 114 0 1 0
0.49/0.50 c indicator : 0.00 0.00 1 0 0 0 0 13 0 0 0
0.49/0.50 c logicor : 0.00 0.00 0 0 0 1 0 5 0 0 0
0.49/0.50 c bounddisjunction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c root node : - - 256 - - 256 - - - - -
0.49/0.50 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.49/0.50 c integral : 0 0 0 0 46 0 236 0 0 0 0 0 92
0.49/0.50 c knapsack : 12 12 3 649 0 0 180 26 1 70 0 0 0
0.49/0.50 c setppc : 77 77 3 648 0 0 163 273 7 800 0 0 0
0.49/0.50 c logicor : 42+ 46 3 188 0 0 8 24 2 14 0 0 0
0.49/0.50 c bounddisjunction : 157 157 0 237 0 0 0 1 0 0 0 0 0
0.49/0.50 c countsols : 0 0 0 0 0 0 45 0 0 0 0 0 0
0.49/0.50 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.49/0.50 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c knapsack : 0.02 0.00 0.01 0.01 0.00 0.00 0.00 0.00
0.49/0.50 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.49/0.50 c rootredcost : 2 0 0 21
0.49/0.50 c pseudoobj : 683 10 1 10
0.49/0.50 c vbounds : 24 12 0 3
0.49/0.50 c redcost : 60 0 0 264
0.49/0.50 c probing : 0 0 0 0
0.49/0.50 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.49/0.50 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c redcost : 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c probing : 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.50 c propagation : 0.00 13 13 31 45.5 1 23.0 -
0.49/0.50 c infeasible LP : 0.00 25 19 50 12.7 0 0.0 0
0.49/0.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.50 c applied globally : - - - 42 11.9 - - -
0.49/0.50 c applied locally : - - - 7 52.6 - - -
0.49/0.50 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.49/0.50 c cut pool : 0.00 0 - - 0 - (maximal pool size: 38)
0.49/0.50 c closecuts : 0.00 0.00 0 0 0 0 0
0.49/0.50 c impliedbounds : 0.00 0.00 7 0 0 0 0
0.49/0.50 c intobj : 0.00 0.00 0 0 0 0 0
0.49/0.50 c gomory : 0.03 0.00 7 0 0 78 0
0.49/0.50 c cgmip : 0.00 0.00 0 0 0 0 0
0.49/0.50 c strongcg : 0.02 0.00 7 0 0 175 0
0.49/0.50 c cmir : 0.01 0.00 7 0 0 0 0
0.49/0.51 c flowcover : 0.03 0.00 7 0 0 0 0
0.49/0.51 c clique : 0.00 0.00 4 0 0 15 0
0.49/0.51 c zerohalf : 0.00 0.00 0 0 0 0 0
0.49/0.51 c mcf : 0.00 0.00 4 0 0 0 0
0.49/0.51 c oddcycle : 0.00 0.00 0 0 0 0 0
0.49/0.51 c rapidlearning : 0.07 0.00 1 0 0 0 157
0.49/0.51 c Pricers : ExecTime SetupTime Calls Vars
0.49/0.51 c problem variables: 0.00 - 0 0
0.49/0.51 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.49/0.51 c inference : 0.00 0.00 46 0 0 0 0 92
0.49/0.51 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.49/0.51 c pscost : 0.00 0.00 0 0 0 0 0 0
0.49/0.51 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.49/0.51 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.49/0.51 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.49/0.51 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.49/0.51 c random : 0.00 0.00 0 0 0 0 0 0
0.49/0.51 c Primal Heuristics : ExecTime SetupTime Calls Found
0.49/0.51 c LP solutions : 0.00 - - 0
0.49/0.51 c pseudo solutions : 0.00 - - 0
0.49/0.51 c crossover : 0.00 0.00 0 0
0.49/0.51 c rootsoldiving : 0.00 0.00 0 0
0.49/0.51 c linesearchdiving : 0.00 0.00 0 0
0.49/0.51 c oneopt : 0.00 0.00 5 0
0.49/0.51 c pscostdiving : 0.00 0.00 1 0
0.49/0.51 c fracdiving : 0.00 0.00 1 1
0.49/0.51 c veclendiving : 0.01 0.00 1 0
0.49/0.51 c objpscostdiving : 0.00 0.00 1 0
0.49/0.51 c smallcard : 0.00 0.00 0 0
0.49/0.51 c trivial : 0.00 0.00 2 1
0.49/0.51 c shiftandpropagate: 0.00 0.00 0 0
0.49/0.51 c simplerounding : 0.00 0.00 54 2
0.49/0.51 c zirounding : 0.00 0.00 1 0
0.49/0.51 c rounding : 0.00 0.00 53 0
0.49/0.51 c shifting : 0.00 0.00 11 2
0.49/0.51 c intshifting : 0.00 0.00 0 0
0.49/0.51 c twoopt : 0.00 0.00 0 0
0.49/0.51 c indoneopt : 0.01 0.00 9 4
0.49/0.51 c indtwoopt : 0.00 0.00 0 0
0.49/0.51 c fixandinfer : 0.00 0.00 0 0
0.49/0.51 c feaspump : 0.00 0.00 0 0
0.49/0.51 c clique : 0.00 0.00 0 0
0.49/0.51 c indcoefdiving : 0.00 0.00 0 0
0.49/0.51 c indrounding : 0.00 0.00 46 2
0.49/0.51 c coefdiving : 0.12 0.00 5 3
0.49/0.51 c nlpdiving : 0.00 0.00 0 0
0.49/0.51 c intdiving : 0.00 0.00 0 0
0.49/0.51 c actconsdiving : 0.00 0.00 0 0
0.49/0.51 c guideddiving : 0.00 0.00 0 0
0.49/0.51 c octane : 0.00 0.00 0 0
0.49/0.51 c rens : 0.02 0.00 1 0
0.49/0.51 c rins : 0.00 0.00 0 0
0.49/0.51 c localbranching : 0.00 0.00 0 0
0.49/0.51 c mutation : 0.00 0.00 0 0
0.49/0.51 c dins : 0.00 0.00 0 0
0.49/0.51 c vbounds : 0.00 0.00 0 0
0.49/0.51 c undercover : 0.00 0.00 0 0
0.49/0.51 c subnlp : 0.00 0.00 0 0
0.49/0.51 c trysol : 0.00 0.00 2 2
0.49/0.51 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.49/0.51 c primal LP : 0.00 3 0 0.00 - 0.00 3
0.49/0.51 c dual LP : 0.08 92 3284 39.57 39460.72 0.00 9
0.49/0.51 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.51 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.49/0.51 c diving/probing LP: 0.10 582 2142 3.68 22049.74
0.49/0.51 c strong branching : 0.00 0 0 0.00 -
0.49/0.51 c (at root node) : - 0 0 0.00 -
0.49/0.51 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.51 c B&B Tree :
0.49/0.51 c number of runs : 4
0.49/0.51 c nodes : 17
0.49/0.51 c nodes (total) : 81
0.49/0.51 c nodes left : 0
0.49/0.51 c max depth : 6
0.49/0.51 c max depth (total): 11
0.49/0.51 c backtracks : 4 (23.5%)
0.49/0.51 c delayed cutoffs : 0
0.49/0.51 c repropagations : 11 (63 domain reductions, 0 cutoffs)
0.49/0.51 c avg switch length: 2.82
0.49/0.51 c switching time : 0.00
0.49/0.51 c Solution :
0.49/0.51 c Solutions found : 18 (12 improvements)
0.49/0.51 c First Solution : +4.94300000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.49/0.51 c Primal Bound : +1.00000000000000e+00 (in run 3, after 12 nodes, 0.42 seconds, depth 3, found by <simplerounding>)
0.49/0.51 c Dual Bound : +1.00000000000000e+00
0.49/0.51 c Gap : 0.00 %
0.49/0.51 c Root Dual Bound : +0.00000000000000e+00
0.49/0.51 c Root Iterations : 697
0.49/0.51 c Time complete: 0.5.