0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664393-1276288563.opb>
0.00/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.06 c problem read
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c presolving settings loaded
0.00/0.06 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.07 c presolving:
0.10/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.10/0.14 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.10/0.15 c presolving (3 rounds):
0.10/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.15 c 242 implications, 22 cliques
0.10/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.10/0.15 c 1 constraints of type <knapsack>
0.10/0.15 c 22 constraints of type <setppc>
0.10/0.15 c 2541 constraints of type <logicor>
0.10/0.15 c transformed objective value is always integral (scale: 1)
0.10/0.15 c Presolving Time: 0.06
0.10/0.15 c - non default parameters ----------------------------------------------------------------------
0.10/0.15 c # SCIP version 1.2.1.2
0.10/0.15 c
0.10/0.15 c # frequency for displaying node information lines
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.15 c display/freq = 10000
0.10/0.15 c
0.10/0.15 c # maximal time in seconds to run
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.15 c limits/time = 1799.95
0.10/0.15 c
0.10/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.15 c limits/memory = 1620
0.10/0.15 c
0.10/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c limits/solutions = 1
0.10/0.15 c
0.10/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c lp/solvefreq = -1
0.10/0.15 c
0.10/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.15 c separating/maxrounds = 1
0.10/0.15 c
0.10/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c separating/maxroundsroot = 5
0.10/0.15 c
0.10/0.15 c # should presolving try to simplify inequalities
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.15 c constraints/linear/simplifyinequalities = TRUE
0.10/0.15 c
0.10/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.15 c constraints/knapsack/disaggregation = FALSE
0.10/0.15 c
0.10/0.15 c # should presolving try to simplify knapsacks
0.10/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.10/0.15 c
0.10/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c presolving/probing/maxrounds = 0
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/coefdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.15 c heuristics/crossover/freq = -1
0.10/0.15 c
0.10/0.15 c # number of nodes added to the contingent of the total nodes
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.15 c heuristics/crossover/nodesofs = 750
0.10/0.15 c
0.10/0.15 c # number of nodes without incumbent change that heuristic should wait
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.15 c heuristics/crossover/nwaitingnodes = 100
0.10/0.15 c
0.10/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.15 c # [type: real, range: [0,1], default: 0.1]
0.10/0.15 c heuristics/crossover/nodesquot = 0.15
0.10/0.15 c
0.10/0.15 c # minimum percentage of integer variables that have to be fixed
0.10/0.15 c # [type: real, range: [0,1], default: 0.666]
0.10/0.15 c heuristics/crossover/minfixingrate = 0.5
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/feaspump/freq = -1
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/fracdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/guideddiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/intshifting/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/linesearchdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/nlp/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/objpscostdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.15 c # [type: real, range: [0,1], default: 0.01]
0.10/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/oneopt/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/pscostdiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c heuristics/rens/freq = -1
0.10/0.15 c
0.10/0.15 c # minimum percentage of integer variables that have to be fixable
0.10/0.15 c # [type: real, range: [0,1], default: 0.5]
0.10/0.15 c heuristics/rens/minfixingrate = 0.3
0.10/0.15 c
0.10/0.15 c # number of nodes added to the contingent of the total nodes
0.10/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.15 c heuristics/rens/nodesofs = 2000
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.15 c heuristics/rootsoldiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/rounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/shifting/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/simplerounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c heuristics/trivial/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/trysol/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.15 c heuristics/veclendiving/freq = -1
0.10/0.15 c
0.10/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.10/0.15 c
0.10/0.15 c # additional number of allowed LP iterations
0.10/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.10/0.15 c
0.10/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.15 c heuristics/zirounding/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c separating/cmir/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.15 c separating/flowcover/freq = -1
0.10/0.15 c
0.10/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.10/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.15 c separating/rapidlearning/freq = 0
0.10/0.15 c
0.10/0.15 c -----------------------------------------------------------------------------------------------
0.10/0.15 c start solving
0.10/0.15 c
0.10/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.15 c 0.1s| 1 | 2 | 0 | - |2396k| 0 | - | 231 |2564 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.19/4.20 c 3.9s| 10000 | 8053 | 0 | 0.0 |7286k| 106 | - | 231 |4430 | 0 | 0 | 0 |2801 | 0 | 0.000000e+00 | -- | Inf
10.09/10.17 c 9.6s| 20000 | 14612 | 0 | 0.0 | 11M| 106 | - | 231 |5509 | 0 | 0 | 0 |7271 | 0 | 0.000000e+00 | -- | Inf
15.99/16.05 c 15.3s| 30000 | 21847 | 0 | 0.0 | 16M| 106 | - | 231 |6310 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
22.99/23.02 c 22.0s| 40000 | 28686 | 0 | 0.0 | 21M| 106 | - | 231 |7375 | 0 | 0 | 0 | 14k| 0 | 0.000000e+00 | -- | Inf
31.08/31.19 c 29.9s| 50000 | 35013 | 0 | 0.0 | 26M| 106 | - | 231 |8439 | 0 | 0 | 0 | 19k| 0 | 0.000000e+00 | -- | Inf
41.98/42.08 c 40.5s| 60000 | 40207 | 0 | 0.0 | 31M| 106 | - | 231 | 10k| 0 | 0 | 0 | 25k| 0 | 0.000000e+00 | -- | Inf
56.08/56.17 c 54.3s| 70000 | 44492 | 0 | 0.0 | 37M| 106 | - | 231 | 12k| 0 | 0 | 0 | 33k| 0 | 0.000000e+00 | -- | Inf
74.17/74.26 c 72.0s| 80000 | 47747 | 0 | 0.0 | 41M| 106 | - | 231 | 12k| 0 | 0 | 0 | 43k| 0 | 0.000000e+00 | -- | Inf
91.46/91.52 c 89.0s| 90000 | 51660 | 0 | 0.0 | 45M| 106 | - | 231 | 11k| 0 | 0 | 0 | 50k| 0 | 0.000000e+00 | -- | Inf
94.68/94.74 c *92.1s| 92468 | 0 | 0 | 0.0 |6137k| 106 | - | 231 | 11k| 0 | 0 | 0 | 51k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
94.68/94.75 c
94.68/94.75 c SCIP Status : problem is solved [optimal solution found]
94.68/94.75 c Solving Time (sec) : 92.12
94.68/94.75 c Solving Nodes : 92468
94.68/94.75 c Primal Bound : +0.00000000000000e+00 (1 solutions)
94.68/94.75 c Dual Bound : +0.00000000000000e+00
94.68/94.75 c Gap : 0.00 %
94.68/94.75 s SATISFIABLE
94.68/94.75 v x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 x170 -x160 -x150 -x140 -x130 -x230 -x220
94.68/94.75 v -x199 -x189 x179 -x169 -x159 -x149 -x139 -x129 x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
94.68/94.75 v -x198 -x177 -x167 x157 -x147 -x137 -x127 -x227 -x217 -x207 x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
94.68/94.75 v -x186 -x176 -x155 -x145 x135 -x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 x184 -x174
94.68/94.75 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 x122 -x222 -x212 -x202 -x192 -x182 -x172 -x162
94.68/94.75 v -x152 x142 -x132 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 x105 -x104
94.68/94.75 v -x103 -x102 -x101 -x100 -x99 -x98 -x97 x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80
94.68/94.75 v -x79 -x78 -x77 x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 x60 -x59 -x58 -x57 -x56 -x55 -x54
94.68/94.75 v -x53 -x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 -x30 -x29
94.68/94.75 v -x28 -x27 -x26 x25 -x24 -x23 -x22 -x11 -x21 -x10 -x20 -x9 -x19 -x8 x18 -x7 -x17 -x6 -x16 -x5 -x15 x4 -x14 -x3 -x13 -x2 -x12
94.68/94.75 v -x1
94.68/94.75 c SCIP Status : problem is solved [optimal solution found]
94.68/94.75 c Solving Time : 92.12
94.68/94.75 c Original Problem :
94.68/94.75 c Problem name : HOME/instance-2664393-1276288563.opb
94.68/94.75 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
94.68/94.75 c Constraints : 2707 initial, 2707 maximal
94.68/94.75 c Presolved Problem :
94.68/94.75 c Problem name : t_HOME/instance-2664393-1276288563.opb
94.68/94.75 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
94.68/94.75 c Constraints : 2564 initial, 12981 maximal
94.68/94.75 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
94.68/94.75 c trivial : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c dualfix : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c boundshift : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c inttobinary : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c implics : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c probing : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c knapsack : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c setppc : 0.00 0 0 0 0 0 0 0 0
94.68/94.75 c linear : 0.02 0 0 0 0 0 143 0 0
94.68/94.75 c logicor : 0.03 0 0 0 0 0 0 0 0
94.68/94.75 c root node : - 0 - - 0 - - - -
94.68/94.75 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
94.68/94.75 c integral : 0 0 0 0 0 0 0 0 0 0
94.68/94.75 c knapsack : 1 0 259587 0 78530 6959 760943 0 0 0
94.68/94.75 c setppc : 22 0 253940 0 78530 9640 330178 0 0 0
94.68/94.75 c logicor : 2541+ 0 199949 0 78531 7631 727926 0 0 0
94.68/94.75 c countsols : 0 0 0 0 78531 0 0 0 0 0
94.68/94.75 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
94.68/94.75 c integral : 0.00 0.00 0.00 0.00 0.00
94.68/94.75 c knapsack : 4.71 0.00 4.38 0.00 0.33
94.68/94.75 c setppc : 2.81 0.00 2.27 0.00 0.54
94.68/94.75 c logicor : 46.27 0.00 35.23 0.00 11.04
94.68/94.75 c countsols : 0.02 0.00 0.00 0.00 0.02
94.68/94.75 c Propagators : Time Calls Cutoffs DomReds
94.68/94.75 c vbounds : 0.18 1 0 0
94.68/94.75 c rootredcost : 0.12 0 0 0
94.68/94.75 c pseudoobj : 0.12 0 0 0
94.68/94.75 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
94.68/94.75 c propagation : 1.41 24230 24216 101648 17.4 545 21.2 -
94.68/94.75 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
94.68/94.75 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
94.68/94.75 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
94.68/94.75 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
94.68/94.75 c applied globally : - - - 51282 14.2 - - -
94.68/94.75 c applied locally : - - - 375 35.2 - - -
94.68/94.75 c Separators : Time Calls Cutoffs DomReds Cuts Conss
94.68/94.75 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
94.68/94.75 c redcost : 0.00 0 0 0 0 0
94.68/94.75 c impliedbounds : 0.00 0 0 0 0 0
94.68/94.75 c intobj : 0.00 0 0 0 0 0
94.68/94.75 c cgmip : 0.00 0 0 0 0 0
94.68/94.75 c gomory : 0.00 0 0 0 0 0
94.68/94.75 c strongcg : 0.00 0 0 0 0 0
94.68/94.75 c cmir : 0.00 0 0 0 0 0
94.68/94.75 c flowcover : 0.00 0 0 0 0 0
94.68/94.75 c clique : 0.00 0 0 0 0 0
94.68/94.75 c zerohalf : 0.00 0 0 0 0 0
94.68/94.75 c mcf : 0.00 0 0 0 0 0
94.68/94.75 c rapidlearning : 0.00 0 0 0 0 0
94.68/94.75 c Pricers : Time Calls Vars
94.68/94.75 c problem variables: 0.00 0 0
94.68/94.75 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
94.68/94.75 c relpscost : 0.00 0 0 0 0 0 0
94.68/94.75 c pscost : 0.00 0 0 0 0 0 0
94.68/94.75 c inference : 2.09 78530 0 0 0 0 157060
94.68/94.75 c mostinf : 0.00 0 0 0 0 0 0
94.68/94.75 c leastinf : 0.00 0 0 0 0 0 0
94.68/94.75 c fullstrong : 0.00 0 0 0 0 0 0
94.68/94.75 c allfullstrong : 0.00 0 0 0 0 0 0
94.68/94.75 c random : 0.00 0 0 0 0 0 0
94.68/94.75 c Primal Heuristics : Time Calls Found
94.68/94.75 c LP solutions : 0.00 - 0
94.68/94.75 c pseudo solutions : 0.13 - 1
94.68/94.75 c trivial : 0.01 1 0
94.68/94.75 c simplerounding : 0.00 0 0
94.68/94.75 c zirounding : 0.00 0 0
94.68/94.75 c rounding : 0.00 0 0
94.68/94.75 c shifting : 0.00 0 0
94.68/94.75 c intshifting : 0.00 0 0
94.68/94.75 c oneopt : 0.00 0 0
94.68/94.75 c twoopt : 0.00 0 0
94.68/94.75 c fixandinfer : 0.00 0 0
94.68/94.75 c feaspump : 0.00 0 0
94.68/94.75 c coefdiving : 0.00 0 0
94.68/94.75 c pscostdiving : 0.00 0 0
94.68/94.75 c fracdiving : 0.00 0 0
94.68/94.75 c veclendiving : 0.00 0 0
94.68/94.75 c intdiving : 0.00 0 0
94.68/94.75 c actconsdiving : 0.00 0 0
94.68/94.75 c objpscostdiving : 0.00 0 0
94.68/94.75 c rootsoldiving : 0.00 0 0
94.68/94.75 c linesearchdiving : 0.00 0 0
94.68/94.75 c guideddiving : 0.00 0 0
94.68/94.75 c octane : 0.00 0 0
94.68/94.75 c rens : 0.00 0 0
94.68/94.75 c rins : 0.00 0 0
94.68/94.75 c localbranching : 0.00 0 0
94.68/94.75 c mutation : 0.00 0 0
94.68/94.75 c crossover : 0.00 0 0
94.68/94.75 c dins : 0.00 0 0
94.68/94.75 c undercover : 0.00 0 0
94.68/94.75 c nlp : 0.00 0 0
94.68/94.75 c trysol : 0.00 0 0
94.68/94.75 c LP : Time Calls Iterations Iter/call Iter/sec
94.68/94.75 c primal LP : 0.00 0 0 0.00 -
94.68/94.75 c dual LP : 0.00 0 0 0.00 -
94.68/94.75 c lex dual LP : 0.00 0 0 0.00 -
94.68/94.75 c barrier LP : 0.00 0 0 0.00 -
94.68/94.75 c diving/probing LP: 0.00 0 0 0.00 -
94.68/94.75 c strong branching : 0.00 0 0 0.00 -
94.68/94.75 c (at root node) : - 0 0 0.00 -
94.68/94.75 c conflict analysis: 0.00 0 0 0.00 -
94.68/94.75 c B&B Tree :
94.68/94.75 c number of runs : 1
94.68/94.75 c nodes : 92468
94.68/94.75 c nodes (total) : 92468
94.68/94.75 c nodes left : 0
94.68/94.75 c max depth : 106
94.68/94.75 c max depth (total): 106
94.68/94.75 c backtracks : 13296 (14.4%)
94.68/94.75 c delayed cutoffs : 11426
94.68/94.75 c repropagations : 46904 (623192 domain reductions, 10293 cutoffs)
94.68/94.75 c avg switch length: 9.04
94.68/94.75 c switching time : 22.36
94.68/94.75 c Solution :
94.68/94.75 c Solutions found : 1 (1 improvements)
94.68/94.75 c First Solution : +0.00000000000000e+00 (in run 1, after 92468 nodes, 91.98 seconds, depth 23, found by <relaxation>)
94.68/94.75 c Primal Bound : +0.00000000000000e+00 (in run 1, after 92468 nodes, 91.98 seconds, depth 23, found by <relaxation>)
94.68/94.75 c Dual Bound : +0.00000000000000e+00
94.68/94.75 c Gap : 0.00 %
94.68/94.75 c Root Dual Bound : +0.00000000000000e+00
94.68/94.75 c Root Iterations : 0
94.68/94.79 c Time complete: 94.75.