0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704035-1278548332.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.02 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 72 constraints of type <setppc>
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.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.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 | 107 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.22 c 0.2s| 1 | 0 | 150 | - |1182k| 0 | 52 | 169 | 211 | 169 | 89 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.25 c 0.2s| 1 | 0 | 205 | - |1474k| 0 | 61 | 169 | 211 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.27 c 0.3s| 1 | 0 | 221 | - |1562k| 0 | 64 | 169 | 211 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.29 c 0.3s| 1 | 0 | 257 | - |1589k| 0 | 59 | 169 | 211 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.50 c 0.5s| 1 | 0 | 262 | - |1588k| 0 | 59 | 169 | 210 | 169 | 101 | 28 | 0 | 10 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.7s| 1 | 0 | 286 | - |1584k| 0 | 60 | 169 | 206 | 169 | 101 | 28 | 0 | 21 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 300 | - |1579k| 0 | 62 | 169 | 200 | 169 | 101 | 28 | 0 | 34 | 0.000000e+00 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 304 | - |1572k| 0 | 62 | 169 | 193 | 169 | 101 | 28 | 0 | 45 | 0.000000e+00 | -- | Inf
1.29/1.38 c 1.4s| 1 | 0 | 349 | - |1515k| 0 | 57 | 169 | 137 | 169 | 101 | 28 | 0 | 59 | 0.000000e+00 | -- | Inf
1.49/1.58 c 1.6s| 1 | 0 | 368 | - |1514k| 0 | 55 | 169 | 136 | 169 | 101 | 28 | 0 | 71 | 0.000000e+00 | -- | Inf
1.69/1.70 c 1.7s| 1 | 0 | 386 | - |1513k| 0 | 55 | 169 | 135 | 169 | 95 | 28 | 0 | 79 | 0.000000e+00 | -- | Inf
1.69/1.77 c 1.8s| 1 | 0 | 396 | - |1500k| 0 | 54 | 169 | 123 | 169 | 95 | 28 | 0 | 84 | 0.000000e+00 | -- | Inf
1.79/1.83 c 1.8s| 1 | 0 | 409 | - |1493k| 0 | 54 | 169 | 117 | 169 | 95 | 28 | 0 | 89 | 0.000000e+00 | -- | Inf
1.89/1.94 c 1.9s| 1 | 0 | 409 | - |1493k| 0 | - | 169 | 117 | 169 | 95 | 28 | 0 | 98 | 0.000000e+00 | -- | Inf
1.89/1.94 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.89/1.94 c
1.89/1.94 c (restart) converted 22 cuts from the global cut pool into linear constraints
1.89/1.94 c
1.89/1.95 c presolving:
1.89/1.95 c (round 1) 35 del vars, 21 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 78 clqs
1.89/1.95 c (round 2) 35 del vars, 22 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 78 clqs
1.89/1.96 c (round 3) 35 del vars, 22 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 46 upgd conss, 10 impls, 78 clqs
1.89/1.96 c (round 4) 35 del vars, 23 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 46 upgd conss, 10 impls, 78 clqs
1.89/1.97 c presolving (5 rounds):
1.89/1.97 c 35 deleted vars, 23 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.89/1.97 c 10 implications, 78 cliques
1.89/1.97 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 116 constraints
1.89/1.97 c 12 constraints of type <knapsack>
1.89/1.97 c 80 constraints of type <setppc>
1.89/1.97 c 24 constraints of type <logicor>
1.89/1.97 c transformed objective value is always integral (scale: 1)
1.89/1.97 c Presolving Time: 0.03
1.89/1.97 c
1.89/1.97 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.97 c 2.0s| 1 | 0 | 524 | - | 901k| 0 | 45 | 134 | 116 | 134 | 92 | 0 | 0 | 98 | 0.000000e+00 | -- | Inf
1.99/2.00 c 2.0s| 1 | 0 | 549 | - |1154k| 0 | 53 | 134 | 116 | 134 | 105 | 13 | 0 | 98 | 0.000000e+00 | -- | Inf
2.10/2.15 c 2.1s| 1 | 0 | 552 | - |1154k| 0 | 53 | 134 | 116 | 134 | 105 | 13 | 0 | 116 | 0.000000e+00 | -- | Inf
2.20/2.28 c 2.3s| 1 | 0 | 557 | - |1154k| 0 | 52 | 134 | 116 | 134 | 105 | 13 | 0 | 132 | 0.000000e+00 | -- | Inf
2.39/2.43 c 2.4s| 1 | 0 | 565 | - |1154k| 0 | 52 | 134 | 116 | 134 | 105 | 13 | 0 | 148 | 0.000000e+00 | -- | Inf
2.49/2.50 c 2.5s| 1 | 0 | 570 | - |1154k| 0 | 51 | 134 | 116 | 134 | 105 | 13 | 0 | 153 | 0.000000e+00 | -- | Inf
2.49/2.59 c 2.6s| 1 | 0 | 581 | - |1154k| 0 | 51 | 134 | 116 | 134 | 105 | 13 | 0 | 160 | 0.000000e+00 | -- | Inf
2.59/2.64 c 2.6s| 1 | 0 | 599 | - |1154k| 0 | 50 | 134 | 115 | 134 | 105 | 13 | 0 | 166 | 0.000000e+00 | -- | Inf
2.69/2.75 c 2.7s| 1 | 0 | 614 | - |1153k| 0 | 47 | 134 | 114 | 134 | 105 | 13 | 0 | 176 | 0.000000e+00 | -- | Inf
2.79/2.81 c 2.8s| 1 | 0 | 619 | - |1153k| 0 | 48 | 134 | 112 | 134 | 105 | 13 | 0 | 181 | 0.000000e+00 | -- | Inf
2.79/2.84 c 2.8s| 1 | 0 | 619 | - |1153k| 0 | - | 134 | 112 | 134 | 105 | 13 | 0 | 183 | 0.000000e+00 | -- | Inf
2.79/2.84 c (run 2, node 1) restarting after 28 global fixings of integer variables
2.79/2.84 c
2.79/2.84 c (restart) converted 13 cuts from the global cut pool into linear constraints
2.79/2.84 c
2.79/2.84 c presolving:
2.79/2.85 c (round 1) 28 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 18 impls, 80 clqs
2.79/2.86 c (round 2) 28 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 18 impls, 80 clqs
2.79/2.86 c presolving (3 rounds):
2.79/2.86 c 28 deleted vars, 3 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.79/2.86 c 18 implications, 80 cliques
2.79/2.86 c presolved problem has 106 variables (106 bin, 0 int, 0 impl, 0 cont) and 122 constraints
2.79/2.86 c 18 constraints of type <knapsack>
2.79/2.86 c 82 constraints of type <setppc>
2.79/2.86 c 22 constraints of type <logicor>
2.79/2.86 c transformed objective value is always integral (scale: 1)
2.79/2.86 c Presolving Time: 0.05
2.79/2.86 c
2.79/2.86 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.79/2.86 c 2.9s| 1 | 0 | 676 | - | 921k| 0 | 44 | 106 | 122 | 106 | 100 | 0 | 0 | 183 | 0.000000e+00 | -- | Inf
2.79/2.89 c 2.9s| 1 | 0 | 707 | - |1148k| 0 | 50 | 106 | 122 | 106 | 110 | 10 | 0 | 183 | 0.000000e+00 | -- | Inf
2.99/3.00 c 3.0s| 1 | 0 | 708 | - |1148k| 0 | 50 | 106 | 122 | 106 | 110 | 10 | 0 | 201 | 0.000000e+00 | -- | Inf
2.99/3.09 c 3.1s| 1 | 2 | 708 | - |1149k| 0 | 50 | 106 | 122 | 106 | 110 | 10 | 0 | 216 | 0.000000e+00 | -- | Inf
3.29/3.32 c * 3.3s| 4 | 0 | 894 | 62.0 |1180k| 2 | - | 106 | 122 | 106 | 77 | 10 | 0 | 310 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.29/3.32 c
3.29/3.32 c SCIP Status : problem is solved [optimal solution found]
3.29/3.32 c Solving Time (sec) : 3.31
3.29/3.32 c Solving Nodes : 4 (total of 6 nodes in 3 runs)
3.29/3.32 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.29/3.32 c Dual Bound : +0.00000000000000e+00
3.29/3.32 c Gap : 0.00 %
3.29/3.32 s SATISFIABLE
3.29/3.32 v -x169 x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148
3.29/3.32 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127
3.29/3.32 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 -x108 -x107 -x106
3.29/3.32 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
3.29/3.32 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
3.29/3.32 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
3.29/3.32 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
3.29/3.32 v -x4 -x3 -x2 -x1
3.29/3.32 c SCIP Status : problem is solved [optimal solution found]
3.29/3.32 c Solving Time : 3.31
3.29/3.32 c Original Problem :
3.29/3.32 c Problem name : HOME/instance-2704035-1278548332.opb
3.29/3.32 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.29/3.32 c Constraints : 101 initial, 101 maximal
3.29/3.32 c Presolved Problem :
3.29/3.32 c Problem name : t_HOME/instance-2704035-1278548332.opb
3.29/3.32 c Variables : 106 (106 binary, 0 integer, 0 implicit integer, 0 continuous)
3.29/3.32 c Constraints : 122 initial, 122 maximal
3.29/3.32 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.29/3.32 c trivial : 0.00 63 0 0 0 0 0 0 0
3.29/3.32 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.29/3.32 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.29/3.32 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.29/3.32 c implics : 0.00 0 0 0 0 0 0 0 0
3.29/3.32 c probing : 0.00 0 0 0 0 0 0 0 0
3.29/3.32 c knapsack : 0.03 0 0 0 0 0 0 0 0
3.29/3.32 c setppc : 0.01 0 0 0 0 0 4 0 0
3.29/3.32 c linear : 0.01 0 0 0 0 0 50 1 0
3.29/3.32 c logicor : 0.00 0 0 0 0 0 0 0 0
3.29/3.32 c root node : - 65 - - 65 - - - -
3.29/3.32 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.29/3.32 c integral : 0 0 0 33 0 1 109 0 0 4
3.29/3.32 c knapsack : 18 7 39 1 0 0 8 0 0 0
3.29/3.32 c setppc : 82 7 39 1 0 0 69 0 0 0
3.29/3.32 c logicor : 22 2 17 0 0 0 0 0 0 0
3.29/3.32 c countsols : 0 0 0 1 0 0 0 0 0 0
3.29/3.32 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.29/3.32 c integral : 2.87 0.00 0.00 2.87 0.00
3.29/3.32 c knapsack : 0.01 0.01 0.00 0.00 0.00
3.29/3.32 c setppc : 0.00 0.00 0.00 0.00 0.00
3.29/3.32 c logicor : 0.00 0.00 0.00 0.00 0.00
3.29/3.32 c countsols : 0.00 0.00 0.00 0.00 0.00
3.29/3.32 c Propagators : Time Calls Cutoffs DomReds
3.29/3.32 c vbounds : 0.00 3 0 0
3.29/3.32 c rootredcost : 0.00 0 0 0
3.29/3.32 c pseudoobj : 0.00 0 0 0
3.29/3.32 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.29/3.32 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.29/3.32 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.29/3.32 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.29/3.32 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.29/3.32 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.29/3.32 c applied globally : - - - 0 0.0 - - -
3.29/3.32 c applied locally : - - - 0 0.0 - - -
3.29/3.32 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.29/3.32 c cut pool : 0.00 0 - - 0 - (maximal pool size: 84)
3.29/3.32 c redcost : 0.00 10 0 0 0 0
3.29/3.32 c impliedbounds : 0.00 7 0 0 0 0
3.29/3.32 c intobj : 0.00 0 0 0 0 0
3.29/3.32 c cgmip : 0.00 0 0 0 0 0
3.29/3.32 c gomory : 0.05 7 0 0 3 0
3.29/3.32 c strongcg : 0.06 7 0 0 307 0
3.29/3.32 c cmir : 0.00 0 0 0 0 0
3.29/3.32 c flowcover : 0.00 0 0 0 0 0
3.29/3.32 c clique : 0.00 7 0 0 25 0
3.29/3.32 c zerohalf : 0.00 0 0 0 0 0
3.29/3.32 c mcf : 0.00 3 0 0 0 0
3.29/3.32 c rapidlearning : 0.17 1 0 0 0 138
3.29/3.32 c Pricers : Time Calls Vars
3.29/3.32 c problem variables: 0.00 0 0
3.29/3.32 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.29/3.32 c relpscost : 2.87 32 1 109 0 0 4
3.29/3.32 c pscost : 0.00 0 0 0 0 0 0
3.29/3.32 c inference : 0.00 0 0 0 0 0 0
3.29/3.32 c mostinf : 0.00 0 0 0 0 0 0
3.29/3.32 c leastinf : 0.00 0 0 0 0 0 0
3.29/3.32 c fullstrong : 0.00 0 0 0 0 0 0
3.29/3.32 c allfullstrong : 0.00 0 0 0 0 0 0
3.29/3.32 c random : 0.00 0 0 0 0 0 0
3.29/3.32 c Primal Heuristics : Time Calls Found
3.29/3.32 c LP solutions : 0.00 - 1
3.29/3.32 c pseudo solutions : 0.00 - 0
3.29/3.32 c trivial : 0.00 1 0
3.29/3.32 c simplerounding : 0.00 0 0
3.29/3.32 c zirounding : 0.00 0 0
3.29/3.32 c rounding : 0.00 0 0
3.29/3.32 c shifting : 0.00 0 0
3.29/3.32 c intshifting : 0.00 0 0
3.29/3.32 c oneopt : 0.00 0 0
3.29/3.32 c twoopt : 0.00 0 0
3.29/3.32 c fixandinfer : 0.00 0 0
3.29/3.32 c feaspump : 0.00 0 0
3.29/3.32 c coefdiving : 0.00 0 0
3.29/3.32 c pscostdiving : 0.00 0 0
3.29/3.32 c fracdiving : 0.00 0 0
3.29/3.32 c veclendiving : 0.00 0 0
3.29/3.32 c intdiving : 0.00 0 0
3.29/3.32 c actconsdiving : 0.00 0 0
3.29/3.32 c objpscostdiving : 0.00 0 0
3.29/3.32 c rootsoldiving : 0.00 0 0
3.29/3.32 c linesearchdiving : 0.00 0 0
3.29/3.32 c guideddiving : 0.00 0 0
3.29/3.32 c octane : 0.00 0 0
3.29/3.32 c rens : 0.00 0 0
3.29/3.32 c rins : 0.00 0 0
3.29/3.32 c localbranching : 0.00 0 0
3.29/3.32 c mutation : 0.00 0 0
3.29/3.32 c crossover : 0.00 0 0
3.29/3.32 c dins : 0.00 0 0
3.29/3.32 c undercover : 0.00 0 0
3.29/3.32 c nlp : 0.00 0 0
3.29/3.32 c trysol : 0.00 0 0
3.29/3.32 c LP : Time Calls Iterations Iter/call Iter/sec
3.29/3.32 c primal LP : 0.00 0 0 0.00 -
3.29/3.32 c dual LP : 0.06 39 894 22.92 13754.69
3.29/3.32 c lex dual LP : 0.00 0 0 0.00 -
3.29/3.32 c barrier LP : 0.00 0 0 0.00 -
3.29/3.32 c diving/probing LP: 0.00 0 0 0.00 -
3.29/3.32 c strong branching : 2.86 310 31940 103.03 11148.75
3.29/3.32 c (at root node) : - 216 28286 130.95 -
3.29/3.32 c conflict analysis: 0.00 0 0 0.00 -
3.29/3.32 c B&B Tree :
3.29/3.32 c number of runs : 3
3.29/3.32 c nodes : 4
3.29/3.32 c nodes (total) : 6
3.29/3.32 c nodes left : 0
3.29/3.32 c max depth : 2
3.29/3.32 c max depth (total): 2
3.29/3.32 c backtracks : 0 (0.0%)
3.29/3.32 c delayed cutoffs : 0
3.29/3.32 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.29/3.32 c avg switch length: 2.00
3.29/3.32 c switching time : 0.00
3.29/3.32 c Solution :
3.29/3.32 c Solutions found : 1 (1 improvements)
3.29/3.32 c First Solution : +0.00000000000000e+00 (in run 3, after 4 nodes, 3.31 seconds, depth 2, found by <relaxation>)
3.29/3.32 c Primal Bound : +0.00000000000000e+00 (in run 3, after 4 nodes, 3.31 seconds, depth 2, found by <relaxation>)
3.29/3.32 c Dual Bound : +0.00000000000000e+00
3.29/3.32 c Gap : 0.00 %
3.29/3.32 c Root Dual Bound : +0.00000000000000e+00
3.29/3.32 c Root Iterations : 708
3.29/3.33 c Time complete: 3.33.