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-1870650-1245214956.opb>
0.00/0.02 c original problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1554 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, 10216 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 10216 implications, 200 cliques
0.29/0.32 c presolved problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1554 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 1252 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.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 | 96 |6512k| 0 | 54 |1452 |1554 |1554 |1452 |2806 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.55 c 0.3s| 1 | 0 | 102 |6529k| 0 | 54 |1452 |1554 |1554 |1452 |2807 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.75 c 0.6s| 1 | 0 | 107 |6566k| 0 | 55 |1452 |1554 |1554 |1452 |2808 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.99/1.08 c 0.9s| 1 | 0 | 113 |6638k| 0 | 56 |1452 |1554 |1554 |1452 |2809 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.49/1.52 c 1.3s| 1 | 0 | 121 |6658k| 0 | 56 |1452 |1554 |1554 |1452 |2810 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.89/1.99 c 1.8s| 1 | 0 | 130 |6718k| 0 | 56 |1452 |1554 |1554 |1452 |2811 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
2.89/2.92 c 2.7s| 1 | 2 | 130 |6718k| 0 | 56 |1452 |1554 |1554 |1452 |2811 | 5 | 0 | 33 | 3.000000e+01 | -- | Inf
3.69/3.72 c * 3.5s| 25 | 0 | 560 |6862k| 22 | - |1452 |1556 |1217 |1452 | 524 | 319 | 2 | 256 | 3.000000e+01 | 3.000000e+01 | 0.00%
3.69/3.72 c
3.69/3.72 c SCIP Status : problem is solved [optimal solution found]
3.69/3.72 c Solving Time (sec) : 3.47
3.69/3.72 c Solving Nodes : 25
3.69/3.72 c Primal Bound : +3.00000000000000e+01 (1 solutions)
3.69/3.72 c Dual Bound : +3.00000000000000e+01
3.69/3.72 c Gap : 0.00 %
3.69/3.72 c NODE 25
3.69/3.72 c DUAL BOUND 30
3.69/3.72 c PRIMAL BOUND 30
3.69/3.72 c GAP 0
3.69/3.72 s SATISFIABLE
3.69/3.72 v -x148 -x139 -x160 -x157 -x183 -x131 -x156 -x196 -x165 -x122 -x198 -x197 x170 -x113 -x163 -x158 -x130 -x126 -x125 -x119 -x159 -x192
3.69/3.72 v -x195 -x144 -x142 -x120 -x164 -x175 -x107 -x181 -x118 -x188 -x145 -x191 -x151 -x169 -x134 -x117 x143 -x190 -x186 -x116 -x124
3.69/3.72 v -x136 -x104 -x193 -x179 -x140 -x108 -x138 -x154 -x172 -x162 -x200 -x109 x103 -x194 -x178 -x146 -x141 -x137 -x185 -x128 -x147
3.69/3.72 v -x168 -x153 -x184 -x180 x102 -x171 -x135 -x114 -x110 -x105 x106 x115 -x187 -x129 -x199 x161 x127 x101 -x189 -x167 x155 -x152
3.69/3.72 v -x149 -x132 x123 -x112 -x182 x174 -x150 -x121 x133 -x177 x173 -x111 -x166 x176 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
3.69/3.72 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.69/3.72 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.69/3.72 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.69/3.72 v -x14 -x13 -x12 -x11 -x10 x9 x8 -x7 -x6 -x5 x4 -x3 -x2 -x1
3.69/3.72 c SCIP Status : problem is solved [optimal solution found]
3.69/3.72 c Solving Time : 3.47
3.69/3.72 c Original Problem :
3.69/3.72 c Problem name : HOME/instance-1870650-1245214956.opb
3.69/3.72 c Variables : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.72 c Constraints : 1554 initial, 1554 maximal
3.69/3.72 c Presolved Problem :
3.69/3.72 c Problem name : t_HOME/instance-1870650-1245214956.opb
3.69/3.72 c Variables : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.72 c Constraints : 1554 initial, 1556 maximal
3.69/3.72 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.69/3.72 c trivial : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c implics : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c probing : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c setppc : 0.00 0 0 0 0 0 0 0 0
3.69/3.72 c and : 0.10 0 0 0 0 0 0 0 0
3.69/3.72 c linear : 0.01 0 0 0 0 0 0 0 0
3.69/3.72 c logicor : 0.01 0 0 0 0 0 0 0 0
3.69/3.72 c root node : - 0 - - 0 - - - -
3.69/3.72 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.69/3.72 c integral : 0 0 0 66 0 0 0 0 0 44
3.69/3.72 c knapsack : 1 5 76 44 0 0 0 0 0 0
3.69/3.72 c setppc : 200 5 76 44 0 2 42 0 0 0
3.69/3.72 c and : 1252 27 74 44 0 0 308 314 0 0
3.69/3.72 c linear : 1 5 74 1 0 0 0 0 0 0
3.69/3.72 c logicor : 100+ 5 29 1 0 0 17 0 0 0
3.69/3.72 c countsols : 0 0 0 1 0 0 0 0 0 0
3.69/3.72 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.69/3.72 c integral : 1.49 0.00 0.00 1.49 0.00
3.69/3.72 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.69/3.72 c setppc : 0.00 0.00 0.00 0.00 0.00
3.69/3.72 c and : 0.04 0.03 0.00 0.01 0.00
3.69/3.72 c linear : 0.00 0.00 0.00 0.00 0.00
3.69/3.72 c logicor : 0.00 0.00 0.00 0.00 0.00
3.69/3.72 c countsols : 0.00 0.00 0.00 0.00 0.00
3.69/3.72 c Propagators : Time Calls Cutoffs DomReds
3.69/3.72 c rootredcost : 0.00 0 0 0
3.69/3.72 c pseudoobj : 0.01 77 0 0
3.69/3.72 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.69/3.72 c propagation : 0.00 2 2 2 3.0 0 0.0 -
3.69/3.72 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.72 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.72 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.72 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.69/3.72 c applied globally : - - - 2 3.0 - - -
3.69/3.72 c applied locally : - - - 0 0.0 - - -
3.69/3.72 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.69/3.72 c cut pool : 0.00 4 - - 5 - (maximal pool size: 30)
3.69/3.72 c redcost : 0.00 27 0 0 0 0
3.69/3.72 c impliedbounds : 0.00 5 0 0 0 0
3.69/3.72 c intobj : 0.00 0 0 0 0 0
3.69/3.72 c gomory : 0.89 5 0 0 1045 0
3.69/3.72 c strongcg : 0.64 5 0 0 2009 0
3.69/3.72 c cmir : 0.00 0 0 0 0 0
3.69/3.72 c flowcover : 0.00 0 0 0 0 0
3.69/3.72 c clique : 0.00 5 0 0 0 0
3.69/3.72 c zerohalf : 0.00 0 0 0 0 0
3.69/3.72 c mcf : 0.00 1 0 0 0 0
3.69/3.72 c Pricers : Time Calls Vars
3.69/3.72 c problem variables: 0.00 0 0
3.69/3.72 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.69/3.72 c relpscost : 1.49 22 0 0 0 0 44
3.69/3.72 c pscost : 0.00 0 0 0 0 0 0
3.69/3.72 c inference : 0.00 0 0 0 0 0 0
3.69/3.72 c mostinf : 0.00 0 0 0 0 0 0
3.69/3.72 c leastinf : 0.00 0 0 0 0 0 0
3.69/3.72 c fullstrong : 0.00 0 0 0 0 0 0
3.69/3.72 c allfullstrong : 0.00 0 0 0 0 0 0
3.69/3.72 c random : 0.00 0 0 0 0 0 0
3.69/3.72 c Primal Heuristics : Time Calls Found
3.69/3.72 c LP solutions : 0.00 - 1
3.69/3.72 c pseudo solutions : 0.00 - 0
3.69/3.72 c simplerounding : 0.00 0 0
3.69/3.72 c rounding : 0.00 0 0
3.69/3.72 c shifting : 0.00 0 0
3.69/3.72 c intshifting : 0.00 0 0
3.69/3.72 c oneopt : 0.00 0 0
3.69/3.72 c fixandinfer : 0.00 0 0
3.69/3.72 c feaspump : 0.00 0 0
3.69/3.72 c coefdiving : 0.00 0 0
3.69/3.72 c pscostdiving : 0.00 0 0
3.69/3.72 c fracdiving : 0.00 0 0
3.69/3.72 c veclendiving : 0.00 0 0
3.69/3.72 c intdiving : 0.00 0 0
3.69/3.72 c actconsdiving : 0.00 0 0
3.69/3.72 c objpscostdiving : 0.00 0 0
3.69/3.72 c rootsoldiving : 0.00 0 0
3.69/3.72 c linesearchdiving : 0.00 0 0
3.69/3.72 c guideddiving : 0.00 0 0
3.69/3.72 c octane : 0.00 0 0
3.69/3.72 c rens : 0.00 0 0
3.69/3.72 c rins : 0.00 0 0
3.69/3.72 c localbranching : 0.00 0 0
3.69/3.72 c mutation : 0.00 0 0
3.69/3.72 c crossover : 0.00 0 0
3.69/3.72 c dins : 0.00 0 0
3.69/3.72 c LP : Time Calls Iterations Iter/call Iter/sec
3.69/3.72 c primal LP : 0.01 0 0 0.00 0.00
3.69/3.72 c dual LP : 0.14 93 560 6.02 4000.00
3.69/3.72 c barrier LP : 0.00 0 0 0.00 -
3.69/3.72 c diving/probing LP: 0.00 0 0 0.00 -
3.69/3.72 c strong branching : 1.49 256 4611 18.01 3094.63
3.69/3.72 c (at root node) : - 33 2192 66.42 -
3.69/3.72 c conflict analysis: 0.00 0 0 0.00 -
3.69/3.72 c B&B Tree :
3.69/3.72 c number of runs : 1
3.69/3.72 c nodes : 25
3.69/3.72 c nodes (total) : 25
3.69/3.72 c nodes left : 0
3.69/3.72 c max depth : 22
3.69/3.72 c max depth (total): 22
3.69/3.72 c backtracks : 0 (0.0%)
3.69/3.72 c delayed cutoffs : 0
3.69/3.72 c repropagations : 14 (31 domain reductions, 0 cutoffs)
3.69/3.72 c avg switch length: 2.96
3.69/3.72 c switching time : 0.03
3.69/3.72 c Solution :
3.69/3.72 c Solutions found : 1 (1 improvements)
3.69/3.72 c Primal Bound : +3.00000000000000e+01 (in run 1, after 25 nodes, 3.47 seconds, depth 22, found by <relaxation>)
3.69/3.72 c Dual Bound : +3.00000000000000e+01
3.69/3.72 c Gap : 0.00 %
3.69/3.72 c Root Dual Bound : +3.00000000000000e+01
3.69/3.74 c Time complete: 3.74.