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-2702841-1278574719.opb>
0.00/0.03 c original problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 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.09/0.12 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.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 10152 implications, 200 cliques
0.09/0.18 c presolved problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 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 1244 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.24 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.24 c 0.2s| 1 | 0 | 168 | - |6517k| 0 | 83 |1444 |1546 |1444 |2790 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.07 c 1.0s| 1 | 0 | 214 | - |7105k| 0 | 83 |1444 |1546 |1444 |2801 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.63 c 1.6s| 1 | 0 | 267 | - |7278k| 0 | 95 |1444 |1546 |1444 |2810 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
2.20/2.22 c 2.2s| 1 | 0 | 349 | - |7557k| 0 | 94 |1444 |1546 |1444 |2817 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.95 c 2.9s| 1 | 0 | 538 | - |7893k| 0 | 73 |1444 |1546 |1444 |2825 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.10 c 3.1s| 1 | 0 | 605 | - |7961k| 0 | 30 |1444 |1546 |1444 |2853 | 63 | 0 | 0 | 0.000000e+00 | -- | Inf
4.29/4.32 c 4.3s| 1 | 2 | 605 | - |7961k| 0 | 30 |1444 |1546 |1444 |2853 | 63 | 0 | 10 | 0.000000e+00 | -- | Inf
11.39/11.46 c *11.4s| 104 | 0 | 4873 | 41.4 |7991k| 31 | - |1444 |1552 |1444 | 577 |1243 | 6 |1335 | 0.000000e+00 | 0.000000e+00 | 0.00%
11.39/11.46 c
11.39/11.46 c SCIP Status : problem is solved [optimal solution found]
11.39/11.46 c Solving Time (sec) : 11.43
11.39/11.46 c Solving Nodes : 104
11.39/11.46 c Primal Bound : +0.00000000000000e+00 (1 solutions)
11.39/11.46 c Dual Bound : +0.00000000000000e+00
11.39/11.46 c Gap : 0.00 %
11.39/11.46 s SATISFIABLE
11.39/11.46 v x166 -x164 x158 x163 -x121 -x171 -x113 -x156 -x144 x135 -x152 -x161 -x122 -x130 -x157 -x146 -x181 x129 -x111 -x192 x167 -x154 -x185
11.39/11.46 v -x127 -x117 -x184 x120 -x124 x134 -x178 x168 x136 x172 -x110 -x187 -x190 x200 -x105 -x151 -x131 -x109 -x106 x183 -x153 -x182
11.39/11.46 v -x189 -x149 -x195 -x104 -x198 -x193 -x188 -x128 -x119 -x112 x191 -x179 -x162 -x107 -x137 -x115 -x175 x145 -x132 -x108 -x199
11.39/11.46 v x138 -x148 -x174 -x139 -x143 -x197 -x180 -x160 -x155 -x150 -x118 -x114 -x116 -x196 -x176 -x142 -x103 -x140 -x194 -x125 -x101
11.39/11.46 v -x170 -x133 -x123 -x159 -x165 -x102 -x177 -x173 -x126 -x141 -x169 -x186 -x147 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
11.39/11.46 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
11.39/11.46 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
11.39/11.46 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
11.39/11.46 v x15 -x14 x13 x12 x11 x10 -x9 -x8 -x7 -x6 x5 x4 -x3 x2 -x1
11.39/11.46 c SCIP Status : problem is solved [optimal solution found]
11.39/11.46 c Solving Time : 11.43
11.39/11.46 c Original Problem :
11.39/11.46 c Problem name : HOME/instance-2702841-1278574719.opb
11.39/11.46 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
11.39/11.46 c Constraints : 1546 initial, 1546 maximal
11.39/11.46 c Presolved Problem :
11.39/11.46 c Problem name : t_HOME/instance-2702841-1278574719.opb
11.39/11.46 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
11.39/11.46 c Constraints : 1546 initial, 1552 maximal
11.39/11.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
11.39/11.46 c trivial : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c implics : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c probing : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c knapsack : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c setppc : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c and : 0.12 0 0 0 0 0 0 0 0
11.39/11.46 c linear : 0.01 0 0 0 0 0 0 0 0
11.39/11.46 c logicor : 0.00 0 0 0 0 0 0 0 0
11.39/11.46 c root node : - 0 - - 0 - - - -
11.39/11.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
11.39/11.46 c integral : 0 0 0 136 0 0 47 0 0 194
11.39/11.46 c knapsack : 1 5 354 1 0 0 0 0 0 0
11.39/11.46 c setppc : 300 5 354 1 0 6 415 0 0 0
11.39/11.46 c and : 1244 102 348 1 0 0 4110 1198 0 0
11.39/11.46 c linear : 1 5 348 1 0 0 0 0 0 0
11.39/11.46 c logicor : 0+ 0 12 0 0 0 6 0 0 0
11.39/11.46 c countsols : 0 0 0 1 0 0 0 0 0 0
11.39/11.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
11.39/11.46 c integral : 7.28 0.00 0.00 7.28 0.00
11.39/11.46 c knapsack : 0.01 0.01 0.00 0.00 0.00
11.39/11.46 c setppc : 0.00 0.00 0.00 0.00 0.00
11.39/11.46 c and : 0.11 0.08 0.03 0.00 0.00
11.39/11.46 c linear : 0.01 0.00 0.01 0.00 0.00
11.39/11.46 c logicor : 0.00 0.00 0.00 0.00 0.00
11.39/11.46 c countsols : 0.00 0.00 0.00 0.00 0.00
11.39/11.46 c Propagators : Time Calls Cutoffs DomReds
11.39/11.46 c vbounds : 0.00 1 0 0
11.39/11.46 c rootredcost : 0.00 0 0 0
11.39/11.46 c pseudoobj : 0.00 0 0 0
11.39/11.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
11.39/11.46 c propagation : 0.00 6 6 6 3.0 0 0.0 -
11.39/11.46 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
11.39/11.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
11.39/11.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
11.39/11.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
11.39/11.46 c applied globally : - - - 6 3.0 - - -
11.39/11.46 c applied locally : - - - 0 0.0 - - -
11.39/11.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
11.39/11.46 c cut pool : 0.00 4 - - 3 - (maximal pool size: 331)
11.39/11.46 c redcost : 0.01 102 0 0 0 0
11.39/11.46 c impliedbounds : 0.00 5 0 0 28 0
11.39/11.46 c intobj : 0.00 0 0 0 0 0
11.39/11.46 c cgmip : 0.00 0 0 0 0 0
11.39/11.46 c gomory : 1.17 5 0 0 615 0
11.39/11.46 c strongcg : 1.02 5 0 0 2493 0
11.39/11.46 c cmir : 0.00 0 0 0 0 0
11.39/11.46 c flowcover : 0.00 0 0 0 0 0
11.39/11.46 c clique : 0.01 5 0 0 31 0
11.39/11.46 c zerohalf : 0.00 0 0 0 0 0
11.39/11.46 c mcf : 0.00 1 0 0 0 0
11.39/11.46 c rapidlearning : 0.43 1 0 0 0 0
11.39/11.46 c Pricers : Time Calls Vars
11.39/11.46 c problem variables: 0.00 0 0
11.39/11.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
11.39/11.46 c relpscost : 7.28 135 0 47 0 0 194
11.39/11.46 c pscost : 0.00 0 0 0 0 0 0
11.39/11.46 c inference : 0.00 0 0 0 0 0 0
11.39/11.46 c mostinf : 0.00 0 0 0 0 0 0
11.39/11.46 c leastinf : 0.00 0 0 0 0 0 0
11.39/11.46 c fullstrong : 0.00 0 0 0 0 0 0
11.39/11.46 c allfullstrong : 0.00 0 0 0 0 0 0
11.39/11.46 c random : 0.00 0 0 0 0 0 0
11.39/11.46 c Primal Heuristics : Time Calls Found
11.39/11.46 c LP solutions : 0.00 - 1
11.39/11.46 c pseudo solutions : 0.00 - 0
11.39/11.46 c trivial : 0.00 1 0
11.39/11.46 c simplerounding : 0.00 0 0
11.39/11.46 c zirounding : 0.00 0 0
11.39/11.46 c rounding : 0.00 0 0
11.39/11.46 c shifting : 0.00 0 0
11.39/11.46 c intshifting : 0.00 0 0
11.39/11.46 c oneopt : 0.00 0 0
11.39/11.46 c twoopt : 0.00 0 0
11.39/11.46 c fixandinfer : 0.00 0 0
11.39/11.46 c feaspump : 0.00 0 0
11.39/11.46 c coefdiving : 0.00 0 0
11.39/11.46 c pscostdiving : 0.00 0 0
11.39/11.46 c fracdiving : 0.00 0 0
11.39/11.46 c veclendiving : 0.00 0 0
11.39/11.46 c intdiving : 0.00 0 0
11.39/11.46 c actconsdiving : 0.00 0 0
11.39/11.46 c objpscostdiving : 0.00 0 0
11.39/11.46 c rootsoldiving : 0.00 0 0
11.39/11.46 c linesearchdiving : 0.00 0 0
11.39/11.46 c guideddiving : 0.00 0 0
11.39/11.46 c octane : 0.00 0 0
11.39/11.46 c rens : 0.00 0 0
11.39/11.46 c rins : 0.00 0 0
11.39/11.46 c localbranching : 0.00 0 0
11.39/11.46 c mutation : 0.00 0 0
11.39/11.46 c crossover : 0.00 0 0
11.39/11.46 c dins : 0.00 0 0
11.39/11.46 c undercover : 0.00 0 0
11.39/11.46 c nlp : 0.00 0 0
11.39/11.46 c trysol : 0.00 0 0
11.39/11.46 c LP : Time Calls Iterations Iter/call Iter/sec
11.39/11.46 c primal LP : 0.04 0 0 0.00 0.00
11.39/11.46 c dual LP : 0.94 233 4873 20.91 5172.99
11.39/11.46 c lex dual LP : 0.00 0 0 0.00 -
11.39/11.46 c barrier LP : 0.00 0 0 0.00 -
11.39/11.46 c diving/probing LP: 0.00 0 0 0.00 -
11.39/11.46 c strong branching : 7.27 1335 32336 24.22 4449.03
11.39/11.46 c (at root node) : - 10 2627 262.70 -
11.39/11.46 c conflict analysis: 0.00 0 0 0.00 -
11.39/11.46 c B&B Tree :
11.39/11.46 c number of runs : 1
11.39/11.46 c nodes : 104
11.39/11.46 c nodes (total) : 104
11.39/11.46 c nodes left : 0
11.39/11.46 c max depth : 31
11.39/11.46 c max depth (total): 31
11.39/11.46 c backtracks : 5 (4.8%)
11.39/11.46 c delayed cutoffs : 0
11.39/11.46 c repropagations : 63 (89 domain reductions, 0 cutoffs)
11.39/11.46 c avg switch length: 3.40
11.39/11.46 c switching time : 0.09
11.39/11.46 c Solution :
11.39/11.46 c Solutions found : 1 (1 improvements)
11.39/11.46 c First Solution : +0.00000000000000e+00 (in run 1, after 104 nodes, 11.43 seconds, depth 31, found by <relaxation>)
11.39/11.46 c Primal Bound : +0.00000000000000e+00 (in run 1, after 104 nodes, 11.43 seconds, depth 31, found by <relaxation>)
11.39/11.46 c Dual Bound : +0.00000000000000e+00
11.39/11.46 c Gap : 0.00 %
11.39/11.46 c Root Dual Bound : +0.00000000000000e+00
11.39/11.46 c Root Iterations : 605
11.39/11.48 c Time complete: 11.48.