0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2664861-1276677609.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.20/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.20
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.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.39/0.46 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.46 c 0.2s| 1 | 0 | 94 | - |6614k| 0 | 57 |1448 |1550 |1448 |2798 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.18 c 0.8s| 1 | 0 | 119 | - |6972k| 0 | 59 |1448 |1550 |1448 |2804 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.61 c 1.2s| 1 | 0 | 188 | - |7091k| 0 | 81 |1448 |1550 |1448 |2813 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
2.10/2.11 c 1.7s| 1 | 0 | 539 | - |7100k| 0 | 83 |1448 |1550 |1448 |2826 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.87 c 2.4s| 1 | 0 | 1156 | - |7265k| 0 | 204 |1448 |1550 |1448 |2853 | 55 | 0 | 0 | 0.000000e+00 | -- | Inf
4.59/4.60 c 4.1s| 1 | 0 | 2912 | - |8172k| 0 | 640 |1448 |1550 |1448 |2965 | 167 | 0 | 0 | 0.000000e+00 | -- | Inf
12.49/12.57 c 12.0s| 1 | 2 | 2912 | - |8172k| 0 | 640 |1448 |1550 |1448 |2965 | 167 | 0 | 10 | 0.000000e+00 | -- | Inf
28.68/28.72 c *27.9s| 43 | 0 | 6669 | 89.5 |8292k| 40 | - |1448 |1552 |1448 |1248 |1209 | 2 | 444 | 0.000000e+00 | 0.000000e+00 | 0.00%
28.68/28.72 c
28.68/28.72 c SCIP Status : problem is solved [optimal solution found]
28.68/28.72 c Solving Time (sec) : 27.87
28.68/28.72 c Solving Nodes : 43
28.68/28.72 c Primal Bound : +0.00000000000000e+00 (1 solutions)
28.68/28.72 c Dual Bound : +0.00000000000000e+00
28.68/28.72 c Gap : 0.00 %
28.68/28.73 s SATISFIABLE
28.68/28.73 v -x162 -x134 -x175 -x180 -x186 -x172 -x132 -x166 -x142 -x153 x118 -x129 x113 -x140 -x161 -x133 -x200 -x152 -x195 -x119 -x189 -x177
28.68/28.73 v -x109 -x188 -x144 -x165 -x107 -x135 -x196 -x106 -x198 -x176 -x146 -x139 -x182 -x197 x105 -x158 -x147 -x145 -x126 -x121 -x181
28.68/28.73 v -x192 -x114 -x171 x125 x199 -x138 -x104 -x151 x149 x115 x108 -x185 -x120 -x174 -x143 x157 -x103 -x190 -x155 x154 x148 -x170
28.68/28.73 v -x159 -x123 -x124 -x183 -x130 -x168 x102 x111 x110 -x169 -x112 -x137 -x173 -x141 x127 x164 -x191 -x128 -x101 -x179 -x167 -x160
28.68/28.73 v -x156 -x131 -x117 -x163 -x122 -x150 -x193 -x136 -x194 -x116 -x178 -x187 -x184 -x100 -x99 -x98 -x97 x96 -x95 -x94 -x93 -x92
28.68/28.73 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 -x66
28.68/28.73 v -x65 -x64 -x63 x62 -x61 -x60 x59 x58 -x57 -x56 x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40
28.68/28.73 v 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 -x14
28.68/28.73 v -x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 -x2 x1
28.68/28.73 c SCIP Status : problem is solved [optimal solution found]
28.68/28.73 c Solving Time : 27.87
28.68/28.73 c Original Problem :
28.68/28.73 c Problem name : HOME/instance-2664861-1276677609.opb
28.68/28.73 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
28.68/28.73 c Constraints : 1550 initial, 1550 maximal
28.68/28.73 c Presolved Problem :
28.68/28.73 c Problem name : t_HOME/instance-2664861-1276677609.opb
28.68/28.73 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
28.68/28.73 c Constraints : 1550 initial, 1552 maximal
28.68/28.73 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
28.68/28.73 c trivial : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c dualfix : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c boundshift : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c inttobinary : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c implics : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c probing : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c knapsack : 0.01 0 0 0 0 0 0 0 0
28.68/28.73 c setppc : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c and : 0.17 0 0 0 0 0 0 0 0
28.68/28.73 c linear : 0.01 0 0 0 0 0 0 0 0
28.68/28.73 c logicor : 0.00 0 0 0 0 0 0 0 0
28.68/28.73 c root node : - 0 - - 0 - - - -
28.68/28.73 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
28.68/28.73 c integral : 0 0 0 48 0 0 6 0 0 80
28.68/28.73 c knapsack : 1 5 131 3 0 0 0 0 0 0
28.68/28.73 c setppc : 200 5 131 3 0 2 128 0 0 0
28.68/28.73 c and : 1248 45 129 3 0 0 1182 1648 0 0
28.68/28.73 c linear : 1 5 129 1 0 0 0 0 0 0
28.68/28.73 c logicor : 100+ 5 34 1 0 0 14 0 0 0
28.68/28.73 c countsols : 0 0 0 1 0 0 0 0 0 0
28.68/28.73 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
28.68/28.73 c integral : 19.79 0.00 0.00 19.79 0.00
28.68/28.73 c knapsack : 0.01 0.01 0.00 0.00 0.00
28.68/28.73 c setppc : 0.00 0.00 0.00 0.00 0.00
28.68/28.73 c and : 0.02 0.01 0.01 0.00 0.00
28.68/28.73 c linear : 0.00 0.00 0.00 0.00 0.00
28.68/28.73 c logicor : 0.00 0.00 0.00 0.00 0.00
28.68/28.73 c countsols : 0.00 0.00 0.00 0.00 0.00
28.68/28.73 c Propagators : Time Calls Cutoffs DomReds
28.68/28.73 c vbounds : 0.00 1 0 0
28.68/28.73 c rootredcost : 0.00 0 0 0
28.68/28.73 c pseudoobj : 0.00 0 0 0
28.68/28.73 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
28.68/28.73 c propagation : 0.00 2 2 2 3.0 0 0.0 -
28.68/28.73 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
28.68/28.73 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
28.68/28.73 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
28.68/28.73 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
28.68/28.73 c applied globally : - - - 2 3.0 - - -
28.68/28.73 c applied locally : - - - 0 0.0 - - -
28.68/28.73 c Separators : Time Calls Cutoffs DomReds Cuts Conss
28.68/28.73 c cut pool : 0.00 4 - - 3 - (maximal pool size: 405)
28.68/28.73 c redcost : 0.00 45 0 0 0 0
28.68/28.73 c impliedbounds : 0.01 5 0 0 150 0
28.68/28.73 c intobj : 0.00 0 0 0 0 0
28.68/28.73 c cgmip : 0.00 0 0 0 0 0
28.68/28.73 c gomory : 1.02 5 0 0 692 0
28.68/28.73 c strongcg : 0.80 5 0 0 1874 0
28.68/28.73 c cmir : 0.00 0 0 0 0 0
28.68/28.73 c flowcover : 0.00 0 0 0 0 0
28.68/28.73 c clique : 0.03 5 0 0 28 0
28.68/28.73 c zerohalf : 0.00 0 0 0 0 0
28.68/28.73 c mcf : 0.00 1 0 0 0 0
28.68/28.73 c rapidlearning : 0.26 1 0 0 0 0
28.68/28.73 c Pricers : Time Calls Vars
28.68/28.73 c problem variables: 0.00 0 0
28.68/28.73 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
28.68/28.73 c relpscost : 19.79 45 0 6 0 0 80
28.68/28.73 c pscost : 0.00 0 0 0 0 0 0
28.68/28.73 c inference : 0.00 0 0 0 0 0 0
28.68/28.73 c mostinf : 0.00 0 0 0 0 0 0
28.68/28.73 c leastinf : 0.00 0 0 0 0 0 0
28.68/28.73 c fullstrong : 0.00 0 0 0 0 0 0
28.68/28.73 c allfullstrong : 0.00 0 0 0 0 0 0
28.68/28.73 c random : 0.00 0 0 0 0 0 0
28.68/28.73 c Primal Heuristics : Time Calls Found
28.68/28.73 c LP solutions : 0.00 - 1
28.68/28.73 c pseudo solutions : 0.00 - 0
28.68/28.73 c trivial : 0.01 1 0
28.68/28.73 c simplerounding : 0.00 0 0
28.68/28.73 c zirounding : 0.00 0 0
28.68/28.73 c rounding : 0.00 0 0
28.68/28.73 c shifting : 0.00 0 0
28.68/28.73 c intshifting : 0.00 0 0
28.68/28.73 c oneopt : 0.00 0 0
28.68/28.73 c twoopt : 0.00 0 0
28.68/28.73 c fixandinfer : 0.00 0 0
28.68/28.73 c feaspump : 0.00 0 0
28.68/28.73 c coefdiving : 0.00 0 0
28.68/28.73 c pscostdiving : 0.00 0 0
28.68/28.73 c fracdiving : 0.00 0 0
28.68/28.73 c veclendiving : 0.00 0 0
28.68/28.73 c intdiving : 0.00 0 0
28.68/28.73 c actconsdiving : 0.00 0 0
28.68/28.73 c objpscostdiving : 0.00 0 0
28.68/28.73 c rootsoldiving : 0.00 0 0
28.68/28.73 c linesearchdiving : 0.00 0 0
28.68/28.73 c guideddiving : 0.00 0 0
28.68/28.73 c octane : 0.00 0 0
28.68/28.73 c rens : 0.00 0 0
28.68/28.73 c rins : 0.00 0 0
28.68/28.73 c localbranching : 0.00 0 0
28.68/28.73 c mutation : 0.00 0 0
28.68/28.73 c crossover : 0.00 0 0
28.68/28.73 c dins : 0.00 0 0
28.68/28.73 c undercover : 0.00 0 0
28.68/28.73 c nlp : 0.00 0 0
28.68/28.73 c trysol : 0.00 0 0
28.68/28.73 c LP : Time Calls Iterations Iter/call Iter/sec
28.68/28.73 c primal LP : 0.95 0 0 0.00 0.00
28.68/28.73 c dual LP : 4.63 91 6669 73.29 1440.39
28.68/28.73 c lex dual LP : 0.00 0 0 0.00 -
28.68/28.73 c barrier LP : 0.00 0 0 0.00 -
28.68/28.73 c diving/probing LP: 0.00 0 0 0.00 -
28.68/28.73 c strong branching : 19.75 444 42273 95.21 2140.41
28.68/28.73 c (at root node) : - 10 9059 905.90 -
28.68/28.73 c conflict analysis: 0.00 0 0 0.00 -
28.68/28.73 c B&B Tree :
28.68/28.73 c number of runs : 1
28.68/28.73 c nodes : 43
28.68/28.73 c nodes (total) : 43
28.68/28.73 c nodes left : 0
28.68/28.73 c max depth : 40
28.68/28.73 c max depth (total): 40
28.68/28.73 c backtracks : 0 (0.0%)
28.68/28.73 c delayed cutoffs : 0
28.68/28.73 c repropagations : 15 (18 domain reductions, 0 cutoffs)
28.68/28.73 c avg switch length: 2.60
28.68/28.73 c switching time : 0.96
28.68/28.73 c Solution :
28.68/28.73 c Solutions found : 1 (1 improvements)
28.68/28.73 c First Solution : +0.00000000000000e+00 (in run 1, after 43 nodes, 27.87 seconds, depth 40, found by <relaxation>)
28.68/28.73 c Primal Bound : +0.00000000000000e+00 (in run 1, after 43 nodes, 27.87 seconds, depth 40, found by <relaxation>)
28.68/28.73 c Dual Bound : +0.00000000000000e+00
28.68/28.73 c Gap : 0.00 %
28.68/28.73 c Root Dual Bound : +0.00000000000000e+00
28.68/28.73 c Root Iterations : 2912
28.68/28.75 c Time complete: 28.73.