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-1870620-1245214073.opb>
0.00/0.02 c original problem has 1448 variables (1448 bin, 0 int, 0 impl, 0 cont) and 1550 constraints
0.03/0.04 c No objective function, only one solution is needed.
0.03/0.04 c start presolving problem
0.03/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.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 10184 implications, 200 cliques
0.29/0.32 c presolved problem has 1448 variables (1448 bin, 0 int, 0 impl, 0 cont) and 1550 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 1248 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.13
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.37 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.37 c 0.2s| 1 | 0 | 101 |6498k| 0 | 58 |1448 |1550 |1550 |1448 |2798 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.58 c 0.4s| 1 | 0 | 108 |6526k| 0 | 58 |1448 |1550 |1550 |1448 |2800 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.68/0.78 c 0.6s| 1 | 0 | 127 |6559k| 0 | 60 |1448 |1550 |1550 |1448 |2801 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.09/1.16 c 0.9s| 1 | 0 | 160 |6615k| 0 | 61 |1448 |1550 |1550 |1448 |2802 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.59/1.63 c 1.4s| 1 | 0 | 183 |6753k| 0 | 61 |1448 |1550 |1550 |1448 |2803 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
2.09/2.16 c 1.9s| 1 | 0 | 219 |6864k| 0 | 60 |1448 |1550 |1550 |1448 |2804 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
4.29/4.32 c 4.1s| 1 | 2 | 219 |6865k| 0 | 60 |1448 |1550 |1550 |1448 |2804 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
4.88/4.91 c * 4.7s| 14 | 0 | 473 |6951k| 12 | - |1448 |1551 |1359 |1448 | 487 | 232 | 1 | 204 | 3.000000e+01 | 3.000000e+01 | 0.00%
4.88/4.91 c
4.88/4.91 c SCIP Status : problem is solved [optimal solution found]
4.88/4.91 c Solving Time (sec) : 4.65
4.88/4.91 c Solving Nodes : 14
4.88/4.91 c Primal Bound : +3.00000000000000e+01 (1 solutions)
4.88/4.91 c Dual Bound : +3.00000000000000e+01
4.88/4.91 c Gap : 0.00 %
4.88/4.91 c NODE 14
4.88/4.91 c DUAL BOUND 30
4.88/4.91 c PRIMAL BOUND 30
4.88/4.91 c GAP 0
4.88/4.91 s SATISFIABLE
4.88/4.91 v -x162 -x134 -x175 -x180 -x186 -x172 -x132 -x166 -x142 -x153 -x118 -x129 -x113 x140 -x161 -x133 -x200 -x152 -x195 -x119 -x189 -x177
4.88/4.91 v -x109 -x188 -x144 -x165 -x107 -x135 -x196 -x106 -x198 -x176 -x146 -x139 -x182 -x197 x105 -x158 -x147 -x145 -x126 -x121 x181
4.88/4.91 v -x192 -x114 -x171 x125 -x199 -x138 -x104 -x151 -x149 -x115 -x108 -x185 -x120 -x174 -x143 -x157 -x103 -x190 x155 x154 x148
4.88/4.91 v -x170 -x159 x123 -x124 -x183 -x130 -x168 -x102 x111 -x110 -x169 -x112 -x137 x173 -x141 -x127 -x164 -x191 -x128 -x101 -x179 -x167
4.88/4.91 v -x160 -x156 x131 -x117 -x163 -x122 -x150 x193 x136 -x194 -x116 -x178 x187 x184 -x100 -x99 -x98 -x97 x96 -x95 -x94 -x93 -x92
4.88/4.91 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.88/4.91 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.88/4.91 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.88/4.91 v -x14 -x13 x12 -x11 -x10 -x9 x8 -x7 x6 -x5 x4 -x3 -x2 -x1
4.88/4.91 c SCIP Status : problem is solved [optimal solution found]
4.88/4.91 c Solving Time : 4.65
4.88/4.91 c Original Problem :
4.88/4.91 c Problem name : HOME/instance-1870620-1245214073.opb
4.88/4.91 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
4.88/4.91 c Constraints : 1550 initial, 1550 maximal
4.88/4.91 c Presolved Problem :
4.88/4.91 c Problem name : t_HOME/instance-1870620-1245214073.opb
4.88/4.91 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
4.88/4.91 c Constraints : 1550 initial, 1551 maximal
4.88/4.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.88/4.91 c trivial : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c implics : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c probing : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c knapsack : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c setppc : 0.01 0 0 0 0 0 0 0 0
4.88/4.91 c and : 0.11 0 0 0 0 0 0 0 0
4.88/4.91 c linear : 0.01 0 0 0 0 0 0 0 0
4.88/4.91 c logicor : 0.00 0 0 0 0 0 0 0 0
4.88/4.91 c root node : - 0 - - 0 - - - -
4.88/4.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.88/4.91 c integral : 0 0 0 17 0 0 0 0 0 24
4.88/4.91 c knapsack : 1 5 38 5 0 0 0 0 0 0
4.88/4.91 c setppc : 200 5 38 5 0 1 11 0 0 0
4.88/4.91 c and : 1248 17 37 5 0 0 173 226 0 0
4.88/4.91 c linear : 1 5 37 1 0 0 0 0 0 0
4.88/4.91 c logicor : 100+ 5 12 1 0 0 9 0 0 0
4.88/4.91 c countsols : 0 0 0 1 0 0 0 0 0 0
4.88/4.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.88/4.91 c integral : 2.60 0.00 0.00 2.60 0.00
4.88/4.91 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.88/4.91 c setppc : 0.00 0.00 0.00 0.00 0.00
4.88/4.91 c and : 0.03 0.02 0.01 0.00 0.00
4.88/4.91 c linear : 0.00 0.00 0.00 0.00 0.00
4.88/4.91 c logicor : 0.00 0.00 0.00 0.00 0.00
4.88/4.91 c countsols : 0.00 0.00 0.00 0.00 0.00
4.88/4.91 c Propagators : Time Calls Cutoffs DomReds
4.88/4.91 c rootredcost : 0.00 0 0 0
4.88/4.91 c pseudoobj : 0.01 39 0 0
4.88/4.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.88/4.91 c propagation : 0.00 1 1 1 3.0 0 0.0 -
4.88/4.91 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.88/4.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.88/4.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.88/4.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.88/4.91 c applied globally : - - - 1 3.0 - - -
4.88/4.91 c applied locally : - - - 0 0.0 - - -
4.88/4.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.88/4.91 c cut pool : 0.00 4 - - 9 - (maximal pool size: 48)
4.88/4.91 c redcost : 0.01 17 0 0 0 0
4.88/4.91 c impliedbounds : 0.01 5 0 0 0 0
4.88/4.91 c intobj : 0.00 0 0 0 0 0
4.88/4.91 c gomory : 1.07 5 0 0 1004 0
4.88/4.91 c strongcg : 0.58 5 0 0 2500 0
4.88/4.91 c cmir : 0.00 0 0 0 0 0
4.88/4.91 c flowcover : 0.00 0 0 0 0 0
4.88/4.91 c clique : 0.01 5 0 0 0 0
4.88/4.91 c zerohalf : 0.00 0 0 0 0 0
4.88/4.91 c mcf : 0.00 1 0 0 0 0
4.88/4.91 c Pricers : Time Calls Vars
4.88/4.91 c problem variables: 0.00 0 0
4.88/4.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.88/4.91 c relpscost : 2.60 12 0 0 0 0 24
4.88/4.91 c pscost : 0.00 0 0 0 0 0 0
4.88/4.91 c inference : 0.00 0 0 0 0 0 0
4.88/4.91 c mostinf : 0.00 0 0 0 0 0 0
4.88/4.91 c leastinf : 0.00 0 0 0 0 0 0
4.88/4.91 c fullstrong : 0.00 0 0 0 0 0 0
4.88/4.91 c allfullstrong : 0.00 0 0 0 0 0 0
4.88/4.91 c random : 0.00 0 0 0 0 0 0
4.88/4.91 c Primal Heuristics : Time Calls Found
4.88/4.91 c LP solutions : 0.00 - 1
4.88/4.91 c pseudo solutions : 0.00 - 0
4.88/4.91 c simplerounding : 0.00 0 0
4.88/4.91 c rounding : 0.00 0 0
4.88/4.91 c shifting : 0.00 0 0
4.88/4.91 c intshifting : 0.00 0 0
4.88/4.91 c oneopt : 0.00 0 0
4.88/4.91 c fixandinfer : 0.00 0 0
4.88/4.91 c feaspump : 0.00 0 0
4.88/4.91 c coefdiving : 0.00 0 0
4.88/4.91 c pscostdiving : 0.00 0 0
4.88/4.91 c fracdiving : 0.00 0 0
4.88/4.91 c veclendiving : 0.00 0 0
4.88/4.91 c intdiving : 0.00 0 0
4.88/4.91 c actconsdiving : 0.00 0 0
4.88/4.91 c objpscostdiving : 0.00 0 0
4.88/4.91 c rootsoldiving : 0.00 0 0
4.88/4.91 c linesearchdiving : 0.00 0 0
4.88/4.91 c guideddiving : 0.00 0 0
4.88/4.91 c octane : 0.00 0 0
4.88/4.91 c rens : 0.00 0 0
4.88/4.91 c rins : 0.00 0 0
4.88/4.91 c localbranching : 0.00 0 0
4.88/4.91 c mutation : 0.00 0 0
4.88/4.91 c crossover : 0.00 0 0
4.88/4.91 c dins : 0.00 0 0
4.88/4.91 c LP : Time Calls Iterations Iter/call Iter/sec
4.88/4.91 c primal LP : 0.01 0 0 0.00 0.00
4.88/4.91 c dual LP : 0.12 34 473 13.91 3941.67
4.88/4.91 c barrier LP : 0.00 0 0 0.00 -
4.88/4.91 c diving/probing LP: 0.00 0 0 0.00 -
4.88/4.91 c strong branching : 2.60 204 6419 31.47 2468.85
4.88/4.91 c (at root node) : - 33 4544 137.70 -
4.88/4.91 c conflict analysis: 0.00 0 0 0.00 -
4.88/4.91 c B&B Tree :
4.88/4.91 c number of runs : 1
4.88/4.91 c nodes : 14
4.88/4.91 c nodes (total) : 14
4.88/4.91 c nodes left : 0
4.88/4.91 c max depth : 12
4.88/4.91 c max depth (total): 12
4.88/4.91 c backtracks : 0 (0.0%)
4.88/4.91 c delayed cutoffs : 0
4.88/4.91 c repropagations : 4 (16 domain reductions, 0 cutoffs)
4.88/4.91 c avg switch length: 2.43
4.88/4.91 c switching time : 0.01
4.88/4.91 c Solution :
4.88/4.91 c Solutions found : 1 (1 improvements)
4.88/4.91 c Primal Bound : +3.00000000000000e+01 (in run 1, after 14 nodes, 4.65 seconds, depth 12, found by <relaxation>)
4.88/4.91 c Dual Bound : +3.00000000000000e+01
4.88/4.91 c Gap : 0.00 %
4.88/4.91 c Root Dual Bound : +3.00000000000000e+01
4.88/4.94 c Time complete: 4.92.