0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-2704362-1278553839.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 722 impls, 0 clqs
0.00/0.04 c (round 2) 4 del vars, 38 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 732 impls, 0 clqs
0.00/0.04 c (round 3) 5 del vars, 47 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.04 c (round 4) 9 del vars, 65 del conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.04 c (round 5) 14 del vars, 116 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 776 impls, 0 clqs
0.00/0.04 c (round 6) 16 del vars, 147 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.04 c (round 7) 19 del vars, 170 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.04 c (round 8) 22 del vars, 191 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 830 impls, 0 clqs
0.00/0.04 c (round 9) 22 del vars, 194 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.06 c (round 10) 22 del vars, 211 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.07 c (round 11) 22 del vars, 211 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 844 impls, 0 clqs
0.09/0.10 c (round 12) 72 del vars, 211 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5922 impls, 0 clqs
0.09/0.10 c (round 13) 72 del vars, 471 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.09/0.11 c (round 14) 72 del vars, 481 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.09/0.11 c (round 15) 73 del vars, 481 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.09/0.11 c (round 16) 73 del vars, 489 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.09/0.11 c presolving (17 rounds):
0.09/0.11 c 73 deleted vars, 489 deleted constraints, 26 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.09/0.11 c 6040 implications, 0 cliques
0.09/0.11 c presolved problem has 127 variables (127 bin, 0 int, 0 impl, 0 cont) and 411 constraints
0.09/0.11 c 95 constraints of type <setppc>
0.09/0.11 c 316 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.09
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.3
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1789.98
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c separating/rapidlearning/freq = 0
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.12 c
0.09/0.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 345 | - |1407k| 0 | 108 | 127 | 411 | 127 | 406 | 0 | 0 | 0 | 8.087500e+01 | -- | Inf
0.09/0.18 o 91
0.09/0.18 c F 0.2s| 1 | 0 | 601 | - |1425k| 0 | 0 | 127 | 411 | 127 | 406 | 0 | 0 | 0 | 8.087500e+01 | 9.100000e+01 | 12.52%
0.30/0.33 o 89
0.30/0.33 c y 0.3s| 1 | 0 | 601 | - |2767k| 0 | 108 | 127 | 411 | 127 | 406 | 0 | 0 | 0 | 8.087500e+01 | 8.900000e+01 | 10.05%
0.30/0.35 c 0.3s| 1 | 0 | 739 | - |1994k| 0 | 94 | 127 | 414 | 127 | 380 | 66 | 0 | 0 | 8.441667e+01 | 8.900000e+01 | 5.43%
0.39/0.40 c 0.4s| 1 | 0 | 788 | - |2062k| 0 | 94 | 127 | 414 | 127 | 385 | 71 | 0 | 0 | 8.506250e+01 | 8.900000e+01 | 4.63%
0.39/0.45 c 0.4s| 1 | 0 | 847 | - |2101k| 0 | 93 | 127 | 414 | 127 | 389 | 75 | 0 | 0 | 8.567500e+01 | 8.900000e+01 | 3.88%
0.49/0.51 c 0.5s| 1 | 0 | 908 | - |2177k| 0 | 96 | 127 | 414 | 127 | 393 | 79 | 0 | 0 | 8.600000e+01 | 8.900000e+01 | 3.49%
0.49/0.58 c 0.6s| 1 | 0 | 935 | - |2877k| 0 | 99 | 127 | 414 | 127 | 397 | 83 | 0 | 0 | 8.600000e+01 | 8.900000e+01 | 3.49%
0.60/0.65 c 0.6s| 1 | 0 | 968 | - |3106k| 0 | 93 | 127 | 414 | 127 | 399 | 85 | 0 | 0 | 8.600000e+01 | 8.900000e+01 | 3.49%
0.69/0.74 c 0.7s| 1 | 0 | 1089 | - |3376k| 0 | 92 | 127 | 414 | 127 | 408 | 94 | 0 | 0 | 8.600000e+01 | 8.900000e+01 | 3.49%
0.79/0.82 c 0.8s| 1 | 0 | 1132 | - |3685k| 0 | 100 | 127 | 414 | 127 | 411 | 97 | 0 | 0 | 8.600000e+01 | 8.900000e+01 | 3.49%
0.89/0.91 c 0.9s| 1 | 0 | 1171 | - |3918k| 0 | 100 | 127 | 414 | 127 | 413 | 99 | 0 | 0 | 8.600000e+01 | 8.900000e+01 | 3.49%
1.19/1.28 c 1.3s| 1 | 0 | 1221 | - |3892k| 0 | 80 | 127 | 387 | 127 | 413 | 99 | 0 | 12 | 8.600000e+01 | 8.900000e+01 | 3.49%
1.29/1.34 c 1.3s| 1 | 0 | 1247 | - |3938k| 0 | 80 | 127 | 387 | 127 | 414 | 100 | 0 | 12 | 8.600000e+01 | 8.900000e+01 | 3.49%
1.89/1.90 c 1.9s| 1 | 0 | 1355 | - |3938k| 0 | 74 | 127 | 386 | 127 | 414 | 100 | 0 | 35 | 8.618841e+01 | 8.900000e+01 | 3.26%
1.89/1.95 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.95 c 1.9s| 1 | 0 | 1410 | - |4047k| 0 | 81 | 127 | 386 | 127 | 416 | 102 | 0 | 35 | 8.700000e+01 | 8.900000e+01 | 2.30%
2.10/2.17 c 2.2s| 1 | 0 | 1468 | - |4022k| 0 | 46 | 127 | 351 | 127 | 416 | 102 | 0 | 49 | 8.700000e+01 | 8.900000e+01 | 2.30%
2.20/2.20 c 2.2s| 1 | 0 | 1516 | - |4031k| 0 | 58 | 127 | 351 | 127 | 376 | 104 | 0 | 49 | 8.714286e+01 | 8.900000e+01 | 2.13%
2.20/2.29 c 2.3s| 1 | 0 | 1516 | - |4029k| 0 | - | 127 | 351 | 127 | 376 | 104 | 0 | 62 | 8.714286e+01 | 8.900000e+01 | 2.13%
2.20/2.29 c (run 1, node 1) restarting after 38 global fixings of integer variables
2.20/2.29 c
2.20/2.29 c (restart) converted 43 cuts from the global cut pool into linear constraints
2.20/2.29 c
2.20/2.29 c presolving:
2.29/2.30 c (round 1) 46 del vars, 219 del conss, 3 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 6268 impls, 0 clqs
2.29/2.30 c (round 2) 57 del vars, 251 del conss, 4 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 6288 impls, 0 clqs
2.29/2.30 c (round 3) 60 del vars, 265 del conss, 4 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 6310 impls, 0 clqs
2.29/2.30 c (round 4) 61 del vars, 267 del conss, 4 chg bounds, 0 chg sides, 2 chg coeffs, 23 upgd conss, 6310 impls, 0 clqs
2.29/2.31 c (round 5) 61 del vars, 268 del conss, 4 chg bounds, 1 chg sides, 3 chg coeffs, 23 upgd conss, 6310 impls, 0 clqs
2.29/2.31 c presolving (6 rounds):
2.29/2.31 c 61 deleted vars, 268 deleted constraints, 4 tightened bounds, 0 added holes, 1 changed sides, 3 changed coefficients
2.29/2.31 c 6310 implications, 0 cliques
2.29/2.31 c presolved problem has 66 variables (66 bin, 0 int, 0 impl, 0 cont) and 126 constraints
2.29/2.31 c 12 constraints of type <knapsack>
2.29/2.31 c 36 constraints of type <setppc>
2.29/2.31 c 78 constraints of type <logicor>
2.29/2.31 c transformed objective value is always integral (scale: 1)
2.29/2.31 c Presolving Time: 0.10
2.29/2.31 c
2.29/2.31 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.31 c 2.3s| 1 | 0 | 1620 | - |1242k| 0 | 52 | 66 | 126 | 66 | 122 | 0 | 0 | 62 | 8.712500e+01 | 8.900000e+01 | 2.15%
2.29/2.33 c 2.3s| 1 | 0 | 1647 | - |1317k| 0 | 55 | 66 | 125 | 66 | 125 | 4 | 0 | 62 | 8.800000e+01 | 8.900000e+01 | 1.14%
2.29/2.36 c 2.3s| 1 | 0 | 1665 | - |1308k| 0 | 20 | 66 | 112 | 66 | 125 | 4 | 0 | 75 | 8.800000e+01 | 8.900000e+01 | 1.14%
2.29/2.37 c 2.3s| 1 | 0 | 1669 | - |1309k| 0 | 16 | 66 | 108 | 66 | 125 | 4 | 0 | 88 | 8.800000e+01 | 8.900000e+01 | 1.14%
2.29/2.37 c 2.3s| 1 | 2 | 1669 | - |1312k| 0 | 16 | 66 | 108 | 66 | 125 | 4 | 0 | 88 | 8.800000e+01 | 8.900000e+01 | 1.14%
2.29/2.37 c (run 2, node 1) restarting after 14 global fixings of integer variables
2.29/2.37 c
2.29/2.37 c (restart) converted 3 cuts from the global cut pool into linear constraints
2.29/2.37 c
2.29/2.37 c presolving:
2.29/2.38 c (round 1) 14 del vars, 30 del conss, 1 chg bounds, 57 chg sides, 80 chg coeffs, 3 upgd conss, 6316 impls, 1 clqs
2.29/2.38 c (round 2) 19 del vars, 39 del conss, 1 chg bounds, 85 chg sides, 133 chg coeffs, 3 upgd conss, 6316 impls, 1 clqs
2.29/2.39 c (round 3) 20 del vars, 42 del conss, 1 chg bounds, 85 chg sides, 140 chg coeffs, 3 upgd conss, 6316 impls, 1 clqs
2.29/2.39 c (round 4) 20 del vars, 53 del conss, 1 chg bounds, 85 chg sides, 143 chg coeffs, 3 upgd conss, 6316 impls, 1 clqs
2.29/2.39 c presolving (5 rounds):
2.29/2.39 c 20 deleted vars, 53 deleted constraints, 1 tightened bounds, 0 added holes, 85 changed sides, 143 changed coefficients
2.29/2.39 c 6316 implications, 1 cliques
2.29/2.39 c presolved problem has 46 variables (46 bin, 0 int, 0 impl, 0 cont) and 89 constraints
2.29/2.39 c 9 constraints of type <knapsack>
2.29/2.39 c 33 constraints of type <setppc>
2.29/2.39 c 47 constraints of type <logicor>
2.29/2.39 c transformed objective value is always integral (scale: 1)
2.29/2.39 c Presolving Time: 0.12
2.29/2.39 c
2.29/2.40 o 88
2.29/2.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.40 c * 2.4s| 1 | 0 | 1759 | - |1202k| 0 | - | 46 | 89 | 46 | 88 | 0 | 0 | 88 | 7.000000e+01 | 8.800000e+01 | 25.71%
2.29/2.40 c 2.4s| 1 | 0 | 1759 | - |1202k| 0 | - | 46 | 89 | 46 | 88 | 0 | 0 | 88 | 8.800000e+01 | 8.800000e+01 | 0.00%
2.29/2.40 c
2.29/2.40 c SCIP Status : problem is solved [optimal solution found]
2.29/2.40 c Solving Time (sec) : 2.37
2.29/2.40 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.29/2.40 c Primal Bound : +8.80000000000000e+01 (5 solutions)
2.29/2.40 c Dual Bound : +8.80000000000000e+01
2.29/2.40 c Gap : 0.00 %
2.39/2.40 s OPTIMUM FOUND
2.39/2.40 v -x200 -x199 -x198 x197 x196 -x195 -x194 x193 -x192 x191 -x190 x189 -x188 x187 -x186 x185 x184 -x183 -x182 -x181 -x180 -x179 -x178
2.39/2.40 v x177 -x176 x175 x174 -x173 -x172 x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 -x162 x161 -x160 x159 x158 -x157 x156 -x155
2.39/2.40 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 x146 -x145 -x144 x143 -x142 x141 x140 -x139 x138 -x137 x136 -x135 -x134 x133
2.39/2.40 v -x132 -x131 x130 -x129 -x128 x127 -x126 x125 x124 -x123 -x122 x121 x120 -x119 x118 -x117 -x116 x115 -x114 x113 -x112 x111 -x110
2.39/2.40 v x109 -x108 x107 -x106 x105 -x104 x103 x102 -x101 -x100 x99 x98 -x97 -x96 x95 -x94 -x93 x92 -x91 -x90 x89 x88 -x87 -x86 x85
2.39/2.40 v -x84 x83 -x82 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
2.39/2.40 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 -x30
2.39/2.40 v 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 x4 -x3 x2 -x1
2.39/2.40 c SCIP Status : problem is solved [optimal solution found]
2.39/2.40 c Solving Time : 2.37
2.39/2.40 c Original Problem :
2.39/2.40 c Problem name : HOME/instance-2704362-1278553839.opb
2.39/2.40 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.40 c Constraints : 900 initial, 900 maximal
2.39/2.40 c Presolved Problem :
2.39/2.40 c Problem name : t_HOME/instance-2704362-1278553839.opb
2.39/2.40 c Variables : 46 (46 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.40 c Constraints : 89 initial, 89 maximal
2.39/2.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.40 c trivial : 0.00 55 0 0 0 0 0 0 0
2.39/2.40 c dualfix : 0.00 12 0 0 0 0 0 0 0
2.39/2.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.40 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.40 c probing : 0.03 39 12 0 4 0 0 0 0
2.39/2.40 c knapsack : 0.02 0 0 0 0 0 5 86 144
2.39/2.40 c setppc : 0.01 11 0 0 0 0 100 0 0
2.39/2.40 c linear : 0.03 24 0 0 26 0 242 17 2
2.39/2.40 c logicor : 0.02 1 0 0 1 0 463 0 0
2.39/2.40 c root node : - 52 - - 52 - - - -
2.39/2.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.40 c integral : 0 0 0 7 0 0 18 0 0 2
2.39/2.40 c knapsack : 9 1 8 0 0 0 1 0 0 0
2.39/2.40 c setppc : 33 14 764 0 0 8 12 0 0 0
2.39/2.40 c logicor : 47 14 580 0 0 6 10 1 0 0
2.39/2.40 c countsols : 0 0 0 0 0 0 0 0 0 0
2.39/2.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.40 c integral : 1.23 0.00 0.00 1.23 0.00
2.39/2.40 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.39/2.40 c setppc : 0.01 0.00 0.01 0.00 0.00
2.39/2.40 c logicor : 0.01 0.00 0.01 0.00 0.00
2.39/2.40 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.40 c Propagators : Time Calls Cutoffs DomReds
2.39/2.40 c vbounds : 0.00 4 0 0
2.39/2.40 c rootredcost : 0.00 0 0 0
2.39/2.40 c pseudoobj : 0.00 29 0 0
2.39/2.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.40 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.40 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.40 c applied globally : - - - 0 0.0 - - -
2.39/2.40 c applied locally : - - - 0 0.0 - - -
2.39/2.40 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.40 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.39/2.40 c redcost : 0.00 13 0 1 0 0
2.39/2.40 c impliedbounds : 0.00 13 0 0 132 0
2.39/2.40 c intobj : 0.00 0 0 0 0 0
2.39/2.40 c cgmip : 0.00 0 0 0 0 0
2.39/2.40 c gomory : 0.29 13 0 0 2134 0
2.39/2.40 c strongcg : 0.27 13 0 0 2880 0
2.39/2.40 c cmir : 0.05 11 0 0 0 0
2.39/2.40 c flowcover : 0.06 11 0 0 0 0
2.39/2.40 c clique : 0.00 13 0 0 48 0
2.39/2.40 c zerohalf : 0.00 0 0 0 0 0
2.39/2.40 c mcf : 0.00 2 0 0 0 0
2.39/2.40 c rapidlearning : 0.09 1 0 10 0 25
2.39/2.40 c Pricers : Time Calls Vars
2.39/2.40 c problem variables: 0.00 0 0
2.39/2.40 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.40 c relpscost : 1.23 7 0 18 0 0 2
2.39/2.40 c pscost : 0.00 0 0 0 0 0 0
2.39/2.40 c inference : 0.00 0 0 0 0 0 0
2.39/2.40 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.40 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.40 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.40 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.40 c random : 0.00 0 0 0 0 0 0
2.39/2.40 c Primal Heuristics : Time Calls Found
2.39/2.40 c LP solutions : 0.00 - 0
2.39/2.40 c pseudo solutions : 0.00 - 0
2.39/2.40 c oneopt : 0.00 1 0
2.39/2.40 c trivial : 0.00 2 0
2.39/2.40 c simplerounding : 0.00 0 0
2.39/2.40 c zirounding : 0.00 1 0
2.39/2.40 c rounding : 0.00 20 0
2.39/2.40 c shifting : 0.01 20 2
2.39/2.40 c intshifting : 0.00 0 0
2.39/2.40 c twoopt : 0.00 0 0
2.39/2.40 c fixandinfer : 0.00 0 0
2.39/2.40 c feaspump : 0.04 1 1
2.39/2.40 c coefdiving : 0.00 0 0
2.39/2.40 c pscostdiving : 0.00 0 0
2.39/2.40 c fracdiving : 0.00 0 0
2.39/2.40 c veclendiving : 0.00 0 0
2.39/2.40 c intdiving : 0.00 0 0
2.39/2.40 c actconsdiving : 0.00 0 0
2.39/2.40 c objpscostdiving : 0.00 0 0
2.39/2.40 c rootsoldiving : 0.00 0 0
2.39/2.40 c linesearchdiving : 0.00 0 0
2.39/2.40 c guideddiving : 0.00 0 0
2.39/2.40 c octane : 0.00 0 0
2.39/2.40 c rens : 0.01 0 0
2.39/2.40 c rins : 0.00 0 0
2.39/2.40 c localbranching : 0.00 0 0
2.39/2.40 c mutation : 0.00 0 0
2.39/2.40 c crossover : 0.00 0 0
2.39/2.40 c dins : 0.00 0 0
2.39/2.40 c undercover : 0.00 0 0
2.39/2.40 c nlp : 0.00 0 0
2.39/2.40 c trysol : 0.00 0 0
2.39/2.40 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.40 c primal LP : 0.00 0 0 0.00 -
2.39/2.40 c dual LP : 0.15 22 1503 68.32 9744.49
2.39/2.40 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.40 c barrier LP : 0.00 0 0 0.00 -
2.39/2.40 c diving/probing LP: 0.04 7 256 36.57 6735.78
2.39/2.40 c strong branching : 1.22 88 8725 99.15 7127.05
2.39/2.40 c (at root node) : - 88 8725 99.15 -
2.39/2.40 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.40 c B&B Tree :
2.39/2.40 c number of runs : 3
2.39/2.40 c nodes : 1
2.39/2.40 c nodes (total) : 3
2.39/2.40 c nodes left : 0
2.39/2.40 c max depth : 0
2.39/2.40 c max depth (total): 0
2.39/2.40 c backtracks : 0 (0.0%)
2.39/2.40 c delayed cutoffs : 0
2.39/2.40 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.39/2.40 c avg switch length: 2.00
2.39/2.40 c switching time : 0.00
2.39/2.40 c Solution :
2.39/2.40 c Solutions found : 5 (3 improvements)
2.39/2.40 c First Solution : +9.10000000000000e+01 (in run 1, after 1 nodes, 0.16 seconds, depth 0, found by <feaspump>)
2.39/2.40 c Primal Bound : +8.80000000000000e+01 (in run 3, after 1 nodes, 2.37 seconds, depth 0, found by <relaxation>)
2.39/2.40 c Dual Bound : +8.80000000000000e+01
2.39/2.40 c Gap : 0.00 %
2.39/2.40 c Root Dual Bound : +8.80000000000000e+01
2.39/2.40 c Root Iterations : 1759
2.39/2.41 c Time complete: 2.4.