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-2664359-1276278499.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.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.8s| 10000 | 7580 | 0 | 0.0 |5416k| 74 | - | 169 |2161 | 0 | 0 | 0 |2148 | 0 | 0.000000e+00 | -- | Inf
5.89/5.98 c 5.5s| 20000 | 13563 | 0 | 0.0 |9845k| 74 | - | 169 |3272 | 0 | 0 | 0 |5742 | 0 | 0.000000e+00 | -- | Inf
10.19/10.20 c 9.6s| 30000 | 19125 | 0 | 0.0 | 13M| 74 | - | 169 |3511 | 0 | 0 | 0 |9482 | 0 | 0.000000e+00 | -- | Inf
15.59/15.66 c 14.8s| 40000 | 23522 | 0 | 0.0 | 18M| 74 | - | 169 |4766 | 0 | 0 | 0 | 14k| 0 | 0.000000e+00 | -- | Inf
22.99/23.10 c 21.9s| 50000 | 26726 | 0 | 0.0 | 22M| 74 | - | 169 |5692 | 0 | 0 | 0 | 20k| 0 | 0.000000e+00 | -- | Inf
33.08/33.13 c 31.7s| 60000 | 28369 | 0 | 0.0 | 25M| 74 | - | 169 |6774 | 0 | 0 | 0 | 27k| 0 | 0.000000e+00 | -- | Inf
42.98/43.01 c 41.3s| 70000 | 31420 | 0 | 0.0 | 28M| 74 | - | 169 |7289 | 0 | 0 | 0 | 33k| 0 | 0.000000e+00 | -- | Inf
54.58/54.67 c 52.7s| 80000 | 33684 | 0 | 0.0 | 32M| 74 | - | 169 |8368 | 0 | 0 | 0 | 40k| 0 | 0.000000e+00 | -- | Inf
67.87/67.99 c 65.8s| 90000 | 35224 | 0 | 0.0 | 35M| 74 | - | 169 |8891 | 0 | 0 | 0 | 47k| 0 | 0.000000e+00 | -- | Inf
83.06/83.11 c 80.6s|100000 | 36044 | 0 | 0.0 | 38M| 74 | - | 169 | 10k| 0 | 0 | 0 | 55k| 0 | 0.000000e+00 | -- | Inf
101.06/101.20 c 98.3s|110000 | 36087 | 0 | 0.0 | 41M| 74 | - | 169 | 12k| 0 | 0 | 0 | 63k| 0 | 0.000000e+00 | -- | Inf
121.75/121.84 c 119s|120000 | 35726 | 0 | 0.0 | 43M| 74 | - | 169 | 14k| 0 | 0 | 0 | 72k| 0 | 0.000000e+00 | -- | Inf
147.84/147.92 c 144s|130000 | 33889 | 0 | 0.0 | 44M| 74 | - | 169 | 16k| 0 | 0 | 0 | 83k| 0 | 0.000000e+00 | -- | Inf
178.53/178.60 c 175s|140000 | 32287 | 0 | 0.0 | 45M| 74 | - | 169 | 16k| 0 | 0 | 0 | 93k| 0 | 0.000000e+00 | -- | Inf
212.82/212.90 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
212.82/212.90 c 209s|150000 | 30442 | 0 | 0.0 | 46M| 74 | - | 169 | 18k| 0 | 0 | 0 | 103k| 0 | 0.000000e+00 | -- | Inf
253.80/253.99 c 249s|160000 | 26751 | 0 | 0.0 | 45M| 74 | - | 169 | 21k| 0 | 0 | 0 | 115k| 0 | 0.000000e+00 | -- | Inf
298.78/298.97 c 294s|170000 | 22301 | 0 | 0.0 | 44M| 74 | - | 169 | 24k| 0 | 0 | 0 | 127k| 0 | 0.000000e+00 | -- | Inf
351.06/351.26 c 346s|180000 | 16972 | 0 | 0.0 | 40M| 74 | - | 169 | 28k| 0 | 0 | 0 | 140k| 0 | 0.000000e+00 | -- | Inf
432.73/432.99 c 427s|190000 | 7199 | 0 | 0.0 | 28M| 74 | - | 169 | 30k| 0 | 0 | 0 | 157k| 0 | 0.000000e+00 | -- | Inf
473.22/473.48 c * 467s|194391 | 0 | 0 | 0.0 | 13M| 74 | - | 169 | 33k| 0 | 0 | 0 | 165k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
473.22/473.49 c
473.22/473.49 c SCIP Status : problem is solved [optimal solution found]
473.22/473.49 c Solving Time (sec) : 467.26
473.22/473.49 c Solving Nodes : 194391
473.22/473.49 c Primal Bound : +0.00000000000000e+00 (1 solutions)
473.22/473.49 c Dual Bound : +0.00000000000000e+00
473.22/473.49 c Gap : 0.00 %
473.22/473.49 s SATISFIABLE
473.22/473.49 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
473.22/473.49 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
473.22/473.49 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
473.22/473.49 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
473.22/473.49 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
473.22/473.49 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
473.22/473.49 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
473.22/473.49 v -x4 -x3 x2 -x1
473.22/473.49 c SCIP Status : problem is solved [optimal solution found]
473.22/473.49 c Solving Time : 467.26
473.22/473.49 c Original Problem :
473.22/473.49 c Problem name : HOME/instance-2664359-1276278499.opb
473.22/473.49 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
473.22/473.49 c Constraints : 101 initial, 101 maximal
473.22/473.49 c Presolved Problem :
473.22/473.49 c Problem name : t_HOME/instance-2664359-1276278499.opb
473.22/473.49 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
473.22/473.49 c Constraints : 73 initial, 33974 maximal
473.22/473.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
473.22/473.49 c trivial : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c dualfix : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c implics : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c probing : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c knapsack : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c setppc : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c linear : 0.00 0 0 0 0 0 28 0 0
473.22/473.49 c logicor : 0.00 0 0 0 0 0 0 0 0
473.22/473.49 c root node : - 0 - - 0 - - - -
473.22/473.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
473.22/473.49 c integral : 0 0 0 0 0 0 0 0 0 0
473.22/473.49 c knapsack : 1 0 664770 0 121079 15126 1896224 0 0 0
473.22/473.49 c setppc : 68 0 649642 0 121078 92050 1467757 0 0 0
473.22/473.49 c logicor : 4+ 0 283739 0 38617 1289 109198 0 0 0
473.22/473.49 c countsols : 0 0 0 0 121079 0 0 0 0 0
473.22/473.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
473.22/473.49 c integral : 0.00 0.00 0.00 0.00 0.00
473.22/473.49 c knapsack : 44.37 0.00 43.42 0.00 0.95
473.22/473.49 c setppc : 15.08 0.00 13.37 0.00 1.71
473.22/473.49 c logicor : 215.59 0.00 215.55 0.00 0.04
473.22/473.49 c countsols : 0.08 0.00 0.00 0.00 0.08
473.22/473.49 c Propagators : Time Calls Cutoffs DomReds
473.22/473.49 c vbounds : 0.36 1 0 0
473.22/473.49 c rootredcost : 0.35 0 0 0
473.22/473.49 c pseudoobj : 0.26 0 0 0
473.22/473.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
473.22/473.49 c propagation : 6.33 108465 108452 551523 19.0 2793 21.5 -
473.22/473.49 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
473.22/473.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
473.22/473.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
473.22/473.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
473.22/473.49 c applied globally : - - - 164751 14.1 - - -
473.22/473.49 c applied locally : - - - 642 33.9 - - -
473.22/473.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
473.22/473.49 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
473.22/473.49 c redcost : 0.00 0 0 0 0 0
473.22/473.49 c impliedbounds : 0.00 0 0 0 0 0
473.22/473.49 c intobj : 0.00 0 0 0 0 0
473.22/473.49 c cgmip : 0.00 0 0 0 0 0
473.22/473.49 c gomory : 0.00 0 0 0 0 0
473.22/473.49 c strongcg : 0.00 0 0 0 0 0
473.22/473.49 c cmir : 0.00 0 0 0 0 0
473.22/473.49 c flowcover : 0.00 0 0 0 0 0
473.22/473.49 c clique : 0.00 0 0 0 0 0
473.22/473.49 c zerohalf : 0.00 0 0 0 0 0
473.22/473.49 c mcf : 0.00 0 0 0 0 0
473.22/473.49 c rapidlearning : 0.00 0 0 0 0 0
473.22/473.49 c Pricers : Time Calls Vars
473.22/473.49 c problem variables: 0.00 0 0
473.22/473.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
473.22/473.49 c relpscost : 0.00 0 0 0 0 0 0
473.22/473.49 c pscost : 0.00 0 0 0 0 0 0
473.22/473.49 c inference : 1.70 121078 0 0 0 0 242156
473.22/473.49 c mostinf : 0.00 0 0 0 0 0 0
473.22/473.49 c leastinf : 0.00 0 0 0 0 0 0
473.22/473.49 c fullstrong : 0.00 0 0 0 0 0 0
473.22/473.49 c allfullstrong : 0.00 0 0 0 0 0 0
473.22/473.49 c random : 0.00 0 0 0 0 0 0
473.22/473.49 c Primal Heuristics : Time Calls Found
473.22/473.49 c LP solutions : 0.00 - 0
473.22/473.49 c pseudo solutions : 0.02 - 1
473.22/473.49 c trivial : 0.00 1 0
473.22/473.49 c simplerounding : 0.00 0 0
473.22/473.49 c zirounding : 0.00 0 0
473.22/473.49 c rounding : 0.00 0 0
473.22/473.49 c shifting : 0.00 0 0
473.22/473.49 c intshifting : 0.00 0 0
473.22/473.49 c oneopt : 0.00 0 0
473.22/473.49 c twoopt : 0.00 0 0
473.22/473.49 c fixandinfer : 0.00 0 0
473.22/473.49 c feaspump : 0.00 0 0
473.22/473.49 c coefdiving : 0.00 0 0
473.22/473.49 c pscostdiving : 0.00 0 0
473.22/473.49 c fracdiving : 0.00 0 0
473.22/473.49 c veclendiving : 0.00 0 0
473.22/473.49 c intdiving : 0.00 0 0
473.22/473.49 c actconsdiving : 0.00 0 0
473.22/473.49 c objpscostdiving : 0.00 0 0
473.22/473.49 c rootsoldiving : 0.00 0 0
473.22/473.49 c linesearchdiving : 0.00 0 0
473.22/473.49 c guideddiving : 0.00 0 0
473.22/473.49 c octane : 0.00 0 0
473.22/473.49 c rens : 0.00 0 0
473.22/473.49 c rins : 0.00 0 0
473.22/473.49 c localbranching : 0.00 0 0
473.22/473.49 c mutation : 0.00 0 0
473.22/473.49 c crossover : 0.00 0 0
473.22/473.49 c dins : 0.00 0 0
473.22/473.49 c undercover : 0.00 0 0
473.22/473.49 c nlp : 0.00 0 0
473.22/473.49 c trysol : 0.00 0 0
473.22/473.49 c LP : Time Calls Iterations Iter/call Iter/sec
473.22/473.49 c primal LP : 0.00 0 0 0.00 -
473.22/473.49 c dual LP : 0.00 0 0 0.00 -
473.22/473.49 c lex dual LP : 0.00 0 0 0.00 -
473.22/473.49 c barrier LP : 0.00 0 0 0.00 -
473.22/473.49 c diving/probing LP: 0.00 0 0 0.00 -
473.22/473.49 c strong branching : 0.00 0 0 0.00 -
473.22/473.49 c (at root node) : - 0 0 0.00 -
473.22/473.49 c conflict analysis: 0.00 0 0 0.00 -
473.22/473.49 c B&B Tree :
473.22/473.49 c number of runs : 1
473.22/473.49 c nodes : 194391
473.22/473.49 c nodes (total) : 194391
473.22/473.49 c nodes left : 0
473.22/473.49 c max depth : 74
473.22/473.49 c max depth (total): 74
473.22/473.49 c backtracks : 77924 (40.1%)
473.22/473.49 c delayed cutoffs : 46496
473.22/473.49 c repropagations : 239789 (965700 domain reductions, 35153 cutoffs)
473.22/473.49 c avg switch length: 20.39
473.22/473.49 c switching time : 128.77
473.22/473.49 c Solution :
473.22/473.49 c Solutions found : 1 (1 improvements)
473.22/473.49 c First Solution : +0.00000000000000e+00 (in run 1, after 194391 nodes, 467.23 seconds, depth 31, found by <relaxation>)
473.22/473.49 c Primal Bound : +0.00000000000000e+00 (in run 1, after 194391 nodes, 467.23 seconds, depth 31, found by <relaxation>)
473.22/473.49 c Dual Bound : +0.00000000000000e+00
473.22/473.49 c Gap : 0.00 %
473.22/473.49 c Root Dual Bound : +0.00000000000000e+00
473.22/473.49 c Root Iterations : 0
473.32/473.58 c Time complete: 473.4.