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-3717754-1338198885.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 5033
0.00/0.00 c feasible solution found by trivial heuristic, objective value 5.033000e+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 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.00/0.02 c 0.0s| 1 | 0 | 166 | - |1338k| 0 | 41 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 2.500000e+02 | Inf
0.00/0.02 o 103
0.00/0.02 c 6 0.0s| 1 | 0 | 166 | - |1361k| 0 | 41 | 371 | 202 | 371 | 202 | 0 | 0 | 0 | 0.000000e+00 | 1.030000e+02 | Inf
0.00/0.06 c 0.1s| 1 | 0 | 196 | - |1374k| 0 | 41 | 371 | 202 | 371 | 203 | 1 | 0 | 0 | 3.448500e-04 | 1.030000e+02 | Large
0.08/0.11 o 73
0.08/0.11 c c 0.1s| 1 | 0 | 784 | - |1689k| 0 | - | 371 | 202 | 371 | 203 | 1 | 0 | 0 | 3.448500e-04 | 7.300000e+01 | Large
0.08/0.14 c 0.1s| 1 | 0 | 813 | - |1627k| 0 | 41 | 371 | 172 | 371 | 203 | 1 | 1 | 0 | 3.448500e-04 | 7.300000e+01 | Large
0.08/0.14 o 68
0.08/0.14 c 6 0.1s| 1 | 0 | 813 | - |1641k| 0 | 41 | 371 | 172 | 371 | 203 | 1 | 1 | 0 | 3.448500e-04 | 6.800000e+01 | Large
0.08/0.15 c 0.2s| 1 | 0 | 813 | - |1649k| 0 | 41 | 371 | 172 | 371 | 203 | 1 | 1 | 0 | 3.448500e-04 | 6.800000e+01 | Large
0.08/0.16 c 0.2s| 1 | 2 | 813 | - |1649k| 0 | 41 | 371 | 172 | 371 | 203 | 1 | 1 | 0 | 3.448500e-04 | 6.800000e+01 | Large
0.08/0.16 c (run 1, node 1) restarting after 67 global fixings of integer variables
0.08/0.16 c
0.08/0.16 c (restart) converted 102 cuts from the global cut pool into linear constraints
0.08/0.16 c
0.08/0.16 c presolving:
0.08/0.17 c (round 1) 74 del vars, 44 del conss, 0 add conss, 7 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 103 impls, 20 clqs
0.08/0.17 c (round 2) 74 del vars, 47 del conss, 0 add conss, 7 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 105 impls, 25 clqs
0.08/0.17 c (round 3) 76 del vars, 49 del conss, 0 add conss, 7 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 105 impls, 25 clqs
0.08/0.17 c (round 4) 76 del vars, 49 del conss, 0 add conss, 7 chg bounds, 1 chg sides, 1 chg coeffs, 99 upgd conss, 105 impls, 25 clqs
0.08/0.17 c (round 5) 76 del vars, 49 del conss, 0 add conss, 7 chg bounds, 2 chg sides, 2 chg coeffs, 99 upgd conss, 105 impls, 25 clqs
0.08/0.17 c presolving (6 rounds):
0.08/0.17 c 76 deleted vars, 49 deleted constraints, 0 added constraints, 7 tightened bounds, 0 added holes, 2 changed sides, 2 changed coefficients
0.08/0.17 c 105 implications, 25 cliques
0.08/0.17 c presolved problem has 295 variables (232 bin, 0 int, 63 impl, 0 cont) and 225 constraints
0.08/0.17 c 63 constraints of type <varbound>
0.08/0.17 c 1 constraints of type <knapsack>
0.08/0.17 c 27 constraints of type <setppc>
0.08/0.17 c 63 constraints of type <linear>
0.08/0.17 c 63 constraints of type <indicator>
0.08/0.17 c 8 constraints of type <logicor>
0.08/0.17 c transformed objective value is always integral (scale: 1)
0.08/0.17 c Presolving Time: 0.01
0.08/0.17 c
0.08/0.18 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.08/0.18 c 0.2s| 1 | 0 | 1152 | - |1664k| 0 | 41 | 295 | 225 | 295 | 225 | 0 | 1 | 0 | 3.460152e-04 | 6.800000e+01 | Large
0.19/0.20 c 0.2s| 1 | 0 | 1173 | - |1690k| 0 | 43 | 295 | 225 | 295 | 226 | 1 | 1 | 0 | 2.593259e-03 | 6.800000e+01 | Large
0.19/0.23 o 53
0.19/0.23 c c 0.2s| 1 | 2 | 1622 | - |1781k| 0 | - | 295 | 225 | 295 | 226 | 1 | 1 | 0 | 2.593259e-03 | 5.300000e+01 | Large
0.19/0.23 o 50
0.19/0.23 c c 0.2s| 1 | 2 | 1629 | - |1785k| 0 | - | 295 | 225 | 295 | 226 | 1 | 1 | 0 | 2.593259e-03 | 5.000000e+01 | Large
0.19/0.23 o 45
0.19/0.23 c c 0.2s| 1 | 2 | 1642 | - |1812k| 0 | - | 295 | 225 | 295 | 226 | 1 | 1 | 0 | 2.593259e-03 | 4.500000e+01 | Large
0.19/0.23 o 42
0.19/0.23 c 6 0.2s| 2 | 1 | 1642 | 543.0 |1749k| 1 | - | 295 | 193 | 0 | 0 | 1 | 1 | 0 | 2.593259e-03 | 4.200000e+01 | Large
0.19/0.28 o 41
0.19/0.28 c p 0.3s| 10 | 11 | 2711 | 215.5 |1819k| 8 | - | 295 | 189 | 295 | 192 | 1 | 1 | 0 | 1.920829e-02 | 4.100000e+01 | Large
0.19/0.28 o 35
0.19/0.28 c 6 0.3s| 10 | 11 | 2719 | 216.3 |1771k| 8 | 40 | 295 | 189 | 295 | 192 | 1 | 2 | 0 | 1.920829e-02 | 3.500000e+01 | Large
0.29/0.34 o 17
0.29/0.34 c 5 0.3s| 17 | 17 | 3674 | 183.4 |1797k| 11 | 27 | 295 | 174 | 295 | 192 | 1 | 7 | 0 | 1.306361e-01 | 1.700000e+01 | Large
0.29/0.35 o 14
0.29/0.35 c s 0.4s| 30 | 16 | 4093 | 117.9 |1825k| 12 | 13 | 295 | 142 | 295 | 192 | 1 | 9 | 0 | 1.306361e-01 | 1.400000e+01 | Large
0.29/0.35 o 12
0.29/0.35 c y 0.4s| 30 | 15 | 4093 | 117.9 |1825k| 12 | 13 | 295 | 142 | 295 | 192 | 1 | 9 | 0 | 1.306361e-01 | 1.200000e+01 |9085.82%
0.29/0.38 o 11
0.29/0.38 c c 0.4s| 49 | 18 | 4405 | 78.6 |1868k| 12 | - | 295 | 154 | 295 | 192 | 1 | 31 | 0 | 3.657407e-01 | 1.100000e+01 |2907.59%
0.39/0.40 o 5
0.39/0.40 c r 0.4s| 71 | 6 | 4713 | 58.5 |1848k| 12 | 3 | 295 | 163 | 295 | 192 | 1 | 42 | 0 | 5.820902e-01 | 5.000000e+00 | 758.97%
0.39/0.40 c Forcing restart, since 57 binary variables among 63 have been fixed.
0.39/0.40 c (run 2, node 71) performing user restart
0.39/0.40 c
0.39/0.40 c (restart) converted 64 cuts from the global cut pool into linear constraints
0.39/0.40 c
0.39/0.40 c presolving:
0.39/0.40 c (round 1) 116 del vars, 86 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 109 impls, 64 clqs
0.39/0.40 c (round 2) 116 del vars, 97 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 43 upgd conss, 109 impls, 64 clqs
0.39/0.41 c (round 3) 116 del vars, 102 del conss, 0 add conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 53 upgd conss, 109 impls, 64 clqs
0.39/0.41 c presolving (4 rounds):
0.39/0.41 c 116 deleted vars, 102 deleted constraints, 0 added constraints, 9 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.41 c 109 implications, 64 cliques
0.39/0.41 c presolved problem has 179 variables (174 bin, 0 int, 5 impl, 0 cont) and 125 constraints
0.39/0.41 c 5 constraints of type <varbound>
0.39/0.41 c 3 constraints of type <knapsack>
0.39/0.41 c 68 constraints of type <setppc>
0.39/0.41 c 5 constraints of type <linear>
0.39/0.41 c 5 constraints of type <indicator>
0.39/0.41 c 27 constraints of type <logicor>
0.39/0.41 c 12 constraints of type <bounddisjunction>
0.39/0.41 c transformed objective value is always integral (scale: 1)
0.39/0.41 c Presolving Time: 0.02
0.39/0.41 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 | 4950 | - |1722k| 0 | 43 | 179 | 125 | 179 | 99 | 0 | 42 | 0 | 5.820902e-01 | 5.000000e+00 | 758.97%
0.39/0.42 c 0.4s| 1 | 0 | 4981 | - |1837k| 0 | 43 | 179 | 125 | 179 | 106 | 7 | 42 | 0 | 5.820902e-01 | 5.000000e+00 | 758.97%
0.39/0.43 c 0.4s| 1 | 2 | 5110 | - |1838k| 0 | 43 | 179 | 126 | 179 | 106 | 7 | 43 | 0 | 5.820902e-01 | 5.000000e+00 | 758.97%
0.39/0.45 o 2
0.39/0.45 c c 0.5s| 27 | 8 | 5732 | 50.1 |1865k| 10 | - | 179 | 139 | 179 | 102 | 7 | 56 | 0 | 5.820902e-01 | 2.000000e+00 | 243.59%
0.39/0.46 c
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time (sec) : 0.46
0.39/0.46 c Solving Nodes : 30 (total of 102 nodes in 3 runs)
0.39/0.46 c Primal Bound : +2.00000000000000e+00 (37 solutions)
0.39/0.46 c Dual Bound : +2.00000000000000e+00
0.39/0.46 c Gap : 0.00 %
0.39/0.46 s OPTIMUM FOUND
0.39/0.46 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
0.39/0.46 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.39/0.46 v -x126 -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.39/0.46 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.39/0.46 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.39/0.46 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.39/0.46 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.39/0.46 v -x4 x3 -x2 -x1
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Total Time : 0.46
0.39/0.46 c solving : 0.46
0.39/0.46 c presolving : 0.02 (included in solving)
0.39/0.46 c reading : 0.00 (included in solving)
0.39/0.46 c copying : 0.01 (2 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.39/0.46 c Original Problem :
0.39/0.46 c Problem name : HOME/instance-3717754-1338198885.wbo
0.39/0.46 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 102 initial, 102 maximal
0.39/0.46 c Objective sense : minimize
0.39/0.46 c Presolved Problem :
0.39/0.46 c Problem name : t_HOME/instance-3717754-1338198885.wbo
0.39/0.46 c Variables : 179 (174 binary, 0 integer, 5 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 125 initial, 142 maximal
0.39/0.46 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.39/0.46 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c trivial : 0.00 0.00 174 0 0 0 0 0 0 0 0
0.39/0.46 c dualfix : 0.00 0.00 1 0 0 0 0 0 0 0 0
0.39/0.46 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c varbound : 0.00 0.00 0 0 0 9 0 14 0 0 0
0.39/0.46 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 1 1
0.39/0.46 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.46 c linear : 0.00 0.00 16 0 0 108 0 111 0 1 1
0.39/0.46 c indicator : 0.00 0.00 1 0 0 0 0 17 0 0 0
0.39/0.46 c logicor : 0.00 0.00 0 0 0 0 0 7 0 0 0
0.39/0.46 c bounddisjunction : 0.00 0.00 0 0 0 0 0 3 0 0 0
0.39/0.46 c root node : - - 228 - - 228 - - - - -
0.39/0.46 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.39/0.46 c integral : 0 0 0 0 70 0 332 0 0 0 0 0 140
0.39/0.46 c varbound : 5 5 2 817 0 0 0 4 0 78 0 0 0
0.39/0.46 c knapsack : 3 3 2 818 0 0 29 3 0 32 0 0 0
0.39/0.46 c setppc : 68 68 2 868 0 0 277 164 0 661 0 0 0
0.39/0.46 c linear : 5 5 6 1084 0 0 116 323 9 465 0 0 0
0.39/0.46 c indicator : 5 5 0 1076 0 0 70 17 0 36 0 0 0
0.39/0.46 c logicor : 27+ 41 2 242 0 0 30 29 2 34 1 0 0
0.39/0.46 c bounddisjunction : 12+ 17 0 97 0 0 0 4 0 8 0 0 0
0.39/0.46 c countsols : 0 0 0 0 0 0 68 0 0 0 0 0 0
0.39/0.46 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.39/0.46 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c varbound : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c knapsack : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c linear : 0.01 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c indicator : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.39/0.46 c rootredcost : 10 0 0 29
0.39/0.46 c pseudoobj : 1112 30 3 107
0.39/0.46 c vbounds : 128 47 0 146
0.39/0.46 c redcost : 104 0 0 580
0.39/0.46 c probing : 0 0 0 0
0.39/0.46 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.39/0.46 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c redcost : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c probing : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.46 c propagation : 0.00 14 14 46 42.0 0 0.0 -
0.39/0.46 c infeasible LP : 0.00 19 17 50 12.7 0 0.0 0
0.39/0.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.46 c applied globally : - - - 55 15.1 - - -
0.39/0.46 c applied locally : - - - 6 60.3 - - -
0.39/0.46 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.39/0.46 c cut pool : 0.00 0 - - 0 - (maximal pool size: 32)
0.39/0.46 c closecuts : 0.00 0.00 0 0 0 0 0
0.39/0.46 c impliedbounds : 0.00 0.00 6 0 0 0 0
0.39/0.46 c intobj : 0.00 0.00 0 0 0 0 0
0.39/0.46 c gomory : 0.02 0.00 6 0 0 2 0
0.39/0.46 c cgmip : 0.00 0.00 0 0 0 0 0
0.39/0.46 c strongcg : 0.02 0.00 6 0 0 30 0
0.39/0.46 c cmir : 0.01 0.00 6 0 0 0 0
0.39/0.46 c flowcover : 0.01 0.00 6 0 0 0 0
0.39/0.46 c clique : 0.00 0.00 3 0 0 4 0
0.39/0.46 c zerohalf : 0.00 0.00 0 0 0 0 0
0.39/0.46 c mcf : 0.00 0.00 3 0 0 0 0
0.39/0.46 c oddcycle : 0.00 0.00 0 0 0 0 0
0.39/0.46 c rapidlearning : 0.03 0.00 1 0 0 0 0
0.39/0.46 c Pricers : ExecTime SetupTime Calls Vars
0.39/0.46 c problem variables: 0.00 - 0 0
0.39/0.46 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.39/0.46 c inference : 0.00 0.00 70 0 0 0 0 140
0.39/0.46 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.39/0.46 c pscost : 0.00 0.00 0 0 0 0 0 0
0.39/0.46 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.39/0.46 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.39/0.46 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.39/0.46 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.39/0.46 c random : 0.00 0.00 0 0 0 0 0 0
0.39/0.46 c Primal Heuristics : ExecTime SetupTime Calls Found
0.39/0.46 c LP solutions : 0.00 - - 0
0.39/0.46 c pseudo solutions : 0.00 - - 0
0.39/0.46 c crossover : 0.00 0.00 0 0
0.39/0.46 c oneopt : 0.00 0.00 9 0
0.39/0.46 c fracdiving : 0.02 0.00 1 0
0.39/0.46 c veclendiving : 0.01 0.00 1 1
0.39/0.46 c linesearchdiving : 0.00 0.00 1 0
0.39/0.46 c guideddiving : 0.00 0.00 1 0
0.39/0.46 c indoneopt : 0.03 0.00 16 6
0.39/0.46 c objpscostdiving : 0.00 0.00 1 0
0.39/0.46 c rootsoldiving : 0.00 0.00 1 1
0.39/0.46 c pscostdiving : 0.04 0.00 3 1
0.39/0.46 c smallcard : 0.00 0.00 0 0
0.39/0.46 c trivial : 0.00 0.00 2 1
0.39/0.46 c shiftandpropagate: 0.00 0.00 0 0
0.39/0.46 c simplerounding : 0.00 0.00 74 1
0.39/0.46 c zirounding : 0.00 0.00 16 0
0.39/0.46 c rounding : 0.00 0.00 74 0
0.39/0.46 c shifting : 0.00 0.00 12 5
0.39/0.46 c intshifting : 0.00 0.00 0 0
0.39/0.46 c twoopt : 0.00 0.00 0 0
0.39/0.46 c indtwoopt : 0.00 0.00 0 0
0.39/0.46 c fixandinfer : 0.00 0.00 0 0
0.39/0.46 c feaspump : 0.00 0.00 0 0
0.39/0.46 c clique : 0.00 0.00 0 0
0.39/0.46 c coefdiving : 0.11 0.00 8 11
0.39/0.46 c indcoefdiving : 0.00 0.00 0 0
0.39/0.46 c indrounding : 0.00 0.00 68 5
0.39/0.46 c nlpdiving : 0.00 0.00 0 0
0.39/0.46 c intdiving : 0.00 0.00 0 0
0.39/0.46 c actconsdiving : 0.00 0.00 0 0
0.39/0.46 c octane : 0.00 0.00 0 0
0.39/0.46 c rens : 0.02 0.00 1 0
0.39/0.46 c rins : 0.00 0.00 0 0
0.39/0.46 c localbranching : 0.00 0.00 0 0
0.39/0.46 c mutation : 0.00 0.00 0 0
0.39/0.46 c dins : 0.00 0.00 0 0
0.39/0.46 c vbounds : 0.00 0.00 0 0
0.39/0.46 c undercover : 0.00 0.00 0 0
0.39/0.46 c subnlp : 0.00 0.00 0 0
0.39/0.46 c trysol : 0.00 0.00 6 5
0.39/0.46 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.39/0.46 c primal LP : 0.00 2 0 0.00 - 0.00 2
0.39/0.46 c dual LP : 0.07 130 2850 30.32 38975.42 0.00 36
0.39/0.46 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.46 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.39/0.46 c diving/probing LP: 0.13 675 2885 4.27 22927.21
0.39/0.46 c strong branching : 0.00 0 0 0.00 -
0.39/0.46 c (at root node) : - 0 0 0.00 -
0.39/0.46 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.46 c B&B Tree :
0.39/0.46 c number of runs : 3
0.39/0.46 c nodes : 30
0.39/0.46 c nodes (total) : 102
0.39/0.46 c nodes left : 0
0.39/0.46 c max depth : 11
0.39/0.46 c max depth (total): 12
0.39/0.46 c backtracks : 9 (30.0%)
0.39/0.46 c delayed cutoffs : 5
0.39/0.46 c repropagations : 25 (82 domain reductions, 2 cutoffs)
0.39/0.46 c avg switch length: 3.40
0.39/0.46 c switching time : 0.00
0.39/0.46 c Solution :
0.39/0.46 c Solutions found : 37 (18 improvements)
0.39/0.46 c First Solution : +5.03300000000000e+03 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.39/0.46 c Primal Bound : +2.00000000000000e+00 (in run 3, after 27 nodes, 0.46 seconds, depth 26, found by <coefdiving>)
0.39/0.46 c Dual Bound : +2.00000000000000e+00
0.39/0.46 c Gap : 0.00 %
0.39/0.46 c Root Dual Bound : +5.82090234360728e-01
0.39/0.46 c Root Iterations : 824
0.39/0.46 c Time complete: 0.45.