0.02/0.05 c SCIP version 1.1.0.7
0.02/0.05 c LP-Solver Clp 1.8.2
0.02/0.05 c user parameter file <scip.set> not found - using default parameters
0.02/0.05 c read problem <HOME/instance-1868333-1245121414.opb>
0.02/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.06 c No objective function, only one solution is needed.
0.02/0.06 c start presolving problem
0.02/0.06 c presolving:
0.09/0.10 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.11 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.12 c presolving (3 rounds):
0.09/0.12 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 242 implications, 22 cliques
0.09/0.12 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.12 c 1 constraints of type <knapsack>
0.09/0.12 c 22 constraints of type <setppc>
0.09/0.12 c 2541 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.06
0.09/0.12 c SATUNSAT-LIN
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/intshifting/freq = c -1
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/guideddiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/fracdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 1620
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 c
0.09/0.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 54 |3513k| 0 | 34 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.30 c 0.2s| 1 | 0 | 95 |3837k| 0 | 47 | 231 |2564 |2564 | 231 |2572 | 8 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.68 c 0.6s| 1 | 0 | 115 |4007k| 0 | 51 | 231 |2564 |2564 | 231 |2575 | 11 | 0 | 0 | 1.100000e+01 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 342 |4039k| 0 | 51 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
1.19/1.21 c 1.1s| 1 | 0 | 619 |4125k| 0 | 31 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
1.29/1.33 c 1.2s| 1 | 0 | 718 |4177k| 0 | 37 | 231 |2564 |2564 | 231 |2592 | 28 | 0 | 0 | 1.100000e+01 | -- | Inf
2.10/2.11 c 2.0s| 1 | 2 | 718 |4178k| 0 | 37 | 231 |2564 |2564 | 231 |2592 | 28 | 0 | 21 | 1.100000e+01 | -- | Inf
127.45/127.58 c 127s| 10000 | 1549 |329173 |7993k| 51 | 26 | 231 |2831 |1818 | 231 |2568 | 28 | 887 |2542 | 1.500000e+01 | -- | Inf
134.26/134.39 c * 133s| 10776 | 1647 |352359 |8221k| 51 | - | 231 |2797 | 507 | 231 |2568 | 28 | 928 |2542 | 1.500000e+01 | 2.200000e+01 | 46.67%
134.26/134.39 c
134.26/134.39 c SCIP Status : solving was interrupted [solution limit reached]
134.26/134.39 c Solving Time (sec) : 133.39
134.26/134.39 c Solving Nodes : 10776
134.26/134.39 c Primal Bound : +2.20000000000000e+01 (1 solutions)
134.26/134.39 c Dual Bound : +1.50000000000000e+01
134.26/134.39 c Gap : 46.67 %
134.26/134.40 c NODE 10776
134.26/134.40 c DUAL BOUND 15
134.26/134.40 c PRIMAL BOUND 22
134.26/134.40 c GAP 0.466667
134.26/134.40 s SATISFIABLE
134.26/134.40 v -x221 -x211 -x201 -x191 -x181 x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220
134.26/134.40 v x199 -x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
134.26/134.40 v -x198 -x177 -x167 -x157 -x147 x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 x126 -x226 -x216 -x206 -x196
134.26/134.40 v -x186 -x176 x155 -x145 -x135 -x125 -x225 x215 -x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 x224 -x214 -x204 -x194 -x184 -x174
134.26/134.40 v -x164 -x154 -x133 -x123 -x223 -x213 x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 -x162
134.26/134.40 v -x152 x142 -x132 x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 x104
134.26/134.40 v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80
134.26/134.40 v -x79 -x78 -x77 -x76 -x75 -x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x56 -x55 -x54
134.26/134.40 v 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
134.26/134.40 v x28 -x27 -x26 -x25 -x24 -x23 -x22 -x11 -x21 -x10 -x20 -x9 -x19 -x8 -x18 -x7 -x17 -x6 -x16 -x5 -x15 -x4 -x14 x3 -x13 -x2 x12
134.26/134.40 v -x1
134.26/134.40 c SCIP Status : solving was interrupted [solution limit reached]
134.26/134.40 c Solving Time : 133.39
134.26/134.40 c Original Problem :
134.26/134.40 c Problem name : HOME/instance-1868333-1245121414.opb
134.26/134.40 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
134.26/134.40 c Constraints : 2707 initial, 2707 maximal
134.26/134.40 c Presolved Problem :
134.26/134.40 c Problem name : t_HOME/instance-1868333-1245121414.opb
134.26/134.40 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
134.26/134.40 c Constraints : 2564 initial, 2911 maximal
134.26/134.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
134.26/134.40 c trivial : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c implics : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c probing : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c knapsack : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c setppc : 0.00 0 0 0 0 0 0 0 0
134.26/134.40 c linear : 0.03 0 0 0 0 0 143 0 0
134.26/134.40 c logicor : 0.02 0 0 0 0 0 0 0 0
134.26/134.40 c root node : - 0 - - 0 - - - -
134.26/134.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
134.26/134.40 c integral : 0 0 0 6697 0 72 764 0 0 12448
134.26/134.40 c knapsack : 1 5 22260 0 0 81 18237 0 0 0
134.26/134.40 c setppc : 22 5 22203 0 0 213 66119 0 0 0
134.26/134.40 c logicor : 2541+ 5 20351 1 0 76 71887 0 0 0
134.26/134.40 c countsols : 0 0 0 1 0 0 0 0 0 0
134.26/134.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
134.26/134.40 c integral : 33.79 0.00 0.00 33.79 0.00
134.26/134.40 c knapsack : 0.05 0.00 0.05 0.00 0.00
134.26/134.40 c setppc : 0.35 0.00 0.35 0.00 0.00
134.26/134.40 c logicor : 1.44 0.00 1.44 0.00 0.00
134.26/134.40 c countsols : 0.00 0.00 0.00 0.00 0.00
134.26/134.40 c Propagators : Time Calls Cutoffs DomReds
134.26/134.40 c rootredcost : 0.01 0 0 0
134.26/134.40 c pseudoobj : 0.25 22288 0 0
134.26/134.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
134.26/134.40 c propagation : 0.04 370 370 2122 18.6 6 12.0 -
134.26/134.40 c infeasible LP : 0.21 4135 0 0 0.0 0 0.0 0
134.26/134.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
134.26/134.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
134.26/134.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
134.26/134.40 c applied globally : - - - 928 16.6 - - -
134.26/134.40 c applied locally : - - - 0 0.0 - - -
134.26/134.40 c Separators : Time Calls Cutoffs DomReds Cuts Conss
134.26/134.40 c cut pool : 0.00 4 - - 15 - (maximal pool size: 286)
134.26/134.40 c redcost : 0.09 6321 0 0 0 0
134.26/134.40 c impliedbounds : 0.00 5 0 0 0 0
134.26/134.40 c intobj : 0.00 0 0 0 0 0
134.26/134.40 c gomory : 0.51 5 0 0 2000 0
134.26/134.40 c strongcg : 0.43 5 0 0 2310 0
134.26/134.40 c cmir : 0.00 0 0 0 0 0
134.26/134.40 c flowcover : 0.00 0 0 0 0 0
134.26/134.40 c clique : 0.00 5 0 0 0 0
134.26/134.40 c zerohalf : 0.00 0 0 0 0 0
134.26/134.40 c mcf : 0.00 1 0 0 0 0
134.26/134.40 c Pricers : Time Calls Vars
134.26/134.40 c problem variables: 0.00 0 0
134.26/134.40 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
134.26/134.40 c relpscost : 33.78 6696 72 764 0 0 12448
134.26/134.40 c pscost : 0.00 0 0 0 0 0 0
134.26/134.40 c inference : 0.00 0 0 0 0 0 0
134.26/134.40 c mostinf : 0.00 0 0 0 0 0 0
134.26/134.40 c leastinf : 0.00 0 0 0 0 0 0
134.26/134.40 c fullstrong : 0.00 0 0 0 0 0 0
134.26/134.40 c allfullstrong : 0.00 0 0 0 0 0 0
134.26/134.40 c random : 0.00 0 0 0 0 0 0
134.26/134.40 c Primal Heuristics : Time Calls Found
134.26/134.40 c LP solutions : 0.00 - 1
134.26/134.40 c pseudo solutions : 0.00 - 0
134.26/134.40 c simplerounding : 0.00 0 0
134.26/134.40 c rounding : 0.00 0 0
134.26/134.40 c shifting : 0.00 0 0
134.26/134.40 c intshifting : 0.00 0 0
134.26/134.40 c oneopt : 0.00 0 0
134.26/134.40 c fixandinfer : 0.00 0 0
134.26/134.40 c feaspump : 0.00 0 0
134.26/134.40 c coefdiving : 0.00 0 0
134.26/134.40 c pscostdiving : 0.00 0 0
134.26/134.40 c fracdiving : 0.00 0 0
134.26/134.40 c veclendiving : 0.00 0 0
134.26/134.40 c intdiving : 0.00 0 0
134.26/134.40 c actconsdiving : 0.00 0 0
134.26/134.40 c objpscostdiving : 0.00 0 0
134.26/134.40 c rootsoldiving : 0.00 0 0
134.26/134.40 c linesearchdiving : 0.00 0 0
134.26/134.40 c guideddiving : 0.00 0 0
134.26/134.40 c octane : 0.00 0 0
134.26/134.40 c rens : 0.00 0 0
134.26/134.40 c rins : 0.00 0 0
134.26/134.40 c localbranching : 0.00 0 0
134.26/134.40 c mutation : 0.00 0 0
134.26/134.40 c crossover : 0.00 0 0
134.26/134.40 c dins : 0.00 0 0
134.26/134.40 c LP : Time Calls Iterations Iter/call Iter/sec
134.26/134.40 c primal LP : 0.01 0 0 0.00 0.00
134.26/134.40 c dual LP : 90.68 10822 352359 32.56 3885.74
134.26/134.40 c barrier LP : 0.00 0 0 0.00 -
134.26/134.40 c diving/probing LP: 0.00 0 0 0.00 -
134.26/134.40 c strong branching : 33.47 2542 135219 53.19 4040.01
134.26/134.40 c (at root node) : - 21 3032 144.38 -
134.26/134.40 c conflict analysis: 0.00 0 0 0.00 -
134.26/134.40 c B&B Tree :
134.26/134.40 c number of runs : 1
134.26/134.40 c nodes : 10776
134.26/134.40 c nodes (total) : 10776
134.26/134.40 c nodes left : 1647
134.26/134.40 c max depth : 51
134.26/134.40 c max depth (total): 51
134.26/134.40 c backtracks : 908 (8.4%)
134.26/134.40 c delayed cutoffs : 26
134.26/134.40 c repropagations : 567 (1936 domain reductions, 26 cutoffs)
134.26/134.40 c avg switch length: 3.26
134.26/134.40 c switching time : 1.41
134.26/134.40 c Solution :
134.26/134.40 c Solutions found : 1 (1 improvements)
134.26/134.40 c Primal Bound : +2.20000000000000e+01 (in run 1, after 10776 nodes, 133.39 seconds, depth 36, found by <relaxation>)
134.26/134.40 c Dual Bound : +1.50000000000000e+01
134.26/134.40 c Gap : 46.67 %
134.26/134.40 c Root Dual Bound : +1.10000000000000e+01
134.36/134.42 c Time complete: 134.37.