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-2704236-1278550147.opb>
0.00/0.02 c original problem has 540 variables (540 bin, 0 int, 0 impl, 0 cont) and 416 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.00/0.05 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 416 upgd conss, 0 impls, 38 clqs
0.00/0.05 c presolving (2 rounds):
0.00/0.05 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 0 implications, 38 cliques
0.00/0.05 c presolved problem has 540 variables (540 bin, 0 int, 0 impl, 0 cont) and 416 constraints
0.00/0.05 c 38 constraints of type <setppc>
0.00/0.05 c 378 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.3
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1789.99
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = 5
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = FALSE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = -1
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = 750
0.00/0.05 c
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = 100
0.00/0.05 c
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = 0.15
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = 0.5
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = -1
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/nlp/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = -1
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = 0.3
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/trivial/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/trysol/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/zirounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.07 c 0.0s| 1 | 0 | 139 | - |2137k| 0 | 91 | 540 | 416 | 540 | 416 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 316 | - |2551k| 0 | 91 | 540 | 416 | 540 | 426 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.3s| 1 | 0 | 469 | - |3200k| 0 | 106 | 540 | 416 | 540 | 436 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 544 | - |3849k| 0 | 130 | 540 | 416 | 540 | 442 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.72 c 0.7s| 1 | 0 | 666 | - |4452k| 0 | 112 | 540 | 416 | 540 | 449 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.90 c 0.9s| 1 | 0 | 792 | - |5085k| 0 | 101 | 540 | 416 | 540 | 458 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.23 c 1.2s| 1 | 2 | 792 | - |5086k| 0 | 101 | 540 | 416 | 540 | 458 | 42 | 0 | 33 | 0.000000e+00 | -- | Inf
19.29/19.33 c 19.3s| 10000 | 47 | 46109 | 4.5 |7123k| 47 | - | 540 |4030 | 540 | 436 | 42 |8329 |1769 | 0.000000e+00 | -- | Inf
34.38/34.45 c 34.4s| 20000 | 62 | 79802 | 4.0 |8462k| 47 | 15 | 540 |6477 | 540 | 436 | 42 | 18k|1795 | 0.000000e+00 | -- | Inf
51.37/51.46 c 51.4s| 30000 | 55 |112599 | 3.7 |9174k| 51 | 20 | 540 |7841 | 540 | 436 | 42 | 29k|1795 | 0.000000e+00 | -- | Inf
70.16/70.30 c 70.3s| 40000 | 71 |146155 | 3.6 |9977k| 51 | 16 | 540 |9210 | 540 | 436 | 42 | 39k|1844 | 0.000000e+00 | -- | Inf
89.46/89.51 c 89.5s| 50000 | 76 |182843 | 3.6 |8965k| 55 | - | 540 |6302 | 540 | 436 | 42 | 49k|1956 | 0.000000e+00 | -- | Inf
107.26/107.39 c 107s| 60000 | 63 |229337 | 3.8 |9532k| 55 | - | 540 |7545 | 540 | 436 | 42 | 58k|2074 | 0.000000e+00 | -- | Inf
125.45/125.57 c 126s| 70000 | 76 |260023 | 3.7 | 10M| 55 | 21 | 540 | 10k| 540 | 436 | 42 | 69k|2362 | 0.000000e+00 | -- | Inf
145.15/145.24 c 145s| 80000 | 71 |289104 | 3.6 | 11M| 55 | 23 | 540 | 12k| 540 | 436 | 42 | 81k|2417 | 0.000000e+00 | -- | Inf
166.84/166.96 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
166.84/166.96 c 167s| 90000 | 71 |318234 | 3.5 | 11M| 55 | 22 | 540 | 11k| 540 | 436 | 42 | 93k|2476 | 0.000000e+00 | -- | Inf
187.04/187.15 c 187s|100000 | 93 |350672 | 3.5 | 11M| 55 | - | 540 | 10k| 0 | 0 | 42 | 103k|2575 | 0.000000e+00 | -- | Inf
207.93/208.04 c 208s|110000 | 121 |391124 | 3.5 | 12M| 55 | - | 540 | 12k| 0 | 0 | 42 | 112k|2637 | 0.000000e+00 | -- | Inf
229.83/229.98 c 230s|120000 | 138 |420453 | 3.5 | 13M| 55 | 16 | 540 | 14k| 540 | 436 | 42 | 123k|2691 | 0.000000e+00 | -- | Inf
252.83/252.91 c 253s|130000 | 147 |450169 | 3.5 | 13M| 55 | - | 540 | 15k| 0 | 0 | 42 | 134k|2751 | 0.000000e+00 | -- | Inf
276.02/276.20 c 276s|140000 | 152 |480537 | 3.4 | 14M| 61 | - | 540 | 16k| 0 | 0 | 42 | 145k|2805 | 0.000000e+00 | -- | Inf
299.21/299.31 c 299s|150000 | 116 |510608 | 3.4 | 12M| 62 | 16 | 540 | 12k| 540 | 436 | 42 | 156k|2970 | 0.000000e+00 | -- | Inf
319.80/319.94 c 320s|160000 | 122 |538269 | 3.4 | 12M| 62 | 21 | 540 | 11k| 540 | 436 | 42 | 167k|2993 | 0.000000e+00 | -- | Inf
341.09/341.27 c 341s|170000 | 134 |579028 | 3.4 | 13M| 62 | - | 540 | 13k| 0 | 0 | 42 | 177k|3064 | 0.000000e+00 | -- | Inf
364.99/365.15 c 365s|180000 | 159 |609992 | 3.4 | 14M| 62 | - | 540 | 15k| 0 | 0 | 42 | 188k|3133 | 0.000000e+00 | -- | Inf
389.78/389.97 c 390s|190000 | 177 |644687 | 3.4 | 14M| 62 | 17 | 540 | 15k| 540 | 436 | 42 | 199k|3182 | 0.000000e+00 | -- | Inf
413.28/413.47 c 413s|200000 | 151 |678728 | 3.4 | 14M| 62 | - | 540 | 15k| 0 | 0 | 42 | 211k|3249 | 0.000000e+00 | -- | Inf
438.88/439.01 c 439s|210000 | 190 |720398 | 3.4 | 16M| 64 | 20 | 540 | 18k| 540 | 436 | 42 | 221k|3311 | 0.000000e+00 | -- | Inf
463.47/463.64 c 464s|220000 | 179 |761177 | 3.5 | 14M| 67 | - | 540 | 15k| 0 | 0 | 42 | 230k|3377 | 0.000000e+00 | -- | Inf
489.27/489.41 c 489s|230000 | 188 |788802 | 3.4 | 15M| 67 | - | 540 | 15k| 0 | 0 | 42 | 241k|3523 | 0.000000e+00 | -- | Inf
511.85/512.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
511.85/512.05 c 512s|240000 | 155 |822625 | 3.4 | 13M| 67 | 22 | 540 | 12k| 540 | 436 | 42 | 252k|3581 | 0.000000e+00 | -- | Inf
533.05/533.23 c 533s|250000 | 137 |854767 | 3.4 | 13M| 69 | - | 540 | 12k| 540 | 436 | 42 | 263k|3634 | 0.000000e+00 | -- | Inf
556.25/556.40 c 556s|260000 | 132 |885513 | 3.4 | 14M| 69 | 24 | 540 | 14k| 540 | 436 | 42 | 274k|3903 | 0.000000e+00 | -- | Inf
578.04/578.29 c 578s|270000 | 132 |917290 | 3.4 | 13M| 69 | 17 | 540 | 12k| 540 | 436 | 42 | 284k|3910 | 0.000000e+00 | -- | Inf
601.13/601.32 c 601s|280000 | 126 |957856 | 3.4 | 13M| 69 | - | 540 | 13k| 540 | 436 | 42 | 294k|3960 | 0.000000e+00 | -- | Inf
622.34/622.59 c 623s|290000 | 77 |992540 | 3.4 | 13M| 69 | - | 540 | 11k| 540 | 436 | 42 | 304k|4009 | 0.000000e+00 | -- | Inf
643.62/643.83 c 644s|300000 | 72 | 1024k| 3.4 | 12M| 69 | - | 540 | 11k| 0 | 0 | 42 | 315k|4074 | 0.000000e+00 | -- | Inf
666.32/666.59 c 667s|310000 | 82 | 1053k| 3.4 | 12M| 69 | - | 540 | 11k| 0 | 0 | 42 | 326k|4099 | 0.000000e+00 | -- | Inf
690.52/690.72 c 691s|320000 | 107 | 1083k| 3.4 | 13M| 69 | 12 | 540 | 13k| 540 | 436 | 42 | 337k|4144 | 0.000000e+00 | -- | Inf
714.50/714.72 c 715s|330000 | 70 | 1111k| 3.4 | 13M| 69 | - | 540 | 13k| 0 | 0 | 42 | 348k|4176 | 0.000000e+00 | -- | Inf
738.48/738.72 c 739s|340000 | 72 | 1142k| 3.4 | 12M| 69 | - | 540 | 10k| 540 | 436 | 42 | 359k|4221 | 0.000000e+00 | -- | Inf
758.09/758.35 c 758s|350000 | 50 | 1187k| 3.4 | 11M| 69 | - | 540 |8274 | 540 | 436 | 42 | 368k|4284 | 0.000000e+00 | -- | Inf
769.09/769.32 c * 769s|355573 | 0 | 1208k| 3.4 | 12M| 69 | - | 540 |9070 | 540 | 436 | 42 | 374k|4454 | 0.000000e+00 | 0.000000e+00 | 0.00%
769.09/769.32 c
769.09/769.32 c SCIP Status : problem is solved [optimal solution found]
769.09/769.32 c Solving Time (sec) : 769.30
769.09/769.32 c Solving Nodes : 355573
769.09/769.32 c Primal Bound : +0.00000000000000e+00 (1 solutions)
769.09/769.32 c Dual Bound : +0.00000000000000e+00
769.09/769.32 c Gap : 0.00 %
769.09/769.33 s SATISFIABLE
769.09/769.33 v -x205 -x202 -x210 -x219 -x20 -x13 -x11 -x9 -x19 -x201 -x10 -x8 -x217 x7 -x220 -x14 -x12 -x209 -x5 -x111 -x109 -x107 -x104 -x103
769.09/769.33 v -x93 -x91 -x87 -x83 -x82 -x216 -x3 -x84 -x117 -x100 -x218 -x18 -x40 -x35 -x34 -x33 -x30 -x29 -x28 -x26 -x25 -x22 -x173 -x172
769.09/769.33 v -x171 -x167 -x165 -x163 -x161 -x211 -x38 -x60 -x53 -x51 -x47 -x43 -x95 -x179 -x106 -x97 -x98 -x58 -x164 -x115 -x300 -x296 -x293
769.09/769.33 v -x291 -x284 -x283 -x282 -x299 -x294 -x260 -x259 -x258 -x255 -x253 -x250 -x247 -x245 -x238 -x234 -x233 -x232 -x228 -x227 -x225
769.09/769.33 v -x224 -x221 -x290 -x86 -x292 -x288 -x287 -x207 -x46 -x162 -x45 -x116 -x32 -x55 -x235 -x285 -x237 -x57 -x212 -x44 -x1 x286
769.09/769.33 v -x177 -x180 -x4 -x59 -x27 -x81 -x113 x256 -x96 -x54 x178 -x236 x102 -x37 -x80 -x79 -x78 -x76 -x74 -x72 -x69 -x66 -x65 -x64
769.09/769.33 v -x62 -x248 -x67 -x16 -x289 -x42 -x88 -x49 -x249 -x120 -x213 -x108 -x77 -x114 -x140 -x139 x137 -x135 -x131 -x129 -x128 -x127 -x121
769.09/769.33 v -x101 -x222 -x170 -x257 -x71 -x203 -x6 -x175 x229 -x52 -x125 -x423 -x422 -x421 -x420 -x419 x418 -x417 -x416 -x415 -x85 -x124
769.09/769.33 v -x90 -x70 -x112 -x204 -x119 -x75 -x15 -x31 -x166 -x254 -x105 -x241 -x223 -x208 -x110 -x138 -x63 -x48 -x231 -x226 -x540 -x539
769.09/769.33 v -x538 -x537 -x536 -x535 -x534 -x533 -x532 -x240 -x297 -x92 -x136 -x168 -x39 -x459 -x458 -x457 -x456 -x455 -x454 -x453 -x452
769.09/769.33 v x451 -x251 -x2 -x50 x23 -x242 x73 -x206 -x200 -x199 -x198 -x197 -x196 x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187
769.09/769.33 v -x186 -x182 -x181 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 x271 -x270 -x269 -x267 -x265 -x264 -x263 -x262 -x261
769.09/769.33 v -x56 -x169 x99 x214 -x252 -x468 -x467 -x466 x465 -x464 -x463 -x462 -x461 -x460 -x132 -x183 -x184 -x230 -x295 -x24 -x281 -x340
769.09/769.33 v -x339 -x338 -x336 -x335 -x334 -x333 x332 -x331 -x329 -x328 -x327 -x326 -x324 -x323 -x322 -x321 -x21 -x36 -x325 -x266 -x174
769.09/769.33 v -x441 -x440 -x439 -x438 -x437 -x436 -x435 x434 -x433 -x89 -x531 -x530 -x529 -x528 -x527 -x526 -x525 x524 -x523 -x239 -x360 -x359
769.09/769.33 v -x358 -x357 -x355 -x354 -x353 -x352 -x351 x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x378 -x377 -x376 -x375
769.09/769.33 v -x374 -x373 -x372 -x371 x370 -x122 -x246 -x477 -x476 -x475 -x474 -x473 x472 -x471 -x470 -x469 -x133 -x405 -x404 -x403 -x402
769.09/769.33 v -x401 -x400 -x399 -x398 -x397 -x185 -x123 -x337 -x126 -x176 -x268 -x513 -x512 -x511 -x510 x509 -x508 -x507 -x506 -x505 -x17
769.09/769.33 v -x130 -x504 -x503 x502 -x501 -x500 -x499 -x498 -x497 -x496 -x356 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311
769.09/769.33 v -x310 -x309 x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x118 -x396 -x395 x394 -x393 -x392 -x391 -x390 -x389 -x388 -x244
769.09/769.33 v -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x147 -x145 x144 -x143 -x142 -x141 -x61 -x68 -x522
769.09/769.33 v x521 -x520 -x519 -x518 -x517 -x516 -x515 -x514 -x298 -x495 -x494 -x493 -x492 -x491 -x490 x489 -x488 -x487 -x215 -x94 -x432 -x431
769.09/769.33 v -x430 -x429 -x428 -x427 x426 -x425 -x424 -x148 -x387 x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x243 -x369 -x368 -x367
769.09/769.33 v x366 -x365 -x364 -x363 -x362 -x361 x41 x450 -x449 -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x330 x486 -x485 -x484 -x483 -x482
769.09/769.33 v -x481 -x480 -x479 -x478 -x134 -x414 -x413 -x412 -x411 x410 -x409 -x408 -x407 -x406 -x146
769.09/769.33 c SCIP Status : problem is solved [optimal solution found]
769.09/769.33 c Solving Time : 769.30
769.09/769.33 c Original Problem :
769.09/769.33 c Problem name : HOME/instance-2704236-1278550147.opb
769.09/769.33 c Variables : 540 (540 binary, 0 integer, 0 implicit integer, 0 continuous)
769.09/769.33 c Constraints : 416 initial, 416 maximal
769.09/769.33 c Presolved Problem :
769.09/769.33 c Problem name : t_HOME/instance-2704236-1278550147.opb
769.09/769.33 c Variables : 540 (540 binary, 0 integer, 0 implicit integer, 0 continuous)
769.09/769.33 c Constraints : 416 initial, 18814 maximal
769.09/769.33 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
769.09/769.33 c trivial : 0.00 0 0 0 0 0 0 0 0
769.09/769.33 c dualfix : 0.00 0 0 0 0 0 0 0 0
769.09/769.33 c boundshift : 0.00 0 0 0 0 0 0 0 0
769.09/769.33 c inttobinary : 0.00 0 0 0 0 0 0 0 0
769.09/769.33 c implics : 0.00 0 0 0 0 0 0 0 0
769.09/769.33 c probing : 0.00 0 0 0 0 0 0 0 0
769.09/769.33 c setppc : 0.00 0 0 0 0 0 0 0 0
769.09/769.33 c logicor : 0.01 0 0 0 0 0 0 0 0
769.09/769.33 c root node : - 0 - - 0 - - - -
769.09/769.33 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
769.09/769.33 c integral : 0 0 0 206133 0 56 463 0 0 411598
769.09/769.33 c setppc : 38 5 1481424 1 0 90806 3193389 0 0 0
769.09/769.33 c logicor : 378+ 5 759213 1 0 46107 1097563 0 0 0
769.09/769.33 c countsols : 0 0 0 1 0 0 0 0 0 0
769.09/769.33 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
769.09/769.33 c integral : 15.55 0.00 0.00 15.55 0.00
769.09/769.33 c setppc : 35.37 0.00 35.37 0.00 0.00
769.09/769.33 c logicor : 212.84 0.00 212.84 0.00 0.00
769.09/769.33 c countsols : 0.00 0.00 0.00 0.00 0.00
769.09/769.33 c Propagators : Time Calls Cutoffs DomReds
769.09/769.33 c vbounds : 0.55 1 0 0
769.09/769.33 c rootredcost : 0.60 0 0 0
769.09/769.33 c pseudoobj : 0.47 0 0 0
769.09/769.33 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
769.09/769.33 c propagation : 16.73 136913 136912 941242 41.2 1985 36.9 -
769.09/769.33 c infeasible LP : 35.88 67580 67239 1169519 68.3 1551 35.2 0
769.09/769.33 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
769.09/769.33 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
769.09/769.33 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
769.09/769.33 c applied globally : - - - 374095 34.0 - - -
769.09/769.33 c applied locally : - - - 2 71.0 - - -
769.09/769.33 c Separators : Time Calls Cutoffs DomReds Cuts Conss
769.09/769.33 c cut pool : 0.00 4 - - 3 - (maximal pool size: 485)
769.09/769.33 c redcost : 3.01 205929 0 0 0 0
769.09/769.33 c impliedbounds : 0.00 5 0 0 0 0
769.09/769.33 c intobj : 0.00 0 0 0 0 0
769.09/769.33 c cgmip : 0.00 0 0 0 0 0
769.09/769.33 c gomory : 0.31 5 0 0 1279 0
769.09/769.33 c strongcg : 0.33 5 0 0 1853 0
769.09/769.33 c cmir : 0.00 0 0 0 0 0
769.09/769.33 c flowcover : 0.00 0 0 0 0 0
769.09/769.33 c clique : 0.00 5 0 0 0 0
769.09/769.33 c zerohalf : 0.00 0 0 0 0 0
769.09/769.33 c mcf : 0.00 1 0 0 0 0
769.09/769.33 c rapidlearning : 0.05 1 0 0 0 0
769.09/769.33 c Pricers : Time Calls Vars
769.09/769.33 c problem variables: 0.00 0 0
769.09/769.33 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
769.09/769.33 c relpscost : 15.20 206132 56 463 0 0 411598
769.09/769.33 c pscost : 0.00 0 0 0 0 0 0
769.09/769.33 c inference : 0.00 0 0 0 0 0 0
769.09/769.33 c mostinf : 0.00 0 0 0 0 0 0
769.09/769.33 c leastinf : 0.00 0 0 0 0 0 0
769.09/769.33 c fullstrong : 0.00 0 0 0 0 0 0
769.09/769.33 c allfullstrong : 0.00 0 0 0 0 0 0
769.09/769.33 c random : 0.00 0 0 0 0 0 0
769.09/769.33 c Primal Heuristics : Time Calls Found
769.09/769.33 c LP solutions : 0.00 - 1
769.09/769.33 c pseudo solutions : 0.00 - 0
769.09/769.33 c trivial : 0.00 1 0
769.09/769.33 c simplerounding : 0.00 0 0
769.09/769.33 c zirounding : 0.00 0 0
769.09/769.33 c rounding : 0.00 0 0
769.09/769.33 c shifting : 0.00 0 0
769.09/769.33 c intshifting : 0.00 0 0
769.09/769.33 c oneopt : 0.00 0 0
769.09/769.33 c twoopt : 0.00 0 0
769.09/769.33 c fixandinfer : 0.00 0 0
769.09/769.33 c feaspump : 0.00 0 0
769.09/769.33 c coefdiving : 0.00 0 0
769.09/769.33 c pscostdiving : 0.00 0 0
769.09/769.33 c fracdiving : 0.00 0 0
769.09/769.33 c veclendiving : 0.00 0 0
769.09/769.33 c intdiving : 0.00 0 0
769.09/769.33 c actconsdiving : 0.00 0 0
769.09/769.33 c objpscostdiving : 0.00 0 0
769.09/769.33 c rootsoldiving : 0.00 0 0
769.09/769.33 c linesearchdiving : 0.00 0 0
769.09/769.33 c guideddiving : 0.00 0 0
769.09/769.33 c octane : 0.00 0 0
769.09/769.33 c rens : 0.00 0 0
769.09/769.33 c rins : 0.00 0 0
769.09/769.33 c localbranching : 0.00 0 0
769.09/769.33 c mutation : 0.00 0 0
769.09/769.33 c crossover : 0.00 0 0
769.09/769.33 c dins : 0.00 0 0
769.09/769.33 c undercover : 0.00 0 0
769.09/769.33 c nlp : 0.00 0 0
769.09/769.33 c trysol : 0.00 0 0
769.09/769.33 c LP : Time Calls Iterations Iter/call Iter/sec
769.09/769.33 c primal LP : 0.00 0 0 0.00 -
769.09/769.33 c dual LP : 207.55 273518 1208132 4.42 5820.81
769.09/769.33 c lex dual LP : 0.00 0 0 0.00 -
769.09/769.33 c barrier LP : 0.00 0 0 0.00 -
769.09/769.33 c diving/probing LP: 0.00 0 0 0.00 -
769.09/769.33 c strong branching : 9.67 4454 59472 13.35 6151.61
769.09/769.33 c (at root node) : - 33 2026 61.39 -
769.09/769.33 c conflict analysis: 0.00 0 0 0.00 -
769.09/769.33 c B&B Tree :
769.09/769.33 c number of runs : 1
769.09/769.33 c nodes : 355573
769.09/769.33 c nodes (total) : 355573
769.09/769.33 c nodes left : 0
769.09/769.33 c max depth : 69
769.09/769.33 c max depth (total): 69
769.09/769.33 c backtracks : 78899 (22.2%)
769.09/769.33 c delayed cutoffs : 55973
769.09/769.33 c repropagations : 475493 (1677035 domain reductions, 54776 cutoffs)
769.09/769.33 c avg switch length: 4.16
769.09/769.33 c switching time : 135.83
769.09/769.33 c Solution :
769.09/769.33 c Solutions found : 1 (1 improvements)
769.09/769.33 c First Solution : +0.00000000000000e+00 (in run 1, after 355573 nodes, 769.30 seconds, depth 26, found by <relaxation>)
769.09/769.33 c Primal Bound : +0.00000000000000e+00 (in run 1, after 355573 nodes, 769.30 seconds, depth 26, found by <relaxation>)
769.09/769.33 c Dual Bound : +0.00000000000000e+00
769.09/769.33 c Gap : 0.00 %
769.09/769.33 c Root Dual Bound : +0.00000000000000e+00
769.09/769.33 c Root Iterations : 792
769.09/769.36 c Time complete: 769.14.