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-1870583-1245212649.opb>
0.00/0.02 c original problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 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, 10152 impls, 200 clqs
0.20/0.29 c presolving (2 rounds):
0.20/0.29 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.20/0.29 c 10152 implications, 200 cliques
0.20/0.29 c presolved problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 constraints
0.20/0.29 c 1 constraints of type <knapsack>
0.20/0.29 c 200 constraints of type <setppc>
0.20/0.29 c 1244 constraints of type <and>
0.20/0.29 c 1 constraints of type <linear>
0.20/0.29 c 100 constraints of type <logicor>
0.20/0.29 c transformed objective value is always integral (scale: 1)
0.20/0.29 c Presolving Time: 0.11
0.20/0.30 c SATUNSAT-NLC
0.20/0.30 c -----------------------------------------------------------------------------------------------
0.20/0.30 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.30 c separating/flowcover/freq = c -1
0.20/0.30 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.30 c separating/cmir/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/veclendiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/veclendiving/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.30 c heuristics/simplerounding/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/shifting/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.30 c heuristics/rounding/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.20/0.30 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.20/0.30 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.30 c heuristics/rootsoldiving/freq = c -1
0.20/0.30 c # number of nodes added to the contingent of the total nodes
0.20/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.20/0.30 c heuristics/rens/nodesofs = c 2000
0.20/0.30 c # minimum percentage of integer variables that have to be fixable
0.20/0.30 c # [type: real, range: [0,1], default: 0.5]
0.20/0.30 c heuristics/rens/minfixingrate = c 0.3
0.20/0.30 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.30 c heuristics/rens/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/pscostdiving/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.30 c heuristics/oneopt/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to total iteration number
0.20/0.30 c # [type: real, range: [0,1], default: 0.01]
0.20/0.30 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.20/0.30 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.30 c heuristics/objpscostdiving/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/linesearchdiving/freq = c -1
0.20/0.30 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/intshifting/freq = c -1
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/intdiving/maxlpiterquot = c 0.075
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/guideddiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/guideddiving/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/fracdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/fracdiving/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/feaspump/maxlpiterofs = c 2000
0.20/0.30 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.30 c heuristics/feaspump/freq = c -1
0.20/0.30 c # minimum percentage of integer variables that have to be fixed
0.20/0.30 c # [type: real, range: [0,1], default: 0.666]
0.20/0.30 c heuristics/crossover/minfixingrate = c 0.5
0.20/0.30 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.20/0.30 c # [type: real, range: [0,1], default: 0.1]
0.20/0.30 c heuristics/crossover/nodesquot = c 0.15
0.20/0.30 c # number of nodes without incumbent change that heuristic should wait
0.20/0.30 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.20/0.30 c heuristics/crossover/nwaitingnodes = c 100
0.20/0.30 c # number of nodes added to the contingent of the total nodes
0.20/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.20/0.30 c heuristics/crossover/nodesofs = c 750
0.20/0.30 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 30]
0.20/0.30 c heuristics/crossover/freq = c -1
0.20/0.30 c # additional number of allowed LP iterations
0.20/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.30 c heuristics/coefdiving/maxlpiterofs = c 1500
0.20/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.30 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.20/0.30 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.30 c heuristics/coefdiving/freq = c -1
0.20/0.30 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c presolving/probing/maxrounds = c 0
0.20/0.30 c # should presolving try to simplify knapsacks
0.20/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.20/0.30 c constraints/knapsack/simplifyinequalities = c TRUE
0.20/0.30 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.20/0.30 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.20/0.30 c constraints/knapsack/disaggregation = c FALSE
0.20/0.30 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c constraints/knapsack/maxnumcardlift = c 0
0.20/0.30 c # should presolving try to simplify inequalities
0.20/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.20/0.30 c constraints/linear/simplifyinequalities = c TRUE
0.20/0.30 c # maximal number of separation rounds in the root node (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c separating/maxroundsroot = c 5
0.20/0.30 c # maximal number of separation rounds per node (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 5]
0.20/0.30 c separating/maxrounds = c 1
0.20/0.30 c # solving stops, if the given number of solutions were found (-1: no limit)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c limits/solutions = c 1
0.20/0.30 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.20/0.30 c limits/memory = c 1620
0.20/0.30 c # maximal time in seconds to run
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.20/0.30 c limits/time = c 1791
0.20/0.30 c # frequency for displaying node information lines
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 100]
0.20/0.30 c display/freq = c 10000
0.20/0.30 c -----------------------------------------------------------------------------------------------
0.20/0.30 c start solving problem
0.20/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.1s| 1 | 0 | 81 |6480k| 0 | 44 |1444 |1546 |1546 |1444 |2790 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.52 c 0.3s| 1 | 0 | 104 |6499k| 0 | 50 |1444 |1546 |1546 |1444 |2791 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.70/0.75 c 0.6s| 1 | 0 | 117 |6574k| 0 | 55 |1444 |1546 |1546 |1444 |2793 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.09/1.15 c 0.9s| 1 | 0 | 124 |6618k| 0 | 63 |1444 |1546 |1546 |1444 |2794 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.59/1.63 c 1.4s| 1 | 0 | 128 |6649k| 0 | 55 |1444 |1546 |1546 |1444 |2795 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
2.09/2.15 c 1.9s| 1 | 0 | 140 |6716k| 0 | 57 |1444 |1546 |1546 |1444 |2796 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
2.99/3.06 c 2.9s| 1 | 2 | 140 |6716k| 0 | 57 |1444 |1546 |1546 |1444 |2796 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
3.40/3.42 c * 3.2s| 14 | 12 | 398 |7061k| 13 | - |1444 |1546 | 553 |1444 | 449 | 152 | 0 | 200 | 3.000000e+01 | 3.300000e+01 | 10.00%
3.40/3.42 c
3.40/3.42 c SCIP Status : solving was interrupted [solution limit reached]
3.40/3.42 c Solving Time (sec) : 3.21
3.40/3.42 c Solving Nodes : 14
3.40/3.42 c Primal Bound : +3.30000000000000e+01 (1 solutions)
3.40/3.42 c Dual Bound : +3.00000000000000e+01
3.40/3.42 c Gap : 10.00 %
3.40/3.42 c NODE 14
3.40/3.42 c DUAL BOUND 30
3.40/3.42 c PRIMAL BOUND 33
3.40/3.42 c GAP 0.1
3.40/3.42 s SATISFIABLE
3.40/3.42 v x166 -x164 -x158 -x163 -x121 -x171 -x113 -x156 -x144 -x135 -x152 -x161 -x122 -x130 -x157 -x146 -x181 -x129 x111 x192 -x167 x154
3.40/3.42 v -x185 -x127 -x117 -x184 -x120 -x124 -x134 -x178 -x168 -x136 -x172 -x110 -x187 -x190 -x200 -x105 -x151 -x131 -x109 -x106 -x183
3.40/3.42 v -x153 -x182 -x189 -x149 x195 -x104 -x198 -x193 x188 x128 -x119 x112 x191 x179 -x162 -x107 -x137 -x115 -x175 -x145 -x132 -x108
3.40/3.42 v -x199 x138 -x148 -x174 -x139 -x143 -x197 -x180 -x160 -x155 -x150 -x118 -x114 -x116 -x196 -x176 -x142 -x103 -x140 -x194 -x125
3.40/3.42 v -x101 -x170 x133 -x123 -x159 -x165 -x102 -x177 x173 -x126 -x141 x169 x186 -x147 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
3.40/3.42 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.40/3.42 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.40/3.42 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.40/3.42 v x14 x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 x2 -x1
3.40/3.42 c SCIP Status : solving was interrupted [solution limit reached]
3.40/3.42 c Solving Time : 3.21
3.40/3.42 c Original Problem :
3.40/3.42 c Problem name : HOME/instance-1870583-1245212649.opb
3.40/3.42 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
3.40/3.42 c Constraints : 1546 initial, 1546 maximal
3.40/3.42 c Presolved Problem :
3.40/3.42 c Problem name : t_HOME/instance-1870583-1245212649.opb
3.40/3.42 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
3.40/3.42 c Constraints : 1546 initial, 1546 maximal
3.40/3.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.40/3.42 c trivial : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c implics : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c probing : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c setppc : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c and : 0.10 0 0 0 0 0 0 0 0
3.40/3.42 c linear : 0.01 0 0 0 0 0 0 0 0
3.40/3.42 c logicor : 0.00 0 0 0 0 0 0 0 0
3.40/3.42 c root node : - 0 - - 0 - - - -
3.40/3.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.40/3.42 c integral : 0 0 0 17 0 0 0 0 0 26
3.40/3.42 c knapsack : 1 5 39 4 0 0 0 0 0 0
3.40/3.42 c setppc : 200 5 39 4 0 0 75 0 0 0
3.40/3.42 c and : 1244 18 39 4 0 0 889 146 0 0
3.40/3.42 c linear : 1 5 39 1 0 0 0 0 0 0
3.40/3.42 c logicor : 100 5 12 1 0 0 10 0 0 0
3.40/3.42 c countsols : 0 0 0 1 0 0 0 0 0 0
3.40/3.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.40/3.42 c integral : 1.11 0.00 0.00 1.11 0.00
3.40/3.42 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.40/3.42 c setppc : 0.00 0.00 0.00 0.00 0.00
3.40/3.42 c and : 0.01 0.00 0.01 0.00 0.00
3.40/3.42 c linear : 0.00 0.00 0.00 0.00 0.00
3.40/3.42 c logicor : 0.00 0.00 0.00 0.00 0.00
3.40/3.42 c countsols : 0.00 0.00 0.00 0.00 0.00
3.40/3.42 c Propagators : Time Calls Cutoffs DomReds
3.40/3.42 c rootredcost : 0.00 0 0 0
3.40/3.42 c pseudoobj : 0.01 40 0 0
3.40/3.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.40/3.42 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.40/3.42 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.40/3.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.40/3.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.40/3.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.40/3.42 c applied globally : - - - 0 0.0 - - -
3.40/3.42 c applied locally : - - - 0 0.0 - - -
3.40/3.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.40/3.42 c cut pool : 0.00 4 - - 8 - (maximal pool size: 31)
3.40/3.42 c redcost : 0.00 18 0 0 0 0
3.40/3.42 c impliedbounds : 0.00 5 0 0 0 0
3.40/3.42 c intobj : 0.00 0 0 0 0 0
3.40/3.42 c gomory : 0.95 5 0 0 1001 0
3.40/3.42 c strongcg : 0.77 5 0 0 2499 0
3.40/3.42 c cmir : 0.00 0 0 0 0 0
3.40/3.42 c flowcover : 0.00 0 0 0 0 0
3.40/3.42 c clique : 0.01 5 0 0 0 0
3.40/3.42 c zerohalf : 0.00 0 0 0 0 0
3.40/3.42 c mcf : 0.01 1 0 0 0 0
3.40/3.42 c Pricers : Time Calls Vars
3.40/3.42 c problem variables: 0.00 0 0
3.40/3.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.40/3.42 c relpscost : 1.11 13 0 0 0 0 26
3.40/3.42 c pscost : 0.00 0 0 0 0 0 0
3.40/3.42 c inference : 0.00 0 0 0 0 0 0
3.40/3.42 c mostinf : 0.00 0 0 0 0 0 0
3.40/3.42 c leastinf : 0.00 0 0 0 0 0 0
3.40/3.42 c fullstrong : 0.00 0 0 0 0 0 0
3.40/3.42 c allfullstrong : 0.00 0 0 0 0 0 0
3.40/3.42 c random : 0.00 0 0 0 0 0 0
3.40/3.42 c Primal Heuristics : Time Calls Found
3.40/3.42 c LP solutions : 0.00 - 1
3.40/3.42 c pseudo solutions : 0.00 - 0
3.40/3.42 c simplerounding : 0.00 0 0
3.40/3.42 c rounding : 0.00 0 0
3.40/3.42 c shifting : 0.00 0 0
3.40/3.42 c intshifting : 0.00 0 0
3.40/3.42 c oneopt : 0.00 0 0
3.40/3.42 c fixandinfer : 0.00 0 0
3.40/3.42 c feaspump : 0.00 0 0
3.40/3.42 c coefdiving : 0.00 0 0
3.40/3.42 c pscostdiving : 0.00 0 0
3.40/3.42 c fracdiving : 0.00 0 0
3.40/3.42 c veclendiving : 0.00 0 0
3.40/3.42 c intdiving : 0.00 0 0
3.40/3.42 c actconsdiving : 0.00 0 0
3.40/3.42 c objpscostdiving : 0.00 0 0
3.40/3.42 c rootsoldiving : 0.00 0 0
3.40/3.42 c linesearchdiving : 0.00 0 0
3.40/3.42 c guideddiving : 0.00 0 0
3.40/3.42 c octane : 0.00 0 0
3.40/3.42 c rens : 0.00 0 0
3.40/3.42 c rins : 0.00 0 0
3.40/3.42 c localbranching : 0.00 0 0
3.40/3.42 c mutation : 0.00 0 0
3.40/3.42 c crossover : 0.00 0 0
3.40/3.42 c dins : 0.00 0 0
3.40/3.42 c LP : Time Calls Iterations Iter/call Iter/sec
3.40/3.42 c primal LP : 0.02 0 0 0.00 0.00
3.40/3.42 c dual LP : 0.15 35 398 11.37 2653.33
3.40/3.42 c barrier LP : 0.00 0 0 0.00 -
3.40/3.42 c diving/probing LP: 0.00 0 0 0.00 -
3.40/3.42 c strong branching : 1.11 200 4825 24.12 4346.85
3.40/3.42 c (at root node) : - 33 3259 98.76 -
3.40/3.42 c conflict analysis: 0.00 0 0 0.00 -
3.40/3.42 c B&B Tree :
3.40/3.42 c number of runs : 1
3.40/3.42 c nodes : 14
3.40/3.42 c nodes (total) : 14
3.40/3.42 c nodes left : 12
3.40/3.42 c max depth : 13
3.40/3.42 c max depth (total): 13
3.40/3.42 c backtracks : 0 (0.0%)
3.40/3.42 c delayed cutoffs : 0
3.40/3.42 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.40/3.42 c avg switch length: 1.00
3.40/3.42 c switching time : 0.03
3.40/3.42 c Solution :
3.40/3.42 c Solutions found : 1 (1 improvements)
3.40/3.42 c Primal Bound : +3.30000000000000e+01 (in run 1, after 14 nodes, 3.21 seconds, depth 13, found by <relaxation>)
3.40/3.42 c Dual Bound : +3.00000000000000e+01
3.40/3.42 c Gap : 10.00 %
3.40/3.42 c Root Dual Bound : +3.00000000000000e+01
3.40/3.44 c Time complete: 3.44.