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-2703982-1278548299.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.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 72 constraints of type <setppc>
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.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = 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.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 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 | 103 | - | 743k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 146 | - |1198k| 0 | 50 | 169 | 219 | 169 | 83 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 186 | - |1441k| 0 | 59 | 169 | 219 | 169 | 90 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 199 | - |1628k| 0 | 59 | 169 | 219 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 243 | - |1795k| 0 | 57 | 169 | 219 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 261 | - |1841k| 0 | 57 | 169 | 219 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 276 | - |1786k| 0 | 60 | 169 | 171 | 169 | 103 | 30 | 0 | 13 | 0.000000e+00 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 312 | - |1781k| 0 | 60 | 169 | 166 | 169 | 103 | 30 | 0 | 25 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 0 | 322 | - |1775k| 0 | 63 | 169 | 160 | 169 | 103 | 30 | 0 | 38 | 0.000000e+00 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 337 | - |1763k| 0 | 61 | 169 | 148 | 169 | 103 | 30 | 0 | 44 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.3s| 1 | 0 | 351 | - |1761k| 0 | 63 | 169 | 146 | 169 | 103 | 30 | 0 | 57 | 0.000000e+00 | -- | Inf
1.29/1.36 c 1.4s| 1 | 0 | 370 | - |1752k| 0 | 57 | 169 | 138 | 169 | 99 | 30 | 0 | 62 | 0.000000e+00 | -- | Inf
1.39/1.45 c 1.4s| 1 | 0 | 387 | - |1752k| 0 | 58 | 169 | 138 | 169 | 99 | 30 | 0 | 68 | 0.000000e+00 | -- | Inf
1.49/1.59 c 1.6s| 1 | 0 | 387 | - |1752k| 0 | - | 169 | 138 | 169 | 99 | 30 | 0 | 77 | 0.000000e+00 | -- | Inf
1.49/1.59 c (run 1, node 1) restarting after 36 global fixings of integer variables
1.49/1.59 c
1.49/1.59 c (restart) converted 26 cuts from the global cut pool into linear constraints
1.49/1.59 c
1.49/1.59 c presolving:
1.49/1.59 c (round 1) 36 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 83 clqs
1.49/1.60 c (round 2) 36 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 83 clqs
1.59/1.60 c (round 3) 36 del vars, 5 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 87 upgd conss, 10 impls, 83 clqs
1.59/1.61 c (round 4) 36 del vars, 6 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 87 upgd conss, 10 impls, 83 clqs
1.59/1.61 c presolving (5 rounds):
1.59/1.61 c 36 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.59/1.61 c 10 implications, 83 cliques
1.59/1.61 c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 158 constraints
1.59/1.61 c 11 constraints of type <knapsack>
1.59/1.61 c 85 constraints of type <setppc>
1.59/1.61 c 62 constraints of type <logicor>
1.59/1.61 c transformed objective value is always integral (scale: 1)
1.59/1.61 c Presolving Time: 0.04
1.59/1.61 c
1.59/1.62 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.62 c 1.6s| 1 | 0 | 545 | - | 925k| 0 | 46 | 133 | 158 | 133 | 96 | 0 | 0 | 77 | 0.000000e+00 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 570 | - |1256k| 0 | 52 | 133 | 158 | 133 | 105 | 9 | 0 | 77 | 0.000000e+00 | -- | Inf
1.79/1.87 c 1.9s| 1 | 0 | 574 | - |1256k| 0 | 51 | 133 | 158 | 133 | 105 | 9 | 0 | 97 | 0.000000e+00 | -- | Inf
1.99/2.04 c 2.0s| 1 | 0 | 587 | - |1256k| 0 | 49 | 133 | 158 | 133 | 105 | 9 | 0 | 113 | 0.000000e+00 | -- | Inf
2.09/2.16 c 2.1s| 1 | 0 | 598 | - |1256k| 0 | 48 | 133 | 158 | 133 | 105 | 9 | 0 | 123 | 0.000000e+00 | -- | Inf
2.20/2.23 c 2.2s| 1 | 0 | 613 | - |1254k| 0 | 48 | 133 | 152 | 133 | 105 | 9 | 0 | 130 | 0.000000e+00 | -- | Inf
2.29/2.36 c 2.3s| 1 | 0 | 635 | - |1254k| 0 | 48 | 133 | 150 | 133 | 105 | 9 | 0 | 141 | 0.000000e+00 | -- | Inf
2.39/2.45 c 2.4s| 1 | 0 | 635 | - |1253k| 0 | - | 133 | 150 | 133 | 105 | 9 | 0 | 150 | 0.000000e+00 | -- | Inf
2.39/2.45 c (run 2, node 1) restarting after 27 global fixings of integer variables
2.39/2.45 c
2.39/2.45 c (restart) converted 9 cuts from the global cut pool into linear constraints
2.39/2.45 c
2.39/2.45 c presolving:
2.39/2.46 c (round 1) 27 del vars, 38 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 22 impls, 79 clqs
2.39/2.46 c (round 2) 27 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 22 impls, 79 clqs
2.39/2.47 c presolving (3 rounds):
2.39/2.47 c 27 deleted vars, 41 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.39/2.47 c 22 implications, 79 cliques
2.39/2.47 c presolved problem has 106 variables (106 bin, 0 int, 0 impl, 0 cont) and 118 constraints
2.39/2.47 c 17 constraints of type <knapsack>
2.39/2.47 c 83 constraints of type <setppc>
2.39/2.47 c 18 constraints of type <logicor>
2.39/2.47 c transformed objective value is always integral (scale: 1)
2.39/2.47 c Presolving Time: 0.05
2.39/2.47 c
2.39/2.47 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.39/2.47 c 2.5s| 1 | 0 | 716 | - | 935k| 0 | 40 | 106 | 118 | 106 | 100 | 0 | 0 | 150 | 0.000000e+00 | -- | Inf
2.39/2.50 c 2.5s| 1 | 0 | 755 | - |1269k| 0 | 51 | 106 | 118 | 106 | 114 | 14 | 0 | 150 | 0.000000e+00 | -- | Inf
2.59/2.68 c 2.7s| 1 | 0 | 777 | - |1269k| 0 | 51 | 106 | 118 | 106 | 114 | 14 | 0 | 159 | 0.000000e+00 | -- | Inf
2.79/2.84 c 2.8s| 1 | 0 | 855 | - |1268k| 0 | 43 | 106 | 116 | 106 | 114 | 14 | 0 | 168 | 0.000000e+00 | -- | Inf
2.99/3.04 c 3.0s| 1 | 0 | 903 | - |1268k| 0 | 45 | 106 | 116 | 106 | 114 | 14 | 0 | 184 | 0.000000e+00 | -- | Inf
3.09/3.10 c 3.1s| 1 | 0 | 918 | - |1268k| 0 | 46 | 106 | 116 | 106 | 114 | 14 | 0 | 189 | 0.000000e+00 | -- | Inf
3.20/3.23 c 3.2s| 1 | 0 | 918 | - |1268k| 0 | - | 106 | 116 | 106 | 114 | 14 | 0 | 197 | 0.000000e+00 | -- | Inf
3.20/3.23 c (run 3, node 1) restarting after 25 global fixings of integer variables
3.20/3.23 c
3.20/3.23 c (restart) converted 14 cuts from the global cut pool into linear constraints
3.20/3.23 c
3.20/3.23 c presolving:
3.20/3.24 c (round 1) 25 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.25 c (round 2) 25 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 6 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.25 c (round 3) 25 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.25 c (round 4) 25 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.25 c (round 5) 25 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 11 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.25 c (round 6) 25 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.25 c (round 7) 25 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 14 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.25 c (round 8) 25 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 15 chg coeffs, 14 upgd conss, 42 impls, 71 clqs
3.20/3.26 c presolving (9 rounds):
3.20/3.26 c 25 deleted vars, 18 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 15 changed coefficients
3.20/3.26 c 42 implications, 71 cliques
3.20/3.26 c presolved problem has 81 variables (81 bin, 0 int, 0 impl, 0 cont) and 112 constraints
3.20/3.26 c 27 constraints of type <knapsack>
3.20/3.26 c 77 constraints of type <setppc>
3.20/3.26 c 8 constraints of type <logicor>
3.20/3.26 c transformed objective value is always integral (scale: 1)
3.20/3.26 c Presolving Time: 0.08
3.20/3.26 c
3.20/3.26 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.20/3.26 c 3.2s| 1 | 0 | 977 | - | 961k| 0 | 40 | 81 | 112 | 81 | 104 | 0 | 0 | 197 | 0.000000e+00 | -- | Inf
3.20/3.28 c 3.3s| 1 | 0 | 1008 | - |1255k| 0 | 47 | 81 | 112 | 81 | 118 | 14 | 0 | 197 | 0.000000e+00 | -- | Inf
3.29/3.38 c 3.4s| 1 | 0 | 1045 | - |1254k| 0 | 40 | 81 | 110 | 81 | 118 | 14 | 0 | 207 | 0.000000e+00 | -- | Inf
3.49/3.57 c 3.6s| 1 | 0 | 1151 | - |1253k| 0 | 38 | 81 | 109 | 81 | 118 | 14 | 0 | 220 | 0.000000e+00 | -- | Inf
3.59/3.69 c 3.7s| 1 | 0 | 1168 | - |1252k| 0 | 38 | 81 | 108 | 81 | 118 | 14 | 0 | 232 | 0.000000e+00 | -- | Inf
3.69/3.76 c 3.8s| 1 | 0 | 1168 | - |1252k| 0 | - | 81 | 108 | 81 | 118 | 14 | 0 | 238 | 0.000000e+00 | -- | Inf
3.69/3.76 c (run 4, node 1) restarting after 20 global fixings of integer variables
3.69/3.76 c
3.69/3.76 c (restart) converted 14 cuts from the global cut pool into linear constraints
3.69/3.76 c
3.69/3.77 c presolving:
3.69/3.77 c (round 1) 23 del vars, 8 del conss, 0 chg bounds, 13 chg sides, 32 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.78 c (round 2) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 43 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.79 c (round 3) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 49 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.79 c (round 4) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 53 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.79 c (round 5) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 56 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.79 c (round 6) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 59 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.79 c (round 7) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 61 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.80 c (round 8) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 62 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.69/3.80 c (round 9) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 63 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.80 c (round 10) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 64 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.80 c (round 11) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 65 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.80 c (round 12) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 66 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.80 c (round 13) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 67 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.80 c (round 14) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 68 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.80 c (round 15) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 69 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.80 c (round 16) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 70 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 17) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 71 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 18) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 72 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 19) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 73 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 20) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 74 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 21) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 75 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 22) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 76 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 23) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 77 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.81 c (round 24) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 78 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 25) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 79 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 26) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 80 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 27) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 81 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 28) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 82 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 29) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 83 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 30) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 84 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 31) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 85 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 32) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 86 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.82 c (round 33) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 87 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.83 c (round 34) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 88 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.83 c (round 35) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 89 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.83 c (round 36) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 91 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.83 c (round 37) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 93 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.83 c (round 38) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 95 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.83 c (round 39) 23 del vars, 13 del conss, 0 chg bounds, 14 chg sides, 96 chg coeffs, 14 upgd conss, 78 impls, 56 clqs
3.79/3.83 c presolving (40 rounds):
3.79/3.83 c 23 deleted vars, 13 deleted constraints, 0 tightened bounds, 0 added holes, 14 changed sides, 96 changed coefficients
3.79/3.83 c 78 implications, 56 cliques
3.79/3.83 c presolved problem has 58 variables (58 bin, 0 int, 0 impl, 0 cont) and 109 constraints
3.79/3.83 c 36 constraints of type <knapsack>
3.79/3.83 c 67 constraints of type <setppc>
3.79/3.83 c 6 constraints of type <logicor>
3.79/3.83 c transformed objective value is always integral (scale: 1)
3.79/3.83 c Presolving Time: 0.15
3.79/3.83 c
3.79/3.84 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.79/3.84 c * 3.8s| 1 | 0 | 1217 | - | 965k| 0 | - | 58 | 109 | 58 | 103 | 0 | 0 | 238 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.79/3.84 c 3.8s| 1 | 0 | 1217 | - | 965k| 0 | - | 58 | 109 | 58 | 103 | 0 | 0 | 238 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.79/3.84 c
3.79/3.84 c SCIP Status : problem is solved [optimal solution found]
3.79/3.84 c Solving Time (sec) : 3.83
3.79/3.84 c Solving Nodes : 1 (total of 5 nodes in 5 runs)
3.79/3.84 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.79/3.84 c Dual Bound : +0.00000000000000e+00
3.79/3.84 c Gap : 0.00 %
3.79/3.84 s SATISFIABLE
3.79/3.84 v -x169 -x168 x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 x150 -x149 -x148
3.79/3.84 v -x147 -x146 -x145 -x144 -x143 x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
3.79/3.84 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
3.79/3.84 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
3.79/3.84 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
3.79/3.84 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
3.79/3.84 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
3.79/3.84 v x4 -x3 -x2 -x1
3.79/3.84 c SCIP Status : problem is solved [optimal solution found]
3.79/3.84 c Solving Time : 3.83
3.79/3.84 c Original Problem :
3.79/3.84 c Problem name : HOME/instance-2703982-1278548299.opb
3.79/3.84 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.84 c Constraints : 101 initial, 101 maximal
3.79/3.84 c Presolved Problem :
3.79/3.84 c Problem name : t_HOME/instance-2703982-1278548299.opb
3.79/3.84 c Variables : 58 (58 binary, 0 integer, 0 implicit integer, 0 continuous)
3.79/3.84 c Constraints : 109 initial, 109 maximal
3.79/3.84 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.79/3.84 c trivial : 0.00 108 0 0 0 0 0 0 0
3.79/3.84 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c implics : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c probing : 0.00 0 0 0 0 0 0 0 0
3.79/3.84 c knapsack : 0.10 0 0 0 0 0 0 14 111
3.79/3.84 c setppc : 0.01 0 3 0 0 0 25 0 0
3.79/3.84 c linear : 0.01 0 0 0 0 0 33 1 0
3.79/3.84 c logicor : 0.00 0 0 0 0 0 48 0 0
3.79/3.84 c root node : - 108 - - 108 - - - -
3.79/3.84 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.79/3.84 c integral : 0 0 0 23 0 0 108 0 0 0
3.79/3.84 c knapsack : 36 8 24 0 0 0 0 0 0 0
3.79/3.84 c setppc : 67 8 24 0 0 0 0 0 0 0
3.79/3.84 c logicor : 6 3 13 0 0 0 0 0 0 0
3.79/3.84 c countsols : 0 0 0 0 0 0 0 0 0 0
3.79/3.84 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.79/3.84 c integral : 3.25 0.00 0.00 3.25 0.00
3.79/3.84 c knapsack : 0.01 0.01 0.00 0.00 0.00
3.79/3.84 c setppc : 0.00 0.00 0.00 0.00 0.00
3.79/3.84 c logicor : 0.00 0.00 0.00 0.00 0.00
3.79/3.84 c countsols : 0.00 0.00 0.00 0.00 0.00
3.79/3.84 c Propagators : Time Calls Cutoffs DomReds
3.79/3.84 c vbounds : 0.00 5 0 0
3.79/3.84 c rootredcost : 0.00 0 0 0
3.79/3.84 c pseudoobj : 0.00 0 0 0
3.79/3.84 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.79/3.84 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.79/3.84 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.84 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.84 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.79/3.84 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
3.79/3.84 c applied globally : - - - 0 0.0 - - -
3.79/3.84 c applied locally : - - - 0 0.0 - - -
3.79/3.84 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.79/3.84 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.79/3.84 c redcost : 0.00 8 0 0 0 0
3.79/3.84 c impliedbounds : 0.00 8 0 0 0 0
3.79/3.84 c intobj : 0.00 0 0 0 0 0
3.79/3.84 c cgmip : 0.00 0 0 0 0 0
3.79/3.84 c gomory : 0.06 8 0 0 135 0
3.79/3.84 c strongcg : 0.07 8 0 0 454 0
3.79/3.84 c cmir : 0.00 0 0 0 0 0
3.79/3.84 c flowcover : 0.00 0 0 0 0 0
3.79/3.84 c clique : 0.01 8 0 0 34 0
3.79/3.84 c zerohalf : 0.00 0 0 0 0 0
3.79/3.84 c mcf : 0.00 4 0 0 0 0
3.79/3.84 c rapidlearning : 0.15 1 0 0 0 146
3.79/3.84 c Pricers : Time Calls Vars
3.79/3.84 c problem variables: 0.00 0 0
3.79/3.84 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.79/3.84 c relpscost : 3.25 23 0 108 0 0 0
3.79/3.84 c pscost : 0.00 0 0 0 0 0 0
3.79/3.84 c inference : 0.00 0 0 0 0 0 0
3.79/3.84 c mostinf : 0.00 0 0 0 0 0 0
3.79/3.84 c leastinf : 0.00 0 0 0 0 0 0
3.79/3.84 c fullstrong : 0.00 0 0 0 0 0 0
3.79/3.84 c allfullstrong : 0.00 0 0 0 0 0 0
3.79/3.84 c random : 0.00 0 0 0 0 0 0
3.79/3.84 c Primal Heuristics : Time Calls Found
3.79/3.84 c LP solutions : 0.00 - 0
3.79/3.84 c pseudo solutions : 0.00 - 0
3.79/3.84 c trivial : 0.00 1 0
3.79/3.84 c simplerounding : 0.00 0 0
3.79/3.84 c zirounding : 0.00 0 0
3.79/3.84 c rounding : 0.00 0 0
3.79/3.84 c shifting : 0.00 0 0
3.79/3.84 c intshifting : 0.00 0 0
3.79/3.84 c oneopt : 0.00 0 0
3.79/3.84 c twoopt : 0.00 0 0
3.79/3.84 c fixandinfer : 0.00 0 0
3.79/3.84 c feaspump : 0.00 0 0
3.79/3.84 c coefdiving : 0.00 0 0
3.79/3.84 c pscostdiving : 0.00 0 0
3.79/3.84 c fracdiving : 0.00 0 0
3.79/3.84 c veclendiving : 0.00 0 0
3.79/3.84 c intdiving : 0.00 0 0
3.79/3.84 c actconsdiving : 0.00 0 0
3.79/3.84 c objpscostdiving : 0.00 0 0
3.79/3.84 c rootsoldiving : 0.00 0 0
3.79/3.84 c linesearchdiving : 0.00 0 0
3.79/3.84 c guideddiving : 0.00 0 0
3.79/3.84 c octane : 0.00 0 0
3.79/3.84 c rens : 0.00 0 0
3.79/3.84 c rins : 0.00 0 0
3.79/3.84 c localbranching : 0.00 0 0
3.79/3.84 c mutation : 0.00 0 0
3.79/3.84 c crossover : 0.00 0 0
3.79/3.84 c dins : 0.00 0 0
3.79/3.84 c undercover : 0.00 0 0
3.79/3.84 c nlp : 0.00 0 0
3.79/3.84 c trysol : 0.00 0 0
3.79/3.84 c LP : Time Calls Iterations Iter/call Iter/sec
3.79/3.84 c primal LP : 0.00 0 0 0.00 -
3.79/3.84 c dual LP : 0.09 32 1217 38.03 13674.77
3.79/3.84 c lex dual LP : 0.00 0 0 0.00 -
3.79/3.84 c barrier LP : 0.00 0 0 0.00 -
3.79/3.84 c diving/probing LP: 0.00 0 0 0.00 -
3.79/3.84 c strong branching : 3.25 238 34847 146.42 10715.88
3.79/3.84 c (at root node) : - 238 34847 146.42 -
3.79/3.84 c conflict analysis: 0.00 0 0 0.00 -
3.79/3.84 c B&B Tree :
3.79/3.84 c number of runs : 5
3.79/3.84 c nodes : 1
3.79/3.84 c nodes (total) : 5
3.79/3.84 c nodes left : 0
3.79/3.84 c max depth : 0
3.79/3.84 c max depth (total): 0
3.79/3.84 c backtracks : 0 (0.0%)
3.79/3.84 c delayed cutoffs : 0
3.79/3.84 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.79/3.84 c avg switch length: 2.00
3.79/3.84 c switching time : 0.00
3.79/3.84 c Solution :
3.79/3.84 c Solutions found : 1 (1 improvements)
3.79/3.84 c First Solution : +0.00000000000000e+00 (in run 5, after 1 nodes, 3.82 seconds, depth 0, found by <relaxation>)
3.79/3.84 c Primal Bound : +0.00000000000000e+00 (in run 5, after 1 nodes, 3.82 seconds, depth 0, found by <relaxation>)
3.79/3.84 c Dual Bound : +0.00000000000000e+00
3.79/3.84 c Gap : 0.00 %
3.79/3.84 c Root Dual Bound : +0.00000000000000e+00
3.79/3.84 c Root Iterations : 1217
3.79/3.85 c Time complete: 3.84.