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-2664343-1276277378.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 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.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.02/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.02/0.03 c presolving (3 rounds):
0.02/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.03 c 8 implications, 68 cliques
0.02/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.03 c 1 constraints of type <knapsack>
0.02/0.03 c 68 constraints of type <setppc>
0.02/0.03 c 4 constraints of type <logicor>
0.02/0.03 c transformed objective value is always integral (scale: 1)
0.02/0.03 c Presolving Time: 0.01
0.02/0.03 c - non default parameters ----------------------------------------------------------------------
0.02/0.03 c # SCIP version 1.2.1.2
0.02/0.03 c
0.02/0.03 c # frequency for displaying node information lines
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.03 c display/freq = 10000
0.02/0.03 c
0.02/0.03 c # maximal time in seconds to run
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/time = 1800
0.02/0.03 c
0.02/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/memory = 1620
0.02/0.03 c
0.02/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c limits/solutions = 1
0.02/0.03 c
0.02/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c lp/solvefreq = -1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.03 c separating/maxrounds = 1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/maxroundsroot = 5
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify inequalities
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/linear/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.03 c constraints/knapsack/disaggregation = FALSE
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify knapsacks
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c presolving/probing/maxrounds = 0
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/coefdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.03 c heuristics/crossover/freq = -1
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/crossover/nodesofs = 750
0.02/0.03 c
0.02/0.03 c # number of nodes without incumbent change that heuristic should wait
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.03 c heuristics/crossover/nwaitingnodes = 100
0.02/0.03 c
0.02/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.03 c # [type: real, range: [0,1], default: 0.1]
0.02/0.03 c heuristics/crossover/nodesquot = 0.15
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixed
0.02/0.03 c # [type: real, range: [0,1], default: 0.666]
0.02/0.03 c heuristics/crossover/minfixingrate = 0.5
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/feaspump/freq = -1
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/fracdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/guideddiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/intshifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/linesearchdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/nlp/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/objpscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.03 c # [type: real, range: [0,1], default: 0.01]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/oneopt/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/pscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/rens/freq = -1
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixable
0.02/0.03 c # [type: real, range: [0,1], default: 0.5]
0.02/0.03 c heuristics/rens/minfixingrate = 0.3
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/rens/nodesofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/rootsoldiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/rounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/shifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/simplerounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/trivial/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/trysol/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/veclendiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/zirounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/cmir/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/flowcover/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/rapidlearning/freq = 0
0.02/0.03 c
0.02/0.03 c -----------------------------------------------------------------------------------------------
0.02/0.03 c start solving
0.02/0.03 c
0.02/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.03 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.28/2.30 c 2.1s| 10000 | 7192 | 0 | 0.0 |5669k| 70 | - | 169 |2414 | 0 | 0 | 0 |2460 | 0 | 0.000000e+00 | -- | Inf
6.39/6.44 c 6.0s| 20000 | 12567 | 0 | 0.0 | 10M| 72 | - | 169 |3151 | 0 | 0 | 0 |6299 | 0 | 0.000000e+00 | -- | Inf
11.58/11.61 c 10.9s| 30000 | 17248 | 0 | 0.0 | 14M| 72 | - | 169 |5402 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
19.48/19.55 c 18.6s| 40000 | 20459 | 0 | 0.0 | 18M| 72 | - | 169 |7302 | 0 | 0 | 0 | 16k| 0 | 0.000000e+00 | -- | Inf
31.58/31.62 c 30.4s| 50000 | 21198 | 0 | 0.0 | 22M| 72 | - | 169 |7582 | 0 | 0 | 0 | 24k| 0 | 0.000000e+00 | -- | Inf
42.89/42.99 c 41.5s| 60000 | 23025 | 0 | 0.0 | 25M| 72 | - | 169 |7888 | 0 | 0 | 0 | 31k| 0 | 0.000000e+00 | -- | Inf
58.58/58.61 c 56.8s| 70000 | 23127 | 0 | 0.0 | 29M| 72 | - | 169 | 11k| 0 | 0 | 0 | 39k| 0 | 0.000000e+00 | -- | Inf
78.67/78.74 c 76.6s| 80000 | 22774 | 0 | 0.0 | 32M| 72 | - | 169 | 15k| 0 | 0 | 0 | 48k| 0 | 0.000000e+00 | -- | Inf
100.87/100.96 c 98.5s| 90000 | 22570 | 0 | 0.0 | 34M| 72 | - | 169 | 18k| 0 | 0 | 0 | 56k| 0 | 0.000000e+00 | -- | Inf
134.36/134.49 c 132s|100000 | 19719 | 0 | 0.0 | 34M| 72 | - | 169 | 19k| 0 | 0 | 0 | 67k| 0 | 0.000000e+00 | -- | Inf
175.54/175.65 c 172s|110000 | 15982 | 0 | 0.0 | 32M| 72 | - | 169 | 20k| 0 | 0 | 0 | 78k| 0 | 0.000000e+00 | -- | Inf
219.43/219.55 c 216s|120000 | 10385 | 0 | 0.0 | 28M| 72 | - | 169 | 26k| 0 | 0 | 0 | 91k| 0 | 0.000000e+00 | -- | Inf
231.43/231.57 c * 228s|121983 | 0 | 0 | 0.0 | 11M| 72 | - | 169 | 28k| 0 | 0 | 0 | 94k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
231.43/231.58 c
231.43/231.58 c SCIP Status : problem is solved [optimal solution found]
231.43/231.58 c Solving Time (sec) : 227.88
231.43/231.58 c Solving Nodes : 121983
231.43/231.58 c Primal Bound : +0.00000000000000e+00 (1 solutions)
231.43/231.58 c Dual Bound : +0.00000000000000e+00
231.43/231.58 c Gap : 0.00 %
231.43/231.58 s SATISFIABLE
231.43/231.58 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
231.43/231.58 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
231.43/231.58 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106
231.43/231.58 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82
231.43/231.58 v -x81 -x80 -x79 -x78 -x77 x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 x61 -x60 -x59 -x58 -x57 -x56
231.43/231.58 v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31
231.43/231.58 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5
231.43/231.58 v -x4 -x3 -x2 -x1
231.43/231.58 c SCIP Status : problem is solved [optimal solution found]
231.43/231.58 c Solving Time : 227.88
231.43/231.58 c Original Problem :
231.43/231.58 c Problem name : HOME/instance-2664343-1276277378.opb
231.43/231.58 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
231.43/231.58 c Constraints : 101 initial, 101 maximal
231.43/231.58 c Presolved Problem :
231.43/231.58 c Problem name : t_HOME/instance-2664343-1276277378.opb
231.43/231.58 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
231.43/231.58 c Constraints : 73 initial, 28259 maximal
231.43/231.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
231.43/231.58 c trivial : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c dualfix : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c implics : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c probing : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c knapsack : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c setppc : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c linear : 0.01 0 0 0 0 0 28 0 0
231.43/231.58 c logicor : 0.00 0 0 0 0 0 0 0 0
231.43/231.58 c root node : - 0 - - 0 - - - -
231.43/231.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
231.43/231.58 c integral : 0 0 0 0 0 0 0 0 0 0
231.43/231.58 c knapsack : 1 0 411501 0 78968 9137 1308575 0 0 0
231.43/231.58 c setppc : 68 0 402364 0 78968 55032 970395 0 0 0
231.43/231.58 c logicor : 4+ 0 171650 0 55414 773 68739 0 0 0
231.43/231.58 c countsols : 0 0 0 0 78969 0 0 0 0 0
231.43/231.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
231.43/231.58 c integral : 0.00 0.00 0.00 0.00 0.00
231.43/231.58 c knapsack : 26.13 0.00 25.63 0.00 0.50
231.43/231.58 c setppc : 8.84 0.00 7.87 0.00 0.97
231.43/231.58 c logicor : 99.17 0.00 99.13 0.00 0.04
231.43/231.58 c countsols : 0.03 0.00 0.00 0.00 0.03
231.43/231.58 c Propagators : Time Calls Cutoffs DomReds
231.43/231.58 c vbounds : 0.20 1 0 0
231.43/231.58 c rootredcost : 0.23 0 0 0
231.43/231.58 c pseudoobj : 0.23 0 0 0
231.43/231.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
231.43/231.58 c propagation : 3.96 64942 64932 309497 18.7 1863 22.0 -
231.43/231.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
231.43/231.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
231.43/231.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
231.43/231.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
231.43/231.58 c applied globally : - - - 93202 13.9 - - -
231.43/231.58 c applied locally : - - - 1139 34.7 - - -
231.43/231.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
231.43/231.58 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
231.43/231.58 c redcost : 0.00 0 0 0 0 0
231.43/231.58 c impliedbounds : 0.00 0 0 0 0 0
231.43/231.58 c intobj : 0.00 0 0 0 0 0
231.43/231.58 c cgmip : 0.00 0 0 0 0 0
231.43/231.58 c gomory : 0.00 0 0 0 0 0
231.43/231.58 c strongcg : 0.00 0 0 0 0 0
231.43/231.59 c cmir : 0.00 0 0 0 0 0
231.43/231.59 c flowcover : 0.00 0 0 0 0 0
231.43/231.59 c clique : 0.00 0 0 0 0 0
231.43/231.59 c zerohalf : 0.00 0 0 0 0 0
231.43/231.59 c mcf : 0.00 0 0 0 0 0
231.43/231.59 c rapidlearning : 0.00 0 0 0 0 0
231.43/231.59 c Pricers : Time Calls Vars
231.43/231.59 c problem variables: 0.00 0 0
231.43/231.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
231.43/231.59 c relpscost : 0.00 0 0 0 0 0 0
231.43/231.59 c pscost : 0.00 0 0 0 0 0 0
231.43/231.59 c inference : 1.09 78968 0 0 0 0 157936
231.43/231.59 c mostinf : 0.00 0 0 0 0 0 0
231.43/231.59 c leastinf : 0.00 0 0 0 0 0 0
231.43/231.59 c fullstrong : 0.00 0 0 0 0 0 0
231.43/231.59 c allfullstrong : 0.00 0 0 0 0 0 0
231.43/231.59 c random : 0.00 0 0 0 0 0 0
231.43/231.59 c Primal Heuristics : Time Calls Found
231.43/231.59 c LP solutions : 0.00 - 0
231.43/231.59 c pseudo solutions : 0.07 - 1
231.43/231.59 c trivial : 0.00 1 0
231.43/231.59 c simplerounding : 0.00 0 0
231.43/231.59 c zirounding : 0.00 0 0
231.43/231.59 c rounding : 0.00 0 0
231.43/231.59 c shifting : 0.00 0 0
231.43/231.59 c intshifting : 0.00 0 0
231.43/231.59 c oneopt : 0.00 0 0
231.43/231.59 c twoopt : 0.00 0 0
231.43/231.59 c fixandinfer : 0.00 0 0
231.43/231.59 c feaspump : 0.00 0 0
231.43/231.59 c coefdiving : 0.00 0 0
231.43/231.59 c pscostdiving : 0.00 0 0
231.43/231.59 c fracdiving : 0.00 0 0
231.43/231.59 c veclendiving : 0.00 0 0
231.43/231.59 c intdiving : 0.00 0 0
231.43/231.59 c actconsdiving : 0.00 0 0
231.43/231.59 c objpscostdiving : 0.00 0 0
231.43/231.59 c rootsoldiving : 0.00 0 0
231.43/231.59 c linesearchdiving : 0.00 0 0
231.43/231.59 c guideddiving : 0.00 0 0
231.43/231.59 c octane : 0.00 0 0
231.43/231.59 c rens : 0.00 0 0
231.43/231.59 c rins : 0.00 0 0
231.43/231.59 c localbranching : 0.00 0 0
231.43/231.59 c mutation : 0.00 0 0
231.43/231.59 c crossover : 0.00 0 0
231.43/231.59 c dins : 0.00 0 0
231.43/231.59 c undercover : 0.00 0 0
231.43/231.59 c nlp : 0.00 0 0
231.43/231.59 c trysol : 0.00 0 0
231.43/231.59 c LP : Time Calls Iterations Iter/call Iter/sec
231.43/231.59 c primal LP : 0.00 0 0 0.00 -
231.43/231.59 c dual LP : 0.00 0 0 0.00 -
231.43/231.59 c lex dual LP : 0.00 0 0 0.00 -
231.43/231.59 c barrier LP : 0.00 0 0 0.00 -
231.43/231.59 c diving/probing LP: 0.00 0 0 0.00 -
231.43/231.59 c strong branching : 0.00 0 0 0.00 -
231.43/231.59 c (at root node) : - 0 0 0.00 -
231.43/231.59 c conflict analysis: 0.00 0 0 0.00 -
231.43/231.59 c B&B Tree :
231.43/231.59 c number of runs : 1
231.43/231.59 c nodes : 121983
231.43/231.59 c nodes (total) : 121983
231.43/231.59 c nodes left : 0
231.43/231.59 c max depth : 72
231.43/231.59 c max depth (total): 72
231.43/231.59 c backtracks : 45526 (37.3%)
231.43/231.59 c delayed cutoffs : 27257
231.43/231.59 c repropagations : 144744 (675250 domain reductions, 21928 cutoffs)
231.43/231.59 c avg switch length: 18.06
231.43/231.59 c switching time : 62.89
231.43/231.59 c Solution :
231.43/231.59 c Solutions found : 1 (1 improvements)
231.43/231.59 c First Solution : +0.00000000000000e+00 (in run 1, after 121983 nodes, 227.80 seconds, depth 44, found by <relaxation>)
231.43/231.59 c Primal Bound : +0.00000000000000e+00 (in run 1, after 121983 nodes, 227.80 seconds, depth 44, found by <relaxation>)
231.43/231.59 c Dual Bound : +0.00000000000000e+00
231.43/231.59 c Gap : 0.00 %
231.43/231.59 c Root Dual Bound : +0.00000000000000e+00
231.43/231.59 c Root Iterations : 0
231.53/231.66 c Time complete: 231.59.