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-3729206-1338678690.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
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 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.01 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.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted 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 1.2.1.3
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
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 = 1790
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 # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = 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 # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = 0
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 <nlp> (-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/nlp/freq = -1
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 <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 <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 <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 # 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 -----------------------------------------------------------------------------------------------
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 | 121 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 155 | - |1147k| 0 | 59 | 169 | 190 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 204 | - |1381k| 0 | 60 | 169 | 190 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 267 | - |1452k| 0 | 61 | 169 | 190 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 308 | - |1479k| 0 | 71 | 169 | 190 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 358 | - |1488k| 0 | 69 | 169 | 190 | 169 | 114 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 367 | - |1462k| 0 | 70 | 169 | 165 | 169 | 114 | 41 | 0 | 11 | 0.000000e+00 | -- | Inf
0.28/0.38 c 0.4s| 1 | 0 | 416 | - |1450k| 0 | 70 | 169 | 154 | 169 | 114 | 41 | 0 | 24 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 422 | - |1447k| 0 | 67 | 169 | 150 | 169 | 114 | 41 | 0 | 36 | 0.000000e+00 | -- | Inf
0.59/0.66 c 0.7s| 1 | 0 | 435 | - |1445k| 0 | 70 | 169 | 148 | 169 | 114 | 41 | 0 | 50 | 0.000000e+00 | -- | Inf
0.69/0.77 c 0.8s| 1 | 0 | 447 | - |1429k| 0 | 66 | 169 | 135 | 169 | 114 | 41 | 0 | 61 | 0.000000e+00 | -- | Inf
0.79/0.88 c 0.9s| 1 | 0 | 474 | - |1426k| 0 | 68 | 169 | 132 | 169 | 105 | 41 | 0 | 72 | 0.000000e+00 | -- | Inf
0.89/0.95 c 1.0s| 1 | 0 | 495 | - |1424k| 0 | 63 | 169 | 131 | 169 | 105 | 41 | 0 | 82 | 0.000000e+00 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 498 | - |1423k| 0 | 63 | 169 | 130 | 169 | 105 | 41 | 0 | 93 | 0.000000e+00 | -- | Inf
1.09/1.13 c 1.1s| 1 | 0 | 510 | - |1423k| 0 | 64 | 169 | 130 | 169 | 105 | 41 | 0 | 104 | 0.000000e+00 | -- | Inf
1.09/1.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.09/1.15 c 1.1s| 1 | 0 | 510 | - |1423k| 0 | - | 169 | 130 | 169 | 105 | 41 | 0 | 107 | 0.000000e+00 | -- | Inf
1.09/1.15 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.09/1.15 c
1.09/1.15 c (restart) converted 32 cuts from the global cut pool into linear constraints
1.09/1.15 c
1.09/1.15 c presolving:
1.09/1.16 c (round 1) 35 del vars, 4 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 88 clqs
1.09/1.16 c (round 2) 35 del vars, 4 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 87 upgd conss, 10 impls, 88 clqs
1.09/1.16 c (round 3) 35 del vars, 5 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 87 upgd conss, 10 impls, 88 clqs
1.09/1.16 c presolving (4 rounds):
1.09/1.16 c 35 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
1.09/1.16 c 10 implications, 88 cliques
1.09/1.16 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 157 constraints
1.09/1.16 c 12 constraints of type <knapsack>
1.09/1.16 c 89 constraints of type <setppc>
1.09/1.16 c 56 constraints of type <logicor>
1.09/1.16 c transformed objective value is always integral (scale: 1)
1.09/1.16 c Presolving Time: 0.01
1.09/1.16 c
1.09/1.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.09/1.16 c 1.2s| 1 | 0 | 605 | - | 934k| 0 | 44 | 134 | 157 | 134 | 101 | 0 | 0 | 107 | 0.000000e+00 | -- | Inf
1.09/1.18 c 1.2s| 1 | 0 | 632 | - |1192k| 0 | 52 | 134 | 157 | 134 | 113 | 12 | 0 | 107 | 0.000000e+00 | -- | Inf
1.19/1.25 c 1.2s| 1 | 0 | 635 | - |1192k| 0 | 52 | 134 | 157 | 134 | 113 | 12 | 0 | 126 | 0.000000e+00 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 655 | - |1192k| 0 | 54 | 134 | 157 | 134 | 113 | 12 | 0 | 145 | 0.000000e+00 | -- | Inf
1.39/1.41 c 1.4s| 1 | 0 | 658 | - |1191k| 0 | 54 | 134 | 154 | 134 | 113 | 12 | 0 | 161 | 0.000000e+00 | -- | Inf
1.39/1.47 c 1.5s| 1 | 0 | 667 | - |1191k| 0 | 54 | 134 | 154 | 134 | 113 | 12 | 0 | 172 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.5s| 1 | 0 | 676 | - |1191k| 0 | 55 | 134 | 154 | 134 | 113 | 12 | 0 | 179 | 0.000000e+00 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 684 | - |1191k| 0 | 55 | 134 | 154 | 134 | 113 | 12 | 0 | 186 | 0.000000e+00 | -- | Inf
1.49/1.56 c 1.6s| 1 | 0 | 686 | - |1191k| 0 | 55 | 134 | 154 | 134 | 113 | 12 | 0 | 191 | 0.000000e+00 | -- | Inf
1.49/1.57 c 1.6s| 1 | 0 | 688 | - |1191k| 0 | 55 | 134 | 154 | 134 | 113 | 12 | 0 | 193 | 0.000000e+00 | -- | Inf
1.49/1.58 c 1.6s| 1 | 0 | 690 | - |1191k| 0 | 55 | 134 | 153 | 134 | 113 | 12 | 0 | 195 | 0.000000e+00 | -- | Inf
1.49/1.59 c 1.6s| 1 | 0 | 691 | - |1191k| 0 | 55 | 134 | 153 | 134 | 113 | 12 | 0 | 196 | 0.000000e+00 | -- | Inf
1.49/1.59 c 1.6s| 1 | 0 | 691 | - |1191k| 0 | - | 134 | 153 | 134 | 113 | 12 | 0 | 197 | 0.000000e+00 | -- | Inf
1.49/1.59 c (run 2, node 1) restarting after 27 global fixings of integer variables
1.49/1.59 c
1.49/1.59 c (restart) converted 12 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) 27 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 16 impls, 88 clqs
1.59/1.60 c presolving (2 rounds):
1.59/1.60 c 27 deleted vars, 23 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.59/1.60 c 16 implications, 88 cliques
1.59/1.60 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 142 constraints
1.59/1.60 c 21 constraints of type <knapsack>
1.59/1.60 c 91 constraints of type <setppc>
1.59/1.60 c 30 constraints of type <logicor>
1.59/1.60 c transformed objective value is always integral (scale: 1)
1.59/1.60 c Presolving Time: 0.02
1.59/1.60 c
1.59/1.60 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.60 c 1.6s| 1 | 0 | 761 | - | 973k| 0 | 47 | 107 | 142 | 107 | 112 | 0 | 0 | 197 | 0.000000e+00 | -- | Inf
1.59/1.61 c 1.6s| 1 | 0 | 786 | - |1206k| 0 | 56 | 107 | 142 | 107 | 122 | 10 | 0 | 197 | 0.000000e+00 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 793 | - |1205k| 0 | 56 | 107 | 140 | 107 | 122 | 10 | 0 | 217 | 0.000000e+00 | -- | Inf
1.69/1.79 c 1.8s| 1 | 2 | 793 | - |1206k| 0 | 56 | 107 | 140 | 107 | 122 | 10 | 0 | 233 | 0.000000e+00 | -- | Inf
1.99/2.01 c * 2.0s| 8 | 0 | 1211 | 59.7 |1246k| 4 | - | 107 | 142 | 107 | 87 | 10 | 2 | 352 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.99/2.01 c
1.99/2.01 c SCIP Status : problem is solved [optimal solution found]
1.99/2.01 c Solving Time (sec) : 2.01
1.99/2.01 c Solving Nodes : 8 (total of 10 nodes in 3 runs)
1.99/2.01 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.99/2.01 c Dual Bound : +0.00000000000000e+00
1.99/2.01 c Gap : 0.00 %
1.99/2.01 s SATISFIABLE
1.99/2.01 v -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.99/2.01 v -x147 -x146 x145 -x144 -x143 -x142 -x141 x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.99/2.01 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
1.99/2.01 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
1.99/2.01 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 -x56
1.99/2.01 v -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
1.99/2.01 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
1.99/2.01 v -x4 x3 -x2 -x1
1.99/2.01 c SCIP Status : problem is solved [optimal solution found]
1.99/2.01 c Solving Time : 2.01
1.99/2.01 c Original Problem :
1.99/2.01 c Problem name : HOME/instance-3729206-1338678690.opb
1.99/2.01 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.01 c Constraints : 101 initial, 101 maximal
1.99/2.01 c Presolved Problem :
1.99/2.01 c Problem name : t_HOME/instance-3729206-1338678690.opb
1.99/2.01 c Variables : 107 (107 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.01 c Constraints : 142 initial, 142 maximal
1.99/2.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.99/2.01 c trivial : 0.00 62 0 0 0 0 0 0 0
1.99/2.01 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.99/2.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.99/2.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.99/2.01 c implics : 0.00 0 0 0 0 0 0 0 0
1.99/2.01 c probing : 0.00 0 0 0 0 0 0 0 0
1.99/2.01 c knapsack : 0.01 0 0 0 0 0 0 0 0
1.99/2.01 c setppc : 0.00 0 0 0 0 0 1 0 0
1.99/2.01 c linear : 0.00 0 0 0 0 0 32 4 0
1.99/2.01 c logicor : 0.00 0 0 0 0 0 23 0 0
1.99/2.01 c root node : - 70 - - 70 - - - -
1.99/2.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.99/2.01 c integral : 0 0 0 38 0 2 102 0 0 8
1.99/2.01 c knapsack : 21 7 53 1 0 0 6 0 0 0
1.99/2.01 c setppc : 91 7 53 0 0 0 137 0 0 0
1.99/2.01 c logicor : 30+ 2 22 0 0 0 0 0 0 0
1.99/2.01 c countsols : 0 0 0 1 0 0 0 0 0 0
1.99/2.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.99/2.01 c integral : 1.80 0.00 0.00 1.80 0.00
1.99/2.01 c knapsack : 0.01 0.00 0.00 0.00 0.00
1.99/2.01 c setppc : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c logicor : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c countsols : 0.00 0.00 0.00 0.00 0.00
1.99/2.01 c Propagators : Time Calls Cutoffs DomReds
1.99/2.01 c vbounds : 0.00 3 0 0
1.99/2.01 c rootredcost : 0.00 0 0 0
1.99/2.01 c pseudoobj : 0.00 0 0 0
1.99/2.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.99/2.01 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.01 c infeasible LP : 0.00 1 1 2 5.0 0 0.0 0
1.99/2.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.99/2.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.99/2.01 c applied globally : - - - 2 5.0 - - -
1.99/2.01 c applied locally : - - - 0 0.0 - - -
1.99/2.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.99/2.01 c cut pool : 0.00 0 - - 0 - (maximal pool size: 88)
1.99/2.01 c redcost : 0.00 14 0 0 0 0
1.99/2.01 c impliedbounds : 0.00 7 0 0 0 0
1.99/2.01 c intobj : 0.00 0 0 0 0 0
1.99/2.01 c cgmip : 0.00 0 0 0 0 0
1.99/2.01 c gomory : 0.02 7 0 0 0 0
1.99/2.01 c strongcg : 0.02 7 0 0 309 0
1.99/2.01 c cmir : 0.00 0 0 0 0 0
1.99/2.01 c flowcover : 0.00 0 0 0 0 0
1.99/2.01 c clique : 0.00 7 0 0 34 0
1.99/2.01 c zerohalf : 0.00 0 0 0 0 0
1.99/2.01 c mcf : 0.00 3 0 0 0 0
1.99/2.01 c rapidlearning : 0.08 1 0 0 0 117
1.99/2.01 c Pricers : Time Calls Vars
1.99/2.01 c problem variables: 0.00 0 0
1.99/2.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.99/2.01 c relpscost : 1.80 37 2 102 0 0 8
1.99/2.01 c pscost : 0.00 0 0 0 0 0 0
1.99/2.01 c inference : 0.00 0 0 0 0 0 0
1.99/2.01 c mostinf : 0.00 0 0 0 0 0 0
1.99/2.01 c leastinf : 0.00 0 0 0 0 0 0
1.99/2.01 c fullstrong : 0.00 0 0 0 0 0 0
1.99/2.01 c allfullstrong : 0.00 0 0 0 0 0 0
1.99/2.01 c random : 0.00 0 0 0 0 0 0
1.99/2.01 c Primal Heuristics : Time Calls Found
1.99/2.01 c LP solutions : 0.00 - 1
1.99/2.01 c pseudo solutions : 0.00 - 0
1.99/2.01 c trivial : 0.00 1 0
1.99/2.01 c simplerounding : 0.00 0 0
1.99/2.01 c zirounding : 0.00 0 0
1.99/2.01 c rounding : 0.00 0 0
1.99/2.01 c shifting : 0.00 0 0
1.99/2.01 c intshifting : 0.00 0 0
1.99/2.01 c oneopt : 0.00 0 0
1.99/2.01 c twoopt : 0.00 0 0
1.99/2.01 c fixandinfer : 0.00 0 0
1.99/2.01 c feaspump : 0.00 0 0
1.99/2.01 c coefdiving : 0.00 0 0
1.99/2.01 c pscostdiving : 0.00 0 0
1.99/2.01 c fracdiving : 0.00 0 0
1.99/2.01 c veclendiving : 0.00 0 0
1.99/2.01 c intdiving : 0.00 0 0
1.99/2.01 c actconsdiving : 0.00 0 0
1.99/2.01 c objpscostdiving : 0.00 0 0
1.99/2.01 c rootsoldiving : 0.00 0 0
1.99/2.01 c linesearchdiving : 0.00 0 0
1.99/2.01 c guideddiving : 0.00 0 0
1.99/2.01 c octane : 0.00 0 0
1.99/2.01 c rens : 0.00 0 0
1.99/2.01 c rins : 0.00 0 0
1.99/2.01 c localbranching : 0.00 0 0
1.99/2.01 c mutation : 0.00 0 0
1.99/2.01 c crossover : 0.00 0 0
1.99/2.01 c dins : 0.00 0 0
1.99/2.01 c undercover : 0.00 0 0
1.99/2.02 c nlp : 0.00 0 0
1.99/2.02 c trysol : 0.00 0 0
1.99/2.02 c LP : Time Calls Iterations Iter/call Iter/sec
1.99/2.02 c primal LP : 0.00 0 0 0.00 -
1.99/2.02 c dual LP : 0.04 46 1211 26.33 28346.71
1.99/2.02 c lex dual LP : 0.00 0 0 0.00 -
1.99/2.02 c barrier LP : 0.00 0 0 0.00 -
1.99/2.02 c diving/probing LP: 0.00 0 0 0.00 -
1.99/2.02 c strong branching : 1.80 352 42594 121.01 23688.50
1.99/2.02 c (at root node) : - 233 35158 150.89 -
1.99/2.02 c conflict analysis: 0.00 0 0 0.00 -
1.99/2.02 c B&B Tree :
1.99/2.02 c number of runs : 3
1.99/2.02 c nodes : 8
1.99/2.02 c nodes (total) : 10
1.99/2.02 c nodes left : 0
1.99/2.02 c max depth : 4
1.99/2.02 c max depth (total): 4
1.99/2.02 c backtracks : 0 (0.0%)
1.99/2.02 c delayed cutoffs : 0
1.99/2.02 c repropagations : 2 (0 domain reductions, 0 cutoffs)
1.99/2.02 c avg switch length: 2.75
1.99/2.02 c switching time : 0.00
1.99/2.02 c Solution :
1.99/2.02 c Solutions found : 1 (1 improvements)
1.99/2.02 c First Solution : +0.00000000000000e+00 (in run 3, after 8 nodes, 2.01 seconds, depth 4, found by <relaxation>)
1.99/2.02 c Primal Bound : +0.00000000000000e+00 (in run 3, after 8 nodes, 2.01 seconds, depth 4, found by <relaxation>)
1.99/2.02 c Dual Bound : +0.00000000000000e+00
1.99/2.02 c Gap : 0.00 %
1.99/2.02 c Root Dual Bound : +0.00000000000000e+00
1.99/2.02 c Root Iterations : 793
1.99/2.02 c Time complete: 2.01.