0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3732734-1338705131.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 950 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 836 impls, 0 clqs
0.00/0.02 c (round 2) 8 del vars, 72 del conss, 0 add conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 860 impls, 0 clqs
0.00/0.02 c (round 3) 13 del vars, 98 del conss, 0 add conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 886 impls, 0 clqs
0.00/0.02 c (round 4) 22 del vars, 169 del conss, 0 add conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 892 impls, 0 clqs
0.00/0.02 c (round 5) 25 del vars, 212 del conss, 0 add conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1020 impls, 0 clqs
0.00/0.03 c (round 6) 25 del vars, 232 del conss, 0 add conss, 22 chg bounds, 19 chg sides, 0 chg coeffs, 0 upgd conss, 1032 impls, 0 clqs
0.00/0.03 c (round 7) 25 del vars, 232 del conss, 0 add conss, 22 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 1032 impls, 0 clqs
0.00/0.04 c (round 8) 49 del vars, 232 del conss, 0 add conss, 23 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 2259 impls, 0 clqs
0.00/0.04 c (round 9) 49 del vars, 437 del conss, 0 add conss, 23 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 2259 impls, 0 clqs
0.00/0.05 c (round 10) 49 del vars, 440 del conss, 0 add conss, 23 chg bounds, 19 chg sides, 0 chg coeffs, 718 upgd conss, 2259 impls, 0 clqs
0.00/0.05 c presolving (11 rounds):
0.00/0.05 c 49 deleted vars, 440 deleted constraints, 0 added constraints, 23 tightened bounds, 0 added holes, 19 changed sides, 0 changed coefficients
0.00/0.05 c 2259 implications, 0 cliques
0.00/0.05 c presolved problem has 151 variables (151 bin, 0 int, 0 impl, 0 cont) and 510 constraints
0.00/0.05 c 123 constraints of type <setppc>
0.00/0.05 c 387 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.5
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1797
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.08 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.08 c 0.1s| 1 | 0 | 701 | - |1589k| 0 | 137 | 151 | 528 | 151 | 510 | 0 | 18 | 0 | 8.023819e+01 | -- | Inf
0.08/0.13 o 98
0.08/0.13 c F 0.1s| 1 | 0 | 1939 | - |1608k| 0 | 0 | 151 | 528 | 151 | 510 | 0 | 18 | 0 | 8.023819e+01 | 9.800000e+01 | 22.14%
0.19/0.21 o 95
0.19/0.21 c y 0.2s| 1 | 0 | 1939 | - |4062k| 0 | 137 | 151 | 528 | 151 | 510 | 0 | 18 | 0 | 8.023819e+01 | 9.500000e+01 | 18.40%
0.19/0.23 c 0.2s| 1 | 0 | 2170 | - |3358k| 0 | 132 | 151 | 544 | 151 | 479 | 6 | 18 | 0 | 8.220266e+01 | 9.500000e+01 | 15.57%
0.19/0.27 c 0.3s| 1 | 0 | 2262 | - |4299k| 0 | 129 | 151 | 544 | 151 | 486 | 13 | 18 | 0 | 8.254317e+01 | 9.500000e+01 | 15.09%
0.29/0.32 c 0.3s| 1 | 0 | 2360 | - |4716k| 0 | 138 | 151 | 544 | 151 | 518 | 45 | 18 | 0 | 8.273734e+01 | 9.500000e+01 | 14.82%
0.29/0.36 c 0.4s| 1 | 0 | 2413 | - |5029k| 0 | 138 | 151 | 544 | 151 | 522 | 49 | 18 | 0 | 8.278867e+01 | 9.500000e+01 | 14.75%
0.38/0.41 c 0.4s| 1 | 0 | 2453 | - |5430k| 0 | 132 | 151 | 544 | 151 | 523 | 50 | 18 | 0 | 8.285162e+01 | 9.500000e+01 | 14.66%
0.38/0.45 c 0.5s| 1 | 0 | 2504 | - |5573k| 0 | 131 | 151 | 544 | 151 | 524 | 51 | 18 | 0 | 8.297068e+01 | 9.500000e+01 | 14.50%
0.48/0.51 c 0.5s| 1 | 0 | 2625 | - |6146k| 0 | 136 | 151 | 544 | 151 | 525 | 52 | 18 | 0 | 8.303095e+01 | 9.500000e+01 | 14.42%
0.48/0.56 c 0.6s| 1 | 0 | 2700 | - |7482k| 0 | 137 | 151 | 544 | 151 | 528 | 55 | 18 | 0 | 8.308013e+01 | 9.500000e+01 | 14.35%
0.58/0.62 c 0.6s| 1 | 0 | 2743 | - |8654k| 0 | 130 | 151 | 544 | 151 | 529 | 56 | 18 | 0 | 8.309823e+01 | 9.500000e+01 | 14.32%
0.58/0.69 c 0.7s| 1 | 0 | 2834 | - |9917k| 0 | 130 | 151 | 544 | 151 | 530 | 57 | 18 | 0 | 8.313457e+01 | 9.500000e+01 | 14.27%
0.69/0.74 c 0.7s| 1 | 0 | 2882 | - | 11M| 0 | 129 | 151 | 544 | 151 | 533 | 60 | 18 | 0 | 8.314623e+01 | 9.500000e+01 | 14.26%
0.69/0.78 c 0.8s| 1 | 0 | 2925 | - | 11M| 0 | 130 | 151 | 544 | 151 | 534 | 61 | 18 | 0 | 8.314685e+01 | 9.500000e+01 | 14.26%
0.79/0.83 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.83 c 0.8s| 1 | 0 | 2969 | - | 12M| 0 | 130 | 151 | 544 | 151 | 504 | 62 | 18 | 0 | 8.314987e+01 | 9.500000e+01 | 14.25%
0.79/0.87 c 0.9s| 1 | 0 | 3034 | - | 12M| 0 | 132 | 151 | 544 | 151 | 505 | 63 | 18 | 0 | 8.316189e+01 | 9.500000e+01 | 14.24%
0.89/0.91 c 0.9s| 1 | 0 | 3078 | - | 12M| 0 | 134 | 151 | 544 | 151 | 508 | 66 | 18 | 0 | 8.317587e+01 | 9.500000e+01 | 14.22%
0.89/0.95 c 0.9s| 1 | 0 | 3106 | - | 12M| 0 | 136 | 151 | 544 | 151 | 509 | 67 | 18 | 0 | 8.318965e+01 | 9.500000e+01 | 14.20%
0.89/0.99 c 1.0s| 1 | 0 | 3141 | - | 13M| 0 | 136 | 151 | 544 | 151 | 510 | 68 | 18 | 0 | 8.319468e+01 | 9.500000e+01 | 14.19%
0.99/1.02 c 1.0s| 1 | 0 | 3168 | - | 13M| 0 | 135 | 151 | 544 | 151 | 511 | 69 | 18 | 0 | 8.319517e+01 | 9.500000e+01 | 14.19%
0.99/1.06 c 1.1s| 1 | 0 | 3192 | - | 13M| 0 | 130 | 151 | 544 | 151 | 506 | 70 | 18 | 0 | 8.319567e+01 | 9.500000e+01 | 14.19%
0.99/1.10 c 1.1s| 1 | 0 | 3271 | - | 13M| 0 | 137 | 151 | 544 | 151 | 507 | 71 | 18 | 0 | 8.320390e+01 | 9.500000e+01 | 14.18%
1.09/1.12 c 1.1s| 1 | 0 | 3285 | - | 13M| 0 | 137 | 151 | 544 | 151 | 508 | 72 | 18 | 0 | 8.320447e+01 | 9.500000e+01 | 14.18%
1.49/1.53 c 1.5s| 1 | 0 | 3315 | - | 13M| 0 | 133 | 151 | 539 | 151 | 508 | 72 | 18 | 15 | 8.320789e+01 | 9.500000e+01 | 14.17%
1.79/1.82 c 1.8s| 1 | 0 | 3457 | - | 13M| 0 | 120 | 151 | 524 | 151 | 508 | 72 | 18 | 28 | 8.372185e+01 | 9.500000e+01 | 13.47%
1.79/1.86 c 1.9s| 1 | 0 | 3591 | - | 13M| 0 | 123 | 151 | 524 | 151 | 509 | 73 | 18 | 28 | 8.434230e+01 | 9.500000e+01 | 12.64%
2.09/2.18 c 2.2s| 1 | 0 | 3775 | - | 13M| 0 | 109 | 151 | 503 | 151 | 504 | 73 | 18 | 50 | 8.604342e+01 | 9.500000e+01 | 10.41%
2.19/2.20 c 2.2s| 1 | 0 | 3819 | - | 13M| 0 | 113 | 151 | 503 | 151 | 505 | 74 | 18 | 50 | 8.647141e+01 | 9.500000e+01 | 9.86%
2.19/2.29 c 2.3s| 1 | 0 | 3819 | - | 13M| 0 | - | 151 | 503 | 151 | 505 | 74 | 18 | 60 | 8.647141e+01 | 9.500000e+01 | 9.86%
2.19/2.29 c (run 1, node 1) restarting after 32 global fixings of integer variables
2.19/2.29 c
2.19/2.29 c (restart) converted 29 cuts from the global cut pool into linear constraints
2.19/2.29 c
2.19/2.29 c presolving:
2.19/2.29 c (round 1) 45 del vars, 180 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2913 impls, 0 clqs
2.29/2.30 c (round 2) 50 del vars, 209 del conss, 0 add conss, 1 chg bounds, 2 chg sides, 3 chg coeffs, 0 upgd conss, 3054 impls, 0 clqs
2.29/2.30 c (round 3) 51 del vars, 223 del conss, 0 add conss, 1 chg bounds, 2 chg sides, 3 chg coeffs, 0 upgd conss, 3054 impls, 0 clqs
2.29/2.30 c (round 4) 51 del vars, 243 del conss, 0 add conss, 1 chg bounds, 5 chg sides, 3 chg coeffs, 0 upgd conss, 3054 impls, 0 clqs
2.29/2.30 c (round 5) 51 del vars, 245 del conss, 0 add conss, 1 chg bounds, 5 chg sides, 3 chg coeffs, 34 upgd conss, 3054 impls, 0 clqs
2.29/2.31 c (round 6) 51 del vars, 256 del conss, 18 add conss, 1 chg bounds, 31 chg sides, 65 chg coeffs, 34 upgd conss, 3054 impls, 2 clqs
2.29/2.31 c (round 7) 51 del vars, 256 del conss, 18 add conss, 1 chg bounds, 31 chg sides, 72 chg coeffs, 34 upgd conss, 3054 impls, 2 clqs
2.29/2.31 c (round 8) 51 del vars, 256 del conss, 19 add conss, 1 chg bounds, 32 chg sides, 77 chg coeffs, 34 upgd conss, 3054 impls, 2 clqs
2.29/2.31 c (round 9) 51 del vars, 256 del conss, 19 add conss, 1 chg bounds, 32 chg sides, 78 chg coeffs, 34 upgd conss, 3054 impls, 2 clqs
2.29/2.32 c presolving (10 rounds):
2.29/2.32 c 51 deleted vars, 256 deleted constraints, 19 added constraints, 1 tightened bounds, 0 added holes, 32 changed sides, 78 changed coefficients
2.29/2.32 c 3054 implications, 2 cliques
2.29/2.32 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 295 constraints
2.29/2.32 c 17 constraints of type <knapsack>
2.29/2.32 c 87 constraints of type <setppc>
2.29/2.32 c 191 constraints of type <logicor>
2.29/2.32 c transformed objective value is always integral (scale: 1)
2.29/2.32 c Presolving Time: 0.06
2.29/2.32 c
2.29/2.33 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.33 c 2.3s| 1 | 0 | 4113 | - |1591k| 0 | 84 | 100 | 295 | 100 | 280 | 0 | 18 | 60 | 8.887500e+01 | 9.500000e+01 | 6.89%
2.29/2.35 c 2.3s| 1 | 0 | 4169 | - |1636k| 0 | 82 | 100 | 295 | 100 | 293 | 13 | 18 | 60 | 9.042857e+01 | 9.500000e+01 | 5.06%
2.29/2.37 c 2.4s| 1 | 0 | 4258 | - |1602k| 0 | 54 | 100 | 225 | 100 | 293 | 13 | 18 | 67 | 9.333333e+01 | 9.500000e+01 | 1.79%
2.29/2.38 c 2.4s| 1 | 0 | 4258 | - |1602k| 0 | 54 | 100 | 225 | 100 | 293 | 13 | 18 | 71 | 9.500000e+01 | 9.500000e+01 | 0.00%
2.29/2.38 c
2.29/2.38 c SCIP Status : problem is solved [optimal solution found]
2.29/2.38 c Solving Time (sec) : 2.37
2.29/2.38 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
2.29/2.38 c Primal Bound : +9.50000000000000e+01 (2 solutions)
2.29/2.38 c Dual Bound : +9.50000000000000e+01
2.29/2.38 c Gap : 0.00 %
2.29/2.38 s OPTIMUM FOUND
2.29/2.38 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.29/2.38 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.29/2.38 v -x154 x153 x152 -x151 -x150 x149 -x148 x147 -x146 -x145 x144 -x143 -x142 x141 -x140 x139 x138 -x137 -x136 x135 -x134 x133
2.29/2.38 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.29/2.38 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 -x84
2.29/2.38 v 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.29/2.38 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 -x29
2.29/2.38 v 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.29/2.38 c SCIP Status : problem is solved [optimal solution found]
2.29/2.38 c Total Time : 2.37
2.29/2.38 c solving : 2.37
2.29/2.38 c presolving : 0.06 (included in solving)
2.29/2.38 c reading : 0.01 (included in solving)
2.29/2.38 c Original Problem :
2.29/2.38 c Problem name : HOME/instance-3732734-1338705131.opb
2.29/2.38 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.38 c Constraints : 950 initial, 950 maximal
2.29/2.38 c Presolved Problem :
2.29/2.38 c Problem name : t_HOME/instance-3732734-1338705131.opb
2.29/2.38 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.38 c Constraints : 295 initial, 295 maximal
2.29/2.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.29/2.38 c trivial : 0.00 38 0 0 0 0 0 0 0 0
2.29/2.38 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.38 c implics : 0.00 0 9 0 0 0 0 0 0 0
2.29/2.38 c probing : 0.01 24 0 0 1 0 0 0 0 0
2.29/2.38 c knapsack : 0.01 0 0 0 0 0 0 19 27 75
2.29/2.38 c setppc : 0.00 9 0 0 0 0 69 0 0 0
2.29/2.38 c linear : 0.01 19 0 0 23 0 248 0 24 3
2.29/2.38 c logicor : 0.01 1 0 0 0 0 379 0 0 0
2.29/2.38 c root node : - 64 - - 64 - - - - -
2.29/2.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.29/2.38 c integral : 0 0 0 6 0 9 0 1 17 0 0 0
2.29/2.38 c knapsack : 17 1 9 0 0 0 0 0 8 0 0 0
2.29/2.38 c setppc : 87 27 572 0 0 5 157 7 20 1 0 0
2.29/2.38 c logicor : 191 27 452 0 0 2 56 12 12 0 0 0
2.29/2.38 c countsols : 0 0 0 0 0 4 0 0 0 0 0 0
2.29/2.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.29/2.38 c integral : 1.05 0.00 0.00 1.05 0.00 0.00 0.00
2.29/2.38 c knapsack : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.38 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.29/2.38 c vbounds : 0 0 0 0
2.29/2.38 c rootredcost : 0 0 0 0
2.29/2.38 c pseudoobj : 113 0 0 0
2.29/2.38 c Propagator Timings : TotalTime Propagate Resprop
2.29/2.38 c vbounds : 0.00 0.00 0.00
2.29/2.38 c rootredcost : 0.00 0.00 0.00
2.29/2.38 c pseudoobj : 0.00 0.00 0.00
2.29/2.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.38 c propagation : 0.00 15 15 19 6.7 0 0.0 -
2.29/2.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.38 c applied globally : - - - 18 6.7 - - -
2.29/2.38 c applied locally : - - - 0 0.0 - - -
2.29/2.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.29/2.38 c cut pool : 0.00 0 - - 0 - (maximal pool size: 48)
2.29/2.38 c redcost : 0.00 26 0 0 0 0
2.29/2.38 c impliedbounds : 0.00 26 0 0 113 0
2.29/2.38 c intobj : 0.00 0 0 0 0 0
2.29/2.38 c gomory : 0.47 26 0 0 2033 0
2.29/2.38 c cgmip : 0.00 0 0 0 0 0
2.29/2.38 c closecuts : 0.00 0 0 0 0 0
2.29/2.38 c strongcg : 0.36 21 0 0 4746 0
2.29/2.38 c cmir : 0.02 11 0 0 1 0
2.29/2.38 c flowcover : 0.05 11 0 0 2 0
2.29/2.38 c clique : 0.00 26 0 0 33 0
2.29/2.38 c zerohalf : 0.00 0 0 0 0 0
2.29/2.38 c mcf : 0.00 2 0 0 0 0
2.29/2.38 c oddcycle : 0.00 0 0 0 0 0
2.29/2.38 c rapidlearning : 0.03 1 0 6 0 30
2.29/2.38 c Pricers : Time Calls Vars
2.29/2.38 c problem variables: 0.00 0 0
2.29/2.38 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.29/2.38 c relpscost : 1.05 6 1 17 0 0 0
2.29/2.38 c pscost : 0.00 0 0 0 0 0 0
2.29/2.38 c inference : 0.00 0 0 0 0 0 0
2.29/2.38 c mostinf : 0.00 0 0 0 0 0 0
2.29/2.38 c leastinf : 0.00 0 0 0 0 0 0
2.29/2.38 c fullstrong : 0.00 0 0 0 0 0 0
2.29/2.38 c allfullstrong : 0.00 0 0 0 0 0 0
2.29/2.38 c random : 0.00 0 0 0 0 0 0
2.29/2.38 c Primal Heuristics : Time Calls Found
2.29/2.38 c LP solutions : 0.00 - 0
2.29/2.38 c pseudo solutions : 0.00 - 0
2.29/2.38 c oneopt : 0.00 1 0
2.29/2.38 c trivial : 0.00 2 0
2.29/2.38 c shiftandpropagate: 0.00 1 0
2.29/2.38 c simplerounding : 0.00 0 0
2.29/2.38 c zirounding : 0.00 1 0
2.29/2.38 c rounding : 0.00 30 0
2.29/2.38 c shifting : 0.01 30 0
2.29/2.38 c intshifting : 0.00 0 0
2.29/2.38 c twoopt : 0.00 0 0
2.29/2.38 c fixandinfer : 0.00 0 0
2.29/2.38 c feaspump : 0.05 1 1
2.29/2.38 c clique : 0.00 0 0
2.29/2.38 c coefdiving : 0.00 0 0
2.29/2.38 c pscostdiving : 0.00 0 0
2.29/2.38 c fracdiving : 0.00 0 0
2.29/2.38 c veclendiving : 0.00 0 0
2.29/2.38 c intdiving : 0.00 0 0
2.29/2.38 c actconsdiving : 0.00 0 0
2.29/2.38 c objpscostdiving : 0.00 0 0
2.29/2.38 c rootsoldiving : 0.00 0 0
2.29/2.38 c linesearchdiving : 0.00 0 0
2.29/2.38 c guideddiving : 0.00 0 0
2.29/2.38 c octane : 0.00 0 0
2.29/2.38 c rens : 0.01 0 0
2.29/2.38 c rins : 0.00 0 0
2.29/2.38 c localbranching : 0.00 0 0
2.29/2.38 c mutation : 0.00 0 0
2.29/2.38 c crossover : 0.00 0 0
2.29/2.38 c dins : 0.00 0 0
2.29/2.38 c vbounds : 0.00 0 0
2.29/2.38 c undercover : 0.00 0 0
2.29/2.38 c subnlp : 0.00 0 0
2.29/2.38 c trysol : 0.00 0 0
2.29/2.38 c LP : Time Calls Iterations Iter/call Iter/sec
2.29/2.38 c primal LP : 0.00 0 0 0.00 -
2.29/2.38 c dual LP : 0.15 31 3020 97.42 20142.73
2.29/2.38 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.38 c barrier LP : 0.00 0 0 0.00 -
2.29/2.38 c diving/probing LP: 0.05 15 1238 82.53 23289.50
2.29/2.38 c strong branching : 1.05 71 18862 265.66 17893.21
2.29/2.38 c (at root node) : - 71 18862 265.66 -
2.29/2.38 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.38 c B&B Tree :
2.29/2.38 c number of runs : 2
2.29/2.38 c nodes : 1
2.29/2.38 c nodes (total) : 2
2.29/2.38 c nodes left : 0
2.29/2.38 c max depth : 0
2.29/2.38 c max depth (total): 0
2.29/2.38 c backtracks : 0 (0.0%)
2.29/2.38 c delayed cutoffs : 0
2.29/2.38 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.29/2.38 c avg switch length: 2.00
2.29/2.38 c switching time : 0.00
2.29/2.38 c Solution :
2.29/2.38 c Solutions found : 2 (2 improvements)
2.29/2.38 c First Solution : +9.80000000000000e+01 (in run 1, after 1 nodes, 0.13 seconds, depth 0, found by <feaspump>)
2.29/2.38 c Primal Bound : +9.50000000000000e+01 (in run 1, after 1 nodes, 0.21 seconds, depth 0, found by <trysol>)
2.29/2.38 c Dual Bound : +9.50000000000000e+01
2.29/2.38 c Gap : 0.00 %
2.29/2.38 c Root Dual Bound : +9.50000000000000e+01
2.29/2.38 c Root Iterations : 4258
2.29/2.38 c Time complete: 2.38.