0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver Clp 1.8.2
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870605-1245213427.opb>
0.00/0.02 c original problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.02/0.04 c No objective function, only one solution is needed.
0.02/0.04 c start presolving problem
0.02/0.04 c presolving:
0.09/0.18 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10264 impls, 200 clqs
0.29/0.31 c presolving (2 rounds):
0.29/0.31 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.31 c 10264 implications, 200 cliques
0.29/0.31 c presolved problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.29/0.31 c 1 constraints of type <knapsack>
0.29/0.31 c 200 constraints of type <setppc>
0.29/0.31 c 1258 constraints of type <and>
0.29/0.31 c 1 constraints of type <linear>
0.29/0.31 c 100 constraints of type <logicor>
0.29/0.31 c transformed objective value is always integral (scale: 1)
0.29/0.31 c Presolving Time: 0.13
0.29/0.31 c SATUNSAT-NLC
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/flowcover/freq = c -1
0.29/0.31 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/cmir/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/veclendiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/simplerounding/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/shifting/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/rounding/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/rootsoldiving/freq = c -1
0.29/0.32 c # number of nodes added to the contingent of the total nodes
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.32 c heuristics/rens/nodesofs = c 2000
0.29/0.32 c # minimum percentage of integer variables that have to be fixable
0.29/0.32 c # [type: real, range: [0,1], default: 0.5]
0.29/0.32 c heuristics/rens/minfixingrate = c 0.3
0.29/0.32 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c heuristics/rens/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/pscostdiving/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/oneopt/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.32 c # [type: real, range: [0,1], default: 0.01]
0.29/0.32 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.32 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/objpscostdiving/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/linesearchdiving/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/intshifting/freq = c -1
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/guideddiving/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/fracdiving/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.32 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/feaspump/freq = c -1
0.29/0.32 c # minimum percentage of integer variables that have to be fixed
0.29/0.32 c # [type: real, range: [0,1], default: 0.666]
0.29/0.32 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.32 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.32 c # [type: real, range: [0,1], default: 0.1]
0.29/0.32 c heuristics/crossover/nodesquot = c 0.15
0.29/0.32 c # number of nodes without incumbent change that heuristic should wait
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.32 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.32 c # number of nodes added to the contingent of the total nodes
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.32 c heuristics/crossover/nodesofs = c 750
0.29/0.32 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.32 c heuristics/crossover/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/coefdiving/freq = c -1
0.29/0.32 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c presolving/probing/maxrounds = c 0
0.29/0.32 c # should presolving try to simplify knapsacks
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.32 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.32 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.32 c constraints/knapsack/disaggregation = c FALSE
0.29/0.32 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.32 c # should presolving try to simplify inequalities
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.32 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.32 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c separating/maxroundsroot = c 5
0.29/0.32 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.32 c separating/maxrounds = c 1
0.29/0.32 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c limits/solutions = c 1
0.29/0.32 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/memory = c 1620
0.29/0.32 c # maximal time in seconds to run
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/time = c 1791
0.29/0.32 c # frequency for displaying node information lines
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.32 c display/freq = c 10000
0.29/0.32 c -----------------------------------------------------------------------------------------------
0.29/0.32 c start solving problem
0.29/0.32 c
0.29/0.35 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.35 c 0.2s| 1 | 0 | 77 |6539k| 0 | 52 |1458 |1560 |1560 |1458 |2818 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.59 c 0.4s| 1 | 0 | 99 |6578k| 0 | 56 |1458 |1560 |1560 |1458 |2819 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.88 c 0.7s| 1 | 0 | 121 |6694k| 0 | 61 |1458 |1560 |1560 |1458 |2820 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
1.29/1.35 c 1.1s| 1 | 0 | 126 |6724k| 0 | 62 |1458 |1560 |1560 |1458 |2821 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.79/1.89 c 1.7s| 1 | 0 | 144 |6783k| 0 | 64 |1458 |1560 |1560 |1458 |2822 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
2.49/2.53 c 2.3s| 1 | 0 | 179 |6831k| 0 | 64 |1458 |1560 |1560 |1458 |2823 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
3.39/3.45 c 3.2s| 1 | 2 | 179 |6832k| 0 | 64 |1458 |1560 |1560 |1458 |2823 | 5 | 0 | 33 | 3.000000e+01 | -- | Inf
3.99/4.02 c * 3.8s| 19 | 16 | 450 |7102k| 17 | - |1458 |1561 | 812 |1458 | 482 | 221 | 1 | 267 | 3.000000e+01 | 3.200000e+01 | 6.67%
3.99/4.02 c
3.99/4.02 c SCIP Status : solving was interrupted [solution limit reached]
3.99/4.02 c Solving Time (sec) : 3.79
3.99/4.02 c Solving Nodes : 19
3.99/4.02 c Primal Bound : +3.20000000000000e+01 (1 solutions)
3.99/4.02 c Dual Bound : +3.00000000000000e+01
3.99/4.02 c Gap : 6.67 %
3.99/4.02 c NODE 19
3.99/4.02 c DUAL BOUND 30
3.99/4.02 c PRIMAL BOUND 32
3.99/4.02 c GAP 0.0666667
3.99/4.02 s SATISFIABLE
3.99/4.02 v -x128 -x141 -x182 -x146 x136 -x166 -x181 -x185 -x156 x153 -x179 -x178 -x149 -x152 x124 -x133 -x188 -x189 x147 -x139 -x197 -x191
3.99/4.02 v -x163 -x130 -x192 -x194 -x106 -x170 -x140 -x109 -x117 -x107 -x196 -x187 -x168 -x190 -x148 -x171 -x161 -x160 -x158 -x154 -x151
3.99/4.02 v -x114 -x173 -x199 -x176 -x177 -x193 x172 -x143 -x135 x162 -x125 -x195 -x120 x200 x157 -x167 -x134 -x113 -x111 -x131 -x121 -x183
3.99/4.02 v x123 x174 x180 -x169 x198 -x159 -x137 -x132 -x122 -x119 -x112 -x105 -x118 -x150 -x142 -x103 -x104 -x165 -x115 -x155 -x101
3.99/4.02 v -x144 -x116 x110 x108 -x145 -x186 -x129 -x126 x138 -x164 -x127 -x175 -x184 -x102 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
3.99/4.02 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.99/4.02 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
3.99/4.02 v -x41 -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.99/4.02 v -x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 x5 -x4 -x3 x2 -x1
3.99/4.02 c SCIP Status : solving was interrupted [solution limit reached]
3.99/4.02 c Solving Time : 3.79
3.99/4.02 c Original Problem :
3.99/4.02 c Problem name : HOME/instance-1870605-1245213427.opb
3.99/4.02 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.02 c Constraints : 1560 initial, 1560 maximal
3.99/4.02 c Presolved Problem :
3.99/4.02 c Problem name : t_HOME/instance-1870605-1245213427.opb
3.99/4.02 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.02 c Constraints : 1560 initial, 1561 maximal
3.99/4.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.99/4.02 c trivial : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c implics : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c probing : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c setppc : 0.01 0 0 0 0 0 0 0 0
3.99/4.02 c and : 0.10 0 0 0 0 0 0 0 0
3.99/4.02 c linear : 0.01 0 0 0 0 0 0 0 0
3.99/4.02 c logicor : 0.00 0 0 0 0 0 0 0 0
3.99/4.02 c root node : - 0 - - 0 - - - -
3.99/4.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.99/4.02 c integral : 0 0 0 30 0 0 0 0 0 34
3.99/4.02 c knapsack : 1 5 59 13 0 0 0 0 0 0
3.99/4.02 c setppc : 200 5 59 13 0 1 41 0 0 0
3.99/4.02 c and : 1258 22 58 13 0 0 676 216 0 0
3.99/4.02 c linear : 1 5 58 1 0 0 0 0 0 0
3.99/4.02 c logicor : 100+ 5 18 1 0 0 13 0 0 0
3.99/4.02 c countsols : 0 0 0 1 0 0 0 0 0 0
3.99/4.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.99/4.02 c integral : 1.24 0.00 0.00 1.24 0.00
3.99/4.02 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c setppc : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c and : 0.03 0.02 0.00 0.01 0.00
3.99/4.02 c linear : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c logicor : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c countsols : 0.00 0.00 0.00 0.00 0.00
3.99/4.02 c Propagators : Time Calls Cutoffs DomReds
3.99/4.02 c rootredcost : 0.00 0 0 0
3.99/4.02 c pseudoobj : 0.00 60 0 0
3.99/4.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.99/4.02 c propagation : 0.00 1 1 1 3.0 0 0.0 -
3.99/4.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.02 c applied globally : - - - 1 3.0 - - -
3.99/4.02 c applied locally : - - - 0 0.0 - - -
3.99/4.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.99/4.02 c cut pool : 0.00 4 - - 1 - (maximal pool size: 37)
3.99/4.02 c redcost : 0.00 22 0 0 0 0
3.99/4.02 c impliedbounds : 0.00 5 0 0 0 0
3.99/4.02 c intobj : 0.00 0 0 0 0 0
3.99/4.02 c gomory : 1.14 5 0 0 1000 0
3.99/4.02 c strongcg : 0.95 5 0 0 2500 0
3.99/4.02 c cmir : 0.00 0 0 0 0 0
3.99/4.02 c flowcover : 0.00 0 0 0 0 0
3.99/4.02 c clique : 0.00 5 0 0 0 0
3.99/4.02 c zerohalf : 0.00 0 0 0 0 0
3.99/4.02 c mcf : 0.01 1 0 0 0 0
3.99/4.02 c Pricers : Time Calls Vars
3.99/4.02 c problem variables: 0.00 0 0
3.99/4.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.99/4.02 c relpscost : 1.24 17 0 0 0 0 34
3.99/4.02 c pscost : 0.00 0 0 0 0 0 0
3.99/4.02 c inference : 0.00 0 0 0 0 0 0
3.99/4.02 c mostinf : 0.00 0 0 0 0 0 0
3.99/4.02 c leastinf : 0.00 0 0 0 0 0 0
3.99/4.02 c fullstrong : 0.00 0 0 0 0 0 0
3.99/4.02 c allfullstrong : 0.00 0 0 0 0 0 0
3.99/4.02 c random : 0.00 0 0 0 0 0 0
3.99/4.02 c Primal Heuristics : Time Calls Found
3.99/4.02 c LP solutions : 0.00 - 1
3.99/4.02 c pseudo solutions : 0.00 - 0
3.99/4.02 c simplerounding : 0.00 0 0
3.99/4.02 c rounding : 0.00 0 0
3.99/4.02 c shifting : 0.00 0 0
3.99/4.02 c intshifting : 0.00 0 0
3.99/4.02 c oneopt : 0.00 0 0
3.99/4.02 c fixandinfer : 0.00 0 0
3.99/4.02 c feaspump : 0.00 0 0
3.99/4.02 c coefdiving : 0.00 0 0
3.99/4.02 c pscostdiving : 0.00 0 0
3.99/4.02 c fracdiving : 0.00 0 0
3.99/4.02 c veclendiving : 0.00 0 0
3.99/4.02 c intdiving : 0.00 0 0
3.99/4.02 c actconsdiving : 0.00 0 0
3.99/4.02 c objpscostdiving : 0.00 0 0
3.99/4.02 c rootsoldiving : 0.00 0 0
3.99/4.02 c linesearchdiving : 0.00 0 0
3.99/4.02 c guideddiving : 0.00 0 0
3.99/4.02 c octane : 0.00 0 0
3.99/4.02 c rens : 0.00 0 0
3.99/4.02 c rins : 0.00 0 0
3.99/4.02 c localbranching : 0.00 0 0
3.99/4.02 c mutation : 0.00 0 0
3.99/4.02 c crossover : 0.00 0 0
3.99/4.02 c dins : 0.00 0 0
3.99/4.02 c LP : Time Calls Iterations Iter/call Iter/sec
3.99/4.02 c primal LP : 0.07 0 0 0.00 0.00
3.99/4.02 c dual LP : 0.17 52 450 8.65 2647.06
3.99/4.02 c barrier LP : 0.00 0 0 0.00 -
3.99/4.02 c diving/probing LP: 0.00 0 0 0.00 -
3.99/4.02 c strong branching : 1.24 267 4969 18.61 4007.26
3.99/4.02 c (at root node) : - 33 3004 91.03 -
3.99/4.02 c conflict analysis: 0.00 0 0 0.00 -
3.99/4.02 c B&B Tree :
3.99/4.02 c number of runs : 1
3.99/4.02 c nodes : 19
3.99/4.02 c nodes (total) : 19
3.99/4.02 c nodes left : 16
3.99/4.02 c max depth : 17
3.99/4.02 c max depth (total): 17
3.99/4.02 c backtracks : 0 (0.0%)
3.99/4.02 c delayed cutoffs : 0
3.99/4.02 c repropagations : 7 (18 domain reductions, 0 cutoffs)
3.99/4.02 c avg switch length: 1.68
3.99/4.02 c switching time : 0.08
3.99/4.02 c Solution :
3.99/4.02 c Solutions found : 1 (1 improvements)
3.99/4.02 c Primal Bound : +3.20000000000000e+01 (in run 1, after 19 nodes, 3.79 seconds, depth 17, found by <relaxation>)
3.99/4.02 c Dual Bound : +3.00000000000000e+01
3.99/4.02 c Gap : 6.67 %
3.99/4.02 c Root Dual Bound : +3.00000000000000e+01
3.99/4.05 c Time complete: 4.04.