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-2665749-1276274921.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.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 | 51 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 120 | - |1129k| 0 | 62 | 169 | 205 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 218 | - |1206k| 0 | 67 | 169 | 205 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 487 | - |1248k| 0 | 64 | 169 | 205 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 690 | - |1275k| 0 | 64 | 169 | 205 | 169 | 115 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 785 | - |1286k| 0 | 69 | 169 | 205 | 169 | 119 | 46 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 802 | - |1278k| 0 | 69 | 169 | 199 | 169 | 119 | 46 | 0 | 11 | 0.000000e+00 | -- | Inf
1.29/1.38 c 1.3s| 1 | 0 | 842 | - |1271k| 0 | 70 | 169 | 193 | 169 | 119 | 46 | 0 | 22 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.7s| 1 | 0 | 884 | - |1268k| 0 | 69 | 169 | 190 | 169 | 119 | 46 | 0 | 33 | 0.000000e+00 | -- | Inf
2.29/2.34 c 2.2s| 1 | 0 | 952 | - |1266k| 0 | 69 | 169 | 188 | 169 | 119 | 46 | 0 | 46 | 0.000000e+00 | -- | Inf
2.59/2.67 c 2.6s| 1 | 2 | 952 | - |1266k| 0 | 69 | 169 | 188 | 169 | 119 | 46 | 0 | 55 | 0.000000e+00 | -- | Inf
2.59/2.67 c (run 1, node 1) restarting after 9 global fixings of integer variables
2.59/2.67 c
2.59/2.67 c (restart) converted 30 cuts from the global cut pool into linear constraints
2.59/2.67 c
2.59/2.67 c presolving:
2.59/2.68 c (round 1) 9 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 84 clqs
2.59/2.69 c (round 2) 9 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 143 upgd conss, 8 impls, 84 clqs
2.69/2.70 c presolving (3 rounds):
2.69/2.70 c 9 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
2.69/2.70 c 8 implications, 84 cliques
2.69/2.70 c presolved problem has 160 variables (160 bin, 0 int, 0 impl, 0 cont) and 214 constraints
2.69/2.70 c 15 constraints of type <knapsack>
2.69/2.70 c 84 constraints of type <setppc>
2.69/2.70 c 115 constraints of type <logicor>
2.69/2.70 c transformed objective value is always integral (scale: 1)
2.69/2.70 c Presolving Time: 0.03
2.69/2.70 c
2.69/2.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.69/2.71 c 2.6s| 1 | 0 | 1040 | - |1036k| 0 | 47 | 160 | 214 | 160 | 102 | 0 | 0 | 55 | 0.000000e+00 | -- | Inf
2.69/2.75 c 2.6s| 1 | 0 | 1101 | - |1390k| 0 | 59 | 160 | 214 | 160 | 112 | 10 | 0 | 55 | 0.000000e+00 | -- | Inf
3.29/3.39 c 3.3s| 1 | 0 | 1117 | - |1390k| 0 | 58 | 160 | 214 | 160 | 112 | 10 | 0 | 74 | 0.000000e+00 | -- | Inf
3.89/3.99 c 3.9s| 1 | 0 | 1250 | - |1390k| 0 | 60 | 160 | 213 | 160 | 112 | 10 | 0 | 94 | 0.000000e+00 | -- | Inf
4.19/4.26 c 4.1s| 1 | 0 | 1266 | - |1389k| 0 | 61 | 160 | 211 | 160 | 112 | 10 | 0 | 103 | 0.000000e+00 | -- | Inf
4.49/4.53 c 4.4s| 1 | 0 | 1310 | - |1388k| 0 | 60 | 160 | 210 | 160 | 112 | 10 | 0 | 114 | 0.000000e+00 | -- | Inf
4.79/4.81 c 4.7s| 1 | 0 | 1342 | - |1388k| 0 | 60 | 160 | 209 | 160 | 112 | 10 | 0 | 124 | 0.000000e+00 | -- | Inf
5.29/5.34 c 5.2s| 1 | 0 | 1351 | - |1388k| 0 | 56 | 160 | 209 | 160 | 112 | 10 | 0 | 141 | 0.000000e+00 | -- | Inf
5.68/5.71 c 5.5s| 1 | 0 | 1407 | - |1388k| 0 | 60 | 160 | 209 | 160 | 112 | 10 | 0 | 153 | 0.000000e+00 | -- | Inf
5.89/5.94 c 5.8s| 1 | 0 | 1435 | - |1383k| 0 | 57 | 160 | 193 | 160 | 112 | 10 | 0 | 161 | 0.000000e+00 | -- | Inf
6.08/6.15 c 6.0s| 1 | 0 | 1478 | - |1382k| 0 | 56 | 160 | 187 | 160 | 112 | 10 | 0 | 168 | 0.000000e+00 | -- | Inf
6.29/6.32 c 6.1s| 1 | 0 | 1482 | - |1378k| 0 | 57 | 160 | 176 | 160 | 112 | 10 | 0 | 174 | 0.000000e+00 | -- | Inf
6.29/6.37 c 6.2s| 1 | 0 | 1486 | - |1376k| 0 | 56 | 160 | 171 | 160 | 112 | 10 | 0 | 176 | 0.000000e+00 | -- | Inf
6.39/6.40 c 6.2s| 1 | 0 | 1491 | - |1376k| 0 | 56 | 160 | 171 | 160 | 88 | 10 | 0 | 177 | 0.000000e+00 | -- | Inf
6.39/6.41 c 6.2s| 1 | 0 | 1494 | - |1376k| 0 | 56 | 160 | 171 | 160 | 88 | 10 | 0 | 178 | 0.000000e+00 | -- | Inf
6.39/6.45 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
6.39/6.45 c 6.2s| 1 | 0 | 1497 | - |1376k| 0 | 56 | 160 | 171 | 160 | 88 | 10 | 0 | 180 | 0.000000e+00 | -- | Inf
6.39/6.46 c 6.2s| 1 | 2 | 1497 | - |1377k| 0 | 56 | 160 | 171 | 160 | 88 | 10 | 0 | 181 | 0.000000e+00 | -- | Inf
6.69/6.74 c * 6.5s| 2 | 0 | 1676 | 179.0 |1411k| 1 | - | 160 | 171 | 160 | 88 | 10 | 0 | 244 | 0.000000e+00 | 0.000000e+00 | 0.00%
6.69/6.74 c
6.69/6.74 c SCIP Status : problem is solved [optimal solution found]
6.69/6.74 c Solving Time (sec) : 6.52
6.69/6.74 c Solving Nodes : 2 (total of 3 nodes in 2 runs)
6.69/6.74 c Primal Bound : +0.00000000000000e+00 (1 solutions)
6.69/6.74 c Dual Bound : +0.00000000000000e+00
6.69/6.74 c Gap : 0.00 %
6.69/6.74 s SATISFIABLE
6.69/6.74 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
6.69/6.74 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
6.69/6.74 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
6.69/6.74 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
6.69/6.74 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
6.69/6.74 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
6.69/6.74 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
6.69/6.74 v -x4 x3 -x2 -x1
6.69/6.74 c SCIP Status : problem is solved [optimal solution found]
6.69/6.74 c Solving Time : 6.52
6.69/6.74 c Original Problem :
6.69/6.74 c Problem name : HOME/instance-2665749-1276274921.opb
6.69/6.74 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
6.69/6.74 c Constraints : 101 initial, 101 maximal
6.69/6.74 c Presolved Problem :
6.69/6.74 c Problem name : t_HOME/instance-2665749-1276274921.opb
6.69/6.74 c Variables : 160 (160 binary, 0 integer, 0 implicit integer, 0 continuous)
6.69/6.74 c Constraints : 214 initial, 214 maximal
6.69/6.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.69/6.74 c trivial : 0.00 9 0 0 0 0 0 0 0
6.69/6.74 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.69/6.74 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.69/6.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.69/6.74 c implics : 0.00 0 0 0 0 0 0 0 0
6.69/6.74 c probing : 0.00 0 0 0 0 0 0 0 0
6.69/6.74 c knapsack : 0.01 0 0 0 0 0 0 0 0
6.69/6.74 c setppc : 0.00 0 0 0 0 0 0 0 0
6.69/6.74 c linear : 0.01 0 0 0 0 0 30 1 0
6.69/6.74 c logicor : 0.01 0 0 0 0 0 2 0 0
6.69/6.74 c root node : - 51 - - 51 - - - -
6.69/6.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.69/6.74 c integral : 0 0 0 30 0 0 94 0 0 4
6.69/6.74 c knapsack : 15 6 36 1 0 0 0 0 0 0
6.69/6.74 c setppc : 84 6 36 1 0 0 48 0 0 0
6.69/6.74 c logicor : 115 6 23 1 0 0 0 0 0 0
6.69/6.74 c countsols : 0 0 0 1 0 0 0 0 0 0
6.69/6.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.69/6.74 c integral : 6.00 0.00 0.00 6.00 0.00
6.69/6.74 c knapsack : 0.01 0.01 0.00 0.00 0.00
6.69/6.74 c setppc : 0.00 0.00 0.00 0.00 0.00
6.69/6.74 c logicor : 0.00 0.00 0.00 0.00 0.00
6.69/6.74 c countsols : 0.00 0.00 0.00 0.00 0.00
6.69/6.74 c Propagators : Time Calls Cutoffs DomReds
6.69/6.74 c vbounds : 0.00 2 0 0
6.69/6.74 c rootredcost : 0.00 0 0 0
6.69/6.74 c pseudoobj : 0.00 0 0 0
6.69/6.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.69/6.74 c propagation : 0.00 0 0 0 0.0 0 0.0 -
6.69/6.74 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.69/6.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.69/6.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.69/6.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.69/6.74 c applied globally : - - - 0 0.0 - - -
6.69/6.74 c applied locally : - - - 0 0.0 - - -
6.69/6.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.69/6.74 c cut pool : 0.00 0 - - 0 - (maximal pool size: 88)
6.69/6.74 c redcost : 0.00 7 0 0 0 0
6.69/6.74 c impliedbounds : 0.00 6 0 0 0 0
6.69/6.74 c intobj : 0.00 0 0 0 0 0
6.69/6.74 c cgmip : 0.00 0 0 0 0 0
6.69/6.74 c gomory : 0.06 6 0 0 29 0
6.69/6.74 c strongcg : 0.06 6 0 0 161 0
6.69/6.74 c cmir : 0.00 0 0 0 0 0
6.69/6.74 c flowcover : 0.00 0 0 0 0 0
6.69/6.74 c clique : 0.00 6 0 0 28 0
6.69/6.74 c zerohalf : 0.00 0 0 0 0 0
6.69/6.74 c mcf : 0.00 2 0 0 0 0
6.69/6.74 c rapidlearning : 0.18 1 0 0 0 132
6.69/6.74 c Pricers : Time Calls Vars
6.69/6.74 c problem variables: 0.00 0 0
6.69/6.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.69/6.74 c relpscost : 6.00 29 0 94 0 0 4
6.69/6.74 c pscost : 0.00 0 0 0 0 0 0
6.69/6.74 c inference : 0.00 0 0 0 0 0 0
6.69/6.74 c mostinf : 0.00 0 0 0 0 0 0
6.69/6.74 c leastinf : 0.00 0 0 0 0 0 0
6.69/6.74 c fullstrong : 0.00 0 0 0 0 0 0
6.69/6.74 c allfullstrong : 0.00 0 0 0 0 0 0
6.69/6.74 c random : 0.00 0 0 0 0 0 0
6.69/6.74 c Primal Heuristics : Time Calls Found
6.69/6.74 c LP solutions : 0.00 - 1
6.69/6.74 c pseudo solutions : 0.00 - 0
6.69/6.74 c trivial : 0.00 1 0
6.69/6.74 c simplerounding : 0.00 0 0
6.69/6.74 c zirounding : 0.00 0 0
6.69/6.74 c rounding : 0.00 0 0
6.69/6.74 c shifting : 0.00 0 0
6.69/6.74 c intshifting : 0.00 0 0
6.69/6.74 c oneopt : 0.00 0 0
6.69/6.74 c twoopt : 0.00 0 0
6.69/6.74 c fixandinfer : 0.00 0 0
6.69/6.74 c feaspump : 0.00 0 0
6.69/6.74 c coefdiving : 0.00 0 0
6.69/6.74 c pscostdiving : 0.00 0 0
6.69/6.74 c fracdiving : 0.00 0 0
6.69/6.74 c veclendiving : 0.00 0 0
6.69/6.74 c intdiving : 0.00 0 0
6.69/6.74 c actconsdiving : 0.00 0 0
6.69/6.74 c objpscostdiving : 0.00 0 0
6.69/6.74 c rootsoldiving : 0.00 0 0
6.69/6.74 c linesearchdiving : 0.00 0 0
6.69/6.74 c guideddiving : 0.00 0 0
6.69/6.74 c octane : 0.00 0 0
6.69/6.74 c rens : 0.00 0 0
6.69/6.74 c rins : 0.00 0 0
6.69/6.74 c localbranching : 0.00 0 0
6.69/6.74 c mutation : 0.00 0 0
6.69/6.74 c crossover : 0.00 0 0
6.69/6.74 c dins : 0.00 0 0
6.69/6.74 c undercover : 0.00 0 0
6.69/6.74 c nlp : 0.00 0 0
6.69/6.74 c trysol : 0.00 0 0
6.69/6.74 c LP : Time Calls Iterations Iter/call Iter/sec
6.69/6.74 c primal LP : 0.00 0 0 0.00 -
6.69/6.74 c dual LP : 0.17 36 1676 46.56 9858.82
6.69/6.74 c lex dual LP : 0.00 0 0 0.00 -
6.69/6.74 c barrier LP : 0.00 0 0 0.00 -
6.69/6.74 c diving/probing LP: 0.00 0 0 0.00 -
6.69/6.74 c strong branching : 6.00 244 92194 377.84 15365.67
6.69/6.74 c (at root node) : - 181 86807 479.60 -
6.69/6.74 c conflict analysis: 0.00 0 0 0.00 -
6.69/6.74 c B&B Tree :
6.69/6.74 c number of runs : 2
6.69/6.74 c nodes : 2
6.69/6.74 c nodes (total) : 3
6.69/6.74 c nodes left : 0
6.69/6.74 c max depth : 1
6.69/6.74 c max depth (total): 1
6.69/6.74 c backtracks : 0 (0.0%)
6.69/6.74 c delayed cutoffs : 0
6.69/6.74 c repropagations : 0 (0 domain reductions, 0 cutoffs)
6.69/6.74 c avg switch length: 2.00
6.69/6.74 c switching time : 0.00
6.69/6.74 c Solution :
6.69/6.74 c Solutions found : 1 (1 improvements)
6.69/6.74 c First Solution : +0.00000000000000e+00 (in run 2, after 2 nodes, 6.52 seconds, depth 1, found by <relaxation>)
6.69/6.74 c Primal Bound : +0.00000000000000e+00 (in run 2, after 2 nodes, 6.52 seconds, depth 1, found by <relaxation>)
6.69/6.74 c Dual Bound : +0.00000000000000e+00
6.69/6.74 c Gap : 0.00 %
6.69/6.74 c Root Dual Bound : +0.00000000000000e+00
6.69/6.74 c Root Iterations : 1497
6.69/6.75 c Time complete: 6.74.