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-2667186-1276275648.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.01
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 = 1799.99
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.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
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/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-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/rootsoldiving/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.01]
0.00/0.03 c heuristics/rootsoldiving/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/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-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/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-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/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-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/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-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/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/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/veclendiving/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/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-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/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 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.00/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.00/0.04 c 0.0s| 1 | 0 | 124 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 154 | - |1180k| 0 | 54 | 169 | 209 | 169 | 84 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 182 | - |1438k| 0 | 58 | 169 | 209 | 169 | 90 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 192 | - |1497k| 0 | 62 | 169 | 209 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.2s| 1 | 0 | 259 | - |1551k| 0 | 59 | 169 | 209 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 302 | - |1579k| 0 | 61 | 169 | 209 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 309 | - |1502k| 0 | 62 | 169 | 141 | 169 | 104 | 31 | 0 | 11 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 338 | - |1449k| 0 | 59 | 169 | 98 | 169 | 104 | 31 | 0 | 24 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.8s| 1 | 0 | 345 | - |1449k| 0 | 60 | 169 | 98 | 169 | 104 | 31 | 0 | 30 | 0.000000e+00 | -- | Inf
0.99/1.08 c 1.0s| 1 | 0 | 352 | - |1449k| 0 | 60 | 169 | 98 | 169 | 104 | 31 | 0 | 44 | 0.000000e+00 | -- | Inf
1.09/1.16 c 1.1s| 1 | 0 | 359 | - |1449k| 0 | 59 | 169 | 98 | 169 | 104 | 31 | 0 | 49 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 366 | - |1449k| 0 | 60 | 169 | 98 | 169 | 99 | 31 | 0 | 56 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.3s| 1 | 0 | 376 | - |1448k| 0 | 57 | 169 | 97 | 169 | 99 | 31 | 0 | 61 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 376 | - |1448k| 0 | - | 169 | 97 | 169 | 99 | 31 | 0 | 69 | 0.000000e+00 | -- | Inf
1.39/1.45 c (run 1, node 1) restarting after 36 global fixings of integer variables
1.39/1.45 c
1.39/1.45 c (restart) converted 26 cuts from the global cut pool into linear constraints
1.39/1.45 c
1.39/1.45 c presolving:
1.39/1.46 c (round 1) 36 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 79 clqs
1.39/1.46 c (round 2) 36 del vars, 4 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 79 clqs
1.39/1.46 c (round 3) 36 del vars, 4 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 47 upgd conss, 16 impls, 79 clqs
1.39/1.47 c presolving (4 rounds):
1.39/1.47 c 36 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
1.39/1.47 c 16 implications, 79 cliques
1.39/1.47 c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 119 constraints
1.39/1.47 c 12 constraints of type <knapsack>
1.39/1.47 c 81 constraints of type <setppc>
1.39/1.47 c 26 constraints of type <logicor>
1.39/1.47 c transformed objective value is always integral (scale: 1)
1.39/1.47 c Presolving Time: 0.02
1.39/1.47 c
1.39/1.48 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.48 c 1.4s| 1 | 0 | 493 | - | 931k| 0 | 44 | 133 | 119 | 133 | 97 | 0 | 0 | 69 | 0.000000e+00 | -- | Inf
1.49/1.51 c 1.4s| 1 | 0 | 535 | - |1172k| 0 | 52 | 133 | 119 | 133 | 107 | 10 | 0 | 69 | 0.000000e+00 | -- | Inf
1.59/1.68 c 1.6s| 1 | 0 | 538 | - |1172k| 0 | 51 | 133 | 119 | 133 | 107 | 10 | 0 | 88 | 0.000000e+00 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 549 | - |1172k| 0 | 50 | 133 | 119 | 133 | 107 | 10 | 0 | 106 | 0.000000e+00 | -- | Inf
1.99/2.03 c 1.9s| 1 | 0 | 552 | - |1172k| 0 | 51 | 133 | 119 | 133 | 107 | 10 | 0 | 122 | 0.000000e+00 | -- | Inf
2.10/2.11 c 2.0s| 1 | 0 | 559 | - |1172k| 0 | 49 | 133 | 119 | 133 | 107 | 10 | 0 | 129 | 0.000000e+00 | -- | Inf
2.10/2.16 c 2.0s| 1 | 0 | 562 | - |1172k| 0 | 49 | 133 | 119 | 133 | 107 | 10 | 0 | 134 | 0.000000e+00 | -- | Inf
2.10/2.19 c 2.1s| 1 | 0 | 563 | - |1172k| 0 | 49 | 133 | 119 | 133 | 107 | 10 | 0 | 137 | 0.000000e+00 | -- | Inf
2.19/2.21 c 2.1s| 1 | 0 | 568 | - |1172k| 0 | 50 | 133 | 119 | 133 | 107 | 10 | 0 | 138 | 0.000000e+00 | -- | Inf
2.19/2.23 c 2.1s| 1 | 0 | 573 | - |1172k| 0 | 51 | 133 | 119 | 133 | 107 | 10 | 0 | 140 | 0.000000e+00 | -- | Inf
2.19/2.26 c 2.1s| 1 | 0 | 575 | - |1172k| 0 | 50 | 133 | 118 | 133 | 88 | 10 | 0 | 144 | 0.000000e+00 | -- | Inf
2.19/2.28 c 2.2s| 1 | 0 | 578 | - |1171k| 0 | 49 | 133 | 117 | 133 | 88 | 10 | 0 | 146 | 0.000000e+00 | -- | Inf
2.19/2.28 c 2.2s| 1 | 0 | 580 | - |1171k| 0 | 50 | 133 | 117 | 133 | 88 | 10 | 0 | 147 | 0.000000e+00 | -- | Inf
2.19/2.29 c 2.2s| 1 | 0 | 581 | - |1171k| 0 | 49 | 133 | 117 | 133 | 88 | 10 | 0 | 148 | 0.000000e+00 | -- | Inf
2.19/2.29 c 2.2s| 1 | 2 | 581 | - |1172k| 0 | 49 | 133 | 117 | 133 | 88 | 10 | 0 | 148 | 0.000000e+00 | -- | Inf
2.19/2.29 c (run 2, node 1) restarting after 24 global fixings of integer variables
2.19/2.29 c
2.19/2.29 c (restart) converted 6 cuts from the global cut pool into linear constraints
2.19/2.29 c
2.19/2.29 c presolving:
2.29/2.30 c (round 1) 24 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 22 impls, 77 clqs
2.29/2.31 c presolving (2 rounds):
2.29/2.31 c 24 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.29/2.31 c 22 implications, 77 cliques
2.29/2.31 c presolved problem has 109 variables (109 bin, 0 int, 0 impl, 0 cont) and 122 constraints
2.29/2.31 c 16 constraints of type <knapsack>
2.29/2.31 c 82 constraints of type <setppc>
2.29/2.31 c 24 constraints of type <logicor>
2.29/2.31 c transformed objective value is always integral (scale: 1)
2.29/2.31 c Presolving Time: 0.04
2.29/2.31 c
2.29/2.31 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.29/2.31 c 2.2s| 1 | 0 | 652 | - | 931k| 0 | 46 | 109 | 122 | 109 | 102 | 0 | 0 | 148 | 0.000000e+00 | -- | Inf
2.29/2.34 c 2.2s| 1 | 0 | 685 | - |1180k| 0 | 52 | 109 | 122 | 109 | 117 | 15 | 0 | 148 | 0.000000e+00 | -- | Inf
2.49/2.59 c 2.5s| 1 | 0 | 703 | - |1180k| 0 | 51 | 109 | 122 | 109 | 117 | 15 | 0 | 167 | 0.000000e+00 | -- | Inf
2.79/2.89 c 2.8s| 1 | 0 | 712 | - |1180k| 0 | 51 | 109 | 122 | 109 | 117 | 15 | 0 | 184 | 0.000000e+00 | -- | Inf
3.09/3.14 c 3.0s| 1 | 0 | 720 | - |1179k| 0 | 50 | 109 | 122 | 109 | 117 | 15 | 0 | 200 | 0.000000e+00 | -- | Inf
3.19/3.25 c 3.1s| 1 | 0 | 732 | - |1179k| 0 | 51 | 109 | 122 | 109 | 117 | 15 | 0 | 208 | 0.000000e+00 | -- | Inf
3.30/3.34 c 3.2s| 1 | 0 | 744 | - |1179k| 0 | 49 | 109 | 120 | 109 | 117 | 15 | 0 | 214 | 0.000000e+00 | -- | Inf
3.30/3.37 c 3.2s| 1 | 0 | 750 | - |1179k| 0 | 49 | 109 | 120 | 109 | 117 | 15 | 0 | 216 | 0.000000e+00 | -- | Inf
3.39/3.42 c 3.3s| 1 | 0 | 754 | - |1178k| 0 | 50 | 109 | 119 | 109 | 117 | 15 | 0 | 219 | 0.000000e+00 | -- | Inf
3.39/3.48 c 3.3s| 1 | 0 | 756 | - |1178k| 0 | 50 | 109 | 118 | 109 | 117 | 15 | 0 | 223 | 0.000000e+00 | -- | Inf
3.49/3.50 c 3.4s| 1 | 0 | 757 | - |1178k| 0 | 50 | 109 | 118 | 109 | 117 | 15 | 0 | 225 | 0.000000e+00 | -- | Inf
3.49/3.52 c 3.4s| 1 | 2 | 757 | - |1178k| 0 | 50 | 109 | 118 | 109 | 117 | 15 | 0 | 226 | 0.000000e+00 | -- | Inf
3.49/3.52 c (run 3, node 1) restarting after 18 global fixings of integer variables
3.49/3.52 c
3.49/3.52 c (restart) converted 8 cuts from the global cut pool into linear constraints
3.49/3.52 c
3.49/3.52 c presolving:
3.49/3.53 c (round 1) 18 del vars, 11 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 22 impls, 78 clqs
3.49/3.53 c (round 2) 18 del vars, 11 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 8 upgd conss, 22 impls, 78 clqs
3.49/3.53 c presolving (3 rounds):
3.49/3.53 c 18 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
3.49/3.53 c 22 implications, 78 cliques
3.49/3.53 c presolved problem has 91 variables (91 bin, 0 int, 0 impl, 0 cont) and 115 constraints
3.49/3.53 c 22 constraints of type <knapsack>
3.49/3.53 c 80 constraints of type <setppc>
3.49/3.53 c 13 constraints of type <logicor>
3.49/3.53 c transformed objective value is always integral (scale: 1)
3.49/3.53 c Presolving Time: 0.05
3.49/3.53 c
3.49/3.54 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.49/3.54 c 3.4s| 1 | 0 | 836 | - | 949k| 0 | 44 | 91 | 115 | 91 | 106 | 0 | 0 | 226 | 0.000000e+00 | -- | Inf
3.49/3.56 c 3.4s| 1 | 0 | 864 | - |1029k| 0 | 48 | 91 | 115 | 91 | 116 | 10 | 0 | 226 | 0.000000e+00 | -- | Inf
3.79/3.81 c 3.6s| 1 | 0 | 926 | - |1028k| 0 | 46 | 91 | 114 | 91 | 116 | 10 | 0 | 247 | 0.000000e+00 | -- | Inf
3.89/3.95 c 3.8s| 1 | 0 | 947 | - |1028k| 0 | 40 | 91 | 113 | 91 | 116 | 10 | 0 | 263 | 0.000000e+00 | -- | Inf
3.99/4.03 c 3.9s| 1 | 0 | 962 | - |1028k| 0 | 41 | 91 | 112 | 91 | 116 | 10 | 0 | 279 | 0.000000e+00 | -- | Inf
3.99/4.06 c 3.9s| 1 | 0 | 965 | - |1028k| 0 | 40 | 91 | 112 | 91 | 116 | 10 | 0 | 288 | 0.000000e+00 | -- | Inf
3.99/4.06 c 3.9s| 1 | 0 | 968 | - |1027k| 0 | 39 | 91 | 112 | 91 | 116 | 10 | 0 | 289 | 0.000000e+00 | -- | Inf
3.99/4.07 c 3.9s| 1 | 0 | 972 | - |1027k| 0 | 40 | 91 | 112 | 91 | 116 | 10 | 0 | 290 | 0.000000e+00 | -- | Inf
3.99/4.08 c 3.9s| 1 | 0 | 972 | - |1027k| 0 | - | 91 | 112 | 91 | 116 | 10 | 0 | 293 | 0.000000e+00 | -- | Inf
3.99/4.08 c (run 4, node 1) restarting after 20 global fixings of integer variables
3.99/4.08 c
3.99/4.08 c (restart) converted 10 cuts from the global cut pool into linear constraints
3.99/4.08 c
3.99/4.08 c presolving:
3.99/4.09 c (round 1) 20 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 10 upgd conss, 52 impls, 66 clqs
4.09/4.10 c (round 2) 20 del vars, 15 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 10 upgd conss, 52 impls, 66 clqs
4.09/4.10 c presolving (3 rounds):
4.09/4.10 c 20 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
4.09/4.10 c 52 implications, 66 cliques
4.09/4.10 c presolved problem has 71 variables (71 bin, 0 int, 0 impl, 0 cont) and 107 constraints
4.09/4.10 c 28 constraints of type <knapsack>
4.09/4.10 c 72 constraints of type <setppc>
4.09/4.10 c 7 constraints of type <logicor>
4.09/4.10 c transformed objective value is always integral (scale: 1)
4.09/4.10 c Presolving Time: 0.06
4.09/4.10 c
4.09/4.10 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.10 c 3.9s| 1 | 0 | 1034 | - | 952k| 0 | 40 | 71 | 107 | 71 | 104 | 0 | 0 | 293 | 0.000000e+00 | -- | Inf
4.09/4.12 c 4.0s| 1 | 0 | 1056 | - |1245k| 0 | 44 | 71 | 107 | 71 | 114 | 10 | 0 | 293 | 0.000000e+00 | -- | Inf
4.18/4.28 c 4.1s| 1 | 0 | 1099 | - |1244k| 0 | 44 | 71 | 106 | 71 | 114 | 10 | 0 | 308 | 0.000000e+00 | -- | Inf
4.30/4.34 c 4.2s| 1 | 0 | 1118 | - |1243k| 0 | 34 | 71 | 104 | 71 | 114 | 10 | 0 | 319 | 0.000000e+00 | -- | Inf
4.30/4.39 c 4.2s| 1 | 0 | 1118 | - |1243k| 0 | - | 71 | 104 | 71 | 114 | 10 | 0 | 326 | 0.000000e+00 | -- | Inf
4.30/4.39 c (run 5, node 1) restarting after 15 global fixings of integer variables
4.30/4.39 c
4.30/4.39 c (restart) converted 10 cuts from the global cut pool into linear constraints
4.30/4.39 c
4.30/4.39 c presolving:
4.30/4.40 c (round 1) 39 del vars, 20 del conss, 0 chg bounds, 11 chg sides, 26 chg coeffs, 10 upgd conss, 88 impls, 30 clqs
4.30/4.40 c (round 2) 46 del vars, 39 del conss, 0 chg bounds, 73 chg sides, 136 chg coeffs, 10 upgd conss, 122 impls, 27 clqs
4.39/4.41 c (round 3) 47 del vars, 40 del conss, 0 chg bounds, 97 chg sides, 212 chg coeffs, 10 upgd conss, 124 impls, 23 clqs
4.39/4.41 c (round 4) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 251 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.41 c (round 5) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 277 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.41 c (round 6) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 289 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.42 c (round 7) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 294 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.42 c (round 8) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 297 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.42 c (round 9) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 298 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.42 c (round 10) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 300 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.42 c (round 11) 47 del vars, 46 del conss, 0 chg bounds, 97 chg sides, 301 chg coeffs, 10 upgd conss, 126 impls, 23 clqs
4.39/4.42 c presolving (12 rounds):
4.39/4.42 c 47 deleted vars, 46 deleted constraints, 0 tightened bounds, 0 added holes, 97 changed sides, 301 changed coefficients
4.39/4.42 c 126 implications, 23 cliques
4.39/4.42 c presolved problem has 24 variables (24 bin, 0 int, 0 impl, 0 cont) and 68 constraints
4.39/4.42 c 34 constraints of type <knapsack>
4.39/4.42 c 32 constraints of type <setppc>
4.39/4.42 c 2 constraints of type <logicor>
4.39/4.42 c transformed objective value is always integral (scale: 1)
4.39/4.42 c Presolving Time: 0.09
4.39/4.42 c
4.39/4.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.39/4.42 c 4.2s| 1 | 0 | 1141 | - | 849k| 0 | 17 | 24 | 68 | 24 | 67 | 0 | 0 | 326 | 0.000000e+00 | -- | Inf
4.39/4.43 c 4.2s| 1 | 0 | 1142 | - | 911k| 0 | 0 | 24 | 68 | 24 | 70 | 3 | 0 | 326 | 0.000000e+00 | -- | Inf
4.39/4.43 c * 4.2s| 1 | 0 | 1142 | - | 914k| 0 | - | 24 | 68 | 24 | 70 | 3 | 0 | 326 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.39/4.43 c
4.39/4.43 c SCIP Status : problem is solved [optimal solution found]
4.39/4.43 c Solving Time (sec) : 4.23
4.39/4.43 c Solving Nodes : 1 (total of 6 nodes in 6 runs)
4.39/4.43 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.39/4.43 c Dual Bound : +0.00000000000000e+00
4.39/4.43 c Gap : 0.00 %
4.39/4.43 s SATISFIABLE
4.39/4.43 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
4.39/4.43 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127
4.39/4.43 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
4.39/4.43 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.39/4.43 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.39/4.43 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.39/4.43 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.39/4.43 v -x4 -x3 -x2 -x1
4.39/4.43 c SCIP Status : problem is solved [optimal solution found]
4.39/4.43 c Solving Time : 4.23
4.39/4.43 c Original Problem :
4.39/4.43 c Problem name : HOME/instance-2667186-1276275648.opb
4.39/4.43 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.39/4.43 c Constraints : 101 initial, 101 maximal
4.39/4.43 c Presolved Problem :
4.39/4.43 c Problem name : t_HOME/instance-2667186-1276275648.opb
4.39/4.43 c Variables : 24 (24 binary, 0 integer, 0 implicit integer, 0 continuous)
4.39/4.43 c Constraints : 68 initial, 68 maximal
4.39/4.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.39/4.43 c trivial : 0.00 114 0 0 0 0 0 0 0
4.39/4.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.39/4.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.39/4.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.39/4.43 c implics : 0.00 0 0 0 0 0 0 0 0
4.39/4.43 c probing : 0.00 0 0 0 0 0 0 0 0
4.39/4.43 c knapsack : 0.06 0 0 0 0 0 0 97 303
4.39/4.43 c setppc : 0.00 24 6 0 0 0 50 0 0
4.39/4.43 c linear : 0.01 0 0 0 0 0 31 2 0
4.39/4.43 c logicor : 0.00 1 0 0 0 0 24 0 0
4.39/4.43 c root node : - 113 - - 113 - - - -
4.39/4.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.39/4.43 c integral : 0 0 0 42 0 0 113 0 0 4
4.39/4.43 c knapsack : 34 10 42 1 0 0 0 0 0 0
4.39/4.43 c setppc : 32 10 42 1 0 0 0 0 0 0
4.39/4.43 c logicor : 2 10 17 0 0 0 0 0 0 0
4.39/4.43 c countsols : 0 0 0 1 0 0 0 0 0 0
4.39/4.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.39/4.43 c integral : 3.67 0.00 0.00 3.67 0.00
4.39/4.43 c knapsack : 0.02 0.01 0.01 0.00 0.00
4.39/4.43 c setppc : 0.00 0.00 0.00 0.00 0.00
4.39/4.43 c logicor : 0.00 0.00 0.00 0.00 0.00
4.39/4.43 c countsols : 0.00 0.00 0.00 0.00 0.00
4.39/4.43 c Propagators : Time Calls Cutoffs DomReds
4.39/4.43 c vbounds : 0.00 6 0 0
4.39/4.43 c rootredcost : 0.00 0 0 0
4.39/4.43 c pseudoobj : 0.00 0 0 0
4.39/4.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.39/4.43 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.39/4.43 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.39/4.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.39/4.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.39/4.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.39/4.43 c applied globally : - - - 0 0.0 - - -
4.39/4.43 c applied locally : - - - 0 0.0 - - -
4.39/4.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.39/4.43 c cut pool : 0.00 0 - - 0 - (maximal pool size: 67)
4.39/4.43 c redcost : 0.00 10 0 0 0 0
4.39/4.43 c impliedbounds : 0.00 10 0 0 0 0
4.39/4.43 c intobj : 0.00 0 0 0 0 0
4.39/4.43 c cgmip : 0.00 0 0 0 0 0
4.39/4.43 c gomory : 0.04 10 0 0 132 0
4.39/4.43 c strongcg : 0.06 10 0 0 467 0
4.39/4.43 c cmir : 0.00 0 0 0 0 0
4.39/4.43 c flowcover : 0.00 0 0 0 0 0
4.39/4.43 c clique : 0.02 10 0 0 42 0
4.39/4.43 c zerohalf : 0.00 0 0 0 0 0
4.39/4.43 c mcf : 0.00 6 0 0 0 0
4.39/4.43 c rapidlearning : 0.15 1 0 0 0 136
4.39/4.43 c Pricers : Time Calls Vars
4.39/4.43 c problem variables: 0.00 0 0
4.39/4.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.39/4.43 c relpscost : 3.67 41 0 113 0 0 4
4.39/4.43 c pscost : 0.00 0 0 0 0 0 0
4.39/4.43 c inference : 0.00 0 0 0 0 0 0
4.39/4.43 c mostinf : 0.00 0 0 0 0 0 0
4.39/4.43 c leastinf : 0.00 0 0 0 0 0 0
4.39/4.43 c fullstrong : 0.00 0 0 0 0 0 0
4.39/4.43 c allfullstrong : 0.00 0 0 0 0 0 0
4.39/4.43 c random : 0.00 0 0 0 0 0 0
4.39/4.43 c Primal Heuristics : Time Calls Found
4.39/4.43 c LP solutions : 0.00 - 1
4.39/4.43 c pseudo solutions : 0.00 - 0
4.39/4.43 c trivial : 0.00 1 0
4.39/4.43 c simplerounding : 0.00 0 0
4.39/4.43 c zirounding : 0.00 0 0
4.39/4.43 c rounding : 0.00 0 0
4.39/4.43 c shifting : 0.00 0 0
4.39/4.43 c intshifting : 0.00 0 0
4.39/4.43 c oneopt : 0.00 0 0
4.39/4.43 c twoopt : 0.00 0 0
4.39/4.43 c fixandinfer : 0.00 0 0
4.39/4.43 c feaspump : 0.00 0 0
4.39/4.43 c coefdiving : 0.00 0 0
4.39/4.43 c pscostdiving : 0.00 0 0
4.39/4.43 c fracdiving : 0.00 0 0
4.39/4.43 c veclendiving : 0.00 0 0
4.39/4.43 c intdiving : 0.00 0 0
4.39/4.43 c actconsdiving : 0.00 0 0
4.39/4.43 c objpscostdiving : 0.00 0 0
4.39/4.43 c rootsoldiving : 0.00 0 0
4.39/4.43 c linesearchdiving : 0.00 0 0
4.39/4.43 c guideddiving : 0.00 0 0
4.39/4.43 c octane : 0.00 0 0
4.39/4.43 c rens : 0.00 0 0
4.39/4.43 c rins : 0.00 0 0
4.39/4.43 c localbranching : 0.00 0 0
4.39/4.43 c mutation : 0.00 0 0
4.39/4.43 c crossover : 0.00 0 0
4.39/4.43 c dins : 0.00 0 0
4.39/4.43 c undercover : 0.00 0 0
4.39/4.43 c nlp : 0.00 0 0
4.39/4.43 c trysol : 0.00 0 0
4.39/4.43 c LP : Time Calls Iterations Iter/call Iter/sec
4.39/4.43 c primal LP : 0.00 0 0 0.00 -
4.39/4.43 c dual LP : 0.13 52 1142 21.96 8784.62
4.39/4.43 c lex dual LP : 0.00 0 0 0.00 -
4.39/4.43 c barrier LP : 0.00 0 0 0.00 -
4.39/4.43 c diving/probing LP: 0.00 0 0 0.00 -
4.39/4.43 c strong branching : 3.67 326 38683 118.66 10540.33
4.39/4.43 c (at root node) : - 326 38683 118.66 -
4.39/4.43 c conflict analysis: 0.00 0 0 0.00 -
4.39/4.43 c B&B Tree :
4.39/4.43 c number of runs : 6
4.39/4.43 c nodes : 1
4.39/4.43 c nodes (total) : 6
4.39/4.43 c nodes left : 0
4.39/4.43 c max depth : 0
4.39/4.43 c max depth (total): 0
4.39/4.43 c backtracks : 0 (0.0%)
4.39/4.43 c delayed cutoffs : 0
4.39/4.43 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.39/4.43 c avg switch length: 2.00
4.39/4.43 c switching time : 0.00
4.39/4.43 c Solution :
4.39/4.43 c Solutions found : 1 (1 improvements)
4.39/4.43 c First Solution : +0.00000000000000e+00 (in run 6, after 1 nodes, 4.23 seconds, depth 0, found by <relaxation>)
4.39/4.43 c Primal Bound : +0.00000000000000e+00 (in run 6, after 1 nodes, 4.23 seconds, depth 0, found by <relaxation>)
4.39/4.43 c Dual Bound : +0.00000000000000e+00
4.39/4.43 c Gap : 0.00 %
4.39/4.43 c Root Dual Bound : +0.00000000000000e+00
4.39/4.43 c Root Iterations : 1142
4.39/4.43 c Time complete: 4.43.