0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2666291-1276677632.opb>
0.00/0.03 c original problem has 1448 variables (1448 bin, 0 int, 0 impl, 0 cont) and 1550 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.00/0.04 c presolving:
0.19/0.24 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.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 10184 implications, 200 cliques
0.39/0.42 c presolved problem has 1448 variables (1448 bin, 0 int, 0 impl, 0 cont) and 1550 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 200 constraints of type <setppc>
0.39/0.42 c 1248 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 100 constraints of type <logicor>
0.39/0.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.21
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/cmir/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/flowcover/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/rapidlearning/freq = 0
0.39/0.43 c
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c start solving
0.39/0.43 c
0.39/0.47 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.47 c 0.3s| 1 | 0 | 155 | - |6614k| 0 | 81 |1448 |1550 |1448 |2798 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.27 c 0.9s| 1 | 0 | 193 | - |6868k| 0 | 88 |1448 |1550 |1448 |2807 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.82 c 1.4s| 1 | 0 | 257 | - |7104k| 0 | 96 |1448 |1550 |1448 |2815 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.39 c 2.0s| 1 | 0 | 313 | - |7375k| 0 | 101 |1448 |1550 |1448 |2821 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
2.99/3.00 c 2.6s| 1 | 0 | 351 | - |7630k| 0 | 104 |1448 |1550 |1448 |2828 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
3.59/3.64 c 3.2s| 1 | 0 | 395 | - |7843k| 0 | 100 |1448 |1550 |1448 |2832 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
4.39/4.45 c 4.0s| 1 | 2 | 395 | - |7844k| 0 | 100 |1448 |1550 |1448 |2832 | 34 | 0 | 10 | 0.000000e+00 | -- | Inf
5.50/5.58 c * 5.1s| 32 | 0 | 925 | 17.1 |7804k| 30 | - |1448 |1551 |1448 | 487 | 162 | 1 | 288 | 0.000000e+00 | 0.000000e+00 | 0.00%
5.50/5.58 c
5.50/5.58 c SCIP Status : problem is solved [optimal solution found]
5.50/5.58 c Solving Time (sec) : 5.11
5.50/5.58 c Solving Nodes : 32
5.50/5.58 c Primal Bound : +0.00000000000000e+00 (1 solutions)
5.50/5.58 c Dual Bound : +0.00000000000000e+00
5.50/5.58 c Gap : 0.00 %
5.50/5.58 s SATISFIABLE
5.50/5.58 v -x162 -x134 -x175 -x180 -x186 -x172 -x132 -x166 -x142 -x153 -x118 -x129 -x113 -x140 -x161 -x133 -x200 -x152 x195 -x119 -x189 x177
5.50/5.58 v -x109 -x188 -x144 -x165 -x107 -x135 -x196 -x106 -x198 x176 -x146 -x139 -x182 -x197 -x105 -x158 -x147 -x145 -x126 -x121 -x181
5.50/5.58 v -x192 -x114 -x171 -x125 -x199 -x138 -x104 -x151 -x149 -x115 x108 x185 -x120 x174 -x143 -x157 -x103 -x190 -x155 -x154 -x148
5.50/5.58 v -x170 -x159 -x123 -x124 -x183 -x130 -x168 -x102 -x111 x110 x169 x112 -x137 x173 -x141 x127 x164 -x191 -x128 -x101 -x179 -x167
5.50/5.58 v -x160 x156 -x131 -x117 -x163 -x122 -x150 -x193 -x136 -x194 -x116 x178 -x187 x184 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
5.50/5.58 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
5.50/5.58 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
5.50/5.58 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
5.50/5.58 v -x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 x3 -x2 -x1
5.50/5.58 c SCIP Status : problem is solved [optimal solution found]
5.50/5.58 c Solving Time : 5.11
5.50/5.58 c Original Problem :
5.50/5.58 c Problem name : HOME/instance-2666291-1276677632.opb
5.50/5.58 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
5.50/5.58 c Constraints : 1550 initial, 1550 maximal
5.50/5.58 c Presolved Problem :
5.50/5.58 c Problem name : t_HOME/instance-2666291-1276677632.opb
5.50/5.58 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
5.50/5.58 c Constraints : 1550 initial, 1551 maximal
5.50/5.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.50/5.58 c trivial : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c implics : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c probing : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c knapsack : 0.01 0 0 0 0 0 0 0 0
5.50/5.58 c setppc : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c and : 0.19 0 0 0 0 0 0 0 0
5.50/5.58 c linear : 0.01 0 0 0 0 0 0 0 0
5.50/5.58 c logicor : 0.00 0 0 0 0 0 0 0 0
5.50/5.58 c root node : - 0 - - 0 - - - -
5.50/5.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.50/5.58 c integral : 0 0 0 38 0 0 4 0 0 60
5.50/5.58 c knapsack : 1 5 89 5 0 0 0 0 0 0
5.50/5.58 c setppc : 200 5 89 5 0 1 91 0 0 0
5.50/5.58 c and : 1248 35 88 5 0 0 1085 132 0 0
5.50/5.58 c linear : 1 5 88 1 0 0 0 0 0 0
5.50/5.58 c logicor : 100+ 5 21 1 0 0 15 0 0 0
5.50/5.58 c countsols : 0 0 0 1 0 0 0 0 0 0
5.50/5.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.50/5.58 c integral : 1.70 0.00 0.00 1.70 0.00
5.50/5.58 c knapsack : 0.00 0.00 0.00 0.00 0.00
5.50/5.58 c setppc : 0.00 0.00 0.00 0.00 0.00
5.50/5.58 c and : 0.04 0.02 0.02 0.00 0.00
5.50/5.58 c linear : 0.01 0.00 0.01 0.00 0.00
5.50/5.58 c logicor : 0.00 0.00 0.00 0.00 0.00
5.50/5.58 c countsols : 0.00 0.00 0.00 0.00 0.00
5.50/5.58 c Propagators : Time Calls Cutoffs DomReds
5.50/5.58 c vbounds : 0.00 1 0 0
5.50/5.58 c rootredcost : 0.00 0 0 0
5.50/5.58 c pseudoobj : 0.00 0 0 0
5.50/5.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.50/5.58 c propagation : 0.00 1 1 1 3.0 0 0.0 -
5.50/5.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.50/5.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.50/5.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.50/5.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.50/5.58 c applied globally : - - - 1 3.0 - - -
5.50/5.58 c applied locally : - - - 0 0.0 - - -
5.50/5.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.50/5.58 c cut pool : 0.00 4 - - 11 - (maximal pool size: 261)
5.50/5.58 c redcost : 0.00 35 0 0 0 0
5.50/5.58 c impliedbounds : 0.00 5 0 0 2 0
5.50/5.58 c intobj : 0.00 0 0 0 0 0
5.50/5.58 c cgmip : 0.00 0 0 0 0 0
5.50/5.58 c gomory : 1.35 5 0 0 181 0
5.50/5.58 c strongcg : 1.19 5 0 0 2156 0
5.50/5.58 c cmir : 0.00 0 0 0 0 0
5.50/5.58 c flowcover : 0.00 0 0 0 0 0
5.50/5.58 c clique : 0.00 5 0 0 26 0
5.50/5.58 c zerohalf : 0.00 0 0 0 0 0
5.50/5.58 c mcf : 0.01 1 0 0 0 0
5.50/5.58 c rapidlearning : 0.26 1 0 0 0 0
5.50/5.58 c Pricers : Time Calls Vars
5.50/5.58 c problem variables: 0.00 0 0
5.50/5.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.50/5.58 c relpscost : 1.70 33 0 4 0 0 60
5.50/5.58 c pscost : 0.00 0 0 0 0 0 0
5.50/5.58 c inference : 0.00 0 0 0 0 0 0
5.50/5.58 c mostinf : 0.00 0 0 0 0 0 0
5.50/5.58 c leastinf : 0.00 0 0 0 0 0 0
5.50/5.58 c fullstrong : 0.00 0 0 0 0 0 0
5.50/5.58 c allfullstrong : 0.00 0 0 0 0 0 0
5.50/5.58 c random : 0.00 0 0 0 0 0 0
5.50/5.58 c Primal Heuristics : Time Calls Found
5.50/5.58 c LP solutions : 0.00 - 1
5.50/5.58 c pseudo solutions : 0.00 - 0
5.50/5.58 c trivial : 0.00 1 0
5.50/5.58 c simplerounding : 0.00 0 0
5.50/5.58 c zirounding : 0.00 0 0
5.50/5.58 c rounding : 0.00 0 0
5.50/5.58 c shifting : 0.00 0 0
5.50/5.58 c intshifting : 0.00 0 0
5.50/5.58 c oneopt : 0.00 0 0
5.50/5.58 c twoopt : 0.00 0 0
5.50/5.58 c fixandinfer : 0.00 0 0
5.50/5.58 c feaspump : 0.00 0 0
5.50/5.58 c coefdiving : 0.00 0 0
5.50/5.58 c pscostdiving : 0.00 0 0
5.50/5.58 c fracdiving : 0.00 0 0
5.50/5.58 c veclendiving : 0.00 0 0
5.50/5.58 c intdiving : 0.00 0 0
5.50/5.58 c actconsdiving : 0.00 0 0
5.50/5.58 c objpscostdiving : 0.00 0 0
5.50/5.58 c rootsoldiving : 0.00 0 0
5.50/5.58 c linesearchdiving : 0.00 0 0
5.50/5.58 c guideddiving : 0.00 0 0
5.50/5.58 c octane : 0.00 0 0
5.50/5.58 c rens : 0.00 0 0
5.50/5.58 c rins : 0.00 0 0
5.50/5.58 c localbranching : 0.00 0 0
5.50/5.58 c mutation : 0.00 0 0
5.50/5.58 c crossover : 0.00 0 0
5.50/5.58 c dins : 0.00 0 0
5.50/5.58 c undercover : 0.00 0 0
5.50/5.58 c nlp : 0.00 0 0
5.50/5.58 c trysol : 0.00 0 0
5.50/5.58 c LP : Time Calls Iterations Iter/call Iter/sec
5.50/5.58 c primal LP : 0.00 0 0 0.00 -
5.50/5.58 c dual LP : 0.25 72 925 12.85 3700.00
5.50/5.58 c lex dual LP : 0.00 0 0 0.00 -
5.50/5.58 c barrier LP : 0.00 0 0 0.00 -
5.50/5.58 c diving/probing LP: 0.00 0 0 0.00 -
5.50/5.58 c strong branching : 1.70 288 6583 22.86 3872.35
5.50/5.58 c (at root node) : - 10 1791 179.10 -
5.50/5.58 c conflict analysis: 0.00 0 0 0.00 -
5.50/5.58 c B&B Tree :
5.50/5.58 c number of runs : 1
5.50/5.58 c nodes : 32
5.50/5.58 c nodes (total) : 32
5.50/5.58 c nodes left : 0
5.50/5.58 c max depth : 30
5.50/5.58 c max depth (total): 30
5.50/5.58 c backtracks : 0 (0.0%)
5.50/5.58 c delayed cutoffs : 0
5.50/5.58 c repropagations : 2 (6 domain reductions, 0 cutoffs)
5.50/5.58 c avg switch length: 2.06
5.50/5.58 c switching time : 0.02
5.50/5.58 c Solution :
5.50/5.58 c Solutions found : 1 (1 improvements)
5.50/5.58 c First Solution : +0.00000000000000e+00 (in run 1, after 32 nodes, 5.11 seconds, depth 30, found by <relaxation>)
5.50/5.58 c Primal Bound : +0.00000000000000e+00 (in run 1, after 32 nodes, 5.11 seconds, depth 30, found by <relaxation>)
5.50/5.58 c Dual Bound : +0.00000000000000e+00
5.50/5.58 c Gap : 0.00 %
5.50/5.58 c Root Dual Bound : +0.00000000000000e+00
5.50/5.58 c Root Iterations : 395
5.59/5.60 c Time complete: 5.59.