0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691618-1338020749.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01 c (round 2) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 72 constraints of type <setppc>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = 5
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = FALSE
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = -1
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = 750
0.00/0.01 c
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = 100
0.00/0.01 c
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = 0.15
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = 0.5
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = -1
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = -1
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = 0.3
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/subnlp/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/trivial/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/trysol/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/zirounding/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c propagating/probing/maxprerounds = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/indoneopt/freq = -1
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 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.01 c 0.0s| 1 | 0 | 112 | - | 824k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.07 c 0.1s| 1 | 0 | 138 | - |1348k| 0 | 53 | 169 | 282 | 169 | 90 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.08 c 0.1s| 1 | 0 | 194 | - |1668k| 0 | 62 | 169 | 282 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.09 c 0.1s| 1 | 0 | 217 | - |1741k| 0 | 62 | 169 | 282 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 260 | - |1779k| 0 | 62 | 169 | 282 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 314 | - |1795k| 0 | 64 | 169 | 282 | 169 | 117 | 44 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 331 | - |1744k| 0 | 63 | 169 | 235 | 169 | 117 | 44 | 0 | 15 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 351 | - |1744k| 0 | 61 | 169 | 235 | 169 | 117 | 44 | 0 | 26 | 0.000000e+00 | -- | Inf
0.28/0.35 c 0.3s| 1 | 0 | 361 | - |1744k| 0 | 60 | 169 | 235 | 169 | 117 | 44 | 0 | 36 | 0.000000e+00 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 438 | - |1744k| 0 | 54 | 169 | 235 | 169 | 117 | 44 | 0 | 48 | 0.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 0 | 474 | - |1744k| 0 | 51 | 169 | 235 | 169 | 117 | 44 | 0 | 61 | 0.000000e+00 | -- | Inf
0.39/0.48 c 0.5s| 1 | 0 | 487 | - |1733k| 0 | 51 | 169 | 225 | 169 | 106 | 44 | 0 | 67 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 493 | - |1733k| 0 | 48 | 169 | 225 | 169 | 106 | 44 | 0 | 79 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 500 | - |1732k| 0 | 50 | 169 | 224 | 169 | 106 | 44 | 0 | 83 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 503 | - |1573k| 0 | 49 | 169 | 83 | 169 | 106 | 44 | 0 | 88 | 0.000000e+00 | -- | Inf
0.49/0.52 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.52 c 0.5s| 1 | 0 | 508 | - |1573k| 0 | 49 | 169 | 83 | 169 | 106 | 44 | 0 | 91 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 508 | - |1573k| 0 | - | 169 | 83 | 169 | 106 | 44 | 0 | 94 | 0.000000e+00 | -- | Inf
0.49/0.53 c (run 1, node 1) restarting after 35 global fixings of integer variables
0.49/0.53 c
0.49/0.53 c (restart) converted 31 cuts from the global cut pool into linear constraints
0.49/0.53 c
0.49/0.53 c presolving:
0.49/0.53 c (round 1) 35 del vars, 2 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 20 impls, 86 clqs
0.49/0.53 c (round 2) 35 del vars, 2 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 40 upgd conss, 20 impls, 86 clqs
0.49/0.53 c (round 3) 35 del vars, 6 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 40 upgd conss, 20 impls, 86 clqs
0.49/0.54 c presolving (4 rounds):
0.49/0.54 c 35 deleted vars, 6 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.49/0.54 c 20 implications, 86 cliques
0.49/0.54 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 108 constraints
0.49/0.54 c 8 constraints of type <knapsack>
0.49/0.54 c 89 constraints of type <setppc>
0.49/0.54 c 11 constraints of type <logicor>
0.49/0.54 c transformed objective value is always integral (scale: 1)
0.49/0.54 c Presolving Time: 0.01
0.49/0.54 c
0.49/0.54 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.54 c 0.5s| 1 | 0 | 590 | - | 993k| 0 | 44 | 134 | 108 | 134 | 97 | 0 | 0 | 94 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 625 | - |1258k| 0 | 53 | 134 | 108 | 134 | 110 | 13 | 0 | 94 | 0.000000e+00 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 660 | - |1258k| 0 | 51 | 134 | 108 | 134 | 110 | 13 | 0 | 119 | 0.000000e+00 | -- | Inf
0.59/0.66 c 0.7s| 1 | 0 | 674 | - |1258k| 0 | 50 | 134 | 108 | 134 | 110 | 13 | 0 | 138 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 682 | - |1257k| 0 | 50 | 134 | 107 | 134 | 110 | 13 | 0 | 153 | 0.000000e+00 | -- | Inf
0.69/0.72 c 0.7s| 1 | 0 | 697 | - |1257k| 0 | 50 | 134 | 107 | 134 | 110 | 13 | 0 | 158 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 701 | - |1257k| 0 | 50 | 134 | 107 | 134 | 110 | 13 | 0 | 164 | 0.000000e+00 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 705 | - |1257k| 0 | 51 | 134 | 107 | 134 | 110 | 13 | 0 | 168 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.8s| 1 | 0 | 708 | - |1257k| 0 | 50 | 134 | 107 | 134 | 110 | 13 | 0 | 173 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.8s| 1 | 0 | 712 | - |1257k| 0 | 51 | 134 | 107 | 134 | 110 | 13 | 0 | 175 | 0.000000e+00 | -- | Inf
0.69/0.77 c 0.8s| 1 | 0 | 712 | - |1257k| 0 | - | 134 | 107 | 134 | 110 | 13 | 0 | 178 | 0.000000e+00 | -- | Inf
0.69/0.77 c (run 2, node 1) restarting after 27 global fixings of integer variables
0.69/0.77 c
0.69/0.77 c (restart) converted 13 cuts from the global cut pool into linear constraints
0.69/0.77 c
0.69/0.77 c presolving:
0.69/0.77 c (round 1) 27 del vars, 4 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 28 impls, 84 clqs
0.69/0.78 c (round 2) 27 del vars, 5 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 28 impls, 84 clqs
0.69/0.78 c presolving (3 rounds):
0.69/0.78 c 27 deleted vars, 5 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.78 c 28 implications, 84 cliques
0.69/0.78 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 115 constraints
0.69/0.78 c 16 constraints of type <knapsack>
0.69/0.78 c 88 constraints of type <setppc>
0.69/0.78 c 11 constraints of type <logicor>
0.69/0.78 c transformed objective value is always integral (scale: 1)
0.69/0.78 c Presolving Time: 0.02
0.69/0.78 c
0.69/0.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.78 c 0.8s| 1 | 0 | 784 | - |1028k| 0 | 42 | 107 | 115 | 107 | 104 | 0 | 0 | 178 | 0.000000e+00 | -- | Inf
0.69/0.79 c 0.8s| 1 | 0 | 811 | - |1299k| 0 | 47 | 107 | 115 | 107 | 118 | 14 | 0 | 178 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 818 | - |1299k| 0 | 46 | 107 | 115 | 107 | 118 | 14 | 0 | 200 | 0.000000e+00 | -- | Inf
0.79/0.89 c 0.9s| 1 | 0 | 825 | - |1299k| 0 | 46 | 107 | 114 | 107 | 118 | 14 | 0 | 215 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 0 | 834 | - |1299k| 0 | 48 | 107 | 114 | 107 | 118 | 14 | 0 | 228 | 0.000000e+00 | -- | Inf
0.89/0.96 c 1.0s| 1 | 0 | 841 | - |1298k| 0 | 48 | 107 | 111 | 107 | 118 | 14 | 0 | 239 | 0.000000e+00 | -- | Inf
0.89/0.98 c 1.0s| 1 | 0 | 849 | - |1298k| 0 | 48 | 107 | 110 | 107 | 118 | 14 | 0 | 246 | 0.000000e+00 | -- | Inf
0.89/1.00 c 1.0s| 1 | 0 | 849 | - |1298k| 0 | - | 107 | 110 | 107 | 118 | 14 | 0 | 251 | 0.000000e+00 | -- | Inf
0.89/1.00 c (run 3, node 1) restarting after 25 global fixings of integer variables
0.89/1.00 c
0.89/1.00 c (restart) converted 14 cuts from the global cut pool into linear constraints
0.89/1.00 c
0.89/1.00 c presolving:
0.89/1.00 c (round 1) 25 del vars, 6 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 38 impls, 81 clqs
0.99/1.00 c presolving (2 rounds):
0.99/1.00 c 25 deleted vars, 6 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.99/1.00 c 38 implications, 81 cliques
0.99/1.00 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 118 constraints
0.99/1.00 c 25 constraints of type <knapsack>
0.99/1.00 c 84 constraints of type <setppc>
0.99/1.00 c 9 constraints of type <logicor>
0.99/1.00 c transformed objective value is always integral (scale: 1)
0.99/1.00 c Presolving Time: 0.03
0.99/1.00 c
0.99/1.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.01 c 1.0s| 1 | 0 | 915 | - |1045k| 0 | 47 | 82 | 118 | 82 | 109 | 0 | 0 | 251 | 0.000000e+00 | -- | Inf
0.99/1.01 c 1.0s| 1 | 0 | 925 | - |1265k| 0 | 49 | 82 | 118 | 82 | 114 | 5 | 0 | 251 | 0.000000e+00 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 934 | - |1265k| 0 | 49 | 82 | 118 | 82 | 114 | 5 | 0 | 274 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 940 | - |1265k| 0 | 49 | 82 | 117 | 82 | 114 | 5 | 0 | 291 | 0.000000e+00 | -- | Inf
0.99/1.09 c 1.1s| 1 | 0 | 947 | - |1264k| 0 | 48 | 82 | 115 | 82 | 114 | 5 | 0 | 305 | 0.000000e+00 | -- | Inf
0.99/1.09 c 1.1s| 1 | 0 | 962 | - |1264k| 0 | 45 | 82 | 114 | 82 | 114 | 5 | 0 | 311 | 0.000000e+00 | -- | Inf
0.99/1.10 c 1.1s| 1 | 0 | 962 | - |1263k| 0 | - | 82 | 114 | 82 | 114 | 5 | 0 | 315 | 0.000000e+00 | -- | Inf
0.99/1.10 c (run 4, node 1) restarting after 17 global fixings of integer variables
0.99/1.10 c
0.99/1.10 c (restart) converted 5 cuts from the global cut pool into linear constraints
0.99/1.10 c
0.99/1.10 c presolving:
1.10/1.10 c (round 1) 17 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 5 upgd conss, 58 impls, 70 clqs
1.10/1.10 c (round 2) 17 del vars, 5 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 5 upgd conss, 58 impls, 70 clqs
1.10/1.10 c (round 3) 17 del vars, 5 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 4 chg coeffs, 5 upgd conss, 58 impls, 70 clqs
1.10/1.10 c presolving (4 rounds):
1.10/1.10 c 17 deleted vars, 5 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 4 changed coefficients
1.10/1.10 c 58 implications, 70 cliques
1.10/1.10 c presolved problem has 65 variables (65 bin, 0 int, 0 impl, 0 cont) and 114 constraints
1.10/1.10 c 28 constraints of type <knapsack>
1.10/1.10 c 77 constraints of type <setppc>
1.10/1.10 c 9 constraints of type <logicor>
1.10/1.10 c transformed objective value is always integral (scale: 1)
1.10/1.10 c Presolving Time: 0.03
1.10/1.10 c
1.10/1.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.11 c 1.1s| 1 | 0 | 1012 | - |1027k| 0 | 38 | 65 | 114 | 65 | 105 | 0 | 0 | 315 | 0.000000e+00 | -- | Inf
1.10/1.11 c 1.1s| 1 | 0 | 1035 | - |1258k| 0 | 47 | 65 | 114 | 65 | 119 | 14 | 0 | 315 | 0.000000e+00 | -- | Inf
1.10/1.17 c 1.2s| 1 | 0 | 1105 | - |1257k| 0 | 42 | 65 | 113 | 65 | 119 | 14 | 0 | 328 | 0.000000e+00 | -- | Inf
1.10/1.19 c 1.2s| 1 | 0 | 1130 | - |1256k| 0 | 33 | 65 | 112 | 65 | 119 | 14 | 0 | 335 | 0.000000e+00 | -- | Inf
1.10/1.19 c 1.2s| 1 | 0 | 1130 | - |1254k| 0 | - | 65 | 112 | 65 | 119 | 14 | 0 | 340 | 0.000000e+00 | -- | Inf
1.10/1.19 c (run 5, node 1) restarting after 15 global fixings of integer variables
1.10/1.19 c
1.10/1.19 c (restart) converted 14 cuts from the global cut pool into linear constraints
1.10/1.19 c
1.10/1.19 c presolving:
1.19/1.20 c (round 1) 22 del vars, 11 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 7 chg coeffs, 14 upgd conss, 92 impls, 44 clqs
1.19/1.20 c (round 2) 31 del vars, 24 del conss, 0 add conss, 0 chg bounds, 19 chg sides, 52 chg coeffs, 14 upgd conss, 96 impls, 40 clqs
1.19/1.20 c (round 3) 31 del vars, 27 del conss, 0 add conss, 0 chg bounds, 53 chg sides, 145 chg coeffs, 14 upgd conss, 98 impls, 40 clqs
1.19/1.21 c (round 4) 31 del vars, 36 del conss, 0 add conss, 0 chg bounds, 53 chg sides, 185 chg coeffs, 14 upgd conss, 98 impls, 40 clqs
1.19/1.21 c (round 5) 31 del vars, 36 del conss, 0 add conss, 0 chg bounds, 53 chg sides, 207 chg coeffs, 14 upgd conss, 98 impls, 40 clqs
1.19/1.21 c (round 6) 31 del vars, 36 del conss, 0 add conss, 0 chg bounds, 53 chg sides, 223 chg coeffs, 14 upgd conss, 98 impls, 40 clqs
1.19/1.21 c (round 7) 31 del vars, 36 del conss, 0 add conss, 0 chg bounds, 53 chg sides, 234 chg coeffs, 14 upgd conss, 98 impls, 40 clqs
1.19/1.21 c (round 8) 31 del vars, 36 del conss, 0 add conss, 0 chg bounds, 53 chg sides, 240 chg coeffs, 14 upgd conss, 98 impls, 40 clqs
1.19/1.21 c (round 9) 31 del vars, 36 del conss, 0 add conss, 0 chg bounds, 53 chg sides, 241 chg coeffs, 14 upgd conss, 98 impls, 40 clqs
1.19/1.21 c presolving (10 rounds):
1.19/1.21 c 31 deleted vars, 36 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 53 changed sides, 241 changed coefficients
1.19/1.21 c 98 implications, 40 cliques
1.19/1.21 c presolved problem has 34 variables (34 bin, 0 int, 0 impl, 0 cont) and 90 constraints
1.19/1.21 c 40 constraints of type <knapsack>
1.19/1.21 c 44 constraints of type <setppc>
1.19/1.21 c 6 constraints of type <logicor>
1.19/1.21 c transformed objective value is always integral (scale: 1)
1.19/1.21 c Presolving Time: 0.05
1.19/1.21 c
1.19/1.21 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.19/1.21 c 1.2s| 1 | 0 | 1165 | - | 986k| 0 | - | 34 | 90 | 34 | 84 | 0 | 0 | 340 | cutoff | -- | 0.00%
1.19/1.21 c 1.2s| 1 | 0 | 1165 | - | 986k| 0 | - | 34 | 90 | 34 | 84 | 0 | 0 | 340 | cutoff | -- | 0.00%
1.19/1.21 c
1.19/1.21 c SCIP Status : problem is solved [infeasible]
1.19/1.21 c Solving Time (sec) : 1.21
1.19/1.21 c Solving Nodes : 1 (total of 6 nodes in 6 runs)
1.19/1.21 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.19/1.21 c Dual Bound : +1.00000000000000e+20
1.19/1.21 c Gap : 0.00 %
1.19/1.21 s UNSATISFIABLE
1.19/1.21 c SCIP Status : problem is solved [infeasible]
1.19/1.21 c Total Time : 1.21
1.19/1.21 c solving : 1.21
1.19/1.21 c presolving : 0.05 (included in solving)
1.19/1.21 c reading : 0.00 (included in solving)
1.19/1.21 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
1.19/1.21 c Original Problem :
1.19/1.21 c Problem name : HOME/instance-3691618-1338020749.opb
1.19/1.21 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.21 c Constraints : 101 initial, 101 maximal
1.19/1.21 c Objective sense : minimize
1.19/1.21 c Presolved Problem :
1.19/1.21 c Problem name : t_HOME/instance-3691618-1338020749.opb
1.19/1.21 c Variables : 34 (34 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.21 c Constraints : 90 initial, 90 maximal
1.19/1.21 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.19/1.21 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c trivial : 0.00 0.00 119 0 0 0 0 0 0 0 0
1.19/1.21 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.19/1.21 c knapsack : 0.03 0.00 0 0 0 0 0 0 0 53 245
1.19/1.21 c setppc : 0.00 0.00 11 5 0 0 0 52 0 0 0
1.19/1.21 c linear : 0.00 0.00 0 0 0 0 0 30 0 2 0
1.19/1.21 c logicor : 0.00 0.00 0 0 0 0 0 4 0 0 0
1.19/1.21 c root node : - - 119 - - 119 - - - - -
1.19/1.21 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
1.19/1.21 c integral : 0 0 0 0 34 0 5 0 0 119 0 0 0
1.19/1.21 c knapsack : 40 40 9 35 0 0 0 0 0 0 0 0 0
1.19/1.21 c setppc : 44 44 9 35 0 0 0 0 0 0 0 0 0
1.19/1.21 c logicor : 6 6 4 15 0 0 0 0 0 0 0 0 0
1.19/1.21 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.19/1.21 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
1.19/1.21 c integral : 0.99 0.00 0.00 0.00 0.99 0.00 0.00 0.00
1.19/1.21 c knapsack : 0.01 0.00 0.01 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.19/1.21 c rootredcost : 0 0 0 0
1.19/1.21 c pseudoobj : 0 0 0 0
1.19/1.21 c vbounds : 0 0 0 0
1.19/1.21 c redcost : 43 0 0 0
1.19/1.21 c probing : 0 0 0 0
1.19/1.21 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
1.19/1.21 c rootredcost : 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c vbounds : 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c redcost : 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c probing : 0.00 0.00 0.00 0.00 0.00
1.19/1.21 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.19/1.21 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.21 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.21 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.21 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.21 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.21 c applied globally : - - - 0 0.0 - - -
1.19/1.21 c applied locally : - - - 0 0.0 - - -
1.19/1.21 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
1.19/1.21 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.19/1.21 c closecuts : 0.00 0.00 0 0 0 0 0
1.19/1.21 c impliedbounds : 0.00 0.00 9 0 0 0 0
1.19/1.21 c intobj : 0.00 0.00 0 0 0 0 0
1.19/1.21 c gomory : 0.03 0.00 9 0 0 69 0
1.19/1.21 c cgmip : 0.00 0.00 0 0 0 0 0
1.19/1.21 c strongcg : 0.03 0.00 9 0 0 502 0
1.19/1.21 c cmir : 0.00 0.00 0 0 0 0 0
1.19/1.21 c flowcover : 0.00 0.00 0 0 0 0 0
1.19/1.21 c clique : 0.00 0.00 9 0 0 45 0
1.19/1.21 c zerohalf : 0.00 0.00 0 0 0 0 0
1.19/1.21 c mcf : 0.00 0.00 5 0 0 0 0
1.19/1.21 c oddcycle : 0.00 0.00 0 0 0 0 0
1.19/1.21 c rapidlearning : 0.05 0.00 1 0 0 0 209
1.19/1.21 c Pricers : ExecTime SetupTime Calls Vars
1.19/1.21 c problem variables: 0.00 - 0 0
1.19/1.21 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
1.19/1.21 c relpscost : 0.99 0.00 34 0 119 0 0 0
1.19/1.21 c pscost : 0.00 0.00 0 0 0 0 0 0
1.19/1.21 c inference : 0.00 0.00 0 0 0 0 0 0
1.19/1.21 c mostinf : 0.00 0.00 0 0 0 0 0 0
1.19/1.21 c leastinf : 0.00 0.00 0 0 0 0 0 0
1.19/1.21 c fullstrong : 0.00 0.00 0 0 0 0 0 0
1.19/1.21 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
1.19/1.21 c random : 0.00 0.00 0 0 0 0 0 0
1.19/1.21 c Primal Heuristics : ExecTime SetupTime Calls Found
1.19/1.21 c LP solutions : 0.00 - - 0
1.19/1.21 c pseudo solutions : 0.00 - - 0
1.19/1.21 c smallcard : 0.00 0.00 0 0
1.19/1.21 c trivial : 0.00 0.00 1 0
1.19/1.21 c shiftandpropagate: 0.00 0.00 0 0
1.19/1.21 c simplerounding : 0.00 0.00 0 0
1.19/1.21 c zirounding : 0.00 0.00 0 0
1.19/1.21 c rounding : 0.00 0.00 0 0
1.19/1.21 c shifting : 0.00 0.00 0 0
1.19/1.21 c intshifting : 0.00 0.00 0 0
1.19/1.21 c oneopt : 0.00 0.00 0 0
1.19/1.21 c twoopt : 0.00 0.00 0 0
1.19/1.21 c indtwoopt : 0.00 0.00 0 0
1.19/1.21 c indoneopt : 0.00 0.00 0 0
1.19/1.21 c fixandinfer : 0.00 0.00 0 0
1.19/1.21 c feaspump : 0.00 0.00 0 0
1.19/1.21 c clique : 0.00 0.00 0 0
1.19/1.21 c indrounding : 0.00 0.00 0 0
1.19/1.21 c indcoefdiving : 0.00 0.00 0 0
1.19/1.21 c coefdiving : 0.00 0.00 0 0
1.19/1.21 c pscostdiving : 0.00 0.00 0 0
1.19/1.21 c nlpdiving : 0.00 0.00 0 0
1.19/1.21 c fracdiving : 0.00 0.00 0 0
1.19/1.21 c veclendiving : 0.00 0.00 0 0
1.19/1.21 c intdiving : 0.00 0.00 0 0
1.19/1.21 c actconsdiving : 0.00 0.00 0 0
1.19/1.21 c objpscostdiving : 0.00 0.00 0 0
1.19/1.21 c rootsoldiving : 0.00 0.00 0 0
1.19/1.21 c linesearchdiving : 0.00 0.00 0 0
1.19/1.21 c guideddiving : 0.00 0.00 0 0
1.19/1.21 c octane : 0.00 0.00 0 0
1.19/1.21 c rens : 0.00 0.00 0 0
1.19/1.21 c rins : 0.00 0.00 0 0
1.19/1.21 c localbranching : 0.00 0.00 0 0
1.19/1.21 c mutation : 0.00 0.00 0 0
1.19/1.21 c crossover : 0.00 0.00 0 0
1.19/1.21 c dins : 0.00 0.00 0 0
1.19/1.21 c vbounds : 0.00 0.00 0 0
1.19/1.21 c undercover : 0.00 0.00 0 0
1.19/1.21 c subnlp : 0.00 0.00 0 0
1.19/1.21 c trysol : 0.00 0.00 0 0
1.19/1.21 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
1.19/1.21 c primal LP : 0.00 1 0 0.00 - 0.00 1
1.19/1.21 c dual LP : 0.04 44 1165 26.48 31872.40 0.00 0
1.19/1.21 c lex dual LP : 0.00 0 0 0.00 -
1.19/1.21 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.19/1.21 c diving/probing LP: 0.00 0 0 0.00 -
1.19/1.21 c strong branching : 0.99 340 33182 97.59 33499.37
1.19/1.21 c (at root node) : - 340 33182 97.59 -
1.19/1.21 c conflict analysis: 0.00 0 0 0.00 -
1.19/1.21 c B&B Tree :
1.19/1.21 c number of runs : 6
1.19/1.21 c nodes : 1
1.19/1.21 c nodes (total) : 6
1.19/1.21 c nodes left : 0
1.19/1.21 c max depth : 0
1.19/1.21 c max depth (total): 0
1.19/1.21 c backtracks : 0 (0.0%)
1.19/1.21 c delayed cutoffs : 0
1.19/1.21 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.19/1.21 c avg switch length: 2.00
1.19/1.21 c switching time : 0.00
1.19/1.21 c Solution :
1.19/1.21 c Solutions found : 0 (0 improvements)
1.19/1.21 c Primal Bound : infeasible
1.19/1.21 c Dual Bound : -
1.19/1.21 c Gap : 0.00 %
1.19/1.21 c Root Dual Bound : -
1.19/1.21 c Root Iterations : 1165
1.19/1.22 c Time complete: 1.21.