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-2703992-1278548305.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.01/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.01/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.01/0.03 c presolving (3 rounds):
0.01/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 8 implications, 68 cliques
0.01/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.01/0.03 c 1 constraints of type <knapsack>
0.01/0.03 c 72 constraints of type <setppc>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.01
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.3
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1789.99
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c limits/solutions = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03 c separating/maxrounds = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/maxroundsroot = 5
0.01/0.03 c
0.01/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.03 c # [type: int, range: [1,2], default: 1]
0.01/0.03 c timing/clocktype = 2
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/indicator/addCouplingCons = TRUE
0.01/0.03 c
0.01/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03 c constraints/knapsack/disaggregation = FALSE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c presolving/probing/maxrounds = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/coefdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03 c heuristics/crossover/freq = -1
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/crossover/nodesofs = 750
0.01/0.03 c
0.01/0.03 c # number of nodes without incumbent change that heuristic should wait
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03 c heuristics/crossover/nwaitingnodes = 100
0.01/0.03 c
0.01/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03 c # [type: real, range: [0,1], default: 0.1]
0.01/0.03 c heuristics/crossover/nodesquot = 0.15
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixed
0.01/0.03 c # [type: real, range: [0,1], default: 0.666]
0.01/0.03 c heuristics/crossover/minfixingrate = 0.5
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/feaspump/freq = -1
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/fracdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/guideddiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/intshifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/linesearchdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/nlp/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/objpscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03 c # [type: real, range: [0,1], default: 0.01]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/oneopt/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/pscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/rens/freq = -1
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixable
0.01/0.03 c # [type: real, range: [0,1], default: 0.5]
0.01/0.03 c heuristics/rens/minfixingrate = 0.3
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/rens/nodesofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/rootsoldiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/rounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/shifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/simplerounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/trivial/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/trysol/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/veclendiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/zirounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/cmir/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/flowcover/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/rapidlearning/freq = 0
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/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.01/0.04 c 0.0s| 1 | 0 | 126 | - | 743k| 0 | 45 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 166 | - |1097k| 0 | 54 | 169 | 192 | 169 | 84 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 222 | - |1357k| 0 | 60 | 169 | 192 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.3s| 1 | 0 | 300 | - |1430k| 0 | 56 | 169 | 192 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 376 | - |1449k| 0 | 56 | 169 | 192 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 429 | - |1464k| 0 | 57 | 169 | 192 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.6s| 1 | 0 | 459 | - |1416k| 0 | 58 | 169 | 150 | 169 | 108 | 35 | 0 | 14 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 491 | - |1407k| 0 | 55 | 169 | 142 | 169 | 108 | 35 | 0 | 26 | 0.000000e+00 | -- | Inf
1.00/1.02 c 1.0s| 1 | 0 | 522 | - |1405k| 0 | 56 | 169 | 140 | 169 | 108 | 35 | 0 | 38 | 0.000000e+00 | -- | Inf
1.19/1.29 c 1.3s| 1 | 0 | 611 | - |1395k| 0 | 53 | 169 | 132 | 169 | 108 | 35 | 0 | 50 | 0.000000e+00 | -- | Inf
1.39/1.40 c 1.4s| 1 | 0 | 652 | - |1381k| 0 | 50 | 169 | 120 | 169 | 108 | 35 | 0 | 57 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.5s| 1 | 0 | 659 | - |1381k| 0 | 51 | 169 | 120 | 169 | 100 | 35 | 0 | 68 | 0.000000e+00 | -- | Inf
1.49/1.58 c 1.6s| 1 | 0 | 665 | - |1379k| 0 | 52 | 169 | 118 | 169 | 100 | 35 | 0 | 80 | 0.000000e+00 | -- | Inf
1.59/1.63 c 1.6s| 1 | 0 | 674 | - |1377k| 0 | 52 | 169 | 115 | 169 | 100 | 35 | 0 | 85 | 0.000000e+00 | -- | Inf
1.59/1.68 c 1.7s| 1 | 0 | 674 | - |1377k| 0 | - | 169 | 115 | 169 | 100 | 35 | 0 | 91 | 0.000000e+00 | -- | Inf
1.59/1.68 c (run 1, node 1) restarting after 36 global fixings of integer variables
1.59/1.68 c
1.59/1.68 c (restart) converted 26 cuts from the global cut pool into linear constraints
1.59/1.68 c
1.59/1.68 c presolving:
1.59/1.68 c (round 1) 36 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 83 clqs
1.59/1.69 c (round 2) 36 del vars, 7 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 83 clqs
1.59/1.69 c (round 3) 36 del vars, 8 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 63 upgd conss, 14 impls, 83 clqs
1.69/1.70 c (round 4) 36 del vars, 10 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 63 upgd conss, 14 impls, 83 clqs
1.69/1.70 c presolving (5 rounds):
1.69/1.70 c 36 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
1.69/1.70 c 14 implications, 83 cliques
1.69/1.70 c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 131 constraints
1.69/1.70 c 9 constraints of type <knapsack>
1.69/1.70 c 85 constraints of type <setppc>
1.69/1.70 c 37 constraints of type <logicor>
1.69/1.70 c transformed objective value is always integral (scale: 1)
1.69/1.70 c Presolving Time: 0.03
1.69/1.70 c
1.69/1.70 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.70 c 1.7s| 1 | 0 | 753 | - | 895k| 0 | 44 | 133 | 131 | 133 | 94 | 0 | 0 | 91 | 0.000000e+00 | -- | Inf
1.69/1.73 c 1.7s| 1 | 0 | 782 | - |1145k| 0 | 53 | 133 | 131 | 133 | 106 | 12 | 0 | 91 | 0.000000e+00 | -- | Inf
1.79/1.86 c 1.8s| 1 | 0 | 806 | - |1144k| 0 | 50 | 133 | 130 | 133 | 106 | 12 | 0 | 103 | 0.000000e+00 | -- | Inf
1.99/2.06 c 2.0s| 1 | 0 | 819 | - |1144k| 0 | 50 | 133 | 130 | 133 | 106 | 12 | 0 | 122 | 0.000000e+00 | -- | Inf
2.20/2.24 c 2.2s| 1 | 0 | 879 | - |1144k| 0 | 48 | 133 | 130 | 133 | 106 | 12 | 0 | 140 | 0.000000e+00 | -- | Inf
2.29/2.39 c 2.4s| 1 | 0 | 896 | - |1144k| 0 | 47 | 133 | 130 | 133 | 106 | 12 | 0 | 156 | 0.000000e+00 | -- | Inf
2.39/2.44 c 2.4s| 1 | 0 | 915 | - |1144k| 0 | 46 | 133 | 127 | 133 | 106 | 12 | 0 | 162 | 0.000000e+00 | -- | Inf
2.49/2.50 c 2.5s| 1 | 0 | 928 | - |1144k| 0 | 46 | 133 | 127 | 133 | 106 | 12 | 0 | 168 | 0.000000e+00 | -- | Inf
2.49/2.55 c 2.5s| 1 | 0 | 928 | - |1144k| 0 | - | 133 | 127 | 133 | 106 | 12 | 0 | 174 | 0.000000e+00 | -- | Inf
2.49/2.55 c (run 2, node 1) restarting after 28 global fixings of integer variables
2.49/2.55 c
2.49/2.55 c (restart) converted 12 cuts from the global cut pool into linear constraints
2.49/2.55 c
2.49/2.55 c presolving:
2.49/2.56 c (round 1) 28 del vars, 16 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 32 impls, 77 clqs
2.49/2.57 c (round 2) 28 del vars, 16 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 11 upgd conss, 32 impls, 77 clqs
2.49/2.57 c (round 3) 28 del vars, 17 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 11 upgd conss, 32 impls, 77 clqs
2.49/2.57 c presolving (4 rounds):
2.49/2.57 c 28 deleted vars, 17 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
2.49/2.57 c 32 implications, 77 cliques
2.49/2.57 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 122 constraints
2.49/2.57 c 17 constraints of type <knapsack>
2.49/2.57 c 82 constraints of type <setppc>
2.49/2.57 c 23 constraints of type <logicor>
2.49/2.57 c transformed objective value is always integral (scale: 1)
2.49/2.57 c Presolving Time: 0.06
2.49/2.57 c
2.49/2.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.49/2.58 c 2.6s| 1 | 0 | 1006 | - | 925k| 0 | 42 | 105 | 122 | 105 | 99 | 0 | 0 | 174 | 0.000000e+00 | -- | Inf
2.59/2.60 c 2.6s| 1 | 0 | 1024 | - |1197k| 0 | 47 | 105 | 122 | 105 | 113 | 14 | 0 | 174 | 0.000000e+00 | -- | Inf
2.79/2.83 c 2.8s| 1 | 0 | 1051 | - |1197k| 0 | 48 | 105 | 122 | 105 | 113 | 14 | 0 | 196 | 0.000000e+00 | -- | Inf
2.99/3.03 c 3.0s| 1 | 0 | 1070 | - |1197k| 0 | 46 | 105 | 122 | 105 | 113 | 14 | 0 | 214 | 0.000000e+00 | -- | Inf
3.09/3.19 c 3.2s| 1 | 0 | 1090 | - |1197k| 0 | 46 | 105 | 122 | 105 | 113 | 14 | 0 | 229 | 0.000000e+00 | -- | Inf
3.20/3.25 c 3.2s| 1 | 0 | 1096 | - |1197k| 0 | 41 | 105 | 121 | 105 | 113 | 14 | 0 | 235 | 0.000000e+00 | -- | Inf
3.30/3.32 c 3.3s| 1 | 0 | 1096 | - |1196k| 0 | - | 105 | 121 | 105 | 113 | 14 | 0 | 242 | 0.000000e+00 | -- | Inf
3.30/3.32 c (run 3, node 1) restarting after 24 global fixings of integer variables
3.30/3.32 c
3.30/3.32 c (restart) converted 14 cuts from the global cut pool into linear constraints
3.30/3.32 c
3.30/3.33 c presolving:
3.30/3.33 c (round 1) 24 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 50 impls, 73 clqs
3.30/3.34 c (round 2) 24 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 50 impls, 73 clqs
3.30/3.34 c presolving (3 rounds):
3.30/3.34 c 24 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.30/3.34 c 50 implications, 73 cliques
3.30/3.34 c presolved problem has 81 variables (81 bin, 0 int, 0 impl, 0 cont) and 120 constraints
3.30/3.34 c 26 constraints of type <knapsack>
3.30/3.34 c 79 constraints of type <setppc>
3.30/3.34 c 15 constraints of type <logicor>
3.30/3.34 c transformed objective value is always integral (scale: 1)
3.30/3.34 c Presolving Time: 0.07
3.30/3.34 c
3.30/3.35 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.30/3.35 c 3.3s| 1 | 0 | 1151 | - | 944k| 0 | 41 | 81 | 120 | 81 | 105 | 0 | 0 | 242 | 0.000000e+00 | -- | Inf
3.30/3.37 c 3.4s| 1 | 0 | 1200 | - |1249k| 0 | 42 | 81 | 120 | 81 | 113 | 8 | 0 | 242 | 0.000000e+00 | -- | Inf
3.59/3.64 c 3.6s| 1 | 0 | 1301 | - |1249k| 0 | 41 | 81 | 120 | 81 | 113 | 8 | 0 | 262 | 0.000000e+00 | -- | Inf
3.69/3.80 c 3.8s| 1 | 0 | 1373 | - |1249k| 0 | 41 | 81 | 119 | 81 | 113 | 8 | 0 | 273 | 0.000000e+00 | -- | Inf
3.89/3.99 c 4.0s| 1 | 0 | 1389 | - |1248k| 0 | 42 | 81 | 117 | 81 | 113 | 8 | 0 | 291 | 0.000000e+00 | -- | Inf
3.99/4.09 c 4.1s| 1 | 0 | 1411 | - |1247k| 0 | 39 | 81 | 116 | 81 | 113 | 8 | 0 | 301 | 0.000000e+00 | -- | Inf
4.09/4.11 c 4.1s| 1 | 0 | 1411 | - |1247k| 0 | - | 81 | 116 | 81 | 113 | 8 | 0 | 303 | 0.000000e+00 | -- | Inf
4.09/4.11 c (run 4, node 1) restarting after 17 global fixings of integer variables
4.09/4.11 c
4.09/4.11 c (restart) converted 8 cuts from the global cut pool into linear constraints
4.09/4.11 c
4.09/4.11 c presolving:
4.09/4.12 c (round 1) 18 del vars, 3 del conss, 0 chg bounds, 5 chg sides, 9 chg coeffs, 8 upgd conss, 58 impls, 66 clqs
4.09/4.13 c (round 2) 18 del vars, 9 del conss, 0 chg bounds, 5 chg sides, 14 chg coeffs, 8 upgd conss, 58 impls, 66 clqs
4.09/4.13 c (round 3) 18 del vars, 9 del conss, 0 chg bounds, 5 chg sides, 18 chg coeffs, 8 upgd conss, 58 impls, 66 clqs
4.09/4.13 c presolving (4 rounds):
4.09/4.13 c 18 deleted vars, 9 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 18 changed coefficients
4.09/4.13 c 58 implications, 66 cliques
4.09/4.13 c presolved problem has 63 variables (63 bin, 0 int, 0 impl, 0 cont) and 115 constraints
4.09/4.13 c 32 constraints of type <knapsack>
4.09/4.13 c 71 constraints of type <setppc>
4.09/4.13 c 12 constraints of type <logicor>
4.09/4.13 c transformed objective value is always integral (scale: 1)
4.09/4.13 c Presolving Time: 0.10
4.09/4.13 c
4.09/4.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.09/4.14 c 4.1s| 1 | 0 | 1461 | - | 945k| 0 | 37 | 63 | 115 | 63 | 103 | 0 | 0 | 303 | 0.000000e+00 | -- | Inf
4.09/4.15 c 4.1s| 1 | 0 | 1462 | - |1239k| 0 | 0 | 63 | 115 | 63 | 117 | 14 | 0 | 303 | 0.000000e+00 | -- | Inf
4.09/4.15 c * 4.1s| 1 | 0 | 1462 | - |1241k| 0 | - | 63 | 115 | 63 | 117 | 14 | 0 | 303 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.09/4.15 c
4.09/4.15 c SCIP Status : problem is solved [optimal solution found]
4.09/4.15 c Solving Time (sec) : 4.14
4.09/4.15 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
4.09/4.15 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.09/4.15 c Dual Bound : +0.00000000000000e+00
4.09/4.15 c Gap : 0.00 %
4.09/4.15 s SATISFIABLE
4.09/4.15 v -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148
4.09/4.15 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
4.09/4.15 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
4.09/4.15 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
4.09/4.15 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
4.09/4.15 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
4.09/4.15 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
4.09/4.15 v x4 -x3 -x2 -x1
4.09/4.15 c SCIP Status : problem is solved [optimal solution found]
4.09/4.15 c Solving Time : 4.14
4.09/4.15 c Original Problem :
4.09/4.15 c Problem name : HOME/instance-2703992-1278548305.opb
4.09/4.15 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.15 c Constraints : 101 initial, 101 maximal
4.09/4.15 c Presolved Problem :
4.09/4.15 c Problem name : t_HOME/instance-2703992-1278548305.opb
4.09/4.15 c Variables : 63 (63 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.15 c Constraints : 115 initial, 115 maximal
4.09/4.15 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.09/4.15 c trivial : 0.00 105 0 0 0 0 0 0 0
4.09/4.15 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c implics : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c probing : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c knapsack : 0.06 0 0 0 0 0 0 5 18
4.09/4.15 c setppc : 0.01 0 1 0 0 0 20 0 0
4.09/4.15 c linear : 0.01 0 0 0 0 0 36 3 0
4.09/4.15 c logicor : 0.01 0 0 0 0 0 23 0 0
4.09/4.15 c root node : - 105 - - 105 - - - -
4.09/4.15 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.09/4.15 c integral : 0 0 0 27 0 0 105 0 0 0
4.09/4.15 c knapsack : 32 9 27 1 0 0 0 0 0 0
4.09/4.15 c setppc : 71 9 27 1 0 0 0 0 0 0
4.09/4.15 c logicor : 12 4 12 0 0 0 0 0 0 0
4.09/4.15 c countsols : 0 0 0 1 0 0 0 0 0 0
4.09/4.15 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.09/4.15 c integral : 3.59 0.00 0.00 3.59 0.00
4.09/4.15 c knapsack : 0.02 0.02 0.00 0.00 0.00
4.09/4.15 c setppc : 0.00 0.00 0.00 0.00 0.00
4.09/4.15 c logicor : 0.00 0.00 0.00 0.00 0.00
4.09/4.15 c countsols : 0.00 0.00 0.00 0.00 0.00
4.09/4.15 c Propagators : Time Calls Cutoffs DomReds
4.09/4.15 c vbounds : 0.00 5 0 0
4.09/4.15 c rootredcost : 0.00 0 0 0
4.09/4.15 c pseudoobj : 0.00 0 0 0
4.09/4.15 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.09/4.15 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.15 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.15 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.15 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.15 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.15 c applied globally : - - - 0 0.0 - - -
4.09/4.15 c applied locally : - - - 0 0.0 - - -
4.09/4.15 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.09/4.15 c cut pool : 0.00 0 - - 0 - (maximal pool size: 165)
4.09/4.15 c redcost : 0.00 9 0 0 0 0
4.09/4.15 c impliedbounds : 0.00 9 0 0 0 0
4.09/4.15 c intobj : 0.00 0 0 0 0 0
4.09/4.15 c cgmip : 0.00 0 0 0 0 0
4.09/4.15 c gomory : 0.06 9 0 0 160 0
4.09/4.15 c strongcg : 0.06 9 0 0 469 0
4.09/4.15 c cmir : 0.00 0 0 0 0 0
4.09/4.15 c flowcover : 0.00 0 0 0 0 0
4.09/4.15 c clique : 0.01 9 0 0 46 0
4.09/4.15 c zerohalf : 0.00 0 0 0 0 0
4.09/4.15 c mcf : 0.00 5 0 0 0 0
4.09/4.15 c rapidlearning : 0.16 1 0 0 0 119
4.09/4.15 c Pricers : Time Calls Vars
4.09/4.15 c problem variables: 0.00 0 0
4.09/4.15 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.09/4.15 c relpscost : 3.59 26 0 105 0 0 0
4.09/4.15 c pscost : 0.00 0 0 0 0 0 0
4.09/4.15 c inference : 0.00 0 0 0 0 0 0
4.09/4.15 c mostinf : 0.00 0 0 0 0 0 0
4.09/4.15 c leastinf : 0.00 0 0 0 0 0 0
4.09/4.15 c fullstrong : 0.00 0 0 0 0 0 0
4.09/4.15 c allfullstrong : 0.00 0 0 0 0 0 0
4.09/4.15 c random : 0.00 0 0 0 0 0 0
4.09/4.15 c Primal Heuristics : Time Calls Found
4.09/4.15 c LP solutions : 0.00 - 1
4.09/4.15 c pseudo solutions : 0.00 - 0
4.09/4.15 c trivial : 0.00 1 0
4.09/4.15 c simplerounding : 0.00 0 0
4.09/4.15 c zirounding : 0.00 0 0
4.09/4.15 c rounding : 0.00 0 0
4.09/4.15 c shifting : 0.00 0 0
4.09/4.15 c intshifting : 0.00 0 0
4.09/4.15 c oneopt : 0.00 0 0
4.09/4.15 c twoopt : 0.00 0 0
4.09/4.15 c fixandinfer : 0.00 0 0
4.09/4.15 c feaspump : 0.00 0 0
4.09/4.15 c coefdiving : 0.00 0 0
4.09/4.15 c pscostdiving : 0.00 0 0
4.09/4.15 c fracdiving : 0.00 0 0
4.09/4.15 c veclendiving : 0.00 0 0
4.09/4.15 c intdiving : 0.00 0 0
4.09/4.15 c actconsdiving : 0.00 0 0
4.09/4.15 c objpscostdiving : 0.00 0 0
4.09/4.15 c rootsoldiving : 0.00 0 0
4.09/4.15 c linesearchdiving : 0.00 0 0
4.09/4.15 c guideddiving : 0.00 0 0
4.09/4.15 c octane : 0.00 0 0
4.09/4.15 c rens : 0.00 0 0
4.09/4.15 c rins : 0.00 0 0
4.09/4.15 c localbranching : 0.00 0 0
4.09/4.15 c mutation : 0.00 0 0
4.09/4.15 c crossover : 0.00 0 0
4.09/4.15 c dins : 0.00 0 0
4.09/4.15 c undercover : 0.00 0 0
4.09/4.15 c nlp : 0.00 0 0
4.09/4.15 c trysol : 0.00 0 0
4.09/4.15 c LP : Time Calls Iterations Iter/call Iter/sec
4.09/4.15 c primal LP : 0.00 0 0 0.00 -
4.09/4.15 c dual LP : 0.11 36 1462 40.61 13663.55
4.09/4.15 c lex dual LP : 0.00 0 0 0.00 -
4.09/4.15 c barrier LP : 0.00 0 0 0.00 -
4.09/4.15 c diving/probing LP: 0.00 0 0 0.00 -
4.09/4.15 c strong branching : 3.58 303 39432 130.14 11005.47
4.09/4.15 c (at root node) : - 303 39432 130.14 -
4.09/4.15 c conflict analysis: 0.00 0 0 0.00 -
4.09/4.15 c B&B Tree :
4.09/4.15 c number of runs : 5
4.09/4.15 c nodes : 1
4.09/4.15 c nodes (total) : 5
4.09/4.15 c nodes left : 0
4.09/4.15 c max depth : 0
4.09/4.15 c max depth (total): 0
4.09/4.15 c backtracks : 0 (0.0%)
4.09/4.15 c delayed cutoffs : 0
4.09/4.15 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.09/4.15 c avg switch length: 2.00
4.09/4.15 c switching time : 0.00
4.09/4.15 c Solution :
4.09/4.15 c Solutions found : 1 (1 improvements)
4.09/4.15 c First Solution : +0.00000000000000e+00 (in run 5, after 1 nodes, 4.14 seconds, depth 0, found by <relaxation>)
4.09/4.15 c Primal Bound : +0.00000000000000e+00 (in run 5, after 1 nodes, 4.14 seconds, depth 0, found by <relaxation>)
4.09/4.15 c Dual Bound : +0.00000000000000e+00
4.09/4.15 c Gap : 0.00 %
4.09/4.15 c Root Dual Bound : +0.00000000000000e+00
4.09/4.15 c Root Iterations : 1462
4.09/4.16 c Time complete: 4.16.