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-2664308-1276274126.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.03 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.03 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.09/2.18 c 2.0s| 10000 | 7495 | 0 | 0.0 |5687k| 72 | - | 169 |2337 | 0 | 0 | 0 |2355 | 0 | 0.000000e+00 | -- | Inf
6.29/6.31 c 5.9s| 20000 | 13129 | 0 | 0.0 | 10M| 72 | - | 169 |3086 | 0 | 0 | 0 |6124 | 0 | 0.000000e+00 | -- | Inf
10.59/10.63 c 10.0s| 30000 | 18646 | 0 | 0.0 | 14M| 72 | - | 169 |4245 | 0 | 0 | 0 |9984 | 0 | 0.000000e+00 | -- | Inf
16.49/16.56 c 15.7s| 40000 | 23288 | 0 | 0.0 | 19M| 72 | - | 169 |5810 | 0 | 0 | 0 | 14k| 0 | 0.000000e+00 | -- | Inf
24.78/24.84 c 23.7s| 50000 | 26662 | 0 | 0.0 | 23M| 72 | - | 169 |7505 | 0 | 0 | 0 | 20k| 0 | 0.000000e+00 | -- | Inf
37.39/37.43 c 36.0s| 60000 | 27886 | 0 | 0.0 | 26M| 72 | - | 169 |8481 | 0 | 0 | 0 | 28k| 0 | 0.000000e+00 | -- | Inf
48.88/48.98 c 47.3s| 70000 | 30828 | 0 | 0.0 | 29M| 72 | - | 169 |8029 | 0 | 0 | 0 | 34k| 0 | 0.000000e+00 | -- | Inf
61.27/61.37 c 59.4s| 80000 | 33200 | 0 | 0.0 | 33M| 72 | - | 169 |8906 | 0 | 0 | 0 | 40k| 0 | 0.000000e+00 | -- | Inf
75.07/75.16 c 72.9s| 90000 | 34988 | 0 | 0.0 | 36M| 72 | - | 169 | 10k| 0 | 0 | 0 | 47k| 0 | 0.000000e+00 | -- | Inf
90.67/90.73 c 88.2s|100000 | 36433 | 0 | 0.0 | 40M| 72 | - | 169 | 11k| 0 | 0 | 0 | 55k| 0 | 0.000000e+00 | -- | Inf
108.77/108.85 c 106s|110000 | 37147 | 0 | 0.0 | 43M| 72 | - | 169 | 12k| 0 | 0 | 0 | 63k| 0 | 0.000000e+00 | -- | Inf
129.77/129.84 c 127s|120000 | 37174 | 0 | 0.0 | 45M| 72 | - | 169 | 15k| 0 | 0 | 0 | 72k| 0 | 0.000000e+00 | -- | Inf
155.45/155.53 c 152s|130000 | 36194 | 0 | 0.0 | 48M| 72 | - | 169 | 17k| 0 | 0 | 0 | 81k| 0 | 0.000000e+00 | -- | Inf
191.44/191.59 c 188s|140000 | 33152 | 0 | 0.0 | 46M| 72 | - | 169 | 16k| 0 | 0 | 0 | 92k| 0 | 0.000000e+00 | -- | Inf
226.33/226.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
226.33/226.40 c 222s|150000 | 30533 | 0 | 0.0 | 47M| 72 | - | 169 | 16k| 0 | 0 | 0 | 103k| 0 | 0.000000e+00 | -- | Inf
263.43/263.59 c 259s|160000 | 27135 | 0 | 0.0 | 46M| 72 | - | 169 | 18k| 0 | 0 | 0 | 113k| 0 | 0.000000e+00 | -- | Inf
302.71/302.83 c 298s|170000 | 23715 | 0 | 0.0 | 45M| 72 | - | 169 | 21k| 0 | 0 | 0 | 125k| 0 | 0.000000e+00 | -- | Inf
347.70/347.85 c 342s|180000 | 19519 | 0 | 0.0 | 43M| 72 | - | 169 | 25k| 0 | 0 | 0 | 137k| 0 | 0.000000e+00 | -- | Inf
411.20/411.33 c 405s|190000 | 12254 | 0 | 0.0 | 35M| 72 | - | 169 | 26k| 0 | 0 | 0 | 151k| 0 | 0.000000e+00 | -- | Inf
489.07/489.24 c 483s|200000 | 1858 | 0 | 0.0 | 19M| 72 | - | 169 | 31k| 0 | 0 | 0 | 167k| 0 | 0.000000e+00 | -- | Inf
493.37/493.53 c * 487s|200345 | 0 | 0 | 0.0 | 13M| 72 | - | 169 | 31k| 0 | 0 | 0 | 168k| 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
493.37/493.54 c
493.37/493.54 c SCIP Status : problem is solved [optimal solution found]
493.37/493.54 c Solving Time (sec) : 487.07
493.37/493.54 c Solving Nodes : 200345
493.37/493.54 c Primal Bound : +0.00000000000000e+00 (1 solutions)
493.37/493.54 c Dual Bound : +0.00000000000000e+00
493.37/493.54 c Gap : 0.00 %
493.37/493.54 s SATISFIABLE
493.37/493.54 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148
493.37/493.54 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127
493.37/493.54 v -x126 -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
493.37/493.54 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
493.37/493.54 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
493.37/493.54 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
493.37/493.54 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
493.37/493.54 v -x4 -x3 -x2 -x1
493.37/493.54 c SCIP Status : problem is solved [optimal solution found]
493.37/493.54 c Solving Time : 487.07
493.37/493.54 c Original Problem :
493.37/493.54 c Problem name : HOME/instance-2664308-1276274126.opb
493.37/493.54 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
493.37/493.54 c Constraints : 101 initial, 101 maximal
493.37/493.54 c Presolved Problem :
493.37/493.54 c Problem name : t_HOME/instance-2664308-1276274126.opb
493.37/493.54 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
493.37/493.54 c Constraints : 73 initial, 31719 maximal
493.37/493.54 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
493.37/493.54 c trivial : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c dualfix : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c boundshift : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c inttobinary : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c implics : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c probing : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c knapsack : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c setppc : 0.01 0 0 0 0 0 0 0 0
493.37/493.54 c linear : 0.00 0 0 0 0 0 28 0 0
493.37/493.54 c logicor : 0.00 0 0 0 0 0 0 0 0
493.37/493.54 c root node : - 1 - - 1 - - - -
493.37/493.54 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
493.37/493.54 c integral : 0 0 0 0 0 0 0 0 0 0
493.37/493.54 c knapsack : 1 0 687113 0 125014 18917 1745270 0 0 0
493.37/493.54 c setppc : 68 0 668195 0 125014 92143 1677778 0 0 0
493.37/493.54 c logicor : 4+ 0 326088 0 40266 2254 131797 0 0 0
493.37/493.54 c countsols : 0 0 0 0 125015 0 0 0 0 0
493.37/493.54 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
493.37/493.54 c integral : 0.00 0.00 0.00 0.00 0.00
493.37/493.54 c knapsack : 47.82 0.00 46.89 0.00 0.93
493.37/493.54 c setppc : 16.60 0.00 14.85 0.00 1.75
493.37/493.54 c logicor : 225.09 0.00 225.06 0.00 0.03
493.37/493.54 c countsols : 0.04 0.00 0.00 0.00 0.04
493.37/493.54 c Propagators : Time Calls Cutoffs DomReds
493.37/493.54 c vbounds : 0.24 1 0 0
493.37/493.54 c rootredcost : 0.34 0 0 0
493.37/493.54 c pseudoobj : 0.25 0 0 0
493.37/493.54 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
493.37/493.54 c propagation : 7.23 113314 113286 592407 20.5 2915 23.0 -
493.37/493.54 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
493.37/493.54 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
493.37/493.54 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
493.37/493.54 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
493.37/493.54 c applied globally : - - - 167647 14.8 - - -
493.37/493.54 c applied locally : - - - 1140 33.8 - - -
493.37/493.54 c Separators : Time Calls Cutoffs DomReds Cuts Conss
493.37/493.54 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
493.37/493.54 c redcost : 0.00 0 0 0 0 0
493.37/493.54 c impliedbounds : 0.00 0 0 0 0 0
493.37/493.54 c intobj : 0.00 0 0 0 0 0
493.37/493.54 c cgmip : 0.00 0 0 0 0 0
493.37/493.54 c gomory : 0.00 0 0 0 0 0
493.37/493.54 c strongcg : 0.00 0 0 0 0 0
493.37/493.54 c cmir : 0.00 0 0 0 0 0
493.37/493.54 c flowcover : 0.00 0 0 0 0 0
493.37/493.54 c clique : 0.00 0 0 0 0 0
493.37/493.54 c zerohalf : 0.00 0 0 0 0 0
493.37/493.54 c mcf : 0.00 0 0 0 0 0
493.37/493.54 c rapidlearning : 0.00 0 0 0 0 0
493.37/493.54 c Pricers : Time Calls Vars
493.37/493.54 c problem variables: 0.00 0 0
493.37/493.54 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
493.37/493.54 c relpscost : 0.00 0 0 0 0 0 0
493.37/493.54 c pscost : 0.00 0 0 0 0 0 0
493.37/493.54 c inference : 1.60 125014 0 0 0 0 250028
493.37/493.54 c mostinf : 0.00 0 0 0 0 0 0
493.37/493.54 c leastinf : 0.00 0 0 0 0 0 0
493.37/493.54 c fullstrong : 0.00 0 0 0 0 0 0
493.37/493.54 c allfullstrong : 0.00 0 0 0 0 0 0
493.37/493.54 c random : 0.00 0 0 0 0 0 0
493.37/493.54 c Primal Heuristics : Time Calls Found
493.37/493.54 c LP solutions : 0.00 - 0
493.37/493.54 c pseudo solutions : 0.02 - 1
493.37/493.54 c trivial : 0.00 1 0
493.37/493.54 c simplerounding : 0.00 0 0
493.37/493.54 c zirounding : 0.00 0 0
493.37/493.54 c rounding : 0.00 0 0
493.37/493.54 c shifting : 0.00 0 0
493.37/493.54 c intshifting : 0.00 0 0
493.37/493.54 c oneopt : 0.00 0 0
493.37/493.54 c twoopt : 0.00 0 0
493.37/493.54 c fixandinfer : 0.00 0 0
493.37/493.54 c feaspump : 0.00 0 0
493.37/493.54 c coefdiving : 0.00 0 0
493.37/493.54 c pscostdiving : 0.00 0 0
493.37/493.54 c fracdiving : 0.00 0 0
493.37/493.54 c veclendiving : 0.00 0 0
493.37/493.54 c intdiving : 0.00 0 0
493.37/493.54 c actconsdiving : 0.00 0 0
493.37/493.54 c objpscostdiving : 0.00 0 0
493.37/493.54 c rootsoldiving : 0.00 0 0
493.37/493.54 c linesearchdiving : 0.00 0 0
493.37/493.54 c guideddiving : 0.00 0 0
493.37/493.54 c octane : 0.00 0 0
493.37/493.54 c rens : 0.00 0 0
493.37/493.54 c rins : 0.00 0 0
493.37/493.54 c localbranching : 0.00 0 0
493.37/493.54 c mutation : 0.00 0 0
493.37/493.54 c crossover : 0.00 0 0
493.37/493.54 c dins : 0.00 0 0
493.37/493.54 c undercover : 0.00 0 0
493.37/493.54 c nlp : 0.00 0 0
493.37/493.54 c trysol : 0.00 0 0
493.37/493.54 c LP : Time Calls Iterations Iter/call Iter/sec
493.37/493.54 c primal LP : 0.00 0 0 0.00 -
493.37/493.54 c dual LP : 0.00 0 0 0.00 -
493.37/493.54 c lex dual LP : 0.00 0 0 0.00 -
493.37/493.54 c barrier LP : 0.00 0 0 0.00 -
493.37/493.54 c diving/probing LP: 0.00 0 0 0.00 -
493.37/493.54 c strong branching : 0.00 0 0 0.00 -
493.37/493.54 c (at root node) : - 0 0 0.00 -
493.37/493.54 c conflict analysis: 0.00 0 0 0.00 -
493.37/493.54 c B&B Tree :
493.37/493.54 c number of runs : 1
493.37/493.54 c nodes : 200345
493.37/493.54 c nodes (total) : 200345
493.37/493.54 c nodes left : 0
493.37/493.54 c max depth : 72
493.37/493.54 c max depth (total): 72
493.37/493.54 c backtracks : 79153 (39.5%)
493.37/493.54 c delayed cutoffs : 48534
493.37/493.54 c repropagations : 230346 (1023662 domain reductions, 37984 cutoffs)
493.37/493.54 c avg switch length: 19.83
493.37/493.54 c switching time : 134.11
493.37/493.54 c Solution :
493.37/493.54 c Solutions found : 1 (1 improvements)
493.37/493.54 c First Solution : +0.00000000000000e+00 (in run 1, after 200345 nodes, 487.04 seconds, depth 28, found by <relaxation>)
493.37/493.54 c Primal Bound : +0.00000000000000e+00 (in run 1, after 200345 nodes, 487.04 seconds, depth 28, found by <relaxation>)
493.37/493.54 c Dual Bound : +0.00000000000000e+00
493.37/493.54 c Gap : 0.00 %
493.37/493.54 c Root Dual Bound : +0.00000000000000e+00
493.37/493.54 c Root Iterations : 0
493.46/493.63 c Time complete: 493.5.