0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870604-1245213425.opb>
0.00/0.02 c original problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 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.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.32 c presolving (2 rounds):
0.29/0.32 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.32 c 10264 implications, 200 cliques
0.29/0.32 c presolved problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.29/0.32 c 1 constraints of type <knapsack>
0.29/0.32 c 200 constraints of type <setppc>
0.29/0.32 c 1258 constraints of type <and>
0.29/0.32 c 1 constraints of type <linear>
0.29/0.32 c 100 constraints of type <logicor>
0.29/0.32 c transformed objective value is always integral (scale: 1)
0.29/0.32 c Presolving Time: 0.12
0.29/0.32 c SATUNSAT-NLC
0.29/0.32 c -----------------------------------------------------------------------------------------------
0.29/0.32 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c separating/flowcover/freq = c -1
0.29/0.32 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c separating/cmir/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/veclendiving/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/veclendiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <simplerounding> (-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/simplerounding/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <rounding> (-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/rounding/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/rootsoldiving/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.01]
0.29/0.32 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.32 c # frequency for calling primal heuristic <rootsoldiving> (-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/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.36 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.36 c 0.2s| 1 | 0 | 97 |6539k| 0 | 60 |1458 |1560 |1560 |1458 |2818 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.59/0.61 c 0.4s| 1 | 0 | 106 |6574k| 0 | 61 |1458 |1560 |1560 |1458 |2819 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.85 c 0.6s| 1 | 0 | 127 |6625k| 0 | 62 |1458 |1560 |1560 |1458 |2821 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.29/1.37 c 1.1s| 1 | 0 | 146 |6688k| 0 | 62 |1458 |1560 |1560 |1458 |2822 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.79/1.89 c 1.6s| 1 | 0 | 173 |6755k| 0 | 62 |1458 |1560 |1560 |1458 |2823 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
2.49/2.53 c 2.3s| 1 | 0 | 194 |6844k| 0 | 62 |1458 |1560 |1560 |1458 |2824 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
4.38/4.45 c 4.2s| 1 | 2 | 194 |6845k| 0 | 62 |1458 |1560 |1560 |1458 |2824 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
5.28/5.38 c * 5.1s| 28 | 27 | 797 |7016k| 27 | - |1458 |1560 |1153 |1458 | 567 | 408 | 0 | 328 | 3.000000e+01 | 3.200000e+01 | 6.67%
5.28/5.38 c
5.28/5.38 c SCIP Status : solving was interrupted [solution limit reached]
5.28/5.38 c Solving Time (sec) : 5.11
5.28/5.38 c Solving Nodes : 28
5.28/5.38 c Primal Bound : +3.20000000000000e+01 (1 solutions)
5.28/5.38 c Dual Bound : +3.00000000000000e+01
5.28/5.38 c Gap : 6.67 %
5.28/5.38 c NODE 28
5.28/5.38 c DUAL BOUND 30
5.28/5.38 c PRIMAL BOUND 32
5.28/5.38 c GAP 0.0666667
5.28/5.38 s SATISFIABLE
5.28/5.38 v -x128 -x141 -x182 -x146 -x136 -x166 x181 -x185 -x156 -x153 -x179 -x178 -x149 -x152 x124 -x133 -x188 -x189 -x147 -x139 -x197 -x191
5.28/5.38 v -x163 -x130 -x192 -x194 x106 -x170 -x140 -x109 -x117 x107 -x196 x187 -x168 -x190 -x148 -x171 -x161 -x160 -x158 -x154 -x151
5.28/5.38 v -x114 -x173 -x199 -x176 x177 -x193 -x172 -x143 -x135 x162 -x125 -x195 -x120 x200 -x157 -x167 x134 -x113 -x111 -x131 x121 -x183
5.28/5.38 v x123 -x174 -x180 -x169 -x198 -x159 -x137 -x132 -x122 -x119 -x112 -x105 -x118 -x150 -x142 -x103 -x104 -x165 -x115 -x155 x101
5.28/5.38 v -x144 -x116 x110 -x108 -x145 -x186 x129 -x126 -x138 -x164 -x127 -x175 x184 -x102 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
5.28/5.38 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
5.28/5.38 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
5.28/5.38 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
5.28/5.38 v -x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 x2 -x1
5.28/5.38 c SCIP Status : solving was interrupted [solution limit reached]
5.28/5.38 c Solving Time : 5.11
5.28/5.38 c Original Problem :
5.28/5.38 c Problem name : HOME/instance-1870604-1245213425.opb
5.28/5.38 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
5.28/5.38 c Constraints : 1560 initial, 1560 maximal
5.28/5.38 c Presolved Problem :
5.28/5.38 c Problem name : t_HOME/instance-1870604-1245213425.opb
5.28/5.38 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
5.28/5.38 c Constraints : 1560 initial, 1560 maximal
5.28/5.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.28/5.38 c trivial : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c implics : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c probing : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c knapsack : 0.01 0 0 0 0 0 0 0 0
5.28/5.38 c setppc : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c and : 0.09 0 0 0 0 0 0 0 0
5.28/5.38 c linear : 0.01 0 0 0 0 0 0 0 0
5.28/5.38 c logicor : 0.00 0 0 0 0 0 0 0 0
5.28/5.38 c root node : - 0 - - 0 - - - -
5.28/5.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.28/5.38 c integral : 0 0 0 41 0 0 0 0 0 54
5.28/5.38 c knapsack : 1 5 71 14 0 0 0 0 0 0
5.28/5.38 c setppc : 200 5 71 14 0 0 0 0 0 0
5.28/5.38 c and : 1258 32 71 14 0 0 362 402 0 0
5.28/5.38 c linear : 1 5 71 1 0 0 0 0 0 0
5.28/5.38 c logicor : 100 5 21 1 0 0 18 0 0 0
5.28/5.38 c countsols : 0 0 0 1 0 0 0 0 0 0
5.28/5.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.28/5.38 c integral : 2.62 0.00 0.00 2.62 0.00
5.28/5.38 c knapsack : 0.00 0.00 0.00 0.00 0.00
5.28/5.38 c setppc : 0.00 0.00 0.00 0.00 0.00
5.28/5.38 c and : 0.02 0.02 0.00 0.00 0.00
5.28/5.38 c linear : 0.01 0.01 0.00 0.00 0.00
5.28/5.38 c logicor : 0.00 0.00 0.00 0.00 0.00
5.28/5.38 c countsols : 0.00 0.00 0.00 0.00 0.00
5.28/5.38 c Propagators : Time Calls Cutoffs DomReds
5.28/5.38 c rootredcost : 0.00 0 0 0
5.28/5.38 c pseudoobj : 0.02 72 0 0
5.28/5.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.28/5.38 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.28/5.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.28/5.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.28/5.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.28/5.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.28/5.38 c applied globally : - - - 0 0.0 - - -
5.28/5.38 c applied locally : - - - 0 0.0 - - -
5.28/5.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.28/5.38 c cut pool : 0.00 4 - - 4 - (maximal pool size: 38)
5.28/5.38 c redcost : 0.00 32 0 0 0 0
5.28/5.38 c impliedbounds : 0.00 5 0 0 0 0
5.28/5.38 c intobj : 0.00 0 0 0 0 0
5.28/5.38 c gomory : 1.08 5 0 0 1000 0
5.28/5.38 c strongcg : 0.97 5 0 0 2458 0
5.28/5.38 c cmir : 0.00 0 0 0 0 0
5.28/5.38 c flowcover : 0.00 0 0 0 0 0
5.28/5.38 c clique : 0.00 5 0 0 0 0
5.28/5.38 c zerohalf : 0.00 0 0 0 0 0
5.28/5.38 c mcf : 0.00 1 0 0 0 0
5.28/5.38 c Pricers : Time Calls Vars
5.28/5.38 c problem variables: 0.00 0 0
5.28/5.38 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.28/5.38 c relpscost : 2.62 27 0 0 0 0 54
5.28/5.38 c pscost : 0.00 0 0 0 0 0 0
5.28/5.38 c inference : 0.00 0 0 0 0 0 0
5.28/5.38 c mostinf : 0.00 0 0 0 0 0 0
5.28/5.38 c leastinf : 0.00 0 0 0 0 0 0
5.28/5.38 c fullstrong : 0.00 0 0 0 0 0 0
5.28/5.38 c allfullstrong : 0.00 0 0 0 0 0 0
5.28/5.38 c random : 0.00 0 0 0 0 0 0
5.28/5.38 c Primal Heuristics : Time Calls Found
5.28/5.38 c LP solutions : 0.00 - 1
5.28/5.38 c pseudo solutions : 0.00 - 0
5.28/5.38 c simplerounding : 0.00 0 0
5.28/5.38 c rounding : 0.00 0 0
5.28/5.38 c shifting : 0.00 0 0
5.28/5.38 c intshifting : 0.00 0 0
5.28/5.38 c oneopt : 0.00 0 0
5.28/5.38 c fixandinfer : 0.00 0 0
5.28/5.38 c feaspump : 0.00 0 0
5.28/5.38 c coefdiving : 0.00 0 0
5.28/5.38 c pscostdiving : 0.00 0 0
5.28/5.38 c fracdiving : 0.00 0 0
5.28/5.38 c veclendiving : 0.00 0 0
5.28/5.38 c intdiving : 0.00 0 0
5.28/5.38 c actconsdiving : 0.00 0 0
5.28/5.38 c objpscostdiving : 0.00 0 0
5.28/5.38 c rootsoldiving : 0.00 0 0
5.28/5.38 c linesearchdiving : 0.00 0 0
5.28/5.38 c guideddiving : 0.00 0 0
5.28/5.38 c octane : 0.00 0 0
5.28/5.38 c rens : 0.00 0 0
5.28/5.38 c rins : 0.00 0 0
5.28/5.38 c localbranching : 0.00 0 0
5.28/5.38 c mutation : 0.00 0 0
5.28/5.38 c crossover : 0.00 0 0
5.28/5.38 c dins : 0.00 0 0
5.28/5.38 c LP : Time Calls Iterations Iter/call Iter/sec
5.28/5.38 c primal LP : 0.01 0 0 0.00 0.00
5.28/5.38 c dual LP : 0.19 73 797 10.92 4194.74
5.28/5.38 c barrier LP : 0.00 0 0 0.00 -
5.28/5.38 c diving/probing LP: 0.00 0 0 0.00 -
5.28/5.38 c strong branching : 2.62 328 6579 20.06 2511.07
5.28/5.38 c (at root node) : - 33 4219 127.85 -
5.28/5.38 c conflict analysis: 0.00 0 0 0.00 -
5.28/5.38 c B&B Tree :
5.28/5.38 c number of runs : 1
5.28/5.38 c nodes : 28
5.28/5.38 c nodes (total) : 28
5.28/5.38 c nodes left : 27
5.28/5.38 c max depth : 27
5.28/5.38 c max depth (total): 27
5.28/5.38 c backtracks : 0 (0.0%)
5.28/5.38 c delayed cutoffs : 0
5.28/5.38 c repropagations : 0 (0 domain reductions, 0 cutoffs)
5.28/5.38 c avg switch length: 1.00
5.28/5.38 c switching time : 0.01
5.28/5.38 c Solution :
5.28/5.38 c Solutions found : 1 (1 improvements)
5.28/5.38 c Primal Bound : +3.20000000000000e+01 (in run 1, after 28 nodes, 5.11 seconds, depth 27, found by <relaxation>)
5.28/5.38 c Dual Bound : +3.00000000000000e+01
5.28/5.38 c Gap : 6.67 %
5.28/5.38 c Root Dual Bound : +3.00000000000000e+01
5.38/5.41 c Time complete: 5.4.