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-2665787-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.00
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.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 | 43 | - | 743k| 0 | 37 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 159 | - |1282k| 0 | 60 | 169 | 202 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 185 | - |1286k| 0 | 65 | 169 | 202 | 169 | 107 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.2s| 1 | 0 | 256 | - |1289k| 0 | 71 | 169 | 202 | 169 | 112 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 277 | - |1291k| 0 | 73 | 169 | 202 | 169 | 115 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 328 | - |1294k| 0 | 69 | 169 | 202 | 169 | 117 | 44 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.8s| 1 | 0 | 471 | - |1202k| 0 | 63 | 169 | 119 | 169 | 117 | 44 | 0 | 13 | 0.000000e+00 | -- | Inf
1.29/1.36 c 1.3s| 1 | 0 | 678 | - |1198k| 0 | 56 | 169 | 116 | 169 | 117 | 44 | 0 | 24 | 0.000000e+00 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 785 | - |1195k| 0 | 61 | 169 | 113 | 169 | 117 | 44 | 0 | 31 | 0.000000e+00 | -- | Inf
1.69/1.74 c 1.7s| 1 | 0 | 815 | - |1193k| 0 | 57 | 169 | 111 | 169 | 117 | 44 | 0 | 38 | 0.000000e+00 | -- | Inf
1.89/1.91 c 1.8s| 1 | 0 | 896 | - |1189k| 0 | 57 | 169 | 107 | 169 | 117 | 44 | 0 | 44 | 0.000000e+00 | -- | Inf
1.99/2.01 c 1.9s| 1 | 0 | 959 | - |1186k| 0 | 55 | 169 | 104 | 169 | 101 | 44 | 0 | 49 | 0.000000e+00 | -- | Inf
2.10/2.14 c 2.0s| 1 | 0 | 959 | - |1186k| 0 | - | 169 | 104 | 169 | 101 | 44 | 0 | 55 | 0.000000e+00 | -- | Inf
2.10/2.14 c (run 1, node 1) restarting after 34 global fixings of integer variables
2.10/2.14 c
2.10/2.14 c (restart) converted 28 cuts from the global cut pool into linear constraints
2.10/2.14 c
2.10/2.14 c presolving:
2.10/2.14 c (round 1) 34 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 81 clqs
2.10/2.15 c (round 2) 34 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 46 upgd conss, 10 impls, 81 clqs
2.10/2.16 c (round 3) 34 del vars, 19 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 46 upgd conss, 10 impls, 81 clqs
2.10/2.16 c presolving (4 rounds):
2.10/2.16 c 34 deleted vars, 19 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.10/2.16 c 10 implications, 81 cliques
2.10/2.16 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 113 constraints
2.10/2.16 c 13 constraints of type <knapsack>
2.10/2.16 c 80 constraints of type <setppc>
2.10/2.16 c 20 constraints of type <logicor>
2.10/2.16 c transformed objective value is always integral (scale: 1)
2.10/2.16 c Presolving Time: 0.01
2.10/2.16 c
2.10/2.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.17 c 2.1s| 1 | 0 | 1018 | - | 914k| 0 | 41 | 135 | 113 | 135 | 95 | 0 | 0 | 55 | 0.000000e+00 | -- | Inf
2.10/2.20 c 2.1s| 1 | 0 | 1088 | - |1155k| 0 | 46 | 135 | 113 | 135 | 102 | 7 | 0 | 55 | 0.000000e+00 | -- | Inf
2.20/2.27 c 2.2s| 1 | 0 | 1131 | - |1155k| 0 | 44 | 135 | 113 | 135 | 102 | 7 | 0 | 61 | 0.000000e+00 | -- | Inf
2.29/2.36 c 2.2s| 1 | 0 | 1300 | - |1152k| 0 | 40 | 135 | 104 | 135 | 102 | 7 | 0 | 67 | 0.000000e+00 | -- | Inf
2.29/2.39 c 2.3s| 1 | 0 | 1300 | - |1152k| 0 | - | 135 | 104 | 135 | 102 | 7 | 0 | 73 | 0.000000e+00 | -- | Inf
2.29/2.39 c (run 2, node 1) restarting after 43 global fixings of integer variables
2.29/2.39 c
2.29/2.39 c (restart) converted 7 cuts from the global cut pool into linear constraints
2.29/2.39 c
2.29/2.40 c presolving:
2.39/2.40 c (round 1) 43 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 7 upgd conss, 26 impls, 67 clqs
2.39/2.41 c (round 2) 43 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 7 upgd conss, 26 impls, 67 clqs
2.39/2.41 c presolving (3 rounds):
2.39/2.41 c 43 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
2.39/2.41 c 26 implications, 67 cliques
2.39/2.41 c presolved problem has 92 variables (92 bin, 0 int, 0 impl, 0 cont) and 96 constraints
2.39/2.41 c 17 constraints of type <knapsack>
2.39/2.41 c 69 constraints of type <setppc>
2.39/2.41 c 10 constraints of type <logicor>
2.39/2.41 c transformed objective value is always integral (scale: 1)
2.39/2.41 c Presolving Time: 0.03
2.39/2.42 c
2.39/2.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.39/2.42 c 2.3s| 1 | 0 | 1370 | - | 884k| 0 | 34 | 92 | 96 | 92 | 87 | 0 | 0 | 73 | 0.000000e+00 | -- | Inf
2.39/2.44 c 2.3s| 1 | 0 | 1449 | - |1194k| 0 | 0 | 92 | 96 | 92 | 100 | 13 | 0 | 73 | 0.000000e+00 | -- | Inf
2.39/2.44 c * 2.3s| 1 | 0 | 1449 | - |1196k| 0 | - | 92 | 96 | 92 | 100 | 13 | 0 | 73 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.39/2.44 c
2.39/2.44 c SCIP Status : problem is solved [optimal solution found]
2.39/2.44 c Solving Time (sec) : 2.33
2.39/2.44 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.39/2.44 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.39/2.44 c Dual Bound : +0.00000000000000e+00
2.39/2.44 c Gap : 0.00 %
2.39/2.44 s SATISFIABLE
2.39/2.44 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148
2.39/2.44 v -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.39/2.44 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
2.39/2.44 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
2.39/2.44 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
2.39/2.44 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
2.39/2.44 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
2.39/2.44 v x4 -x3 -x2 -x1
2.39/2.44 c SCIP Status : problem is solved [optimal solution found]
2.39/2.45 c Solving Time : 2.33
2.39/2.45 c Original Problem :
2.39/2.45 c Problem name : HOME/instance-2665787-1276278448.opb
2.39/2.45 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45 c Constraints : 101 initial, 101 maximal
2.39/2.45 c Presolved Problem :
2.39/2.45 c Problem name : t_HOME/instance-2665787-1276278448.opb
2.39/2.45 c Variables : 92 (92 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.45 c Constraints : 96 initial, 96 maximal
2.39/2.45 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.45 c trivial : 0.01 77 0 0 0 0 0 0 0
2.39/2.45 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c probing : 0.00 0 0 0 0 0 0 0 0
2.39/2.45 c knapsack : 0.00 0 0 0 0 0 0 0 1
2.39/2.45 c setppc : 0.00 0 0 0 0 0 10 0 0
2.39/2.45 c linear : 0.00 0 0 0 0 0 41 0 0
2.39/2.45 c logicor : 0.01 0 0 0 0 0 11 0 0
2.39/2.45 c root node : - 77 - - 77 - - - -
2.39/2.45 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.45 c integral : 0 0 0 11 0 0 49 0 0 0
2.39/2.45 c knapsack : 17 7 12 1 0 0 0 0 0 0
2.39/2.45 c setppc : 69 7 12 1 0 0 28 0 0 0
2.39/2.45 c logicor : 10 7 5 0 0 0 0 0 0 0
2.39/2.45 c countsols : 0 0 0 1 0 0 0 0 0 0
2.39/2.45 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.45 c integral : 1.86 0.00 0.00 1.86 0.00
2.39/2.45 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.39/2.45 c setppc : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c logicor : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.45 c Propagators : Time Calls Cutoffs DomReds
2.39/2.45 c vbounds : 0.00 3 0 0
2.39/2.45 c rootredcost : 0.00 0 0 0
2.39/2.45 c pseudoobj : 0.00 0 0 0
2.39/2.45 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.45 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.45 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.45 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.45 c applied globally : - - - 0 0.0 - - -
2.39/2.45 c applied locally : - - - 0 0.0 - - -
2.39/2.45 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.45 c cut pool : 0.00 0 - - 0 - (maximal pool size: 131)
2.39/2.45 c redcost : 0.00 7 0 0 0 0
2.39/2.45 c impliedbounds : 0.00 7 0 0 0 0
2.39/2.45 c intobj : 0.00 0 0 0 0 0
2.39/2.45 c cgmip : 0.00 0 0 0 0 0
2.39/2.45 c gomory : 0.05 7 0 0 142 0
2.39/2.45 c strongcg : 0.06 7 0 0 202 0
2.39/2.45 c cmir : 0.00 0 0 0 0 0
2.39/2.45 c flowcover : 0.00 0 0 0 0 0
2.39/2.45 c clique : 0.00 7 0 0 28 0
2.39/2.45 c zerohalf : 0.00 0 0 0 0 0
2.39/2.45 c mcf : 0.00 3 0 0 0 0
2.39/2.45 c rapidlearning : 0.18 1 0 0 0 129
2.39/2.45 c Pricers : Time Calls Vars
2.39/2.45 c problem variables: 0.00 0 0
2.39/2.45 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.45 c relpscost : 1.86 10 0 49 0 0 0
2.39/2.45 c pscost : 0.00 0 0 0 0 0 0
2.39/2.45 c inference : 0.00 0 0 0 0 0 0
2.39/2.45 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.45 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.45 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.45 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.45 c random : 0.00 0 0 0 0 0 0
2.39/2.45 c Primal Heuristics : Time Calls Found
2.39/2.45 c LP solutions : 0.00 - 1
2.39/2.45 c pseudo solutions : 0.00 - 0
2.39/2.45 c trivial : 0.00 1 0
2.39/2.45 c simplerounding : 0.00 0 0
2.39/2.45 c zirounding : 0.00 0 0
2.39/2.45 c rounding : 0.00 0 0
2.39/2.45 c shifting : 0.00 0 0
2.39/2.45 c intshifting : 0.00 0 0
2.39/2.45 c oneopt : 0.00 0 0
2.39/2.45 c twoopt : 0.00 0 0
2.39/2.45 c fixandinfer : 0.00 0 0
2.39/2.45 c feaspump : 0.00 0 0
2.39/2.45 c coefdiving : 0.00 0 0
2.39/2.45 c pscostdiving : 0.00 0 0
2.39/2.45 c fracdiving : 0.00 0 0
2.39/2.45 c veclendiving : 0.00 0 0
2.39/2.45 c intdiving : 0.00 0 0
2.39/2.45 c actconsdiving : 0.00 0 0
2.39/2.45 c objpscostdiving : 0.00 0 0
2.39/2.45 c rootsoldiving : 0.00 0 0
2.39/2.45 c linesearchdiving : 0.00 0 0
2.39/2.45 c guideddiving : 0.00 0 0
2.39/2.45 c octane : 0.00 0 0
2.39/2.45 c rens : 0.00 0 0
2.39/2.45 c rins : 0.00 0 0
2.39/2.45 c localbranching : 0.00 0 0
2.39/2.45 c mutation : 0.00 0 0
2.39/2.45 c crossover : 0.00 0 0
2.39/2.45 c dins : 0.00 0 0
2.39/2.45 c undercover : 0.00 0 0
2.39/2.45 c nlp : 0.00 0 0
2.39/2.45 c trysol : 0.00 0 0
2.39/2.45 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.45 c primal LP : 0.00 0 0 0.00 -
2.39/2.45 c dual LP : 0.13 18 1449 80.50 11146.15
2.39/2.45 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.45 c barrier LP : 0.00 0 0 0.00 -
2.39/2.45 c diving/probing LP: 0.00 0 0 0.00 -
2.39/2.45 c strong branching : 1.86 73 27923 382.51 15012.37
2.39/2.45 c (at root node) : - 73 27923 382.51 -
2.39/2.45 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.45 c B&B Tree :
2.39/2.45 c number of runs : 3
2.39/2.45 c nodes : 1
2.39/2.45 c nodes (total) : 3
2.39/2.45 c nodes left : 0
2.39/2.45 c max depth : 0
2.39/2.45 c max depth (total): 0
2.39/2.45 c backtracks : 0 (0.0%)
2.39/2.45 c delayed cutoffs : 0
2.39/2.45 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.39/2.45 c avg switch length: 2.00
2.39/2.45 c switching time : 0.00
2.39/2.45 c Solution :
2.39/2.45 c Solutions found : 1 (1 improvements)
2.39/2.45 c First Solution : +0.00000000000000e+00 (in run 3, after 1 nodes, 2.33 seconds, depth 0, found by <relaxation>)
2.39/2.45 c Primal Bound : +0.00000000000000e+00 (in run 3, after 1 nodes, 2.33 seconds, depth 0, found by <relaxation>)
2.39/2.45 c Dual Bound : +0.00000000000000e+00
2.39/2.45 c Gap : 0.00 %
2.39/2.45 c Root Dual Bound : +0.00000000000000e+00
2.39/2.45 c Root Iterations : 1449
2.39/2.45 c Time complete: 2.44.