0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665796-1276278819.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 = 1799.99
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.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.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 | 44 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.25 c 0.2s| 1 | 0 | 103 | - |1158k| 0 | 54 | 169 | 202 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.27 c 0.2s| 1 | 0 | 213 | - |1217k| 0 | 58 | 169 | 202 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.30 c 0.2s| 1 | 0 | 374 | - |1261k| 0 | 52 | 169 | 202 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 441 | - |1333k| 0 | 57 | 169 | 202 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 610 | - |1382k| 0 | 54 | 169 | 202 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 796 | - |1323k| 0 | 55 | 169 | 147 | 169 | 109 | 36 | 0 | 8 | 0.000000e+00 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 883 | - |1272k| 0 | 56 | 169 | 96 | 169 | 109 | 36 | 0 | 13 | 0.000000e+00 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 1048 | - |1271k| 0 | 45 | 169 | 95 | 169 | 109 | 36 | 0 | 26 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.8s| 1 | 0 | 1095 | - |1271k| 0 | 53 | 169 | 95 | 169 | 109 | 36 | 0 | 33 | 0.000000e+00 | -- | Inf
0.89/0.98 c 0.9s| 1 | 0 | 1136 | - |1270k| 0 | 50 | 169 | 94 | 169 | 109 | 36 | 0 | 38 | 0.000000e+00 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 1156 | - |1267k| 0 | 49 | 169 | 91 | 169 | 103 | 36 | 0 | 46 | 0.000000e+00 | -- | Inf
1.00/1.08 c 1.0s| 1 | 0 | 1156 | - |1267k| 0 | - | 169 | 91 | 169 | 103 | 36 | 0 | 51 | 0.000000e+00 | -- | Inf
1.00/1.08 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.00/1.08 c
1.00/1.08 c (restart) converted 30 cuts from the global cut pool into linear constraints
1.00/1.08 c
1.00/1.08 c presolving:
1.00/1.09 c (round 1) 35 del vars, 6 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 89 clqs
1.00/1.10 c (round 2) 35 del vars, 6 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 46 upgd conss, 16 impls, 89 clqs
1.00/1.10 c (round 3) 35 del vars, 9 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 46 upgd conss, 16 impls, 89 clqs
1.10/1.11 c presolving (4 rounds):
1.10/1.11 c 35 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
1.10/1.11 c 16 implications, 89 cliques
1.10/1.11 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 112 constraints
1.10/1.11 c 5 constraints of type <knapsack>
1.10/1.11 c 86 constraints of type <setppc>
1.10/1.11 c 21 constraints of type <logicor>
1.10/1.11 c transformed objective value is always integral (scale: 1)
1.10/1.11 c Presolving Time: 0.02
1.10/1.11 c
1.10/1.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.11 c 1.0s| 1 | 0 | 1213 | - | 844k| 0 | 39 | 134 | 112 | 134 | 94 | 0 | 0 | 51 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 1364 | - |1232k| 0 | 49 | 134 | 112 | 134 | 107 | 13 | 0 | 51 | 0.000000e+00 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 1410 | - |1229k| 0 | 43 | 134 | 102 | 134 | 107 | 13 | 0 | 57 | 0.000000e+00 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 1410 | - |1229k| 0 | - | 134 | 102 | 134 | 107 | 13 | 0 | 62 | 0.000000e+00 | -- | Inf
1.19/1.24 c (run 2, node 1) restarting after 38 global fixings of integer variables
1.19/1.24 c
1.19/1.24 c (restart) converted 13 cuts from the global cut pool into linear constraints
1.19/1.24 c
1.19/1.25 c presolving:
1.19/1.25 c (round 1) 61 del vars, 19 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 34 impls, 67 clqs
1.19/1.26 c (round 2) 61 del vars, 22 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 34 impls, 67 clqs
1.19/1.27 c (round 3) 61 del vars, 27 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 34 impls, 67 clqs
1.19/1.27 c presolving (4 rounds):
1.19/1.27 c 61 deleted vars, 27 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.19/1.27 c 34 implications, 67 cliques
1.19/1.27 c presolved problem has 73 variables (73 bin, 0 int, 0 impl, 0 cont) and 88 constraints
1.19/1.27 c 13 constraints of type <knapsack>
1.19/1.27 c 66 constraints of type <setppc>
1.19/1.27 c 9 constraints of type <logicor>
1.19/1.27 c transformed objective value is always integral (scale: 1)
1.19/1.27 c Presolving Time: 0.04
1.19/1.27 c
1.19/1.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.27 c 1.2s| 1 | 0 | 1462 | - | 818k| 0 | 0 | 73 | 88 | 73 | 83 | 0 | 0 | 62 | 0.000000e+00 | -- | Inf
1.19/1.27 c * 1.2s| 1 | 0 | 1462 | - | 820k| 0 | - | 73 | 88 | 73 | 83 | 0 | 0 | 62 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.19/1.27 c
1.19/1.27 c SCIP Status : problem is solved [optimal solution found]
1.19/1.27 c Solving Time (sec) : 1.18
1.19/1.27 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.19/1.27 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.19/1.27 c Dual Bound : +0.00000000000000e+00
1.19/1.27 c Gap : 0.00 %
1.19/1.27 s SATISFIABLE
1.19/1.27 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.19/1.27 v -x147 x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.19/1.27 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 -x108 -x107 -x106
1.19/1.27 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.19/1.27 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.19/1.27 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.19/1.27 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.19/1.27 v -x4 -x3 -x2 -x1
1.19/1.27 c SCIP Status : problem is solved [optimal solution found]
1.19/1.27 c Solving Time : 1.18
1.19/1.27 c Original Problem :
1.19/1.27 c Problem name : HOME/instance-2665796-1276278819.opb
1.19/1.27 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.27 c Constraints : 101 initial, 101 maximal
1.19/1.27 c Presolved Problem :
1.19/1.27 c Problem name : t_HOME/instance-2665796-1276278819.opb
1.19/1.27 c Variables : 73 (73 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.27 c Constraints : 88 initial, 88 maximal
1.19/1.27 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.19/1.27 c trivial : 0.00 73 0 0 0 0 0 0 0
1.19/1.27 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.19/1.27 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.19/1.27 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.19/1.27 c implics : 0.00 0 0 0 0 0 0 0 0
1.19/1.27 c probing : 0.00 0 0 0 0 0 0 0 0
1.19/1.27 c knapsack : 0.04 0 0 0 0 0 0 0 0
1.19/1.27 c setppc : 0.00 23 0 0 0 0 19 0 0
1.19/1.27 c linear : 0.00 0 0 0 0 0 31 3 0
1.19/1.27 c logicor : 0.00 0 0 0 0 0 14 0 0
1.19/1.27 c root node : - 73 - - 73 - - - -
1.19/1.27 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.19/1.27 c integral : 0 0 0 10 0 0 45 0 0 0
1.19/1.27 c knapsack : 13 7 11 1 0 0 0 0 0 0
1.19/1.27 c setppc : 66 7 11 1 0 0 28 0 0 0
1.19/1.27 c logicor : 9 7 4 0 0 0 0 0 0 0
1.19/1.27 c countsols : 0 0 0 1 0 0 0 0 0 0
1.19/1.27 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.19/1.27 c integral : 0.78 0.00 0.00 0.78 0.00
1.19/1.27 c knapsack : 0.01 0.01 0.00 0.00 0.00
1.19/1.27 c setppc : 0.00 0.00 0.00 0.00 0.00
1.19/1.27 c logicor : 0.00 0.00 0.00 0.00 0.00
1.19/1.27 c countsols : 0.00 0.00 0.00 0.00 0.00
1.19/1.27 c Propagators : Time Calls Cutoffs DomReds
1.19/1.27 c vbounds : 0.00 3 0 0
1.19/1.27 c rootredcost : 0.00 0 0 0
1.19/1.27 c pseudoobj : 0.00 0 0 0
1.19/1.27 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.19/1.27 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.27 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.27 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.27 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.27 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.27 c applied globally : - - - 0 0.0 - - -
1.19/1.27 c applied locally : - - - 0 0.0 - - -
1.19/1.27 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.19/1.27 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.19/1.27 c redcost : 0.00 7 0 0 0 0
1.19/1.27 c impliedbounds : 0.00 6 0 0 0 0
1.19/1.27 c intobj : 0.00 0 0 0 0 0
1.19/1.27 c cgmip : 0.00 0 0 0 0 0
1.19/1.27 c gomory : 0.04 6 0 0 81 0
1.19/1.27 c strongcg : 0.05 6 0 0 177 0
1.19/1.27 c cmir : 0.00 0 0 0 0 0
1.19/1.27 c flowcover : 0.00 0 0 0 0 0
1.19/1.27 c clique : 0.01 6 0 0 35 0
1.19/1.27 c zerohalf : 0.00 0 0 0 0 0
1.19/1.27 c mcf : 0.00 2 0 0 0 0
1.19/1.27 c rapidlearning : 0.16 1 0 0 0 129
1.19/1.27 c Pricers : Time Calls Vars
1.19/1.27 c problem variables: 0.00 0 0
1.19/1.27 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.19/1.27 c relpscost : 0.78 9 0 45 0 0 0
1.19/1.27 c pscost : 0.00 0 0 0 0 0 0
1.19/1.27 c inference : 0.00 0 0 0 0 0 0
1.19/1.27 c mostinf : 0.00 0 0 0 0 0 0
1.19/1.27 c leastinf : 0.00 0 0 0 0 0 0
1.19/1.27 c fullstrong : 0.00 0 0 0 0 0 0
1.19/1.27 c allfullstrong : 0.00 0 0 0 0 0 0
1.19/1.27 c random : 0.00 0 0 0 0 0 0
1.19/1.27 c Primal Heuristics : Time Calls Found
1.19/1.27 c LP solutions : 0.00 - 1
1.19/1.27 c pseudo solutions : 0.00 - 0
1.19/1.27 c trivial : 0.00 1 0
1.19/1.27 c simplerounding : 0.00 0 0
1.19/1.27 c zirounding : 0.00 0 0
1.19/1.27 c rounding : 0.00 0 0
1.19/1.27 c shifting : 0.00 0 0
1.19/1.27 c intshifting : 0.00 0 0
1.19/1.27 c oneopt : 0.00 0 0
1.19/1.27 c twoopt : 0.00 0 0
1.19/1.27 c fixandinfer : 0.00 0 0
1.19/1.27 c feaspump : 0.00 0 0
1.19/1.27 c coefdiving : 0.00 0 0
1.19/1.27 c pscostdiving : 0.00 0 0
1.19/1.27 c fracdiving : 0.00 0 0
1.19/1.27 c veclendiving : 0.00 0 0
1.19/1.27 c intdiving : 0.00 0 0
1.19/1.27 c actconsdiving : 0.00 0 0
1.19/1.27 c objpscostdiving : 0.00 0 0
1.19/1.27 c rootsoldiving : 0.00 0 0
1.19/1.27 c linesearchdiving : 0.00 0 0
1.19/1.27 c guideddiving : 0.00 0 0
1.19/1.27 c octane : 0.00 0 0
1.19/1.27 c rens : 0.00 0 0
1.19/1.27 c rins : 0.00 0 0
1.19/1.27 c localbranching : 0.00 0 0
1.19/1.27 c mutation : 0.00 0 0
1.19/1.27 c crossover : 0.00 0 0
1.19/1.27 c dins : 0.00 0 0
1.19/1.27 c undercover : 0.00 0 0
1.19/1.27 c nlp : 0.00 0 0
1.19/1.27 c trysol : 0.00 0 0
1.19/1.27 c LP : Time Calls Iterations Iter/call Iter/sec
1.19/1.27 c primal LP : 0.00 0 0 0.00 -
1.19/1.27 c dual LP : 0.08 16 1462 91.38 18275.00
1.19/1.27 c lex dual LP : 0.00 0 0 0.00 -
1.19/1.27 c barrier LP : 0.00 0 0 0.00 -
1.19/1.27 c diving/probing LP: 0.00 0 0 0.00 -
1.19/1.27 c strong branching : 0.78 62 13792 222.45 17682.05
1.19/1.27 c (at root node) : - 62 13792 222.45 -
1.19/1.27 c conflict analysis: 0.00 0 0 0.00 -
1.19/1.27 c B&B Tree :
1.19/1.27 c number of runs : 3
1.19/1.27 c nodes : 1
1.19/1.27 c nodes (total) : 3
1.19/1.27 c nodes left : 0
1.19/1.27 c max depth : 0
1.19/1.27 c max depth (total): 0
1.19/1.27 c backtracks : 0 (0.0%)
1.19/1.27 c delayed cutoffs : 0
1.19/1.27 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.19/1.27 c avg switch length: 2.00
1.19/1.27 c switching time : 0.00
1.19/1.27 c Solution :
1.19/1.27 c Solutions found : 1 (1 improvements)
1.19/1.27 c First Solution : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.18 seconds, depth 0, found by <relaxation>)
1.19/1.27 c Primal Bound : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.18 seconds, depth 0, found by <relaxation>)
1.19/1.27 c Dual Bound : +0.00000000000000e+00
1.19/1.27 c Gap : 0.00 %
1.19/1.27 c Root Dual Bound : +0.00000000000000e+00
1.19/1.27 c Root Iterations : 1462
1.19/1.28 c Time complete: 1.27.