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-2664299-1276273094.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.00/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.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = -1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 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.04 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.06 c 1.9s| 10000 | 7645 | 0 | 0.0 |5605k| 71 | - | 169 |2172 | 0 | 0 | 0 |2186 | 0 | 0.000000e+00 | -- | Inf
6.19/6.29 c 5.8s| 20000 | 13162 | 0 | 0.0 | 10M| 75 | - | 169 |2796 | 0 | 0 | 0 |6051 | 0 | 0.000000e+00 | -- | Inf
10.78/10.80 c 10.1s| 30000 | 18438 | 0 | 0.0 | 14M| 75 | - | 169 |3941 | 0 | 0 | 0 | 10k| 0 | 0.000000e+00 | -- | Inf
16.59/16.68 c 15.8s| 40000 | 22916 | 0 | 0.0 | 18M| 75 | - | 169 |5244 | 0 | 0 | 0 | 15k| 0 | 0.000000e+00 | -- | Inf
24.20/24.29 c 23.1s| 50000 | 26346 | 0 | 0.0 | 22M| 75 | - | 169 |5920 | 0 | 0 | 0 | 21k| 0 | 0.000000e+00 | -- | Inf
34.89/34.92 c 33.5s| 60000 | 27405 | 0 | 0.0 | 25M| 75 | - | 169 |5801 | 0 | 0 | 0 | 29k| 0 | 0.000000e+00 | -- | Inf
44.58/44.66 c 43.0s| 70000 | 29550 | 0 | 0.0 | 28M| 75 | - | 169 |6054 | 0 | 0 | 0 | 35k| 0 | 0.000000e+00 | -- | Inf
57.78/57.85 c 55.9s| 80000 | 30068 | 0 | 0.0 | 31M| 75 | - | 169 |7861 | 0 | 0 | 0 | 43k| 0 | 0.000000e+00 | -- | Inf
74.27/74.37 c 72.1s| 90000 | 29529 | 0 | 0.0 | 34M| 75 | - | 169 |9501 | 0 | 0 | 0 | 52k| 0 | 0.000000e+00 | -- | Inf
93.76/93.81 c 91.2s|100000 | 28282 | 0 | 0.0 | 36M| 75 | - | 169 | 11k| 0 | 0 | 0 | 61k| 0 | 0.000000e+00 | -- | Inf
115.26/115.31 c 112s|110000 | 26761 | 0 | 0.0 | 38M| 75 | - | 169 | 12k| 0 | 0 | 0 | 71k| 0 | 0.000000e+00 | -- | Inf
141.06/141.16 c 138s|120000 | 24239 | 0 | 0.0 | 38M| 75 | - | 169 | 13k| 0 | 0 | 0 | 82k| 0 | 0.000000e+00 | -- | Inf
171.15/171.24 c 168s|130000 | 20060 | 0 | 0.0 | 36M| 75 | - | 169 | 12k| 0 | 0 | 0 | 94k| 0 | 0.000000e+00 | -- | Inf
203.85/203.92 c 200s|140000 | 14504 | 0 | 0.0 | 32M| 75 | - | 169 | 16k| 0 | 0 | 0 | 106k| 0 | 0.000000e+00 | -- | Inf
228.23/228.33 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
228.23/228.33 c * 224s|145971 | 0 | 0 | 0.0 |7995k| 75 | - | 169 | 19k| 0 | 0 | 0 | 115k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
228.23/228.34 c
228.23/228.34 c SCIP Status : problem is solved [optimal solution found]
228.23/228.34 c Solving Time (sec) : 224.06
228.23/228.34 c Solving Nodes : 145971
228.23/228.34 c Primal Bound : +0.00000000000000e+00 (1 solutions)
228.23/228.34 c Dual Bound : +0.00000000000000e+00
228.23/228.34 c Gap : 0.00 %
228.23/228.34 s SATISFIABLE
228.23/228.34 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
228.23/228.34 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
228.23/228.34 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
228.23/228.34 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
228.23/228.34 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
228.23/228.34 v -x56 -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
228.23/228.34 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
228.23/228.34 v -x4 -x3 -x2 -x1
228.23/228.34 c SCIP Status : problem is solved [optimal solution found]
228.23/228.34 c Solving Time : 224.06
228.23/228.34 c Original Problem :
228.23/228.34 c Problem name : HOME/instance-2664299-1276273094.opb
228.23/228.34 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
228.23/228.34 c Constraints : 101 initial, 101 maximal
228.23/228.34 c Presolved Problem :
228.23/228.34 c Problem name : t_HOME/instance-2664299-1276273094.opb
228.23/228.34 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
228.23/228.34 c Constraints : 73 initial, 19082 maximal
228.23/228.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
228.23/228.34 c trivial : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c dualfix : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c implics : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c probing : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c knapsack : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c setppc : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c linear : 0.00 0 0 0 0 0 28 0 0
228.23/228.34 c logicor : 0.00 0 0 0 0 0 0 0 0
228.23/228.34 c root node : - 0 - - 0 - - - -
228.23/228.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
228.23/228.34 c integral : 0 0 0 0 0 0 0 0 0 0
228.23/228.34 c knapsack : 1 0 483716 0 93623 11109 1474839 0 0 0
228.23/228.34 c setppc : 68 0 472605 0 93622 64608 1122605 0 0 0
228.23/228.34 c logicor : 4+ 0 207217 0 54873 876 78832 0 0 0
228.23/228.34 c countsols : 0 0 0 0 93623 0 0 0 0 0
228.23/228.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
228.23/228.34 c integral : 0.00 0.00 0.00 0.00 0.00
228.23/228.34 c knapsack : 30.43 0.00 29.73 0.00 0.70
228.23/228.34 c setppc : 9.88 0.00 8.42 0.00 1.46
228.23/228.34 c logicor : 91.70 0.00 91.67 0.00 0.03
228.23/228.34 c countsols : 0.05 0.00 0.00 0.00 0.05
228.23/228.34 c Propagators : Time Calls Cutoffs DomReds
228.23/228.34 c vbounds : 0.23 1 0 0
228.23/228.34 c rootredcost : 0.16 0 0 0
228.23/228.34 c pseudoobj : 0.21 0 0 0
228.23/228.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
228.23/228.34 c propagation : 4.00 76593 76580 362441 18.9 1948 22.7 -
228.23/228.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
228.23/228.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
228.23/228.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
228.23/228.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
228.23/228.34 c applied globally : - - - 114309 14.2 - - -
228.23/228.34 c applied locally : - - - 1178 35.0 - - -
228.23/228.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
228.23/228.34 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
228.23/228.34 c redcost : 0.00 0 0 0 0 0
228.23/228.34 c impliedbounds : 0.00 0 0 0 0 0
228.23/228.34 c intobj : 0.00 0 0 0 0 0
228.23/228.34 c cgmip : 0.00 0 0 0 0 0
228.23/228.34 c gomory : 0.00 0 0 0 0 0
228.23/228.34 c strongcg : 0.00 0 0 0 0 0
228.23/228.34 c cmir : 0.00 0 0 0 0 0
228.23/228.34 c flowcover : 0.00 0 0 0 0 0
228.23/228.34 c clique : 0.00 0 0 0 0 0
228.23/228.34 c zerohalf : 0.00 0 0 0 0 0
228.23/228.34 c mcf : 0.00 0 0 0 0 0
228.23/228.34 c rapidlearning : 0.00 0 0 0 0 0
228.23/228.34 c Pricers : Time Calls Vars
228.23/228.34 c problem variables: 0.00 0 0
228.23/228.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
228.23/228.34 c relpscost : 0.00 0 0 0 0 0 0
228.23/228.34 c pscost : 0.00 0 0 0 0 0 0
228.23/228.34 c inference : 1.39 93622 0 0 0 0 187244
228.23/228.34 c mostinf : 0.00 0 0 0 0 0 0
228.23/228.34 c leastinf : 0.00 0 0 0 0 0 0
228.23/228.34 c fullstrong : 0.00 0 0 0 0 0 0
228.23/228.34 c allfullstrong : 0.00 0 0 0 0 0 0
228.23/228.34 c random : 0.00 0 0 0 0 0 0
228.23/228.34 c Primal Heuristics : Time Calls Found
228.23/228.34 c LP solutions : 0.00 - 0
228.23/228.34 c pseudo solutions : 0.08 - 1
228.23/228.34 c trivial : 0.00 1 0
228.23/228.34 c simplerounding : 0.00 0 0
228.23/228.34 c zirounding : 0.00 0 0
228.23/228.34 c rounding : 0.00 0 0
228.23/228.34 c shifting : 0.00 0 0
228.23/228.34 c intshifting : 0.00 0 0
228.23/228.34 c oneopt : 0.00 0 0
228.23/228.34 c twoopt : 0.00 0 0
228.23/228.34 c fixandinfer : 0.00 0 0
228.23/228.34 c feaspump : 0.00 0 0
228.23/228.34 c coefdiving : 0.00 0 0
228.23/228.34 c pscostdiving : 0.00 0 0
228.23/228.34 c fracdiving : 0.00 0 0
228.23/228.34 c veclendiving : 0.00 0 0
228.23/228.34 c intdiving : 0.00 0 0
228.23/228.34 c actconsdiving : 0.00 0 0
228.23/228.34 c objpscostdiving : 0.00 0 0
228.23/228.34 c rootsoldiving : 0.00 0 0
228.23/228.34 c linesearchdiving : 0.00 0 0
228.23/228.34 c guideddiving : 0.00 0 0
228.23/228.34 c octane : 0.00 0 0
228.23/228.34 c rens : 0.00 0 0
228.23/228.34 c rins : 0.00 0 0
228.23/228.34 c localbranching : 0.00 0 0
228.23/228.34 c mutation : 0.00 0 0
228.23/228.34 c crossover : 0.00 0 0
228.23/228.34 c dins : 0.00 0 0
228.23/228.34 c undercover : 0.00 0 0
228.23/228.34 c nlp : 0.00 0 0
228.23/228.34 c trysol : 0.00 0 0
228.23/228.34 c LP : Time Calls Iterations Iter/call Iter/sec
228.23/228.34 c primal LP : 0.00 0 0 0.00 -
228.23/228.34 c dual LP : 0.00 0 0 0.00 -
228.23/228.34 c lex dual LP : 0.00 0 0 0.00 -
228.23/228.34 c barrier LP : 0.00 0 0 0.00 -
228.23/228.34 c diving/probing LP: 0.00 0 0 0.00 -
228.23/228.34 c strong branching : 0.00 0 0 0.00 -
228.23/228.34 c (at root node) : - 0 0 0.00 -
228.23/228.34 c conflict analysis: 0.00 0 0 0.00 -
228.23/228.34 c B&B Tree :
228.23/228.34 c number of runs : 1
228.23/228.34 c nodes : 145971
228.23/228.34 c nodes (total) : 145971
228.23/228.34 c nodes left : 0
228.23/228.34 c max depth : 75
228.23/228.34 c max depth (total): 75
228.23/228.34 c backtracks : 54873 (37.6%)
228.23/228.34 c delayed cutoffs : 31499
228.23/228.34 c repropagations : 173008 (718847 domain reductions, 24245 cutoffs)
228.23/228.34 c avg switch length: 19.29
228.23/228.34 c switching time : 62.45
228.23/228.34 c Solution :
228.23/228.34 c Solutions found : 1 (1 improvements)
228.23/228.34 c First Solution : +0.00000000000000e+00 (in run 1, after 145971 nodes, 223.97 seconds, depth 41, found by <relaxation>)
228.23/228.34 c Primal Bound : +0.00000000000000e+00 (in run 1, after 145971 nodes, 223.97 seconds, depth 41, found by <relaxation>)
228.23/228.34 c Dual Bound : +0.00000000000000e+00
228.23/228.34 c Gap : 0.00 %
228.23/228.34 c Root Dual Bound : +0.00000000000000e+00
228.23/228.34 c Root Iterations : 0
228.33/228.40 c Time complete: 228.34.