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-2667133-1276270661.opb>
0.00/0.02 c original problem has 370 variables (370 bin, 0 int, 0 impl, 0 cont) and 557 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.04/0.05 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 557 upgd conss, 402 impls, 0 clqs
0.04/0.07 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 557 upgd conss, 12226 impls, 0 clqs
0.04/0.07 c presolving (3 rounds):
0.04/0.07 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.04/0.07 c 12226 implications, 0 cliques
0.04/0.07 c presolved problem has 362 variables (362 bin, 0 int, 0 impl, 0 cont) and 557 constraints
0.04/0.07 c 244 constraints of type <knapsack>
0.04/0.07 c 313 constraints of type <logicor>
0.04/0.07 c transformed objective value is always integral (scale: 1)
0.04/0.07 c Presolving Time: 0.03
0.04/0.07 c - non default parameters ----------------------------------------------------------------------
0.04/0.07 c # SCIP version 1.2.1.2
0.04/0.07 c
0.04/0.07 c # frequency for displaying node information lines
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.07 c display/freq = 10000
0.04/0.07 c
0.04/0.07 c # maximal time in seconds to run
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.07 c limits/time = 1799.99
0.04/0.07 c
0.04/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.07 c limits/memory = 1620
0.04/0.07 c
0.04/0.07 c # solving stops, if the given number of solutions were found (-1: no limit)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.07 c limits/solutions = 1
0.04/0.07 c
0.04/0.07 c # maximal number of separation rounds per node (-1: unlimited)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 5]
0.04/0.07 c separating/maxrounds = 1
0.04/0.07 c
0.04/0.07 c # maximal number of separation rounds in the root node (-1: unlimited)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.07 c separating/maxroundsroot = 5
0.04/0.07 c
0.04/0.07 c # should presolving try to simplify inequalities
0.04/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.07 c constraints/linear/simplifyinequalities = TRUE
0.04/0.07 c
0.04/0.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.04/0.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.04/0.07 c constraints/knapsack/disaggregation = FALSE
0.04/0.07 c
0.04/0.07 c # should presolving try to simplify knapsacks
0.04/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.07 c
0.04/0.07 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.07 c presolving/probing/maxrounds = 0
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/coefdiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.07 c heuristics/coefdiving/maxlpiterquot = 0.075
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/coefdiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 30]
0.04/0.07 c heuristics/crossover/freq = -1
0.04/0.07 c
0.04/0.07 c # number of nodes added to the contingent of the total nodes
0.04/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.07 c heuristics/crossover/nodesofs = 750
0.04/0.07 c
0.04/0.07 c # number of nodes without incumbent change that heuristic should wait
0.04/0.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.04/0.07 c heuristics/crossover/nwaitingnodes = 100
0.04/0.07 c
0.04/0.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.04/0.07 c # [type: real, range: [0,1], default: 0.1]
0.04/0.07 c heuristics/crossover/nodesquot = 0.15
0.04/0.07 c
0.04/0.07 c # minimum percentage of integer variables that have to be fixed
0.04/0.07 c # [type: real, range: [0,1], default: 0.666]
0.04/0.07 c heuristics/crossover/minfixingrate = 0.5
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.07 c heuristics/feaspump/freq = -1
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/feaspump/maxlpiterofs = 2000
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/fracdiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.07 c heuristics/fracdiving/maxlpiterquot = 0.075
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/fracdiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/guideddiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.07 c heuristics/guideddiving/maxlpiterquot = 0.075
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/guideddiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.07 c heuristics/intdiving/maxlpiterquot = 0.075
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/intshifting/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/linesearchdiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.07 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.07 c heuristics/nlp/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.07 c heuristics/objpscostdiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to total iteration number
0.04/0.07 c # [type: real, range: [0,1], default: 0.01]
0.04/0.07 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.07 c heuristics/oneopt/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/pscostdiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.07 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/pscostdiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.07 c heuristics/rens/freq = -1
0.04/0.07 c
0.04/0.07 c # minimum percentage of integer variables that have to be fixable
0.04/0.07 c # [type: real, range: [0,1], default: 0.5]
0.04/0.07 c heuristics/rens/minfixingrate = 0.3
0.04/0.07 c
0.04/0.07 c # number of nodes added to the contingent of the total nodes
0.04/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.07 c heuristics/rens/nodesofs = 2000
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.07 c heuristics/rootsoldiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.04/0.07 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.07 c heuristics/rounding/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/shifting/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.07 c heuristics/simplerounding/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.07 c heuristics/trivial/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.07 c heuristics/trysol/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.07 c heuristics/veclendiving/freq = -1
0.04/0.07 c
0.04/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.07 c heuristics/veclendiving/maxlpiterquot = 0.075
0.04/0.07 c
0.04/0.07 c # additional number of allowed LP iterations
0.04/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.07 c heuristics/veclendiving/maxlpiterofs = 1500
0.04/0.07 c
0.04/0.07 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.07 c heuristics/zirounding/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.07 c separating/cmir/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.07 c separating/flowcover/freq = -1
0.04/0.07 c
0.04/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.07 c separating/rapidlearning/freq = 0
0.04/0.07 c
0.04/0.07 c -----------------------------------------------------------------------------------------------
0.04/0.07 c start solving
0.04/0.07 c
0.04/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.09 c 0.1s| 1 | 0 | 154 | - |2235k| 0 | 91 | 362 | 557 | 362 | 549 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 431 | - |2817k| 0 | 144 | 362 | 559 | 362 | 814 | 265 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.66 c 0.6s| 1 | 0 | 723 | - |4373k| 0 | 155 | 362 | 559 | 362 |1089 | 540 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.8s| 1 | 0 | 920 | - |5843k| 0 | 182 | 362 | 559 | 362 |1109 | 560 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.24 c 1.2s| 1 | 0 | 1118 | - |7030k| 0 | 176 | 362 | 559 | 362 |1135 | 586 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.53 c 1.4s| 1 | 0 | 1221 | - |7771k| 0 | 177 | 362 | 559 | 362 |1172 | 623 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.52 c 2.4s| 1 | 2 | 1221 | - |7771k| 0 | 177 | 362 | 559 | 362 |1172 | 623 | 0 | 10 | 0.000000e+00 | -- | Inf
24.49/24.58 c 23.9s| 10000 | 122 | 67965 | 6.7 |8378k| 36 | 19 | 362 |1019 | 362 | 683 | 623 | 599 |2428 | 0.000000e+00 | -- | Inf
39.88/39.98 c 38.8s| 20000 | 153 |143925 | 7.1 |8580k| 38 | 31 | 362 |1276 | 362 | 683 | 623 |1151 |2449 | 0.000000e+00 | -- | Inf
55.58/55.60 c 53.9s| 30000 | 166 |217648 | 7.2 |8688k| 38 | 21 | 362 |1354 | 362 | 683 | 623 |1748 |2666 | 0.000000e+00 | -- | Inf
72.97/73.07 c 70.8s| 40000 | 217 |300187 | 7.5 |8848k| 44 | 22 | 362 |1418 | 362 | 683 | 623 |2177 |3114 | 0.000000e+00 | -- | Inf
93.96/94.03 c 91.1s| 50000 | 234 |398970 | 8.0 |8881k| 46 | - | 362 |1329 | 0 | 0 | 623 |2583 |3754 | 0.000000e+00 | -- | Inf
114.15/114.23 c 111s| 60000 | 284 |498285 | 8.3 |9011k| 47 | - | 362 |1275 | 362 | 683 | 623 |2971 |4210 | 0.000000e+00 | -- | Inf
132.85/132.99 c 129s| 70000 | 340 |588245 | 8.4 |9184k| 48 | - | 362 |1392 | 0 | 0 | 623 |3458 |4630 | 0.000000e+00 | -- | Inf
151.54/151.60 c 147s| 80000 | 324 |676407 | 8.4 |9180k| 48 | - | 362 |1394 | 362 | 683 | 623 |3897 |5026 | 0.000000e+00 | -- | Inf
169.64/169.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
169.64/169.71 c 164s| 90000 | 333 |762498 | 8.5 |9190k| 51 | 33 | 362 |1302 | 362 | 683 | 623 |4365 |5364 | 0.000000e+00 | -- | Inf
190.43/190.54 c 185s|100000 | 370 |870077 | 8.7 |9337k| 52 | - | 362 |1407 | 362 | 683 | 623 |4775 |5626 | 0.000000e+00 | -- | Inf
206.53/206.68 c 200s|110000 | 367 |943095 | 8.6 |9416k| 53 | - | 362 |1566 | 0 | 0 | 623 |5298 |5975 | 0.000000e+00 | -- | Inf
225.13/225.29 c 218s|120000 | 350 | 1031k| 8.6 |9331k| 53 | - | 362 |1387 | 362 | 683 | 623 |5748 |6281 | 0.000000e+00 | -- | Inf
243.73/243.89 c 236s|130000 | 319 | 1122k| 8.6 |9230k| 53 | - | 362 |1312 | 362 | 683 | 623 |6190 |6525 | 0.000000e+00 | -- | Inf
261.32/261.48 c 253s|140000 | 326 | 1209k| 8.6 |9318k| 53 | 44 | 362 |1484 | 362 | 683 | 623 |6643 |6740 | 0.000000e+00 | -- | Inf
279.61/279.74 c 271s|150000 | 337 | 1295k| 8.6 |9347k| 53 | 42 | 362 |1461 | 362 | 683 | 623 |7180 |7085 | 0.000000e+00 | -- | Inf
296.82/296.91 c 288s|160000 | 351 | 1379k| 8.6 |9466k| 53 | - | 362 |1715 | 0 | 0 | 623 |7611 |7254 | 0.000000e+00 | -- | Inf
314.71/314.87 c 305s|170000 | 365 | 1468k| 8.6 |9545k| 53 | 42 | 362 |1791 | 362 | 683 | 623 |8066 |7391 | 0.000000e+00 | -- | Inf
334.00/334.19 c 324s|180000 | 369 | 1563k| 8.7 |9566k| 53 | 49 | 362 |1780 | 362 | 683 | 623 |8490 |7661 | 0.000000e+00 | -- | Inf
349.90/350.01 c 339s|190000 | 372 | 1640k| 8.6 |9634k| 53 | - | 362 |1936 | 0 | 0 | 623 |9045 |7802 | 0.000000e+00 | -- | Inf
366.29/366.47 c 355s|200000 | 372 | 1719k| 8.6 |9673k| 53 | 24 | 362 |2013 | 362 | 683 | 623 |9480 |7995 | 0.000000e+00 | -- | Inf
384.69/384.82 c 373s|210000 | 406 | 1808k| 8.6 |9772k| 53 | 28 | 362 |2067 | 362 | 683 | 623 |9898 |8156 | 0.000000e+00 | -- | Inf
404.48/404.70 c 392s|220000 | 418 | 1894k| 8.6 |9744k| 53 | - | 362 |1821 | 362 | 683 | 623 | 10k|8913 | 0.000000e+00 | -- | Inf
420.28/420.42 c 407s|230000 | 452 | 1970k| 8.6 |9917k| 53 | - | 362 |2071 | 0 | 0 | 623 | 10k|8935 | 0.000000e+00 | -- | Inf
436.68/436.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
436.68/436.81 c 423s|240000 | 469 | 2050k| 8.5 | 10M| 53 | 23 | 362 |2193 | 362 | 683 | 623 | 11k|8974 | 0.000000e+00 | -- | Inf
452.67/452.84 c 439s|250000 | 465 | 2126k| 8.5 | 10M| 53 | 19 | 362 |2195 | 362 | 683 | 623 | 11k|9051 | 0.000000e+00 | -- | Inf
470.37/470.56 c 456s|260000 | 469 | 2211k| 8.5 | 10M| 53 | 25 | 362 |2376 | 362 | 683 | 623 | 12k|9226 | 0.000000e+00 | -- | Inf
487.27/487.49 c 472s|270000 | 469 | 2293k| 8.5 | 10M| 53 | 16 | 362 |2291 | 362 | 683 | 623 | 12k|9318 | 0.000000e+00 | -- | Inf
502.76/502.95 c 487s|280000 | 478 | 2365k| 8.4 | 10M| 53 | 21 | 362 |2529 | 362 | 683 | 623 | 13k|9411 | 0.000000e+00 | -- | Inf
517.76/517.95 c 502s|290000 | 447 | 2432k| 8.4 | 10M| 53 | - | 362 |2536 | 0 | 0 | 623 | 14k|9534 | 0.000000e+00 | -- | Inf
538.55/538.77 c 522s|300000 | 435 | 2529k| 8.4 |9984k| 53 | - | 362 |2055 | 0 | 0 | 623 | 14k| 10k| 0.000000e+00 | -- | Inf
557.56/557.73 c 540s|310000 | 443 | 2618k| 8.4 |9969k| 53 | - | 362 |1878 | 0 | 0 | 623 | 14k| 10k| 0.000000e+00 | -- | Inf
561.55/561.76 c * 544s|312302 | 0 | 2638k| 8.4 |8803k| 53 | - | 362 |1807 | 362 | 683 | 623 | 15k| 10k| 0.000000e+00 | 0.000000e+00 | 0.00%
561.55/561.76 c
561.55/561.76 c SCIP Status : problem is solved [optimal solution found]
561.55/561.76 c Solving Time (sec) : 544.23
561.55/561.76 c Solving Nodes : 312302
561.55/561.76 c Primal Bound : +0.00000000000000e+00 (1 solutions)
561.55/561.76 c Dual Bound : +0.00000000000000e+00
561.55/561.76 c Gap : 0.00 %
561.55/561.76 s SATISFIABLE
561.55/561.76 v -x369 x370 -x367 x368 -x365 x366 -x363 x364 -x361 x362 -x359 x360 -x357 x358 -x355 x356 -x353 -x354 -x351 -x352 -x349 -x350 x347
561.55/561.76 v -x348 x345 -x346 x343 -x344 x341 -x342 -x339 x340 -x337 x338 x335 -x336 -x333 x334 x331 -x332 x329 -x330 x327 -x328 -x325 x326
561.55/561.76 v -x323 x324 -x321 x322 -x319 x320 -x317 x318 -x315 -x316 -x313 -x314 -x311 -x312 -x309 -x310 x307 -x308 x305 -x306 x303 -x304
561.55/561.76 v x301 -x302 x299 -x300 x297 -x298 x295 -x296 x293 -x294 x291 -x292 x289 -x290 x287 -x288 -x285 x286 x283 -x284 x281 -x282
561.55/561.76 v -x279 x280 -x277 x278 -x275 x276 -x273 x274 x271 -x272 x269 -x270 x267 -x268 x265 -x266 x263 -x264 x261 -x262 x259 -x260 x257
561.55/561.76 v -x258 x255 -x256 -x253 x254 -x251 x252 -x249 x250 -x247 x248 -x245 x246 -x243 x244 -x242 x240 x238 -x236 -x234 -x232 -x230 x228
561.55/561.76 v -x226 x224 x222 -x220 x218 x216 -x214 -x212 -x210 -x208 -x206 x204 x202 x200 -x198 -x196 x194 -x192 -x190 -x188 -x186 x184
561.55/561.76 v x182 x180 -x178 -x176 -x174 -x172 -x170 -x168 -x166 -x164 x162 x160 -x158 -x156 -x154 -x152 -x150 -x148 -x146 -x144 -x142 x140
561.55/561.76 v -x138 -x136 -x134 -x132 -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98
561.55/561.76 v -x96 -x94 -x92 -x90 -x88 -x86 -x84 -x82 -x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48
561.55/561.76 v -x46 -x44 -x42 -x40 -x38 -x36 -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x241 -x239
561.55/561.76 v -x237 -x235 -x233 -x231 -x229 -x227 -x225 -x223 -x221 -x219 -x217 -x215 -x213 -x211 -x209 -x207 -x205 -x203 -x201 -x199 -x197
561.55/561.76 v -x195 -x193 -x191 -x189 -x187 -x185 -x183 -x181 -x179 -x177 -x175 -x173 -x171 -x169 -x167 -x165 -x163 -x161 -x159 -x157 -x155
561.55/561.76 v -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 x131 -x129 -x127 x125 -x123 -x121 -x119 -x117 -x115 -x113
561.55/561.76 v -x111 x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 x77 x75 -x73 -x71 -x69 -x67 x65
561.55/561.76 v -x63 -x61 -x59 x57 x55 x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39 x37 x35 x33 x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 x15 x13 x11
561.55/561.76 v x9 -x7 -x5 -x3 -x1
561.55/561.76 c SCIP Status : problem is solved [optimal solution found]
561.55/561.76 c Solving Time : 544.23
561.55/561.76 c Original Problem :
561.55/561.76 c Problem name : HOME/instance-2667133-1276270661.opb
561.55/561.76 c Variables : 370 (370 binary, 0 integer, 0 implicit integer, 0 continuous)
561.55/561.76 c Constraints : 557 initial, 557 maximal
561.55/561.76 c Presolved Problem :
561.55/561.76 c Problem name : t_HOME/instance-2667133-1276270661.opb
561.55/561.76 c Variables : 362 (362 binary, 0 integer, 0 implicit integer, 0 continuous)
561.55/561.76 c Constraints : 557 initial, 2616 maximal
561.55/561.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
561.55/561.76 c trivial : 0.00 0 0 0 0 0 0 0 0
561.55/561.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
561.55/561.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
561.55/561.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
561.55/561.76 c implics : 0.00 0 8 0 0 0 0 0 0
561.55/561.76 c probing : 0.00 0 0 0 0 0 0 0 0
561.55/561.76 c knapsack : 0.02 0 0 0 0 0 0 0 0
561.55/561.76 c linear : 0.01 0 0 0 0 0 0 0 0
561.55/561.76 c logicor : 0.00 0 0 0 0 0 0 0 0
561.55/561.76 c root node : - 0 - - 0 - - - -
561.55/561.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
561.55/561.76 c integral : 0 0 0 158382 0 335 1487 0 0 313878
561.55/561.76 c knapsack : 244 5 769891 0 0 109417 2766311 509 0 0
561.55/561.76 c linear : 0+ 5 86556 0 0 0 202 0 0 0
561.55/561.76 c logicor : 313+ 5 508678 1 0 2179 1207248 0 0 0
561.55/561.76 c countsols : 0 0 0 1 0 0 0 0 0 0
561.55/561.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
561.55/561.76 c integral : 36.14 0.00 0.00 36.14 0.00
561.55/561.76 c knapsack : 31.00 0.03 30.97 0.00 0.00
561.55/561.76 c linear : 0.23 0.00 0.23 0.00 0.00
561.55/561.76 c logicor : 13.59 0.00 13.59 0.00 0.00
561.55/561.76 c countsols : 0.00 0.00 0.00 0.00 0.00
561.55/561.76 c Propagators : Time Calls Cutoffs DomReds
561.55/561.76 c vbounds : 0.37 1 0 0
561.55/561.76 c rootredcost : 0.40 0 0 0
561.55/561.76 c pseudoobj : 0.31 0 0 0
561.55/561.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
561.55/561.76 c propagation : 6.54 16950 14733 103526 81.1 199 95.5 -
561.55/561.76 c infeasible LP : 10.95 44520 0 0 0.0 0 0.0 0
561.55/561.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
561.55/561.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
561.55/561.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
561.55/561.76 c applied globally : - - - 14934 17.1 - - -
561.55/561.76 c applied locally : - - - 73 55.2 - - -
561.55/561.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
561.55/561.76 c cut pool : 0.00 4 - - 168 - (maximal pool size: 1878)
561.55/561.76 c redcost : 1.74 157847 0 0 0 0
561.55/561.76 c impliedbounds : 0.00 5 0 0 1048 0
561.55/561.76 c intobj : 0.00 0 0 0 0 0
561.55/561.76 c cgmip : 0.00 0 0 0 0 0
561.55/561.76 c gomory : 0.41 5 0 0 306 0
561.55/561.76 c strongcg : 0.41 5 0 0 1894 0
561.55/561.76 c cmir : 0.00 0 0 0 0 0
561.55/561.76 c flowcover : 0.00 0 0 0 0 0
561.55/561.76 c clique : 0.00 1 0 0 0 0
561.55/561.76 c zerohalf : 0.00 0 0 0 0 0
561.55/561.76 c mcf : 0.01 1 0 0 0 0
561.55/561.76 c rapidlearning : 0.11 1 0 0 0 2
561.55/561.76 c Pricers : Time Calls Vars
561.55/561.76 c problem variables: 0.00 0 0
561.55/561.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
561.55/561.76 c relpscost : 35.85 158381 335 1487 0 0 313878
561.55/561.76 c pscost : 0.00 0 0 0 0 0 0
561.55/561.76 c inference : 0.00 0 0 0 0 0 0
561.55/561.76 c mostinf : 0.00 0 0 0 0 0 0
561.55/561.76 c leastinf : 0.00 0 0 0 0 0 0
561.55/561.76 c fullstrong : 0.00 0 0 0 0 0 0
561.55/561.76 c allfullstrong : 0.00 0 0 0 0 0 0
561.55/561.76 c random : 0.00 0 0 0 0 0 0
561.55/561.76 c Primal Heuristics : Time Calls Found
561.55/561.76 c LP solutions : 0.01 - 1
561.55/561.76 c pseudo solutions : 0.00 - 0
561.55/561.76 c trivial : 0.00 1 0
561.55/561.76 c simplerounding : 0.00 0 0
561.55/561.76 c zirounding : 0.00 0 0
561.55/561.76 c rounding : 0.00 0 0
561.55/561.76 c shifting : 0.00 0 0
561.55/561.76 c intshifting : 0.00 0 0
561.55/561.76 c oneopt : 0.00 0 0
561.55/561.76 c twoopt : 0.00 0 0
561.55/561.76 c fixandinfer : 0.00 0 0
561.55/561.76 c feaspump : 0.00 0 0
561.55/561.76 c coefdiving : 0.00 0 0
561.55/561.76 c pscostdiving : 0.00 0 0
561.55/561.76 c fracdiving : 0.00 0 0
561.55/561.76 c veclendiving : 0.00 0 0
561.55/561.76 c intdiving : 0.00 0 0
561.55/561.76 c actconsdiving : 0.00 0 0
561.55/561.76 c objpscostdiving : 0.00 0 0
561.55/561.76 c rootsoldiving : 0.00 0 0
561.55/561.76 c linesearchdiving : 0.00 0 0
561.55/561.76 c guideddiving : 0.00 0 0
561.55/561.76 c octane : 0.00 0 0
561.55/561.76 c rens : 0.00 0 0
561.55/561.76 c rins : 0.00 0 0
561.55/561.76 c localbranching : 0.00 0 0
561.55/561.76 c mutation : 0.00 0 0
561.55/561.76 c crossover : 0.00 0 0
561.55/561.76 c dins : 0.00 0 0
561.55/561.76 c undercover : 0.00 0 0
561.55/561.76 c nlp : 0.00 0 0
561.55/561.76 c trysol : 0.00 0 0
561.55/561.76 c LP : Time Calls Iterations Iter/call Iter/sec
561.55/561.76 c primal LP : 0.00 0 0 0.00 -
561.55/561.76 c dual LP : 378.36 202539 2638340 13.03 6973.09
561.55/561.76 c lex dual LP : 0.00 0 0 0.00 -
561.55/561.76 c barrier LP : 0.00 0 0 0.00 -
561.55/561.76 c diving/probing LP: 0.00 0 0 0.00 -
561.55/561.76 c strong branching : 31.31 10498 170668 16.26 5450.91
561.55/561.76 c (at root node) : - 10 2630 263.00 -
561.55/561.76 c conflict analysis: 0.00 0 0 0.00 -
561.55/561.76 c B&B Tree :
561.55/561.76 c number of runs : 1
561.55/561.76 c nodes : 312302
561.55/561.76 c nodes (total) : 312302
561.55/561.76 c nodes left : 0
561.55/561.76 c max depth : 53
561.55/561.76 c max depth (total): 53
561.55/561.76 c backtracks : 40081 (12.8%)
561.55/561.76 c delayed cutoffs : 1125
561.55/561.76 c repropagations : 32347 (74680 domain reductions, 1089 cutoffs)
561.55/561.76 c avg switch length: 2.90
561.55/561.76 c switching time : 22.08
561.55/561.76 c Solution :
561.55/561.76 c Solutions found : 1 (1 improvements)
561.55/561.76 c First Solution : +0.00000000000000e+00 (in run 1, after 312302 nodes, 544.22 seconds, depth 26, found by <relaxation>)
561.55/561.76 c Primal Bound : +0.00000000000000e+00 (in run 1, after 312302 nodes, 544.22 seconds, depth 26, found by <relaxation>)
561.55/561.76 c Dual Bound : +0.00000000000000e+00
561.55/561.76 c Gap : 0.00 %
561.55/561.76 c Root Dual Bound : +0.00000000000000e+00
561.55/561.76 c Root Iterations : 1221
561.55/561.77 c Time complete: 561.63.