0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667217-1276278448.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 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 # 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.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 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 | 0 | 96 | - | 743k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 128 | - |1153k| 0 | 47 | 169 | 202 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 187 | - |1394k| 0 | 51 | 169 | 202 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 217 | - |1483k| 0 | 49 | 169 | 202 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 243 | - |1529k| 0 | 53 | 169 | 202 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 317 | - |1562k| 0 | 53 | 169 | 202 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.58 c 0.5s| 1 | 0 | 382 | - |1528k| 0 | 47 | 169 | 167 | 169 | 109 | 36 | 0 | 11 | 0.000000e+00 | -- | Inf
0.59/0.68 c 0.6s| 1 | 0 | 441 | - |1491k| 0 | 46 | 169 | 132 | 169 | 109 | 36 | 0 | 17 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 552 | - |1489k| 0 | 38 | 169 | 130 | 169 | 109 | 36 | 0 | 25 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.8s| 1 | 0 | 574 | - |1468k| 0 | 14 | 169 | 113 | 169 | 109 | 36 | 0 | 30 | 0.000000e+00 | -- | Inf
0.89/0.97 c 0.9s| 1 | 0 | 707 | - |1425k| 0 | 23 | 169 | 69 | 169 | 109 | 36 | 0 | 36 | 0.000000e+00 | -- | Inf
0.89/0.99 c 0.9s| 1 | 0 | 707 | - |1425k| 0 | - | 169 | 69 | 169 | 109 | 36 | 0 | 41 | 0.000000e+00 | -- | Inf
0.89/0.99 c (run 1, node 1) restarting after 88 global fixings of integer variables
0.89/0.99 c
0.89/1.00 c (restart) converted 36 cuts from the global cut pool into linear constraints
0.89/1.00 c
1.00/1.00 c presolving:
1.00/1.00 c (round 1) 88 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 30 impls, 63 clqs
1.00/1.00 c (round 2) 88 del vars, 11 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 30 impls, 63 clqs
1.00/1.00 c (round 3) 88 del vars, 11 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 36 upgd conss, 30 impls, 63 clqs
1.00/1.01 c (round 4) 88 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 11 chg coeffs, 36 upgd conss, 30 impls, 63 clqs
1.00/1.01 c (round 5) 88 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 14 chg coeffs, 36 upgd conss, 30 impls, 63 clqs
1.00/1.01 c (round 6) 88 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 17 chg coeffs, 36 upgd conss, 30 impls, 63 clqs
1.00/1.01 c (round 7) 88 del vars, 13 del conss, 0 chg bounds, 6 chg sides, 19 chg coeffs, 36 upgd conss, 30 impls, 63 clqs
1.00/1.01 c presolving (8 rounds):
1.00/1.01 c 88 deleted vars, 13 deleted constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 19 changed coefficients
1.00/1.01 c 30 implications, 63 cliques
1.00/1.01 c presolved problem has 81 variables (81 bin, 0 int, 0 impl, 0 cont) and 92 constraints
1.00/1.01 c 14 constraints of type <knapsack>
1.00/1.01 c 66 constraints of type <setppc>
1.00/1.01 c 12 constraints of type <logicor>
1.00/1.01 c transformed objective value is always integral (scale: 1)
1.00/1.01 c Presolving Time: 0.03
1.00/1.01 c
1.00/1.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.02 c 0.9s| 1 | 0 | 787 | - | 828k| 0 | 34 | 81 | 92 | 81 | 85 | 0 | 0 | 41 | 0.000000e+00 | -- | Inf
1.00/1.03 c 1.0s| 1 | 0 | 838 | - |1034k| 0 | 35 | 81 | 92 | 81 | 91 | 6 | 0 | 41 | 0.000000e+00 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 853 | - |1024k| 0 | 19 | 81 | 66 | 81 | 91 | 6 | 0 | 46 | 0.000000e+00 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 853 | - |1024k| 0 | - | 81 | 66 | 81 | 91 | 6 | 0 | 51 | 0.000000e+00 | -- | Inf
1.00/1.06 c (run 2, node 1) restarting after 57 global fixings of integer variables
1.00/1.06 c
1.00/1.06 c (restart) converted 6 cuts from the global cut pool into linear constraints
1.00/1.06 c
1.00/1.06 c presolving:
1.00/1.06 c (round 1) 79 del vars, 33 del conss, 8 chg bounds, 30 chg sides, 54 chg coeffs, 0 upgd conss, 34 impls, 0 clqs
1.00/1.06 c presolving (2 rounds):
1.00/1.06 c 81 deleted vars, 72 deleted constraints, 8 tightened bounds, 0 added holes, 30 changed sides, 54 changed coefficients
1.00/1.06 c 34 implications, 0 cliques
1.00/1.06 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
1.00/1.06 c transformed objective value is always integral (scale: 1)
1.00/1.06 c Presolving Time: 0.04
1.00/1.07 c
1.00/1.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.07 c 1.0s| 1 | 0 | 853 | - | 635k| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 51 | 0.000000e+00 | -- | Inf
1.00/1.07 c * 1.0s| 1 | 0 | 853 | - | 636k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 51 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.00/1.07 c
1.00/1.07 c SCIP Status : problem is solved [optimal solution found]
1.00/1.07 c Solving Time (sec) : 1.00
1.00/1.07 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.00/1.07 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.00/1.07 c Dual Bound : +0.00000000000000e+00
1.00/1.07 c Gap : 0.00 %
1.00/1.07 s SATISFIABLE
1.00/1.07 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148
1.00/1.07 v -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.00/1.07 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
1.00/1.07 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
1.00/1.07 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
1.00/1.07 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
1.00/1.07 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
1.00/1.07 v x4 -x3 -x2 -x1
1.00/1.07 c SCIP Status : problem is solved [optimal solution found]
1.00/1.07 c Solving Time : 1.00
1.00/1.07 c Original Problem :
1.00/1.07 c Problem name : HOME/instance-2667217-1276278448.opb
1.00/1.07 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.07 c Constraints : 101 initial, 101 maximal
1.00/1.07 c Presolved Problem :
1.00/1.07 c Problem name : t_HOME/instance-2667217-1276278448.opb
1.00/1.07 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.07 c Constraints : 0 initial, 0 maximal
1.00/1.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.00/1.07 c trivial : 0.00 145 0 0 0 0 0 0 0
1.00/1.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.00/1.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.00/1.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.00/1.07 c implics : 0.00 0 0 0 0 0 0 0 0
1.00/1.07 c probing : 0.00 0 0 0 0 0 0 0 0
1.00/1.07 c knapsack : 0.02 2 0 0 0 0 14 35 72
1.00/1.07 c setppc : 0.00 8 6 0 0 0 45 0 0
1.00/1.07 c linear : 0.01 8 0 0 8 0 41 1 1
1.00/1.07 c logicor : 0.00 0 0 0 0 0 13 0 0
1.00/1.07 c root node : - 145 - - 145 - - - -
1.00/1.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.00/1.07 c integral : 0 0 0 9 0 0 40 0 0 0
1.00/1.07 c countsols : 0 0 0 1 0 0 0 0 0 0
1.00/1.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.00/1.07 c integral : 0.63 0.00 0.00 0.63 0.00
1.00/1.07 c countsols : 0.00 0.00 0.00 0.00 0.00
1.00/1.07 c Propagators : Time Calls Cutoffs DomReds
1.00/1.07 c vbounds : 0.00 3 0 0
1.00/1.07 c rootredcost : 0.00 0 0 0
1.00/1.07 c pseudoobj : 0.00 0 0 0
1.00/1.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.00/1.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.07 c applied globally : - - - 0 0.0 - - -
1.00/1.07 c applied locally : - - - 0 0.0 - - -
1.00/1.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.00/1.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.00/1.07 c redcost : 0.00 6 0 0 0 0
1.00/1.07 c impliedbounds : 0.00 6 0 0 0 0
1.00/1.07 c intobj : 0.00 0 0 0 0 0
1.00/1.07 c cgmip : 0.00 0 0 0 0 0
1.00/1.07 c gomory : 0.03 6 0 0 45 0
1.00/1.07 c strongcg : 0.02 6 0 0 205 0
1.00/1.07 c cmir : 0.00 0 0 0 0 0
1.00/1.07 c flowcover : 0.00 0 0 0 0 0
1.00/1.07 c clique : 0.01 6 0 0 30 0
1.00/1.07 c zerohalf : 0.00 0 0 0 0 0
1.00/1.07 c mcf : 0.00 2 0 0 0 0
1.00/1.07 c rapidlearning : 0.18 1 0 0 0 129
1.00/1.07 c Pricers : Time Calls Vars
1.00/1.07 c problem variables: 0.00 0 0
1.00/1.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.00/1.07 c relpscost : 0.63 8 0 40 0 0 0
1.00/1.07 c pscost : 0.00 0 0 0 0 0 0
1.00/1.07 c inference : 0.00 0 0 0 0 0 0
1.00/1.07 c mostinf : 0.00 0 0 0 0 0 0
1.00/1.07 c leastinf : 0.00 0 0 0 0 0 0
1.00/1.07 c fullstrong : 0.00 0 0 0 0 0 0
1.00/1.07 c allfullstrong : 0.00 0 0 0 0 0 0
1.00/1.07 c random : 0.00 0 0 0 0 0 0
1.00/1.07 c Primal Heuristics : Time Calls Found
1.00/1.07 c LP solutions : 0.00 - 1
1.00/1.07 c pseudo solutions : 0.00 - 0
1.00/1.07 c trivial : 0.00 1 0
1.00/1.07 c simplerounding : 0.00 0 0
1.00/1.07 c zirounding : 0.00 0 0
1.00/1.07 c rounding : 0.00 0 0
1.00/1.07 c shifting : 0.00 0 0
1.00/1.07 c intshifting : 0.00 0 0
1.00/1.07 c oneopt : 0.00 0 0
1.00/1.07 c twoopt : 0.00 0 0
1.00/1.07 c fixandinfer : 0.00 0 0
1.00/1.07 c feaspump : 0.00 0 0
1.00/1.07 c coefdiving : 0.00 0 0
1.00/1.07 c pscostdiving : 0.00 0 0
1.00/1.07 c fracdiving : 0.00 0 0
1.00/1.07 c veclendiving : 0.00 0 0
1.00/1.07 c intdiving : 0.00 0 0
1.00/1.07 c actconsdiving : 0.00 0 0
1.00/1.07 c objpscostdiving : 0.00 0 0
1.00/1.07 c rootsoldiving : 0.00 0 0
1.00/1.07 c linesearchdiving : 0.00 0 0
1.00/1.07 c guideddiving : 0.00 0 0
1.00/1.07 c octane : 0.00 0 0
1.00/1.07 c rens : 0.00 0 0
1.00/1.07 c rins : 0.00 0 0
1.00/1.07 c localbranching : 0.00 0 0
1.00/1.07 c mutation : 0.00 0 0
1.00/1.07 c crossover : 0.00 0 0
1.00/1.07 c dins : 0.00 0 0
1.00/1.07 c undercover : 0.00 0 0
1.00/1.07 c nlp : 0.00 0 0
1.00/1.07 c trysol : 0.00 0 0
1.00/1.07 c LP : Time Calls Iterations Iter/call Iter/sec
1.00/1.07 c primal LP : 0.00 0 0 0.00 -
1.00/1.07 c dual LP : 0.05 14 853 60.93 17060.00
1.00/1.07 c lex dual LP : 0.00 0 0 0.00 -
1.00/1.07 c barrier LP : 0.00 0 0 0.00 -
1.00/1.07 c diving/probing LP: 0.00 0 0 0.00 -
1.00/1.07 c strong branching : 0.63 51 6980 136.86 11079.37
1.00/1.07 c (at root node) : - 51 6980 136.86 -
1.00/1.07 c conflict analysis: 0.00 0 0 0.00 -
1.00/1.07 c B&B Tree :
1.00/1.07 c number of runs : 3
1.00/1.07 c nodes : 1
1.00/1.07 c nodes (total) : 3
1.00/1.07 c nodes left : 0
1.00/1.07 c max depth : 0
1.00/1.07 c max depth (total): 0
1.00/1.07 c backtracks : 0 (0.0%)
1.00/1.07 c delayed cutoffs : 0
1.00/1.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.00/1.07 c avg switch length: 2.00
1.00/1.07 c switching time : 0.00
1.00/1.07 c Solution :
1.00/1.07 c Solutions found : 1 (1 improvements)
1.00/1.07 c First Solution : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.00 seconds, depth 0, found by <relaxation>)
1.00/1.07 c Primal Bound : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.00 seconds, depth 0, found by <relaxation>)
1.00/1.07 c Dual Bound : +0.00000000000000e+00
1.00/1.07 c Gap : 0.00 %
1.00/1.07 c Root Dual Bound : +0.00000000000000e+00
1.00/1.07 c Root Iterations : 853
1.00/1.07 c Time complete: 1.06.