0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667159-1276273098.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.04 c # [type: real, range: [0,1], default: 0.5]
0.00/0.04 c heuristics/rens/minfixingrate = 0.3
0.00/0.04 c
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/rens/nodesofs = 2000
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/rootsoldiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/rounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/simplerounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/trivial/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/trysol/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/veclendiving/freq = -1
0.00/0.04 c
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04 c
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/zirounding/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/cmir/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c separating/flowcover/freq = -1
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.03/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.03/0.04 c 0.0s| 1 | 0 | 121 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 148 | - |1151k| 0 | 46 | 169 | 210 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 201 | - |1360k| 0 | 56 | 169 | 210 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 260 | - |1535k| 0 | 57 | 169 | 210 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 308 | - |1661k| 0 | 58 | 169 | 210 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 394 | - |1753k| 0 | 55 | 169 | 210 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.58 c 0.5s| 1 | 0 | 413 | - |1743k| 0 | 55 | 169 | 201 | 169 | 108 | 35 | 0 | 12 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.6s| 1 | 0 | 426 | - |1712k| 0 | 55 | 169 | 171 | 169 | 108 | 35 | 0 | 17 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 0 | 442 | - |1635k| 0 | 58 | 169 | 104 | 169 | 108 | 35 | 0 | 22 | 0.000000e+00 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 456 | - |1621k| 0 | 52 | 169 | 91 | 169 | 108 | 35 | 0 | 31 | 0.000000e+00 | -- | Inf
0.89/0.97 c 0.9s| 1 | 0 | 471 | - |1621k| 0 | 52 | 169 | 91 | 169 | 108 | 35 | 0 | 37 | 0.000000e+00 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 488 | - |1621k| 0 | 53 | 169 | 91 | 169 | 98 | 35 | 0 | 42 | 0.000000e+00 | -- | Inf
1.00/1.10 c 1.0s| 1 | 0 | 502 | - |1616k| 0 | 50 | 169 | 86 | 169 | 98 | 35 | 0 | 47 | 0.000000e+00 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 502 | - |1616k| 0 | - | 169 | 86 | 169 | 98 | 35 | 0 | 56 | 0.000000e+00 | -- | Inf
1.19/1.20 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.19/1.20 c
1.19/1.20 c (restart) converted 25 cuts from the global cut pool into linear constraints
1.19/1.20 c
1.19/1.20 c presolving:
1.19/1.21 c (round 1) 38 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 84 clqs
1.19/1.21 c (round 2) 38 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 37 upgd conss, 16 impls, 84 clqs
1.19/1.22 c (round 3) 38 del vars, 7 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 37 upgd conss, 16 impls, 84 clqs
1.19/1.22 c presolving (4 rounds):
1.19/1.22 c 38 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.19/1.22 c 16 implications, 84 cliques
1.19/1.22 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 104 constraints
1.19/1.22 c 6 constraints of type <knapsack>
1.19/1.22 c 83 constraints of type <setppc>
1.19/1.22 c 15 constraints of type <logicor>
1.19/1.22 c transformed objective value is always integral (scale: 1)
1.19/1.22 c Presolving Time: 0.01
1.19/1.22 c
1.19/1.23 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.23 c 1.1s| 1 | 0 | 579 | - | 854k| 0 | 42 | 131 | 104 | 131 | 91 | 0 | 0 | 56 | 0.000000e+00 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 601 | - |1062k| 0 | 47 | 131 | 104 | 131 | 101 | 10 | 0 | 56 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.2s| 1 | 0 | 649 | - |1061k| 0 | 41 | 131 | 101 | 131 | 101 | 10 | 0 | 65 | 0.000000e+00 | -- | Inf
1.29/1.39 c 1.3s| 1 | 0 | 709 | - |1060k| 0 | 37 | 131 | 94 | 131 | 101 | 10 | 0 | 71 | 0.000000e+00 | -- | Inf
1.39/1.41 c 1.3s| 1 | 0 | 709 | - |1059k| 0 | - | 131 | 94 | 131 | 101 | 10 | 0 | 76 | 0.000000e+00 | -- | Inf
1.39/1.41 c (run 2, node 1) restarting after 47 global fixings of integer variables
1.39/1.41 c
1.39/1.41 c (restart) converted 10 cuts from the global cut pool into linear constraints
1.39/1.41 c
1.39/1.41 c presolving:
1.39/1.41 c (round 1) 64 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 46 impls, 56 clqs
1.39/1.42 c (round 2) 64 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.43 c (round 3) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 7 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.43 c (round 4) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 11 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.43 c (round 5) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 13 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.43 c (round 6) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 15 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.44 c (round 7) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 17 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.44 c (round 8) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 19 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.44 c (round 9) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.44 c (round 10) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 22 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.44 c (round 11) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.44 c (round 12) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.45 c (round 13) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.45 c (round 14) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.45 c (round 15) 64 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 8 upgd conss, 46 impls, 56 clqs
1.39/1.45 c presolving (16 rounds):
1.39/1.45 c 64 deleted vars, 23 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 28 changed coefficients
1.39/1.45 c 46 implications, 56 cliques
1.39/1.45 c presolved problem has 67 variables (67 bin, 0 int, 0 impl, 0 cont) and 81 constraints
1.39/1.45 c 11 constraints of type <knapsack>
1.39/1.45 c 66 constraints of type <setppc>
1.39/1.45 c 4 constraints of type <logicor>
1.39/1.45 c transformed objective value is always integral (scale: 1)
1.39/1.45 c Presolving Time: 0.04
1.39/1.45 c
1.39/1.46 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.46 c 1.3s| 1 | 0 | 762 | - | 811k| 0 | 27 | 67 | 81 | 67 | 80 | 0 | 0 | 76 | 0.000000e+00 | -- | Inf
1.39/1.47 c 1.4s| 1 | 0 | 794 | - | 997k| 0 | 32 | 67 | 81 | 67 | 84 | 4 | 0 | 76 | 0.000000e+00 | -- | Inf
1.39/1.49 c 1.4s| 1 | 0 | 813 | - | 986k| 0 | 0 | 67 | 55 | 67 | 84 | 4 | 0 | 81 | 0.000000e+00 | -- | Inf
1.39/1.49 c (run 3, node 1) restarting after 37 global fixings of integer variables
1.39/1.49 c
1.39/1.49 c (restart) converted 4 cuts from the global cut pool into linear constraints
1.39/1.49 c
1.39/1.50 c presolving:
1.49/1.50 c (round 1) 38 del vars, 4 del conss, 0 chg bounds, 38 chg sides, 54 chg coeffs, 0 upgd conss, 72 impls, 26 clqs
1.49/1.51 c (round 2) 38 del vars, 10 del conss, 0 chg bounds, 53 chg sides, 83 chg coeffs, 3 upgd conss, 72 impls, 29 clqs
1.49/1.51 c (round 3) 38 del vars, 11 del conss, 0 chg bounds, 53 chg sides, 98 chg coeffs, 3 upgd conss, 72 impls, 42 clqs
1.49/1.52 c (round 4) 38 del vars, 11 del conss, 0 chg bounds, 57 chg sides, 115 chg coeffs, 3 upgd conss, 72 impls, 42 clqs
1.49/1.52 c (round 5) 38 del vars, 11 del conss, 0 chg bounds, 57 chg sides, 128 chg coeffs, 3 upgd conss, 72 impls, 42 clqs
1.49/1.52 c (round 6) 38 del vars, 11 del conss, 0 chg bounds, 58 chg sides, 147 chg coeffs, 3 upgd conss, 78 impls, 42 clqs
1.49/1.53 c (round 7) 38 del vars, 11 del conss, 0 chg bounds, 58 chg sides, 158 chg coeffs, 3 upgd conss, 78 impls, 42 clqs
1.49/1.53 c (round 8) 38 del vars, 11 del conss, 0 chg bounds, 58 chg sides, 166 chg coeffs, 3 upgd conss, 78 impls, 42 clqs
1.49/1.53 c (round 9) 38 del vars, 11 del conss, 0 chg bounds, 58 chg sides, 169 chg coeffs, 3 upgd conss, 80 impls, 42 clqs
1.49/1.54 c presolving (10 rounds):
1.49/1.54 c 38 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 58 changed sides, 169 changed coefficients
1.49/1.54 c 80 implications, 42 cliques
1.49/1.54 c presolved problem has 29 variables (29 bin, 0 int, 0 impl, 0 cont) and 48 constraints
1.49/1.54 c 12 constraints of type <knapsack>
1.49/1.54 c 35 constraints of type <setppc>
1.49/1.54 c 1 constraints of type <logicor>
1.49/1.54 c transformed objective value is always integral (scale: 1)
1.49/1.54 c Presolving Time: 0.07
1.49/1.54 c
1.49/1.54 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.54 c 1.4s| 1 | 0 | 836 | - | 743k| 0 | 0 | 29 | 48 | 29 | 48 | 0 | 0 | 81 | 0.000000e+00 | -- | Inf
1.49/1.54 c * 1.4s| 1 | 0 | 836 | - | 746k| 0 | - | 29 | 48 | 29 | 48 | 0 | 0 | 81 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.49/1.54 c
1.49/1.54 c SCIP Status : problem is solved [optimal solution found]
1.49/1.54 c Solving Time (sec) : 1.41
1.49/1.54 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
1.49/1.54 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.49/1.54 c Dual Bound : +0.00000000000000e+00
1.49/1.54 c Gap : 0.00 %
1.49/1.54 s SATISFIABLE
1.49/1.54 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.49/1.54 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
1.49/1.54 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
1.49/1.54 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 x94 -x93 -x92 -x91 -x90 x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
1.49/1.54 v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57
1.49/1.54 v -x56 -x55 x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31
1.49/1.54 v -x30 -x29 -x28 -x27 x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5
1.49/1.54 v -x4 -x3 -x2 -x1
1.49/1.54 c SCIP Status : problem is solved [optimal solution found]
1.49/1.54 c Solving Time : 1.41
1.49/1.54 c Original Problem :
1.49/1.54 c Problem name : HOME/instance-2667159-1276273098.opb
1.49/1.54 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.54 c Constraints : 101 initial, 101 maximal
1.49/1.54 c Presolved Problem :
1.49/1.54 c Problem name : t_HOME/instance-2667159-1276273098.opb
1.49/1.54 c Variables : 29 (29 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.54 c Constraints : 48 initial, 48 maximal
1.49/1.54 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.54 c trivial : 0.00 122 0 0 0 0 0 0 0
1.49/1.54 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.54 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.54 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.54 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.54 c probing : 0.00 0 0 0 0 0 0 0 0
1.49/1.54 c knapsack : 0.05 0 0 0 0 0 0 58 197
1.49/1.54 c setppc : 0.00 17 1 0 0 0 22 0 0
1.49/1.54 c linear : 0.01 0 0 0 0 0 32 1 0
1.49/1.54 c logicor : 0.00 0 0 0 0 0 15 0 0
1.49/1.54 c root node : - 122 - - 122 - - - -
1.49/1.54 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.54 c integral : 0 0 0 14 0 0 58 0 0 0
1.49/1.54 c knapsack : 12 8 17 2 0 0 6 0 0 0
1.49/1.54 c setppc : 35 8 17 2 0 0 58 0 0 0
1.49/1.54 c logicor : 1 8 6 0 0 0 0 0 0 0
1.49/1.54 c countsols : 0 0 0 2 0 0 0 0 0 0
1.49/1.54 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.54 c integral : 1.01 0.00 0.00 1.01 0.00
1.49/1.54 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.49/1.54 c setppc : 0.00 0.00 0.00 0.00 0.00
1.49/1.54 c logicor : 0.00 0.00 0.00 0.00 0.00
1.49/1.54 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.54 c Propagators : Time Calls Cutoffs DomReds
1.49/1.54 c vbounds : 0.00 4 0 0
1.49/1.54 c rootredcost : 0.00 0 0 0
1.49/1.54 c pseudoobj : 0.00 0 0 0
1.49/1.54 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.54 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.54 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.54 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.54 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.54 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.54 c applied globally : - - - 0 0.0 - - -
1.49/1.54 c applied locally : - - - 0 0.0 - - -
1.49/1.54 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.54 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.49/1.54 c redcost : 0.00 8 0 0 0 0
1.49/1.54 c impliedbounds : 0.00 7 0 0 0 0
1.49/1.54 c intobj : 0.00 0 0 0 0 0
1.49/1.54 c cgmip : 0.00 0 0 0 0 0
1.49/1.54 c gomory : 0.06 7 0 0 69 0
1.49/1.54 c strongcg : 0.04 7 0 0 316 0
1.49/1.54 c cmir : 0.00 0 0 0 0 0
1.49/1.54 c flowcover : 0.00 0 0 0 0 0
1.49/1.54 c clique : 0.00 7 0 0 36 0
1.49/1.54 c zerohalf : 0.00 0 0 0 0 0
1.49/1.54 c mcf : 0.00 3 0 0 0 0
1.49/1.54 c rapidlearning : 0.18 1 0 0 0 137
1.49/1.54 c Pricers : Time Calls Vars
1.49/1.54 c problem variables: 0.00 0 0
1.49/1.54 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.54 c relpscost : 1.01 12 0 58 0 0 0
1.49/1.54 c pscost : 0.00 0 0 0 0 0 0
1.49/1.54 c inference : 0.00 0 0 0 0 0 0
1.49/1.54 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.54 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.54 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.54 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.54 c random : 0.00 0 0 0 0 0 0
1.49/1.54 c Primal Heuristics : Time Calls Found
1.49/1.54 c LP solutions : 0.00 - 1
1.49/1.54 c pseudo solutions : 0.00 - 0
1.49/1.54 c trivial : 0.00 1 0
1.49/1.54 c simplerounding : 0.00 0 0
1.49/1.54 c zirounding : 0.00 0 0
1.49/1.54 c rounding : 0.00 0 0
1.49/1.54 c shifting : 0.00 0 0
1.49/1.54 c intshifting : 0.00 0 0
1.49/1.54 c oneopt : 0.00 0 0
1.49/1.54 c twoopt : 0.00 0 0
1.49/1.54 c fixandinfer : 0.00 0 0
1.49/1.54 c feaspump : 0.00 0 0
1.49/1.54 c coefdiving : 0.00 0 0
1.49/1.54 c pscostdiving : 0.00 0 0
1.49/1.54 c fracdiving : 0.00 0 0
1.49/1.54 c veclendiving : 0.00 0 0
1.49/1.54 c intdiving : 0.00 0 0
1.49/1.54 c actconsdiving : 0.00 0 0
1.49/1.54 c objpscostdiving : 0.00 0 0
1.49/1.54 c rootsoldiving : 0.00 0 0
1.49/1.54 c linesearchdiving : 0.00 0 0
1.49/1.54 c guideddiving : 0.00 0 0
1.49/1.54 c octane : 0.00 0 0
1.49/1.54 c rens : 0.00 0 0
1.49/1.54 c rins : 0.00 0 0
1.49/1.54 c localbranching : 0.00 0 0
1.49/1.54 c mutation : 0.00 0 0
1.49/1.54 c crossover : 0.00 0 0
1.49/1.54 c dins : 0.00 0 0
1.49/1.54 c undercover : 0.00 0 0
1.49/1.54 c nlp : 0.00 0 0
1.49/1.54 c trysol : 0.00 0 0
1.49/1.54 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.54 c primal LP : 0.00 0 0 0.00 -
1.49/1.54 c dual LP : 0.04 21 836 39.81 20900.00
1.49/1.54 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.54 c barrier LP : 0.00 0 0 0.00 -
1.49/1.54 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.54 c strong branching : 1.01 81 11034 136.22 10924.75
1.49/1.54 c (at root node) : - 81 11034 136.22 -
1.49/1.54 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.54 c B&B Tree :
1.49/1.54 c number of runs : 4
1.49/1.54 c nodes : 1
1.49/1.54 c nodes (total) : 4
1.49/1.54 c nodes left : 0
1.49/1.54 c max depth : 0
1.49/1.54 c max depth (total): 0
1.49/1.54 c backtracks : 0 (0.0%)
1.49/1.54 c delayed cutoffs : 0
1.49/1.54 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.49/1.54 c avg switch length: 2.00
1.49/1.54 c switching time : 0.00
1.49/1.54 c Solution :
1.49/1.54 c Solutions found : 1 (1 improvements)
1.49/1.54 c First Solution : +0.00000000000000e+00 (in run 4, after 1 nodes, 1.41 seconds, depth 0, found by <relaxation>)
1.49/1.54 c Primal Bound : +0.00000000000000e+00 (in run 4, after 1 nodes, 1.41 seconds, depth 0, found by <relaxation>)
1.49/1.54 c Dual Bound : +0.00000000000000e+00
1.49/1.54 c Gap : 0.00 %
1.49/1.54 c Root Dual Bound : +0.00000000000000e+00
1.49/1.54 c Root Iterations : 836
1.49/1.55 c Time complete: 1.54.