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-2704025-1278548327.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.02/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.02/0.03 c presolving (3 rounds):
0.02/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.03 c 8 implications, 68 cliques
0.02/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.03 c 1 constraints of type <knapsack>
0.02/0.03 c 72 constraints of type <setppc>
0.02/0.03 c transformed objective value is always integral (scale: 1)
0.02/0.03 c Presolving Time: 0.01
0.02/0.03 c - non default parameters ----------------------------------------------------------------------
0.02/0.03 c # SCIP version 1.2.1.3
0.02/0.03 c
0.02/0.03 c # frequency for displaying node information lines
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.03 c display/freq = 10000
0.02/0.03 c
0.02/0.03 c # maximal time in seconds to run
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/time = 1790
0.02/0.03 c
0.02/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03 c limits/memory = 1620
0.02/0.03 c
0.02/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c limits/solutions = 1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.03 c separating/maxrounds = 1
0.02/0.03 c
0.02/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/maxroundsroot = 5
0.02/0.03 c
0.02/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.03 c # [type: int, range: [1,2], default: 1]
0.02/0.03 c timing/clocktype = 2
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify inequalities
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/linear/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/indicator/addCouplingCons = TRUE
0.02/0.03 c
0.02/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.03 c constraints/knapsack/disaggregation = FALSE
0.02/0.03 c
0.02/0.03 c # should presolving try to simplify knapsacks
0.02/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.03 c
0.02/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c presolving/probing/maxrounds = 0
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/coefdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.03 c heuristics/crossover/freq = -1
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/crossover/nodesofs = 750
0.02/0.03 c
0.02/0.03 c # number of nodes without incumbent change that heuristic should wait
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.03 c heuristics/crossover/nwaitingnodes = 100
0.02/0.03 c
0.02/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.03 c # [type: real, range: [0,1], default: 0.1]
0.02/0.03 c heuristics/crossover/nodesquot = 0.15
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixed
0.02/0.03 c # [type: real, range: [0,1], default: 0.666]
0.02/0.03 c heuristics/crossover/minfixingrate = 0.5
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/feaspump/freq = -1
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/fracdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/guideddiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/intshifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/linesearchdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/nlp/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/objpscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.03 c # [type: real, range: [0,1], default: 0.01]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/oneopt/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/pscostdiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/rens/freq = -1
0.02/0.03 c
0.02/0.03 c # minimum percentage of integer variables that have to be fixable
0.02/0.03 c # [type: real, range: [0,1], default: 0.5]
0.02/0.03 c heuristics/rens/minfixingrate = 0.3
0.02/0.03 c
0.02/0.03 c # number of nodes added to the contingent of the total nodes
0.02/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03 c heuristics/rens/nodesofs = 2000
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03 c heuristics/rootsoldiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/rounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/shifting/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/simplerounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c heuristics/trivial/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/trysol/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03 c heuristics/veclendiving/freq = -1
0.02/0.03 c
0.02/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.03 c
0.02/0.03 c # additional number of allowed LP iterations
0.02/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.03 c
0.02/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03 c heuristics/zirounding/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/cmir/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03 c separating/flowcover/freq = -1
0.02/0.03 c
0.02/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03 c separating/rapidlearning/freq = 0
0.02/0.03 c
0.02/0.03 c -----------------------------------------------------------------------------------------------
0.02/0.03 c start solving
0.02/0.03 c
0.02/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.02/0.04 c 0.0s| 1 | 0 | 124 | - | 743k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 152 | - |1154k| 0 | 46 | 169 | 212 | 169 | 85 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 209 | - |1312k| 0 | 53 | 169 | 212 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 236 | - |1361k| 0 | 57 | 169 | 212 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 253 | - |1366k| 0 | 61 | 169 | 212 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 298 | - |1377k| 0 | 59 | 169 | 212 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 0 | 316 | - |1370k| 0 | 59 | 169 | 204 | 169 | 104 | 31 | 0 | 11 | 0.000000e+00 | -- | Inf
0.59/0.68 c 0.7s| 1 | 0 | 342 | - |1300k| 0 | 55 | 169 | 145 | 169 | 104 | 31 | 0 | 24 | 0.000000e+00 | -- | Inf
0.79/0.88 c 0.9s| 1 | 0 | 358 | - |1275k| 0 | 57 | 169 | 121 | 169 | 104 | 31 | 0 | 37 | 0.000000e+00 | -- | Inf
0.99/1.08 c 1.1s| 1 | 0 | 369 | - |1262k| 0 | 55 | 169 | 109 | 169 | 104 | 31 | 0 | 50 | 0.000000e+00 | -- | Inf
1.29/1.30 c 1.3s| 1 | 0 | 395 | - |1261k| 0 | 52 | 169 | 108 | 169 | 104 | 31 | 0 | 64 | 0.000000e+00 | -- | Inf
1.29/1.39 c 1.4s| 1 | 0 | 403 | - |1260k| 0 | 53 | 169 | 106 | 169 | 96 | 31 | 0 | 70 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 416 | - |1258k| 0 | 52 | 169 | 105 | 169 | 96 | 31 | 0 | 75 | 0.000000e+00 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 416 | - |1258k| 0 | - | 169 | 105 | 169 | 96 | 31 | 0 | 85 | 0.000000e+00 | -- | Inf
1.49/1.55 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.49/1.55 c
1.49/1.55 c (restart) converted 23 cuts from the global cut pool into linear constraints
1.49/1.55 c
1.49/1.56 c presolving:
1.49/1.56 c (round 1) 35 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 56 upgd conss, 18 impls, 78 clqs
1.49/1.57 c (round 2) 35 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 56 upgd conss, 18 impls, 78 clqs
1.49/1.57 c presolving (3 rounds):
1.49/1.57 c 35 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.49/1.57 c 18 implications, 78 cliques
1.49/1.57 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 124 constraints
1.49/1.57 c 9 constraints of type <knapsack>
1.49/1.57 c 82 constraints of type <setppc>
1.49/1.57 c 33 constraints of type <logicor>
1.49/1.57 c transformed objective value is always integral (scale: 1)
1.49/1.57 c Presolving Time: 0.03
1.49/1.57 c
1.49/1.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.49/1.58 c 1.6s| 1 | 0 | 533 | - | 900k| 0 | 47 | 134 | 124 | 134 | 91 | 0 | 0 | 85 | 0.000000e+00 | -- | Inf
1.59/1.60 c 1.6s| 1 | 0 | 607 | - | 999k| 0 | 50 | 134 | 124 | 134 | 95 | 4 | 0 | 85 | 0.000000e+00 | -- | Inf
1.69/1.78 c 1.8s| 1 | 0 | 625 | - | 999k| 0 | 50 | 134 | 124 | 134 | 95 | 4 | 0 | 103 | 0.000000e+00 | -- | Inf
1.89/1.94 c 1.9s| 1 | 0 | 643 | - | 999k| 0 | 46 | 134 | 123 | 134 | 95 | 4 | 0 | 120 | 0.000000e+00 | -- | Inf
2.09/2.11 c 2.1s| 1 | 0 | 660 | - | 999k| 0 | 48 | 134 | 123 | 134 | 95 | 4 | 0 | 137 | 0.000000e+00 | -- | Inf
2.09/2.16 c 2.1s| 1 | 0 | 673 | - | 998k| 0 | 48 | 134 | 121 | 134 | 95 | 4 | 0 | 143 | 0.000000e+00 | -- | Inf
2.20/2.24 c 2.2s| 1 | 0 | 687 | - | 997k| 0 | 46 | 134 | 119 | 134 | 95 | 4 | 0 | 153 | 0.000000e+00 | -- | Inf
2.20/2.29 c 2.3s| 1 | 0 | 701 | - | 997k| 0 | 44 | 134 | 119 | 134 | 95 | 4 | 0 | 159 | 0.000000e+00 | -- | Inf
2.29/2.32 c 2.3s| 1 | 0 | 708 | - | 997k| 0 | 42 | 134 | 119 | 134 | 95 | 4 | 0 | 163 | 0.000000e+00 | -- | Inf
2.29/2.33 c 2.3s| 1 | 0 | 710 | - | 997k| 0 | 42 | 134 | 119 | 134 | 95 | 4 | 0 | 166 | 0.000000e+00 | -- | Inf
2.29/2.35 c 2.3s| 1 | 0 | 710 | - | 997k| 0 | - | 134 | 119 | 134 | 95 | 4 | 0 | 168 | 0.000000e+00 | -- | Inf
2.29/2.35 c (run 2, node 1) restarting after 27 global fixings of integer variables
2.29/2.35 c
2.29/2.35 c (restart) converted 4 cuts from the global cut pool into linear constraints
2.29/2.35 c
2.29/2.35 c presolving:
2.29/2.36 c (round 1) 27 del vars, 31 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 26 impls, 77 clqs
2.29/2.37 c (round 2) 27 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 4 upgd conss, 26 impls, 77 clqs
2.29/2.37 c presolving (3 rounds):
2.29/2.37 c 27 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.29/2.37 c 26 implications, 77 cliques
2.29/2.37 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 91 constraints
2.29/2.37 c 10 constraints of type <knapsack>
2.29/2.37 c 80 constraints of type <setppc>
2.29/2.37 c 1 constraints of type <logicor>
2.29/2.37 c transformed objective value is always integral (scale: 1)
2.29/2.37 c Presolving Time: 0.05
2.29/2.37 c
2.29/2.37 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.38 c 2.4s| 1 | 0 | 819 | - | 871k| 0 | 49 | 107 | 91 | 107 | 90 | 0 | 0 | 168 | 0.000000e+00 | -- | Inf
2.29/2.40 c 2.4s| 1 | 0 | 855 | - |1104k| 0 | 51 | 107 | 91 | 107 | 94 | 4 | 0 | 168 | 0.000000e+00 | -- | Inf
2.49/2.51 c 2.5s| 1 | 2 | 855 | - |1104k| 0 | 51 | 107 | 91 | 107 | 94 | 4 | 0 | 185 | 0.000000e+00 | -- | Inf
2.99/3.02 c * 3.0s| 5 | 0 | 1268 | 103.2 |1102k| 2 | - | 107 | 13 | 107 | 77 | 4 | 2 | 354 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.99/3.02 c
2.99/3.02 c SCIP Status : problem is solved [optimal solution found]
2.99/3.02 c Solving Time (sec) : 3.00
2.99/3.02 c Solving Nodes : 5 (total of 7 nodes in 3 runs)
2.99/3.02 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.99/3.02 c Dual Bound : +0.00000000000000e+00
2.99/3.02 c Gap : 0.00 %
2.99/3.02 s SATISFIABLE
2.99/3.02 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
2.99/3.02 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127
2.99/3.02 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
2.99/3.02 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.99/3.02 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.99/3.02 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.99/3.02 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.99/3.02 v -x4 -x3 -x2 -x1
2.99/3.02 c SCIP Status : problem is solved [optimal solution found]
2.99/3.02 c Solving Time : 3.00
2.99/3.02 c Original Problem :
2.99/3.02 c Problem name : HOME/instance-2704025-1278548327.opb
2.99/3.02 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.02 c Constraints : 101 initial, 101 maximal
2.99/3.02 c Presolved Problem :
2.99/3.02 c Problem name : t_HOME/instance-2704025-1278548327.opb
2.99/3.02 c Variables : 107 (107 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.02 c Constraints : 91 initial, 93 maximal
2.99/3.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.02 c trivial : 0.00 62 0 0 0 0 0 0 0
2.99/3.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.02 c implics : 0.00 0 0 0 0 0 0 0 0
2.99/3.02 c probing : 0.00 0 0 0 0 0 0 0 0
2.99/3.02 c knapsack : 0.03 0 0 0 0 0 0 0 0
2.99/3.02 c setppc : 0.01 0 0 0 0 0 6 0 0
2.99/3.02 c linear : 0.01 0 0 0 0 0 28 0 0
2.99/3.02 c logicor : 0.00 0 0 0 0 0 30 0 0
2.99/3.02 c root node : - 169 - - 169 - - - -
2.99/3.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.02 c integral : 0 0 0 38 0 1 144 0 0 4
2.99/3.02 c knapsack : 10 7 48 1 0 0 4 0 0 0
2.99/3.02 c setppc : 80 7 47 0 0 0 107 0 0 0
2.99/3.02 c logicor : 1+ 2 12 0 0 0 0 0 0 0
2.99/3.02 c countsols : 0 0 0 1 0 0 0 0 0 0
2.99/3.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.02 c integral : 2.57 0.00 0.00 2.57 0.00
2.99/3.02 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.99/3.02 c setppc : 0.00 0.00 0.00 0.00 0.00
2.99/3.02 c logicor : 0.00 0.00 0.00 0.00 0.00
2.99/3.02 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.02 c Propagators : Time Calls Cutoffs DomReds
2.99/3.02 c vbounds : 0.00 3 0 0
2.99/3.02 c rootredcost : 0.00 0 0 0
2.99/3.02 c pseudoobj : 0.00 0 0 0
2.99/3.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.02 c infeasible LP : 0.00 1 1 2 17.5 0 0.0 0
2.99/3.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.02 c applied globally : - - - 2 17.5 - - -
2.99/3.02 c applied locally : - - - 0 0.0 - - -
2.99/3.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 81)
2.99/3.02 c redcost : 0.00 11 0 0 0 0
2.99/3.02 c impliedbounds : 0.00 7 0 0 0 0
2.99/3.02 c intobj : 0.00 0 0 0 0 0
2.99/3.02 c cgmip : 0.00 0 0 0 0 0
2.99/3.02 c gomory : 0.05 7 0 0 8 0
2.99/3.02 c strongcg : 0.05 7 0 0 207 0
2.99/3.02 c cmir : 0.00 0 0 0 0 0
2.99/3.02 c flowcover : 0.00 0 0 0 0 0
2.99/3.02 c clique : 0.01 7 0 0 28 0
2.99/3.02 c zerohalf : 0.00 0 0 0 0 0
2.99/3.02 c mcf : 0.00 3 0 0 0 0
2.99/3.02 c rapidlearning : 0.17 1 0 0 0 139
2.99/3.02 c Pricers : Time Calls Vars
2.99/3.02 c problem variables: 0.00 0 0
2.99/3.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.02 c relpscost : 2.57 37 1 144 0 0 4
2.99/3.02 c pscost : 0.00 0 0 0 0 0 0
2.99/3.02 c inference : 0.00 0 0 0 0 0 0
2.99/3.02 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.02 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.02 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.02 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.02 c random : 0.00 0 0 0 0 0 0
2.99/3.02 c Primal Heuristics : Time Calls Found
2.99/3.02 c LP solutions : 0.00 - 1
2.99/3.02 c pseudo solutions : 0.00 - 0
2.99/3.02 c trivial : 0.00 1 0
2.99/3.02 c simplerounding : 0.00 0 0
2.99/3.02 c zirounding : 0.00 0 0
2.99/3.02 c rounding : 0.00 0 0
2.99/3.02 c shifting : 0.00 0 0
2.99/3.02 c intshifting : 0.00 0 0
2.99/3.02 c oneopt : 0.00 0 0
2.99/3.02 c twoopt : 0.00 0 0
2.99/3.02 c fixandinfer : 0.00 0 0
2.99/3.02 c feaspump : 0.00 0 0
2.99/3.02 c coefdiving : 0.00 0 0
2.99/3.02 c pscostdiving : 0.00 0 0
2.99/3.02 c fracdiving : 0.00 0 0
2.99/3.02 c veclendiving : 0.00 0 0
2.99/3.02 c intdiving : 0.00 0 0
2.99/3.02 c actconsdiving : 0.00 0 0
2.99/3.02 c objpscostdiving : 0.00 0 0
2.99/3.02 c rootsoldiving : 0.00 0 0
2.99/3.02 c linesearchdiving : 0.00 0 0
2.99/3.02 c guideddiving : 0.00 0 0
2.99/3.02 c octane : 0.00 0 0
2.99/3.02 c rens : 0.00 0 0
2.99/3.02 c rins : 0.00 0 0
2.99/3.02 c localbranching : 0.00 0 0
2.99/3.02 c mutation : 0.00 0 0
2.99/3.02 c crossover : 0.00 0 0
2.99/3.02 c dins : 0.00 0 0
2.99/3.02 c undercover : 0.00 0 0
2.99/3.02 c nlp : 0.00 0 0
2.99/3.02 c trysol : 0.00 0 0
2.99/3.02 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.02 c primal LP : 0.00 0 0 0.00 -
2.99/3.02 c dual LP : 0.08 46 1268 27.57 15655.09
2.99/3.02 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.02 c barrier LP : 0.00 0 0 0.00 -
2.99/3.02 c diving/probing LP: 0.00 0 0 0.00 -
2.99/3.02 c strong branching : 2.57 354 32407 91.55 12624.92
2.99/3.02 c (at root node) : - 185 24245 131.05 -
2.99/3.02 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.02 c B&B Tree :
2.99/3.02 c number of runs : 3
2.99/3.02 c nodes : 5
2.99/3.02 c nodes (total) : 7
2.99/3.02 c nodes left : 0
2.99/3.02 c max depth : 2
2.99/3.02 c max depth (total): 2
2.99/3.02 c backtracks : 1 (20.0%)
2.99/3.02 c delayed cutoffs : 0
2.99/3.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.99/3.02 c avg switch length: 2.00
2.99/3.02 c switching time : 0.00
2.99/3.02 c Solution :
2.99/3.02 c Solutions found : 1 (1 improvements)
2.99/3.02 c First Solution : +0.00000000000000e+00 (in run 3, after 5 nodes, 3.00 seconds, depth 1, found by <relaxation>)
2.99/3.02 c Primal Bound : +0.00000000000000e+00 (in run 3, after 5 nodes, 3.00 seconds, depth 1, found by <relaxation>)
2.99/3.02 c Dual Bound : +0.00000000000000e+00
2.99/3.02 c Gap : 0.00 %
2.99/3.02 c Root Dual Bound : +0.00000000000000e+00
2.99/3.02 c Root Iterations : 855
2.99/3.02 c Time complete: 3.02.