0.00/0.03 c SCIP version 1.1.0.7
0.00/0.03 c LP-Solver Clp 1.8.2
0.00/0.03 c user parameter file <scip.set> not found - using default parameters
0.00/0.03 c read problem <HOME/instance-1870621-1245214078.opb>
0.00/0.03 c original problem has 1448 variables (1448 bin, 0 int, 0 impl, 0 cont) and 1550 constraints
0.00/0.04 c No objective function, only one solution is needed.
0.00/0.04 c start presolving problem
0.00/0.04 c presolving:
0.09/0.19 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10184 impls, 200 clqs
0.28/0.32 c presolving (2 rounds):
0.28/0.33 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.28/0.33 c 10184 implications, 200 cliques
0.28/0.33 c presolved problem has 1448 variables (1448 bin, 0 int, 0 impl, 0 cont) and 1550 constraints
0.28/0.33 c 1 constraints of type <knapsack>
0.28/0.33 c 200 constraints of type <setppc>
0.28/0.33 c 1248 constraints of type <and>
0.28/0.33 c 1 constraints of type <linear>
0.28/0.33 c 100 constraints of type <logicor>
0.28/0.33 c transformed objective value is always integral (scale: 1)
0.28/0.33 c Presolving Time: 0.13
0.28/0.33 c SATUNSAT-NLC
0.28/0.33 c -----------------------------------------------------------------------------------------------
0.28/0.33 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.28/0.33 c separating/flowcover/freq = c -1
0.28/0.33 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.28/0.33 c separating/cmir/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/veclendiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.28/0.33 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.28/0.33 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/veclendiving/freq = c -1
0.28/0.33 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.28/0.33 c heuristics/simplerounding/freq = c -1
0.28/0.33 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/shifting/freq = c -1
0.28/0.33 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.28/0.33 c heuristics/rounding/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.28/0.33 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.28/0.33 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.28/0.33 c heuristics/rootsoldiving/freq = c -1
0.28/0.33 c # number of nodes added to the contingent of the total nodes
0.28/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.28/0.33 c heuristics/rens/nodesofs = c 2000
0.28/0.33 c # minimum percentage of integer variables that have to be fixable
0.28/0.33 c # [type: real, range: [0,1], default: 0.5]
0.28/0.33 c heuristics/rens/minfixingrate = c 0.3
0.28/0.33 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.28/0.33 c heuristics/rens/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.28/0.33 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.28/0.33 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/pscostdiving/freq = c -1
0.28/0.33 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.28/0.33 c heuristics/oneopt/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to total iteration number
0.28/0.33 c # [type: real, range: [0,1], default: 0.01]
0.28/0.33 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.28/0.33 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.28/0.33 c heuristics/objpscostdiving/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.28/0.33 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.28/0.33 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/linesearchdiving/freq = c -1
0.28/0.33 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/intshifting/freq = c -1
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.28/0.33 c heuristics/intdiving/maxlpiterquot = c 0.075
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/guideddiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.28/0.33 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.28/0.33 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/guideddiving/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/fracdiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.28/0.33 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.28/0.33 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/fracdiving/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/feaspump/maxlpiterofs = c 2000
0.28/0.33 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.28/0.33 c heuristics/feaspump/freq = c -1
0.28/0.33 c # minimum percentage of integer variables that have to be fixed
0.28/0.33 c # [type: real, range: [0,1], default: 0.666]
0.28/0.33 c heuristics/crossover/minfixingrate = c 0.5
0.28/0.33 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.28/0.33 c # [type: real, range: [0,1], default: 0.1]
0.28/0.33 c heuristics/crossover/nodesquot = c 0.15
0.28/0.33 c # number of nodes without incumbent change that heuristic should wait
0.28/0.33 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.28/0.33 c heuristics/crossover/nwaitingnodes = c 100
0.28/0.33 c # number of nodes added to the contingent of the total nodes
0.28/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.28/0.33 c heuristics/crossover/nodesofs = c 750
0.28/0.33 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 30]
0.28/0.33 c heuristics/crossover/freq = c -1
0.28/0.33 c # additional number of allowed LP iterations
0.28/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.28/0.33 c heuristics/coefdiving/maxlpiterofs = c 1500
0.28/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.28/0.33 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.28/0.33 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.28/0.33 c heuristics/coefdiving/freq = c -1
0.28/0.33 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.28/0.33 c presolving/probing/maxrounds = c 0
0.28/0.33 c # should presolving try to simplify knapsacks
0.28/0.33 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.28/0.33 c constraints/knapsack/simplifyinequalities = c TRUE
0.28/0.33 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.28/0.33 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.28/0.33 c constraints/knapsack/disaggregation = c FALSE
0.28/0.33 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.28/0.33 c constraints/knapsack/maxnumcardlift = c 0
0.28/0.33 c # should presolving try to simplify inequalities
0.28/0.33 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.28/0.33 c constraints/linear/simplifyinequalities = c TRUE
0.28/0.33 c # maximal number of separation rounds in the root node (-1: unlimited)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.28/0.33 c separating/maxroundsroot = c 5
0.28/0.33 c # maximal number of separation rounds per node (-1: unlimited)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 5]
0.28/0.33 c separating/maxrounds = c 1
0.28/0.33 c # solving stops, if the given number of solutions were found (-1: no limit)
0.28/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.28/0.33 c limits/solutions = c 1
0.28/0.33 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.28/0.33 c limits/memory = c 1620
0.28/0.33 c # maximal time in seconds to run
0.28/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.28/0.33 c limits/time = c 1791
0.28/0.33 c # frequency for displaying node information lines
0.28/0.33 c # [type: int, range: [-1,2147483647], default: 100]
0.28/0.33 c display/freq = c 10000
0.28/0.33 c -----------------------------------------------------------------------------------------------
0.28/0.33 c start solving problem
0.28/0.33 c
0.28/0.36 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.28/0.36 c 0.2s| 1 | 0 | 66 |6498k| 0 | 44 |1448 |1550 |1550 |1448 |2798 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.50/0.56 c 0.4s| 1 | 0 | 80 |6524k| 0 | 46 |1448 |1550 |1550 |1448 |2799 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.78/0.80 c 0.6s| 1 | 0 | 98 |6584k| 0 | 47 |1448 |1550 |1550 |1448 |2800 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
1.09/1.13 c 0.9s| 1 | 0 | 100 |6626k| 0 | 49 |1448 |1550 |1550 |1448 |2801 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.49/1.54 c 1.3s| 1 | 0 | 103 |6656k| 0 | 54 |1448 |1550 |1550 |1448 |2802 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.88/1.97 c 1.8s| 1 | 0 | 123 |6698k| 0 | 55 |1448 |1550 |1550 |1448 |2803 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
2.88/2.90 c 2.7s| 1 | 2 | 123 |6699k| 0 | 55 |1448 |1550 |1550 |1448 |2803 | 5 | 0 | 33 | 3.000000e+01 | -- | Inf
3.79/3.81 c * 3.6s| 35 | 21 | 913 |7048k| 18 | - |1448 |1551 | 999 |1448 | 461 | 423 | 1 | 329 | 3.000000e+01 | 3.100000e+01 | 3.33%
3.79/3.81 c
3.79/3.81 c SCIP Status : solving was interrupted [solution limit reached]
3.79/3.81 c Solving Time (sec) : 3.58
3.79/3.81 c Solving Nodes : 35
3.79/3.81 c Primal Bound : +3.10000000000000e+01 (1 solutions)
3.79/3.81 c Dual Bound : +3.00000000000000e+01
3.79/3.81 c Gap : 3.33 %
3.79/3.81 c NODE 35
3.79/3.81 c DUAL BOUND 30
3.79/3.81 c PRIMAL BOUND 31
3.79/3.81 c GAP 0.0333333
3.79/3.81 s SATISFIABLE
3.79/3.81 v -x162 -x134 -x175 x180 x186 -x172 -x132 -x166 -x142 -x153 -x118 -x129 -x113 -x140 -x161 -x133 -x200 x152 x195 x119 -x189 x177 -x109
3.79/3.81 v x188 -x144 -x165 -x107 x135 -x196 -x106 -x198 x176 x146 -x139 -x182 -x197 -x105 -x158 -x147 -x145 -x126 -x121 -x181 -x192
3.79/3.81 v -x114 -x171 -x125 -x199 -x138 -x104 -x151 x149 -x115 -x108 -x185 -x120 -x174 -x143 -x157 -x103 -x190 -x155 -x154 x148 -x170
3.79/3.81 v -x159 -x123 -x124 -x183 -x130 x168 -x102 -x111 x110 -x169 -x112 -x137 -x173 -x141 -x127 -x164 x191 -x128 -x101 -x179 -x167 -x160
3.79/3.81 v -x156 -x131 -x117 -x163 -x122 -x150 -x193 -x136 -x194 -x116 -x178 -x187 -x184 x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
3.79/3.81 v -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67
3.79/3.81 v -x66 -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
3.79/3.81 v -x40 -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
3.79/3.81 v x14 -x13 x12 x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
3.79/3.81 c SCIP Status : solving was interrupted [solution limit reached]
3.79/3.81 c Solving Time : 3.58
3.79/3.81 c Original Problem :
3.79/3.81 c Problem name : HOME/instance-1870621-1245214078.opb
3.79/3.81 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.81 c Constraints : 1550 initial, 1550 maximal
3.79/3.81 c Presolved Problem :
3.79/3.81 c Problem name : t_HOME/instance-1870621-1245214078.opb
3.79/3.81 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.81 c Constraints : 1550 initial, 1551 maximal
3.79/3.81 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.79/3.81 c trivial : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c implics : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c probing : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c setppc : 0.01 0 0 0 0 0 0 0 0
3.79/3.81 c and : 0.10 0 0 0 0 0 0 0 0
3.79/3.81 c linear : 0.01 0 0 0 0 0 0 0 0
3.79/3.81 c logicor : 0.00 0 0 0 0 0 0 0 0
3.79/3.81 c root node : - 0 - - 0 - - - -
3.79/3.81 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.79/3.81 c integral : 0 0 0 67 0 0 0 0 0 66
3.79/3.81 c knapsack : 1 5 95 34 0 0 0 0 0 0
3.79/3.81 c setppc : 200 5 95 34 0 1 78 0 0 0
3.79/3.81 c and : 1248 38 94 34 0 0 1249 418 0 0
3.79/3.81 c linear : 1 5 94 1 0 0 0 0 0 0
3.79/3.81 c logicor : 100+ 5 29 1 0 0 25 0 0 0
3.79/3.81 c countsols : 0 0 0 1 0 0 0 0 0 0
3.79/3.81 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.79/3.81 c integral : 1.38 0.00 0.00 1.38 0.00
3.79/3.81 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.79/3.81 c setppc : 0.00 0.00 0.00 0.00 0.00
3.79/3.81 c and : 0.09 0.03 0.02 0.04 0.00
3.79/3.81 c linear : 0.00 0.00 0.00 0.00 0.00
3.79/3.81 c logicor : 0.00 0.00 0.00 0.00 0.00
3.79/3.81 c countsols : 0.00 0.00 0.00 0.00 0.00
3.79/3.81 c Propagators : Time Calls Cutoffs DomReds
3.79/3.81 c rootredcost : 0.00 0 0 0
3.79/3.81 c pseudoobj : 0.00 96 0 0
3.79/3.81 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.79/3.81 c propagation : 0.00 1 1 1 3.0 0 0.0 -
3.79/3.81 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.81 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.81 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.81 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.79/3.81 c applied globally : - - - 1 3.0 - - -
3.79/3.81 c applied locally : - - - 0 0.0 - - -
3.79/3.81 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.79/3.81 c cut pool : 0.00 4 - - 3 - (maximal pool size: 30)
3.79/3.81 c redcost : 0.00 38 0 0 0 0
3.79/3.82 c impliedbounds : 0.00 5 0 0 0 0
3.79/3.82 c intobj : 0.00 0 0 0 0 0
3.79/3.82 c gomory : 0.81 5 0 0 1000 0
3.79/3.82 c strongcg : 0.69 5 0 0 2500 0
3.79/3.82 c cmir : 0.00 0 0 0 0 0
3.79/3.82 c flowcover : 0.00 0 0 0 0 0
3.79/3.82 c clique : 0.02 5 0 0 0 0
3.79/3.82 c zerohalf : 0.00 0 0 0 0 0
3.79/3.82 c mcf : 0.00 1 0 0 0 0
3.79/3.82 c Pricers : Time Calls Vars
3.79/3.82 c problem variables: 0.00 0 0
3.79/3.82 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.79/3.82 c relpscost : 1.38 33 0 0 0 0 66
3.79/3.82 c pscost : 0.00 0 0 0 0 0 0
3.79/3.82 c inference : 0.00 0 0 0 0 0 0
3.79/3.82 c mostinf : 0.00 0 0 0 0 0 0
3.79/3.82 c leastinf : 0.00 0 0 0 0 0 0
3.79/3.82 c fullstrong : 0.00 0 0 0 0 0 0
3.79/3.82 c allfullstrong : 0.00 0 0 0 0 0 0
3.79/3.82 c random : 0.00 0 0 0 0 0 0
3.79/3.82 c Primal Heuristics : Time Calls Found
3.79/3.82 c LP solutions : 0.00 - 1
3.79/3.82 c pseudo solutions : 0.00 - 0
3.79/3.82 c simplerounding : 0.00 0 0
3.79/3.82 c rounding : 0.00 0 0
3.79/3.82 c shifting : 0.00 0 0
3.79/3.82 c intshifting : 0.00 0 0
3.79/3.82 c oneopt : 0.00 0 0
3.79/3.82 c fixandinfer : 0.00 0 0
3.79/3.82 c feaspump : 0.00 0 0
3.79/3.82 c coefdiving : 0.00 0 0
3.79/3.82 c pscostdiving : 0.00 0 0
3.79/3.82 c fracdiving : 0.00 0 0
3.79/3.82 c veclendiving : 0.00 0 0
3.79/3.82 c intdiving : 0.00 0 0
3.79/3.82 c actconsdiving : 0.00 0 0
3.79/3.82 c objpscostdiving : 0.00 0 0
3.79/3.82 c rootsoldiving : 0.00 0 0
3.79/3.82 c linesearchdiving : 0.00 0 0
3.79/3.82 c guideddiving : 0.00 0 0
3.79/3.82 c octane : 0.00 0 0
3.79/3.82 c rens : 0.00 0 0
3.79/3.82 c rins : 0.00 0 0
3.79/3.82 c localbranching : 0.00 0 0
3.79/3.82 c mutation : 0.00 0 0
3.79/3.82 c crossover : 0.00 0 0
3.79/3.82 c dins : 0.00 0 0
3.79/3.82 c LP : Time Calls Iterations Iter/call Iter/sec
3.79/3.82 c primal LP : 0.07 0 0 0.00 0.00
3.79/3.82 c dual LP : 0.23 103 913 8.86 3969.57
3.79/3.82 c barrier LP : 0.00 0 0 0.00 -
3.79/3.82 c diving/probing LP: 0.00 0 0 0.00 -
3.79/3.82 c strong branching : 1.38 329 6325 19.22 4583.33
3.79/3.82 c (at root node) : - 33 3026 91.70 -
3.79/3.82 c conflict analysis: 0.00 0 0 0.00 -
3.79/3.82 c B&B Tree :
3.79/3.82 c number of runs : 1
3.79/3.82 c nodes : 35
3.79/3.82 c nodes (total) : 35
3.79/3.82 c nodes left : 21
3.79/3.82 c max depth : 18
3.79/3.82 c max depth (total): 18
3.79/3.82 c backtracks : 1 (2.9%)
3.79/3.82 c delayed cutoffs : 0
3.79/3.82 c repropagations : 1 (11 domain reductions, 0 cutoffs)
3.79/3.82 c avg switch length: 1.54
3.79/3.82 c switching time : 0.08
3.79/3.82 c Solution :
3.79/3.82 c Solutions found : 1 (1 improvements)
3.79/3.82 c Primal Bound : +3.10000000000000e+01 (in run 1, after 35 nodes, 3.58 seconds, depth 15, found by <relaxation>)
3.79/3.82 c Dual Bound : +3.00000000000000e+01
3.79/3.82 c Gap : 3.33 %
3.79/3.82 c Root Dual Bound : +3.00000000000000e+01
3.79/3.84 c Time complete: 3.83.