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-1870594-1245213315.opb>
0.00/0.02 c original problem has 1460 variables (1460 bin, 0 int, 0 impl, 0 cont) and 1562 constraints
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c start presolving problem
0.00/0.03 c presolving:
0.09/0.17 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10280 impls, 200 clqs
0.19/0.29 c presolving (2 rounds):
0.19/0.29 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.29 c 10280 implications, 200 cliques
0.19/0.29 c presolved problem has 1460 variables (1460 bin, 0 int, 0 impl, 0 cont) and 1562 constraints
0.19/0.29 c 1 constraints of type <knapsack>
0.19/0.29 c 200 constraints of type <setppc>
0.19/0.29 c 1260 constraints of type <and>
0.19/0.29 c 1 constraints of type <linear>
0.19/0.29 c 100 constraints of type <logicor>
0.19/0.29 c transformed objective value is always integral (scale: 1)
0.19/0.29 c Presolving Time: 0.13
0.19/0.29 c SATUNSAT-NLC
0.19/0.29 c -----------------------------------------------------------------------------------------------
0.19/0.29 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c separating/flowcover/freq = c -1
0.19/0.29 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c separating/cmir/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/veclendiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/simplerounding/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/shifting/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/rounding/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.29 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.29 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/rootsoldiving/freq = c -1
0.19/0.29 c # number of nodes added to the contingent of the total nodes
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.29 c heuristics/rens/nodesofs = c 2000
0.19/0.29 c # minimum percentage of integer variables that have to be fixable
0.19/0.29 c # [type: real, range: [0,1], default: 0.5]
0.19/0.29 c heuristics/rens/minfixingrate = c 0.3
0.19/0.29 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c heuristics/rens/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/pscostdiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/oneopt/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.29 c # [type: real, range: [0,1], default: 0.01]
0.19/0.29 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.29 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/objpscostdiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/linesearchdiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/intshifting/freq = c -1
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/guideddiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/fracdiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.29 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/feaspump/freq = c -1
0.19/0.29 c # minimum percentage of integer variables that have to be fixed
0.19/0.29 c # [type: real, range: [0,1], default: 0.666]
0.19/0.29 c heuristics/crossover/minfixingrate = c 0.5
0.19/0.29 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.29 c # [type: real, range: [0,1], default: 0.1]
0.19/0.29 c heuristics/crossover/nodesquot = c 0.15
0.19/0.29 c # number of nodes without incumbent change that heuristic should wait
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.29 c heuristics/crossover/nwaitingnodes = c 100
0.19/0.29 c # number of nodes added to the contingent of the total nodes
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.29 c heuristics/crossover/nodesofs = c 750
0.19/0.29 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.29 c heuristics/crossover/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/coefdiving/freq = c -1
0.19/0.29 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c presolving/probing/maxrounds = c 0
0.19/0.29 c # should presolving try to simplify knapsacks
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.29 c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.29 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.29 c constraints/knapsack/disaggregation = c FALSE
0.19/0.29 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c constraints/knapsack/maxnumcardlift = c 0
0.19/0.29 c # should presolving try to simplify inequalities
0.19/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.30 c constraints/linear/simplifyinequalities = c TRUE
0.19/0.30 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.30 c separating/maxroundsroot = c 5
0.19/0.30 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.30 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.30 c separating/maxrounds = c 1
0.19/0.30 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.30 c limits/solutions = c 1
0.19/0.30 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.30 c limits/memory = c 1620
0.19/0.30 c # maximal time in seconds to run
0.19/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.30 c limits/time = c 1791
0.19/0.30 c # frequency for displaying node information lines
0.19/0.30 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.30 c display/freq = c 10000
0.19/0.30 c -----------------------------------------------------------------------------------------------
0.19/0.30 c start solving problem
0.19/0.30 c
0.29/0.33 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.33 c 0.2s| 1 | 0 | 92 |6549k| 0 | 60 |1460 |1562 |1562 |1460 |2822 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.55 c 0.4s| 1 | 0 | 129 |6580k| 0 | 62 |1460 |1562 |1562 |1460 |2824 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.89/0.92 c 0.7s| 1 | 0 | 158 |6662k| 0 | 64 |1460 |1562 |1562 |1460 |2825 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.29/1.34 c 1.1s| 1 | 0 | 172 |6743k| 0 | 62 |1460 |1562 |1562 |1460 |2826 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.80/1.80 c 1.6s| 1 | 0 | 198 |6810k| 0 | 62 |1460 |1562 |1562 |1460 |2827 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
2.29/2.34 c 2.1s| 1 | 0 | 212 |6860k| 0 | 62 |1460 |1562 |1562 |1460 |2828 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
3.89/3.95 c 3.7s| 1 | 2 | 212 |6861k| 0 | 62 |1460 |1562 |1562 |1460 |2828 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
4.89/4.90 c * 4.7s| 33 | 0 | 676 |6997k| 19 | - |1460 |1562 |1243 |1460 | 475 | 356 | 0 | 382 | 3.000000e+01 | 3.000000e+01 | 0.00%
4.89/4.90 c
4.89/4.90 c SCIP Status : problem is solved [optimal solution found]
4.89/4.90 c Solving Time (sec) : 4.67
4.89/4.90 c Solving Nodes : 33
4.89/4.90 c Primal Bound : +3.00000000000000e+01 (1 solutions)
4.89/4.90 c Dual Bound : +3.00000000000000e+01
4.89/4.90 c Gap : 0.00 %
4.89/4.90 c NODE 33
4.89/4.90 c DUAL BOUND 30
4.89/4.90 c PRIMAL BOUND 30
4.89/4.90 c GAP 0
4.89/4.90 s SATISFIABLE
4.89/4.90 v -x179 -x159 -x121 -x148 -x151 -x132 -x175 -x193 -x195 -x136 -x184 -x112 -x147 -x119 -x156 -x182 -x141 -x127 -x134 -x186 -x171 -x135
4.89/4.90 v -x169 -x118 -x117 -x144 -x106 -x133 -x113 -x163 -x124 -x167 -x200 -x145 -x105 -x181 -x142 -x108 -x115 -x107 -x129 -x158
4.89/4.90 v -x185 -x172 -x161 -x160 -x139 -x137 -x109 -x198 -x153 -x183 -x187 -x114 -x196 x188 x154 -x140 -x126 -x104 -x197 x111 -x192 -x116
4.89/4.90 v -x170 x173 x102 -x166 -x152 x149 x130 -x125 -x110 -x103 x131 -x168 -x174 -x155 -x138 -x194 -x150 x180 x143 x101 -x190 x177
4.89/4.90 v x164 -x157 x123 -x122 -x128 -x146 -x178 -x165 -x199 -x162 -x176 -x189 -x120 x191 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
4.89/4.90 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
4.89/4.90 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
4.89/4.90 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
4.89/4.90 v -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 x4 -x3 -x2 -x1
4.89/4.90 c SCIP Status : problem is solved [optimal solution found]
4.89/4.90 c Solving Time : 4.67
4.89/4.90 c Original Problem :
4.89/4.90 c Problem name : HOME/instance-1870594-1245213315.opb
4.89/4.90 c Variables : 1460 (1460 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.90 c Constraints : 1562 initial, 1562 maximal
4.89/4.90 c Presolved Problem :
4.89/4.90 c Problem name : t_HOME/instance-1870594-1245213315.opb
4.89/4.90 c Variables : 1460 (1460 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.90 c Constraints : 1562 initial, 1562 maximal
4.89/4.90 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.89/4.90 c trivial : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c dualfix : 0.01 0 0 0 0 0 0 0 0
4.89/4.90 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c implics : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c probing : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c knapsack : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c setppc : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c and : 0.10 0 0 0 0 0 0 0 0
4.89/4.90 c linear : 0.01 0 0 0 0 0 0 0 0
4.89/4.90 c logicor : 0.00 0 0 0 0 0 0 0 0
4.89/4.90 c root node : - 0 - - 0 - - - -
4.89/4.90 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.89/4.90 c integral : 0 0 0 36 0 0 0 0 0 64
4.89/4.90 c knapsack : 1 5 86 4 0 0 0 0 0 0
4.89/4.90 c setppc : 200 5 86 4 0 0 0 0 0 0
4.89/4.90 c and : 1260 37 86 4 0 0 486 350 0 0
4.89/4.90 c linear : 1 5 86 1 0 0 0 0 0 0
4.89/4.90 c logicor : 100 5 23 1 0 0 21 0 0 0
4.89/4.90 c countsols : 0 0 0 1 0 0 0 0 0 0
4.89/4.90 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.89/4.90 c integral : 2.34 0.00 0.00 2.34 0.00
4.89/4.90 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.89/4.90 c setppc : 0.00 0.00 0.00 0.00 0.00
4.89/4.90 c and : 0.03 0.02 0.01 0.00 0.00
4.89/4.90 c linear : 0.00 0.00 0.00 0.00 0.00
4.89/4.90 c logicor : 0.00 0.00 0.00 0.00 0.00
4.89/4.90 c countsols : 0.00 0.00 0.00 0.00 0.00
4.89/4.90 c Propagators : Time Calls Cutoffs DomReds
4.89/4.90 c rootredcost : 0.00 0 0 0
4.89/4.90 c pseudoobj : 0.01 87 0 0
4.89/4.90 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.89/4.90 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.90 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.90 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.90 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.90 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.90 c applied globally : - - - 0 0.0 - - -
4.89/4.90 c applied locally : - - - 0 0.0 - - -
4.89/4.90 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.89/4.90 c cut pool : 0.00 4 - - 19 - (maximal pool size: 41)
4.89/4.90 c redcost : 0.00 37 0 0 0 0
4.89/4.90 c impliedbounds : 0.00 5 0 0 0 0
4.89/4.90 c intobj : 0.00 0 0 0 0 0
4.89/4.90 c gomory : 1.12 5 0 0 665 0
4.89/4.90 c strongcg : 0.76 5 0 0 2089 0
4.89/4.90 c cmir : 0.00 0 0 0 0 0
4.89/4.90 c flowcover : 0.00 0 0 0 0 0
4.89/4.90 c clique : 0.00 5 0 0 0 0
4.89/4.90 c zerohalf : 0.00 0 0 0 0 0
4.89/4.90 c mcf : 0.01 1 0 0 0 0
4.89/4.90 c Pricers : Time Calls Vars
4.89/4.90 c problem variables: 0.00 0 0
4.89/4.90 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.89/4.90 c relpscost : 2.34 32 0 0 0 0 64
4.89/4.90 c pscost : 0.00 0 0 0 0 0 0
4.89/4.90 c inference : 0.00 0 0 0 0 0 0
4.89/4.90 c mostinf : 0.00 0 0 0 0 0 0
4.89/4.90 c leastinf : 0.00 0 0 0 0 0 0
4.89/4.90 c fullstrong : 0.00 0 0 0 0 0 0
4.89/4.90 c allfullstrong : 0.00 0 0 0 0 0 0
4.89/4.90 c random : 0.00 0 0 0 0 0 0
4.89/4.90 c Primal Heuristics : Time Calls Found
4.89/4.90 c LP solutions : 0.00 - 1
4.89/4.90 c pseudo solutions : 0.00 - 0
4.89/4.90 c simplerounding : 0.00 0 0
4.89/4.90 c rounding : 0.00 0 0
4.89/4.90 c shifting : 0.00 0 0
4.89/4.90 c intshifting : 0.00 0 0
4.89/4.90 c oneopt : 0.00 0 0
4.89/4.90 c fixandinfer : 0.00 0 0
4.89/4.90 c feaspump : 0.00 0 0
4.89/4.90 c coefdiving : 0.00 0 0
4.89/4.90 c pscostdiving : 0.00 0 0
4.89/4.90 c fracdiving : 0.00 0 0
4.89/4.90 c veclendiving : 0.00 0 0
4.89/4.90 c intdiving : 0.00 0 0
4.89/4.90 c actconsdiving : 0.00 0 0
4.89/4.90 c objpscostdiving : 0.00 0 0
4.89/4.90 c rootsoldiving : 0.00 0 0
4.89/4.90 c linesearchdiving : 0.00 0 0
4.89/4.90 c guideddiving : 0.00 0 0
4.89/4.90 c octane : 0.00 0 0
4.89/4.90 c rens : 0.00 0 0
4.89/4.90 c rins : 0.00 0 0
4.89/4.90 c localbranching : 0.00 0 0
4.89/4.90 c mutation : 0.00 0 0
4.89/4.90 c crossover : 0.00 0 0
4.89/4.90 c dins : 0.00 0 0
4.89/4.90 c LP : Time Calls Iterations Iter/call Iter/sec
4.89/4.90 c primal LP : 0.01 0 0 0.00 0.00
4.89/4.90 c dual LP : 0.17 70 676 9.66 3976.47
4.89/4.90 c barrier LP : 0.00 0 0 0.00 -
4.89/4.90 c diving/probing LP: 0.00 0 0 0.00 -
4.89/4.90 c strong branching : 2.33 382 6929 18.14 2973.82
4.89/4.90 c (at root node) : - 33 4108 124.48 -
4.89/4.90 c conflict analysis: 0.00 0 0 0.00 -
4.89/4.90 c B&B Tree :
4.89/4.90 c number of runs : 1
4.89/4.90 c nodes : 33
4.89/4.90 c nodes (total) : 33
4.89/4.90 c nodes left : 0
4.89/4.90 c max depth : 19
4.89/4.90 c max depth (total): 19
4.89/4.90 c backtracks : 1 (3.0%)
4.89/4.90 c delayed cutoffs : 0
4.89/4.90 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.89/4.90 c avg switch length: 2.00
4.89/4.90 c switching time : 0.02
4.89/4.90 c Solution :
4.89/4.90 c Solutions found : 1 (1 improvements)
4.89/4.90 c Primal Bound : +3.00000000000000e+01 (in run 1, after 33 nodes, 4.67 seconds, depth 19, found by <relaxation>)
4.89/4.90 c Dual Bound : +3.00000000000000e+01
4.89/4.90 c Gap : 0.00 %
4.89/4.90 c Root Dual Bound : +3.00000000000000e+01
4.89/4.92 c Time complete: 4.91.