0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3484739-1307788287.opb>
0.00/0.00 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.04 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10152 impls, 200 clqs
0.00/0.07 c presolving (2 rounds):
0.00/0.07 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.07 c 10152 implications, 200 cliques
0.00/0.07 c presolved problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 constraints
0.00/0.07 c 1 constraints of type <knapsack>
0.00/0.07 c 300 constraints of type <setppc>
0.00/0.07 c 1244 constraints of type <and>
0.00/0.07 c 1 constraints of type <linear>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.06
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 2.0.1.4
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1797
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 13950
0.00/0.07 c
0.00/0.07 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c limits/solutions = 1
0.00/0.07 c
0.00/0.07 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.07 c separating/maxrounds = 1
0.00/0.07 c
0.00/0.07 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/maxroundsroot = 5
0.00/0.07 c
0.00/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.07 c # [type: int, range: [1,2], default: 1]
0.00/0.07 c timing/clocktype = 2
0.00/0.07 c
0.00/0.07 c # belongs reading time to solving time?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c timing/reading = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/indicator/addCouplingCons = TRUE
0.00/0.07 c
0.00/0.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.07 c constraints/knapsack/disaggregation = FALSE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c presolving/probing/maxrounds = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/coefdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.07 c heuristics/crossover/freq = -1
0.00/0.07 c
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/crossover/nodesofs = 750
0.00/0.07 c
0.00/0.07 c # number of nodes without incumbent change that heuristic should wait
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.07 c heuristics/crossover/nwaitingnodes = 100
0.00/0.07 c
0.00/0.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.07 c # [type: real, range: [0,1], default: 0.1]
0.00/0.07 c heuristics/crossover/nodesquot = 0.15
0.00/0.07 c
0.00/0.07 c # minimum percentage of integer variables that have to be fixed
0.00/0.07 c # [type: real, range: [0,1], default: 0.666]
0.00/0.07 c heuristics/crossover/minfixingrate = 0.5
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/feaspump/freq = -1
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/fracdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/guideddiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/intshifting/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/linesearchdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/objpscostdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.07 c # [type: real, range: [0,1], default: 0.01]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/oneopt/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/pscostdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/rens/freq = -1
0.00/0.07 c
0.00/0.07 c # minimum percentage of integer variables that have to be fixable
0.00/0.07 c # [type: real, range: [0,1], default: 0.5]
0.00/0.07 c heuristics/rens/minfixingrate = 0.3
0.00/0.07 c
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/rens/nodesofs = 2000
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/rootsoldiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/rounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/shiftandpropagate/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/shifting/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/simplerounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/subnlp/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/trivial/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/trysol/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/undercover/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/veclendiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/zirounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/cmir/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/flowcover/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.09 c 0.1s| 1 | 0 | 167 | - |6122k| 0 | 83 |1444 |1546 |1444 |2790 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 210 | - |6647k| 0 | 94 |1444 |1557 |1444 |2800 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 255 | - |7039k| 0 | 107 |1444 |1557 |1444 |2810 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.68/0.74 c 0.7s| 1 | 0 | 282 | - |7499k| 0 | 112 |1444 |1557 |1444 |2819 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.88/0.97 c 1.0s| 1 | 0 | 294 | - |7988k| 0 | 108 |1444 |1557 |1444 |2824 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.20 c 1.2s| 1 | 0 | 317 | - |8513k| 0 | 112 |1444 |1557 |1444 |2828 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.4s| 1 | 2 | 317 | - |8514k| 0 | 112 |1444 |1557 |1444 |2828 | 38 | 0 | 9 | 0.000000e+00 | -- | Inf
1.98/2.08 c * 2.1s| 36 | 0 | 1039 | 20.6 |8399k| 33 | - |1444 |1559 |1444 | 517 | 204 | 2 | 343 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.98/2.08 c
1.98/2.08 c SCIP Status : problem is solved [optimal solution found]
1.98/2.08 c Solving Time (sec) : 2.08
1.98/2.08 c Solving Nodes : 36
1.98/2.08 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.98/2.08 c Dual Bound : +0.00000000000000e+00
1.98/2.08 c Gap : 0.00 %
1.98/2.08 s SATISFIABLE
1.98/2.08 v -x166 -x164 -x158 -x163 -x121 -x171 -x113 -x156 -x144 x135 x152 -x161 -x122 -x130 -x157 -x146 x181 -x129 -x111 -x192 x167 -x154
1.98/2.08 v -x185 -x127 -x117 -x184 x120 -x124 -x134 -x178 -x168 -x136 -x172 -x110 -x187 -x190 -x200 -x105 -x151 -x131 -x109 -x106 -x183
1.98/2.08 v -x153 -x182 -x189 -x149 -x195 -x104 -x198 -x193 -x188 -x128 -x119 x112 -x191 x179 x162 -x107 -x137 -x115 -x175 -x145 -x132 x108
1.98/2.08 v -x199 x138 -x148 -x174 -x139 -x143 -x197 -x180 -x160 -x155 -x150 -x118 -x114 x116 -x196 x176 -x142 x103 -x140 -x194 -x125
1.98/2.08 v -x101 -x170 x133 -x123 -x159 -x165 -x102 -x177 -x173 -x126 x141 -x169 -x186 -x147 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
1.98/2.08 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
1.98/2.08 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
1.98/2.08 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
1.98/2.08 v x15 -x14 -x13 -x12 x11 x10 -x9 -x8 x7 x6 x5 -x4 -x3 -x2 -x1
1.98/2.08 c SCIP Status : problem is solved [optimal solution found]
1.98/2.08 c Total Time : 2.08
1.98/2.08 c solving : 2.08
1.98/2.08 c presolving : 0.06 (included in solving)
1.98/2.08 c reading : 0.00 (included in solving)
1.98/2.08 c Original Problem :
1.98/2.08 c Problem name : HOME/instance-3484739-1307788287.opb
1.98/2.08 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.98/2.08 c Constraints : 302 initial, 302 maximal
1.98/2.08 c Presolved Problem :
1.98/2.08 c Problem name : t_HOME/instance-3484739-1307788287.opb
1.98/2.08 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
1.98/2.08 c Constraints : 1546 initial, 1559 maximal
1.98/2.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.98/2.08 c trivial : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c setppc : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c and : 0.05 0 0 0 0 0 0 0 0 0
1.98/2.08 c linear : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c logicor : 0.00 0 0 0 0 0 0 0 0 0
1.98/2.08 c root node : - 0 - - 0 - - - - -
1.98/2.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.98/2.08 c integral : 0 0 0 39 0 3 0 0 7 0 0 66
1.98/2.08 c knapsack : 1 5 103 1 0 0 0 0 0 0 0 0
1.98/2.08 c setppc : 300 5 103 1 0 0 0 2 140 0 0 0
1.98/2.08 c and : 1244 38 101 1 0 0 4 0 1209 171 0 0
1.98/2.08 c linear : 1+ 6 101 1 0 0 0 0 2 0 0 0
1.98/2.08 c logicor : 0+ 0 2 0 0 0 0 0 2 0 0 0
1.98/2.08 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
1.98/2.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.98/2.08 c integral : 0.79 0.00 0.00 0.79 0.00 0.00 0.00
1.98/2.08 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.98/2.08 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.98/2.08 c and : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
1.98/2.08 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.98/2.08 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.98/2.08 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.98/2.08 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.98/2.08 c vbounds : 0 0 0 0
1.98/2.08 c rootredcost : 0 0 0 0
1.98/2.08 c pseudoobj : 0 0 0 0
1.98/2.08 c Propagator Timings : TotalTime Propagate Resprop
1.98/2.08 c vbounds : 0.00 0.00 0.00
1.98/2.08 c rootredcost : 0.00 0.00 0.00
1.98/2.08 c pseudoobj : 0.00 0.00 0.00
1.98/2.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.98/2.08 c propagation : 0.00 2 2 2 3.0 0 0.0 -
1.98/2.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.98/2.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.98/2.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.98/2.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.98/2.08 c applied globally : - - - 2 3.0 - - -
1.98/2.08 c applied locally : - - - 0 0.0 - - -
1.98/2.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.98/2.08 c cut pool : 0.00 4 - - 34 - (maximal pool size: 454)
1.98/2.08 c redcost : 0.00 38 0 0 0 0
1.98/2.08 c impliedbounds : 0.00 5 0 0 9 0
1.98/2.08 c intobj : 0.00 0 0 0 0 0
1.98/2.08 c gomory : 0.67 5 0 0 81 0
1.98/2.08 c cgmip : 0.00 0 0 0 0 0
1.98/2.08 c closecuts : 0.00 0 0 0 0 0
1.98/2.08 c strongcg : 0.33 5 0 0 2500 0
1.98/2.08 c cmir : 0.00 0 0 0 0 0
1.98/2.08 c flowcover : 0.00 0 0 0 0 0
1.98/2.08 c clique : 0.01 5 0 0 28 0
1.98/2.08 c zerohalf : 0.00 0 0 0 0 0
1.98/2.08 c mcf : 0.00 1 0 0 0 0
1.98/2.08 c oddcycle : 0.00 0 0 0 0 0
1.98/2.08 c rapidlearning : 0.05 1 0 0 0 11
1.98/2.08 c Pricers : Time Calls Vars
1.98/2.08 c problem variables: 0.00 0 0
1.98/2.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.98/2.08 c relpscost : 0.79 38 0 7 0 0 66
1.98/2.08 c pscost : 0.00 0 0 0 0 0 0
1.98/2.08 c inference : 0.00 0 0 0 0 0 0
1.98/2.08 c mostinf : 0.00 0 0 0 0 0 0
1.98/2.08 c leastinf : 0.00 0 0 0 0 0 0
1.98/2.08 c fullstrong : 0.00 0 0 0 0 0 0
1.98/2.08 c allfullstrong : 0.00 0 0 0 0 0 0
1.98/2.08 c random : 0.00 0 0 0 0 0 0
1.98/2.08 c Primal Heuristics : Time Calls Found
1.98/2.08 c LP solutions : 0.00 - 1
1.98/2.08 c pseudo solutions : 0.00 - 0
1.98/2.08 c trivial : 0.00 1 0
1.98/2.08 c shiftandpropagate: 0.00 0 0
1.98/2.08 c simplerounding : 0.00 0 0
1.98/2.08 c zirounding : 0.00 0 0
1.98/2.08 c rounding : 0.00 0 0
1.98/2.08 c shifting : 0.00 0 0
1.98/2.08 c intshifting : 0.00 0 0
1.98/2.08 c oneopt : 0.00 0 0
1.98/2.08 c twoopt : 0.00 0 0
1.98/2.08 c fixandinfer : 0.00 0 0
1.98/2.08 c feaspump : 0.00 0 0
1.98/2.08 c clique : 0.00 0 0
1.98/2.08 c coefdiving : 0.00 0 0
1.98/2.08 c pscostdiving : 0.00 0 0
1.98/2.08 c fracdiving : 0.00 0 0
1.98/2.08 c veclendiving : 0.00 0 0
1.98/2.08 c intdiving : 0.00 0 0
1.98/2.08 c actconsdiving : 0.00 0 0
1.98/2.08 c objpscostdiving : 0.00 0 0
1.98/2.08 c rootsoldiving : 0.00 0 0
1.98/2.08 c linesearchdiving : 0.00 0 0
1.98/2.08 c guideddiving : 0.00 0 0
1.98/2.08 c octane : 0.00 0 0
1.98/2.08 c rens : 0.00 0 0
1.98/2.08 c rins : 0.00 0 0
1.98/2.08 c localbranching : 0.00 0 0
1.98/2.08 c mutation : 0.00 0 0
1.98/2.08 c crossover : 0.00 0 0
1.98/2.08 c dins : 0.00 0 0
1.98/2.08 c vbounds : 0.00 0 0
1.98/2.08 c undercover : 0.00 0 0
1.98/2.08 c subnlp : 0.00 0 0
1.98/2.08 c trysol : 0.00 0 0
1.98/2.08 c LP : Time Calls Iterations Iter/call Iter/sec
1.98/2.08 c primal LP : 0.01 0 0 0.00 -
1.98/2.08 c dual LP : 0.10 75 1039 13.85 10469.67
1.98/2.08 c lex dual LP : 0.00 0 0 0.00 -
1.98/2.08 c barrier LP : 0.00 0 0 0.00 -
1.98/2.08 c diving/probing LP: 0.00 0 0 0.00 -
1.98/2.08 c strong branching : 0.79 343 8386 24.45 10611.03
1.98/2.08 c (at root node) : - 9 1201 133.44 -
1.98/2.08 c conflict analysis: 0.00 0 0 0.00 -
1.98/2.08 c B&B Tree :
1.98/2.08 c number of runs : 1
1.98/2.08 c nodes : 36
1.98/2.08 c nodes (total) : 36
1.98/2.08 c nodes left : 0
1.98/2.08 c max depth : 33
1.98/2.08 c max depth (total): 33
1.98/2.08 c backtracks : 0 (0.0%)
1.98/2.08 c delayed cutoffs : 0
1.98/2.08 c repropagations : 4 (20 domain reductions, 0 cutoffs)
1.98/2.08 c avg switch length: 2.11
1.98/2.08 c switching time : 0.01
1.98/2.08 c Solution :
1.98/2.08 c Solutions found : 1 (1 improvements)
1.98/2.08 c First Solution : +0.00000000000000e+00 (in run 1, after 36 nodes, 2.08 seconds, depth 33, found by <relaxation>)
1.98/2.08 c Primal Bound : +0.00000000000000e+00 (in run 1, after 36 nodes, 2.08 seconds, depth 33, found by <relaxation>)
1.98/2.08 c Dual Bound : +0.00000000000000e+00
1.98/2.08 c Gap : 0.00 %
1.98/2.08 c Root Dual Bound : +0.00000000000000e+00
1.98/2.08 c Root Iterations : 317
1.98/2.09 c Time complete: 2.09.