0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2702875-1278575516.opb>
0.00/0.03 c original problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1554 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.03/0.04 c presolving:
0.09/0.12 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.09/0.18 c presolving (2 rounds):
0.09/0.18 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.18 c 10216 implications, 200 cliques
0.09/0.18 c presolved problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1554 constraints
0.09/0.18 c 1 constraints of type <knapsack>
0.09/0.18 c 300 constraints of type <setppc>
0.09/0.18 c 1252 constraints of type <and>
0.09/0.18 c 1 constraints of type <linear>
0.09/0.18 c transformed objective value is always integral (scale: 1)
0.09/0.18 c Presolving Time: 0.14
0.09/0.18 c - non default parameters ----------------------------------------------------------------------
0.09/0.18 c # SCIP version 1.2.1.3
0.09/0.18 c
0.09/0.18 c # frequency for displaying node information lines
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.18 c display/freq = 10000
0.09/0.18 c
0.09/0.18 c # maximal time in seconds to run
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/time = 1789.98
0.09/0.18 c
0.09/0.18 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.18 c limits/memory = 1620
0.09/0.18 c
0.09/0.18 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c limits/solutions = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.18 c separating/maxrounds = 1
0.09/0.18 c
0.09/0.18 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/maxroundsroot = 5
0.09/0.18 c
0.09/0.18 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.18 c # [type: int, range: [1,2], default: 1]
0.09/0.18 c timing/clocktype = 2
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify inequalities
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/linear/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/indicator/addCouplingCons = TRUE
0.09/0.18 c
0.09/0.18 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.18 c constraints/knapsack/disaggregation = FALSE
0.09/0.18 c
0.09/0.18 c # should presolving try to simplify knapsacks
0.09/0.18 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.18 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.18 c
0.09/0.18 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c presolving/probing/maxrounds = 0
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/coefdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.18 c heuristics/crossover/freq = -1
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/crossover/nodesofs = 750
0.09/0.18 c
0.09/0.18 c # number of nodes without incumbent change that heuristic should wait
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.18 c heuristics/crossover/nwaitingnodes = 100
0.09/0.18 c
0.09/0.18 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.18 c # [type: real, range: [0,1], default: 0.1]
0.09/0.18 c heuristics/crossover/nodesquot = 0.15
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixed
0.09/0.18 c # [type: real, range: [0,1], default: 0.666]
0.09/0.18 c heuristics/crossover/minfixingrate = 0.5
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/feaspump/freq = -1
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/fracdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/guideddiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/intshifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/linesearchdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/nlp/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/objpscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.18 c # [type: real, range: [0,1], default: 0.01]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/oneopt/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/pscostdiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/rens/freq = -1
0.09/0.18 c
0.09/0.18 c # minimum percentage of integer variables that have to be fixable
0.09/0.18 c # [type: real, range: [0,1], default: 0.5]
0.09/0.18 c heuristics/rens/minfixingrate = 0.3
0.09/0.18 c
0.09/0.18 c # number of nodes added to the contingent of the total nodes
0.09/0.18 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.18 c heuristics/rens/nodesofs = 2000
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.18 c heuristics/rootsoldiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/rounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/shifting/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/simplerounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c heuristics/trivial/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/trysol/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.18 c heuristics/veclendiving/freq = -1
0.09/0.18 c
0.09/0.18 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.18 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.18 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.18 c
0.09/0.18 c # additional number of allowed LP iterations
0.09/0.18 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.18 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.18 c
0.09/0.18 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.18 c heuristics/zirounding/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/cmir/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.18 c separating/flowcover/freq = -1
0.09/0.18 c
0.09/0.18 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.18 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.18 c separating/rapidlearning/freq = 0
0.09/0.18 c
0.09/0.18 c -----------------------------------------------------------------------------------------------
0.09/0.18 c start solving
0.09/0.18 c
0.19/0.23 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.23 c 0.2s| 1 | 0 | 154 | - |6550k| 0 | 77 |1452 |1554 |1452 |2806 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 185 | - |6909k| 0 | 80 |1452 |1554 |1452 |2815 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.31 c 1.3s| 1 | 0 | 237 | - |7250k| 0 | 91 |1452 |1554 |1452 |2823 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.66 c 1.6s| 1 | 0 | 263 | - |7515k| 0 | 96 |1452 |1554 |1452 |2830 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.08 c 2.0s| 1 | 0 | 285 | - |7899k| 0 | 97 |1452 |1554 |1452 |2832 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.51 c 2.5s| 1 | 0 | 297 | - |8271k| 0 | 96 |1452 |1554 |1452 |2837 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.86 c 2.8s| 1 | 2 | 297 | - |8271k| 0 | 96 |1452 |1554 |1452 |2837 | 31 | 0 | 10 | 0.000000e+00 | -- | Inf
3.79/3.88 c * 3.8s| 25 | 0 | 684 | 16.1 |8162k| 24 | - |1452 |1554 |1452 | 463 | 131 | 0 | 250 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.79/3.88 c
3.79/3.88 c SCIP Status : problem is solved [optimal solution found]
3.79/3.88 c Solving Time (sec) : 3.85
3.79/3.88 c Solving Nodes : 25
3.79/3.88 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.79/3.88 c Dual Bound : +0.00000000000000e+00
3.79/3.88 c Gap : 0.00 %
3.79/3.88 s SATISFIABLE
3.79/3.88 v -x148 -x139 -x160 -x157 -x183 -x131 -x156 -x196 -x165 -x122 -x198 -x197 -x170 -x113 -x163 -x158 -x130 -x126 -x125 -x119 -x159 -x192
3.79/3.88 v -x195 -x144 -x142 -x120 -x164 -x175 -x107 -x181 -x118 -x188 -x145 -x191 -x151 -x169 -x134 -x117 -x143 -x190 x186 -x116 x124
3.79/3.88 v -x136 -x104 -x193 -x179 -x140 -x108 -x138 -x154 -x172 -x162 -x200 -x109 x103 x194 x178 -x146 x141 -x137 -x185 -x128 -x147
3.79/3.88 v -x168 -x153 -x184 -x180 -x102 -x171 -x135 -x114 -x110 -x105 -x106 -x115 -x187 -x129 -x199 -x161 -x127 x101 -x189 x167 x155 -x152
3.79/3.88 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.79/3.88 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.79/3.88 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.79/3.88 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
3.79/3.88 v x15 -x14 -x13 -x12 -x11 x10 x9 x8 x7 -x6 -x5 x4 -x3 x2 -x1
3.79/3.88 c SCIP Status : problem is solved [optimal solution found]
3.79/3.88 c Solving Time : 3.85
3.79/3.88 c Original Problem :
3.79/3.88 c Problem name : HOME/instance-2702875-1278575516.opb
3.79/3.88 c Variables : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.88 c Constraints : 1554 initial, 1554 maximal
3.79/3.88 c Presolved Problem :
3.79/3.88 c Problem name : t_HOME/instance-2702875-1278575516.opb
3.79/3.88 c Variables : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.88 c Constraints : 1554 initial, 1554 maximal
3.79/3.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.79/3.88 c trivial : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c implics : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c probing : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c setppc : 0.00 0 0 0 0 0 0 0 0
3.79/3.88 c and : 0.12 0 0 0 0 0 0 0 0
3.79/3.88 c linear : 0.01 0 0 0 0 0 0 0 0
3.79/3.88 c root node : - 0 - - 0 - - - -
3.79/3.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.79/3.88 c integral : 0 0 0 27 0 0 2 0 0 48
3.79/3.88 c knapsack : 1 5 58 1 0 0 0 0 0 0
3.79/3.88 c setppc : 300 5 58 1 0 0 82 0 0 0
3.79/3.88 c and : 1252 29 58 1 0 0 914 105 0 0
3.79/3.88 c linear : 1 5 58 1 0 0 0 0 0 0
3.79/3.88 c countsols : 0 0 0 1 0 0 0 0 0 0
3.79/3.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.79/3.88 c integral : 1.23 0.00 0.00 1.23 0.00
3.79/3.88 c knapsack : 0.01 0.01 0.00 0.00 0.00
3.79/3.88 c setppc : 0.00 0.00 0.00 0.00 0.00
3.79/3.88 c and : 0.02 0.02 0.00 0.00 0.00
3.79/3.88 c linear : 0.00 0.00 0.00 0.00 0.00
3.79/3.88 c countsols : 0.00 0.00 0.00 0.00 0.00
3.79/3.88 c Propagators : Time Calls Cutoffs DomReds
3.79/3.88 c vbounds : 0.00 1 0 0
3.79/3.88 c rootredcost : 0.00 0 0 0
3.79/3.88 c pseudoobj : 0.00 0 0 0
3.79/3.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.79/3.88 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.79/3.88 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.79/3.88 c applied globally : - - - 0 0.0 - - -
3.79/3.88 c applied locally : - - - 0 0.0 - - -
3.79/3.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.79/3.88 c cut pool : 0.00 4 - - 64 - (maximal pool size: 357)
3.79/3.88 c redcost : 0.00 29 0 0 0 0
3.79/3.88 c impliedbounds : 0.00 5 0 0 12 0
3.79/3.88 c intobj : 0.00 0 0 0 0 0
3.79/3.88 c cgmip : 0.00 0 0 0 0 0
3.79/3.88 c gomory : 1.10 5 0 0 57 0
3.79/3.88 c strongcg : 0.64 5 0 0 2500 0
3.79/3.88 c cmir : 0.00 0 0 0 0 0
3.79/3.88 c flowcover : 0.00 0 0 0 0 0
3.79/3.88 c clique : 0.01 5 0 0 22 0
3.79/3.88 c zerohalf : 0.00 0 0 0 0 0
3.79/3.88 c mcf : 0.00 1 0 0 0 0
3.79/3.88 c rapidlearning : 0.43 1 0 0 0 0
3.79/3.88 c Pricers : Time Calls Vars
3.79/3.88 c problem variables: 0.00 0 0
3.79/3.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.79/3.88 c relpscost : 1.23 26 0 2 0 0 48
3.79/3.88 c pscost : 0.00 0 0 0 0 0 0
3.79/3.88 c inference : 0.00 0 0 0 0 0 0
3.79/3.88 c mostinf : 0.00 0 0 0 0 0 0
3.79/3.88 c leastinf : 0.00 0 0 0 0 0 0
3.79/3.88 c fullstrong : 0.00 0 0 0 0 0 0
3.79/3.88 c allfullstrong : 0.00 0 0 0 0 0 0
3.79/3.88 c random : 0.00 0 0 0 0 0 0
3.79/3.88 c Primal Heuristics : Time Calls Found
3.79/3.88 c LP solutions : 0.00 - 1
3.79/3.88 c pseudo solutions : 0.00 - 0
3.79/3.88 c trivial : 0.00 1 0
3.79/3.88 c simplerounding : 0.00 0 0
3.79/3.88 c zirounding : 0.00 0 0
3.79/3.88 c rounding : 0.00 0 0
3.79/3.88 c shifting : 0.00 0 0
3.79/3.88 c intshifting : 0.00 0 0
3.79/3.88 c oneopt : 0.00 0 0
3.79/3.88 c twoopt : 0.00 0 0
3.79/3.88 c fixandinfer : 0.00 0 0
3.79/3.88 c feaspump : 0.00 0 0
3.79/3.88 c coefdiving : 0.00 0 0
3.79/3.88 c pscostdiving : 0.00 0 0
3.79/3.88 c fracdiving : 0.00 0 0
3.79/3.88 c veclendiving : 0.00 0 0
3.79/3.88 c intdiving : 0.00 0 0
3.79/3.88 c actconsdiving : 0.00 0 0
3.79/3.88 c objpscostdiving : 0.00 0 0
3.79/3.88 c rootsoldiving : 0.00 0 0
3.79/3.88 c linesearchdiving : 0.00 0 0
3.79/3.88 c guideddiving : 0.00 0 0
3.79/3.88 c octane : 0.00 0 0
3.79/3.88 c rens : 0.00 0 0
3.79/3.88 c rins : 0.00 0 0
3.79/3.88 c localbranching : 0.00 0 0
3.79/3.88 c mutation : 0.00 0 0
3.79/3.88 c crossover : 0.00 0 0
3.79/3.88 c dins : 0.00 0 0
3.79/3.88 c undercover : 0.00 0 0
3.79/3.88 c nlp : 0.00 0 0
3.79/3.88 c trysol : 0.00 0 0
3.79/3.88 c LP : Time Calls Iterations Iter/call Iter/sec
3.79/3.88 c primal LP : 0.01 0 0 0.00 -
3.79/3.88 c dual LP : 0.16 52 684 13.15 4302.08
3.79/3.88 c lex dual LP : 0.00 0 0 0.00 -
3.79/3.88 c barrier LP : 0.00 0 0 0.00 -
3.79/3.88 c diving/probing LP: 0.00 0 0 0.00 -
3.79/3.88 c strong branching : 1.22 250 5594 22.38 4577.97
3.79/3.88 c (at root node) : - 10 864 86.40 -
3.79/3.88 c conflict analysis: 0.00 0 0 0.00 -
3.79/3.88 c B&B Tree :
3.79/3.88 c number of runs : 1
3.79/3.88 c nodes : 25
3.79/3.88 c nodes (total) : 25
3.79/3.88 c nodes left : 0
3.79/3.88 c max depth : 24
3.79/3.88 c max depth (total): 24
3.79/3.88 c backtracks : 0 (0.0%)
3.79/3.88 c delayed cutoffs : 0
3.79/3.88 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.79/3.88 c avg switch length: 2.00
3.79/3.88 c switching time : 0.02
3.79/3.88 c Solution :
3.79/3.88 c Solutions found : 1 (1 improvements)
3.79/3.88 c First Solution : +0.00000000000000e+00 (in run 1, after 25 nodes, 3.85 seconds, depth 24, found by <relaxation>)
3.79/3.88 c Primal Bound : +0.00000000000000e+00 (in run 1, after 25 nodes, 3.85 seconds, depth 24, found by <relaxation>)
3.79/3.88 c Dual Bound : +0.00000000000000e+00
3.79/3.88 c Gap : 0.00 %
3.79/3.88 c Root Dual Bound : +0.00000000000000e+00
3.79/3.88 c Root Iterations : 297
3.89/3.90 c Time complete: 3.9.