0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver Clp 1.8.2
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870699-1245215924.opb>
0.00/0.04 c original problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 constraints
0.00/0.07 c No objective function, only one solution is needed.
0.00/0.07 c start presolving problem
0.00/0.07 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24504 impls, 200 clqs
0.29/0.38 c presolving (2 rounds):
0.29/0.38 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.38 c 24504 implications, 200 cliques
0.29/0.38 c presolved problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 constraints
0.29/0.38 c 1 constraints of type <knapsack>
0.29/0.38 c 200 constraints of type <setppc>
0.29/0.38 c 3038 constraints of type <and>
0.29/0.38 c 1 constraints of type <linear>
0.29/0.38 c 100 constraints of type <logicor>
0.29/0.38 c transformed objective value is always integral (scale: 1)
0.29/0.38 c Presolving Time: 0.16
0.29/0.38 c SATUNSAT-NLC
0.29/0.38 c -----------------------------------------------------------------------------------------------
0.29/0.38 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/flowcover/freq = c -1
0.29/0.38 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/cmir/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/veclendiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/simplerounding/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/shifting/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/rounding/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/rootsoldiving/freq = c -1
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/rens/nodesofs = c 2000
0.29/0.38 c # minimum percentage of integer variables that have to be fixable
0.29/0.38 c # [type: real, range: [0,1], default: 0.5]
0.29/0.38 c heuristics/rens/minfixingrate = c 0.3
0.29/0.38 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c heuristics/rens/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/pscostdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/oneopt/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.38 c # [type: real, range: [0,1], default: 0.01]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/objpscostdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/linesearchdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/intshifting/freq = c -1
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/guideddiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/fracdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.38 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/feaspump/freq = c -1
0.29/0.38 c # minimum percentage of integer variables that have to be fixed
0.29/0.38 c # [type: real, range: [0,1], default: 0.666]
0.29/0.38 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.38 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.38 c # [type: real, range: [0,1], default: 0.1]
0.29/0.38 c heuristics/crossover/nodesquot = c 0.15
0.29/0.38 c # number of nodes without incumbent change that heuristic should wait
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.38 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/crossover/nodesofs = c 750
0.29/0.38 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.38 c heuristics/crossover/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/coefdiving/freq = c -1
0.29/0.38 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c presolving/probing/maxrounds = c 0
0.29/0.38 c # should presolving try to simplify knapsacks
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.38 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.38 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.38 c constraints/knapsack/disaggregation = c FALSE
0.29/0.38 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.38 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = c 5
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = c 1
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = c 1
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = c 1620
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = c 1791
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = c 10000
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving problem
0.29/0.39 c
0.39/0.46 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.46 c 0.2s| 1 | 0 | 66 | 14M| 0 | 56 |3238 |3340 |3340 |3238 |6378 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.80 c 0.6s| 1 | 0 | 88 | 14M| 0 | 57 |3238 |3340 |3340 |3238 |6379 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
1.10/1.12 c 0.9s| 1 | 0 | 142 | 14M| 0 | 63 |3238 |3340 |3340 |3238 |6381 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
2.20/2.28 c 2.0s| 1 | 0 | 151 | 14M| 0 | 64 |3238 |3340 |3340 |3238 |6382 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
3.49/3.52 c 3.3s| 1 | 0 | 170 | 14M| 0 | 64 |3238 |3340 |3340 |3238 |6383 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
5.39/5.42 c 5.2s| 1 | 0 | 389 | 14M| 0 | 64 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
15.49/15.51 c 15.2s| 1 | 2 | 389 | 14M| 0 | 64 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
148.10/148.11 c * 147s| 4014 | 952 |195720 | 32M| 37 | - |3238 |3561 | 612 |3238 | 834 | 125k| 261 |6772 | 3.000000e+01 | 3.700000e+01 | 23.33%
148.10/148.11 c
148.10/148.11 c SCIP Status : solving was interrupted [solution limit reached]
148.10/148.11 c Solving Time (sec) : 147.10
148.10/148.11 c Solving Nodes : 4014
148.10/148.11 c Primal Bound : +3.70000000000000e+01 (1 solutions)
148.10/148.11 c Dual Bound : +3.00000000000001e+01
148.10/148.11 c Gap : 23.33 %
148.10/148.12 c NODE 4014
148.10/148.12 c DUAL BOUND 30
148.10/148.12 c PRIMAL BOUND 37
148.10/148.12 c GAP 0.233333
148.10/148.12 s SATISFIABLE
148.10/148.12 v -x162 -x111 -x139 -x121 -x180 -x119 -x108 -x154 -x172 -x132 x190 -x166 -x129 -x153 x198 -x113 -x140 -x200 -x155 -x189 -x179 -x156
148.10/148.12 v -x152 x149 -x109 -x188 -x151 -x144 x165 -x135 -x115 x146 -x147 -x126 x106 -x182 -x197 -x102 -x195 -x161 -x133 -x105 -x104
148.10/148.12 v -x192 -x114 -x171 -x125 -x138 -x185 -x174 -x143 -x157 -x170 -x159 -x123 -x103 -x101 -x199 -x196 x186 -x181 -x177 -x176 x175 -x167
148.10/148.12 v -x158 x148 x145 -x142 -x134 -x120 -x118 -x117 -x110 -x107 -x124 -x131 -x183 -x130 x168 -x169 -x112 -x137 -x173 -x141 -x127
148.10/148.12 v -x164 -x160 -x191 -x128 -x163 x122 -x150 x193 -x136 x194 x116 -x178 -x187 -x184 x100 x99 -x98 -x97 x96 x95 -x94 -x93 x92 -x91
148.10/148.12 v -x90 -x89 x88 -x87 -x86 x85 -x84 x83 -x82 -x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66
148.10/148.12 v -x65 -x64 x63 -x62 x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 x44 -x43 -x42 -x41 -x40
148.10/148.12 v -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15
148.10/148.12 v x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
148.10/148.12 c SCIP Status : solving was interrupted [solution limit reached]
148.10/148.12 c Solving Time : 147.10
148.10/148.12 c Original Problem :
148.10/148.12 c Problem name : HOME/instance-1870699-1245215924.opb
148.10/148.12 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
148.10/148.12 c Constraints : 3340 initial, 3340 maximal
148.10/148.12 c Presolved Problem :
148.10/148.12 c Problem name : t_HOME/instance-1870699-1245215924.opb
148.10/148.12 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
148.10/148.12 c Constraints : 3340 initial, 3561 maximal
148.10/148.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
148.10/148.12 c trivial : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c dualfix : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c implics : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c probing : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c knapsack : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c setppc : 0.01 0 0 0 0 0 0 0 0
148.10/148.12 c and : 0.12 0 0 0 0 0 0 0 0
148.10/148.12 c linear : 0.02 0 0 0 0 0 0 0 0
148.10/148.12 c logicor : 0.00 0 0 0 0 0 0 0 0
148.10/148.12 c root node : - 0 - - 0 - - - -
148.10/148.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
148.10/148.12 c integral : 0 0 0 3851 0 73 679 0 0 5684
148.10/148.12 c knapsack : 1 5 14112 592 0 1 33 0 0 0
148.10/148.12 c setppc : 200 5 14115 592 0 67 41829 0 0 0
148.10/148.12 c and : 3038 3193 14048 592 0 158 684274 126558 0 0
148.10/148.12 c linear : 1 5 13890 1 0 0 0 0 0 0
148.10/148.12 c logicor : 100+ 5 4438 1 0 0 3679 0 0 0
148.10/148.12 c countsols : 0 0 0 1 0 0 0 0 0 0
148.10/148.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
148.10/148.12 c integral : 42.05 0.00 0.00 42.05 0.00
148.10/148.12 c knapsack : 0.01 0.00 0.01 0.00 0.00
148.10/148.12 c setppc : 0.30 0.00 0.28 0.02 0.00
148.10/148.12 c and : 8.17 4.18 3.44 0.55 0.00
148.10/148.12 c linear : 0.35 0.00 0.35 0.00 0.00
148.10/148.12 c logicor : 0.06 0.00 0.06 0.00 0.00
148.10/148.12 c countsols : 0.00 0.00 0.00 0.00 0.00
148.10/148.12 c Propagators : Time Calls Cutoffs DomReds
148.10/148.12 c rootredcost : 0.00 0 0 0
148.10/148.12 c pseudoobj : 5.43 14117 0 0
148.10/148.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
148.10/148.12 c propagation : 0.00 226 226 278 10.3 0 0.0 -
148.10/148.12 c infeasible LP : 0.66 872 0 0 0.0 0 0.0 0
148.10/148.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
148.10/148.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
148.10/148.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
148.10/148.12 c applied globally : - - - 261 9.4 - - -
148.10/148.12 c applied locally : - - - 0 0.0 - - -
148.10/148.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
148.10/148.12 c cut pool : 0.00 4 - - 2 - (maximal pool size: 18)
148.10/148.12 c redcost : 1.32 3193 0 0 0 0
148.10/148.12 c impliedbounds : 0.00 5 0 0 0 0
148.10/148.12 c intobj : 0.00 0 0 0 0 0
148.10/148.12 c gomory : 3.07 5 0 0 1000 0
148.10/148.12 c strongcg : 1.47 5 0 0 2500 0
148.10/148.12 c cmir : 0.00 0 0 0 0 0
148.10/148.12 c flowcover : 0.00 0 0 0 0 0
148.10/148.12 c clique : 0.02 5 0 0 0 0
148.10/148.12 c zerohalf : 0.00 0 0 0 0 0
148.10/148.12 c mcf : 0.07 2 0 0 0 0
148.10/148.12 c Pricers : Time Calls Vars
148.10/148.12 c problem variables: 0.00 0 0
148.10/148.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
148.10/148.12 c relpscost : 42.05 3259 73 679 0 0 5684
148.10/148.12 c pscost : 0.00 0 0 0 0 0 0
148.10/148.12 c inference : 0.00 0 0 0 0 0 0
148.10/148.12 c mostinf : 0.00 0 0 0 0 0 0
148.10/148.12 c leastinf : 0.00 0 0 0 0 0 0
148.10/148.12 c fullstrong : 0.00 0 0 0 0 0 0
148.10/148.12 c allfullstrong : 0.00 0 0 0 0 0 0
148.10/148.12 c random : 0.00 0 0 0 0 0 0
148.10/148.12 c Primal Heuristics : Time Calls Found
148.10/148.12 c LP solutions : 0.01 - 1
148.10/148.12 c pseudo solutions : 0.00 - 0
148.10/148.12 c simplerounding : 0.00 0 0
148.10/148.12 c rounding : 0.00 0 0
148.10/148.12 c shifting : 0.00 0 0
148.10/148.12 c intshifting : 0.00 0 0
148.10/148.12 c oneopt : 0.00 0 0
148.10/148.12 c fixandinfer : 0.00 0 0
148.10/148.12 c feaspump : 0.00 0 0
148.10/148.12 c coefdiving : 0.00 0 0
148.10/148.12 c pscostdiving : 0.00 0 0
148.10/148.12 c fracdiving : 0.00 0 0
148.10/148.12 c veclendiving : 0.00 0 0
148.10/148.12 c intdiving : 0.00 0 0
148.10/148.12 c actconsdiving : 0.00 0 0
148.10/148.12 c objpscostdiving : 0.00 0 0
148.10/148.12 c rootsoldiving : 0.00 0 0
148.10/148.12 c linesearchdiving : 0.00 0 0
148.10/148.12 c guideddiving : 0.00 0 0
148.10/148.12 c octane : 0.00 0 0
148.10/148.12 c rens : 0.00 0 0
148.10/148.12 c rins : 0.00 0 0
148.10/148.12 c localbranching : 0.00 0 0
148.10/148.12 c mutation : 0.00 0 0
148.10/148.12 c crossover : 0.00 0 0
148.10/148.12 c dins : 0.00 0 0
148.10/148.12 c LP : Time Calls Iterations Iter/call Iter/sec
148.10/148.12 c primal LP : 21.55 0 0 0.00 0.00
148.10/148.12 c dual LP : 48.65 7885 195720 24.82 4023.02
148.10/148.12 c barrier LP : 0.00 0 0 0.00 -
148.10/148.12 c diving/probing LP: 0.00 0 0 0.00 -
148.10/148.12 c strong branching : 41.75 6772 186443 27.53 4465.70
148.10/148.12 c (at root node) : - 33 10424 315.88 -
148.10/148.12 c conflict analysis: 0.00 0 0 0.00 -
148.10/148.12 c B&B Tree :
148.10/148.12 c number of runs : 1
148.10/148.12 c nodes : 4014
148.10/148.12 c nodes (total) : 4014
148.10/148.12 c nodes left : 952
148.10/148.12 c max depth : 37
148.10/148.12 c max depth (total): 37
148.10/148.12 c backtracks : 239 (6.0%)
148.10/148.12 c delayed cutoffs : 0
148.10/148.12 c repropagations : 2086 (5329 domain reductions, 0 cutoffs)
148.10/148.12 c avg switch length: 3.23
148.10/148.12 c switching time : 25.44
148.10/148.12 c Solution :
148.10/148.12 c Solutions found : 1 (1 improvements)
148.10/148.12 c Primal Bound : +3.70000000000000e+01 (in run 1, after 4014 nodes, 147.09 seconds, depth 24, found by <relaxation>)
148.10/148.12 c Dual Bound : +3.00000000000001e+01
148.10/148.12 c Gap : 23.33 %
148.10/148.12 c Root Dual Bound : +3.00000000000000e+01
148.20/148.21 c Time complete: 148.21.