0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3452852-1307067414.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.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.0.1.4
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 = 1800
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 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 <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 # 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.02 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.02 c 0.0s| 1 | 0 | 172 | - | 762k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.05 c 0.0s| 1 | 0 | 192 | - |1228k| 0 | 53 | 169 | 102 | 169 | 87 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.06 c 0.1s| 1 | 0 | 210 | - |1238k| 0 | 55 | 169 | 102 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.06 c 0.1s| 1 | 0 | 226 | - |1251k| 0 | 56 | 169 | 102 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.07 c 0.1s| 1 | 0 | 237 | - |1257k| 0 | 58 | 169 | 102 | 169 | 106 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.08 c 0.1s| 1 | 0 | 240 | - |1258k| 0 | 59 | 169 | 102 | 169 | 107 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.21 c 0.2s| 1 | 0 | 259 | - |1242k| 0 | 60 | 169 | 89 | 169 | 107 | 34 | 0 | 14 | 0.000000e+00 | -- | Inf
0.28/0.36 c 0.4s| 1 | 0 | 272 | - |1240k| 0 | 56 | 169 | 87 | 169 | 107 | 34 | 0 | 28 | 0.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 0 | 296 | - |1240k| 0 | 52 | 169 | 87 | 169 | 107 | 34 | 0 | 38 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 313 | - |1240k| 0 | 54 | 169 | 87 | 169 | 107 | 34 | 0 | 50 | 0.000000e+00 | -- | Inf
0.58/0.64 c 0.6s| 1 | 0 | 323 | - |1240k| 0 | 54 | 169 | 87 | 169 | 107 | 34 | 0 | 55 | 0.000000e+00 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 365 | - |1240k| 0 | 54 | 169 | 87 | 169 | 101 | 34 | 0 | 67 | 0.000000e+00 | -- | Inf
0.78/0.84 c 0.8s| 1 | 0 | 379 | - |1240k| 0 | 53 | 169 | 87 | 169 | 101 | 34 | 0 | 77 | 0.000000e+00 | -- | Inf
0.78/0.89 c 0.9s| 1 | 0 | 379 | - |1240k| 0 | - | 169 | 87 | 169 | 101 | 34 | 0 | 83 | 0.000000e+00 | -- | Inf
0.78/0.89 c (run 1, node 1) restarting after 37 global fixings of integer variables
0.78/0.89 c
0.78/0.89 c (restart) converted 28 cuts from the global cut pool into linear constraints
0.78/0.89 c
0.78/0.89 c presolving:
0.78/0.89 c (round 1) 37 del vars, 2 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 82 clqs
0.78/0.89 c (round 2) 37 del vars, 2 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 40 upgd conss, 14 impls, 82 clqs
0.89/0.90 c (round 3) 37 del vars, 3 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 40 upgd conss, 14 impls, 82 clqs
0.89/0.90 c presolving (4 rounds):
0.89/0.90 c 37 deleted vars, 3 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.89/0.90 c 14 implications, 82 cliques
0.89/0.90 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 112 constraints
0.89/0.90 c 12 constraints of type <knapsack>
0.89/0.90 c 86 constraints of type <setppc>
0.89/0.90 c 14 constraints of type <logicor>
0.89/0.90 c transformed objective value is always integral (scale: 1)
0.89/0.90 c Presolving Time: 0.02
0.89/0.90 c
0.89/0.90 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.90 c 0.9s| 1 | 0 | 464 | - | 972k| 0 | 45 | 132 | 112 | 132 | 98 | 0 | 0 | 83 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.9s| 1 | 0 | 499 | - |1185k| 0 | 51 | 132 | 112 | 132 | 110 | 12 | 0 | 83 | 0.000000e+00 | -- | Inf
0.89/0.97 c 1.0s| 1 | 0 | 510 | - |1185k| 0 | 48 | 132 | 112 | 132 | 110 | 12 | 0 | 104 | 0.000000e+00 | -- | Inf
0.89/1.00 c 1.0s| 1 | 0 | 522 | - |1185k| 0 | 48 | 132 | 111 | 132 | 110 | 12 | 0 | 115 | 0.000000e+00 | -- | Inf
1.00/1.02 c 1.0s| 1 | 0 | 545 | - |1184k| 0 | 49 | 132 | 110 | 132 | 110 | 12 | 0 | 121 | 0.000000e+00 | -- | Inf
1.00/1.03 c 1.0s| 1 | 0 | 554 | - |1184k| 0 | 49 | 132 | 110 | 132 | 110 | 12 | 0 | 126 | 0.000000e+00 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 572 | - |1184k| 0 | 47 | 132 | 110 | 132 | 110 | 12 | 0 | 131 | 0.000000e+00 | -- | Inf
1.00/1.06 c 1.1s| 1 | 0 | 572 | - |1184k| 0 | - | 132 | 110 | 132 | 110 | 12 | 0 | 138 | 0.000000e+00 | -- | Inf
1.00/1.06 c (run 2, node 1) restarting after 29 global fixings of integer variables
1.00/1.06 c
1.00/1.06 c (restart) converted 12 cuts from the global cut pool into linear constraints
1.00/1.06 c
1.00/1.06 c presolving:
1.00/1.07 c (round 1) 49 del vars, 13 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 38 impls, 69 clqs
1.00/1.07 c (round 2) 49 del vars, 19 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 38 impls, 69 clqs
1.00/1.07 c presolving (3 rounds):
1.00/1.07 c 49 deleted vars, 19 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.00/1.07 c 38 implications, 69 cliques
1.00/1.07 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 103 constraints
1.00/1.07 c 20 constraints of type <knapsack>
1.00/1.07 c 79 constraints of type <setppc>
1.00/1.07 c 4 constraints of type <logicor>
1.00/1.07 c transformed objective value is always integral (scale: 1)
1.00/1.07 c Presolving Time: 0.03
1.00/1.07 c
1.00/1.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.08 c 1.1s| 1 | 0 | 636 | - | 942k| 0 | 38 | 83 | 103 | 83 | 99 | 0 | 0 | 138 | 0.000000e+00 | -- | Inf
1.00/1.09 c 1.1s| 1 | 0 | 667 | - |1241k| 0 | 48 | 83 | 103 | 83 | 112 | 13 | 0 | 138 | 0.000000e+00 | -- | Inf
1.11/1.12 c 1.1s| 1 | 0 | 840 | - |1240k| 0 | 0 | 83 | 101 | 83 | 112 | 13 | 0 | 144 | 0.000000e+00 | -- | Inf
1.11/1.12 c * 1.1s| 1 | 0 | 840 | - |1242k| 0 | - | 83 | 101 | 83 | 112 | 13 | 0 | 144 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.11/1.12 c
1.11/1.12 c SCIP Status : problem is solved [optimal solution found]
1.11/1.12 c Solving Time (sec) : 1.12
1.11/1.12 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.11/1.12 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.11/1.12 c Dual Bound : +0.00000000000000e+00
1.11/1.12 c Gap : 0.00 %
1.11/1.12 s SATISFIABLE
1.11/1.12 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.11/1.12 v x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
1.11/1.12 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106
1.11/1.12 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.11/1.12 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.11/1.12 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.11/1.12 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.11/1.12 v -x4 -x3 -x2 -x1
1.11/1.12 c SCIP Status : problem is solved [optimal solution found]
1.11/1.12 c Total Time : 1.12
1.11/1.12 c solving : 1.12
1.11/1.12 c presolving : 0.03 (included in solving)
1.11/1.12 c reading : 0.00 (included in solving)
1.11/1.12 c Original Problem :
1.11/1.12 c Problem name : HOME/instance-3452852-1307067414.opb
1.11/1.12 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.11/1.12 c Constraints : 101 initial, 101 maximal
1.11/1.12 c Presolved Problem :
1.11/1.12 c Problem name : t_HOME/instance-3452852-1307067414.opb
1.11/1.12 c Variables : 83 (83 binary, 0 integer, 0 implicit integer, 0 continuous)
1.11/1.12 c Constraints : 103 initial, 103 maximal
1.11/1.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.11/1.12 c trivial : 0.00 66 0 0 0 0 0 0 0 0
1.11/1.12 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.11/1.12 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.11/1.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.11/1.12 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.11/1.12 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.11/1.12 c knapsack : 0.02 0 0 0 0 0 0 0 0 0
1.11/1.12 c setppc : 0.00 20 0 0 0 0 11 0 0 0
1.11/1.12 c linear : 0.00 0 0 0 0 0 30 0 2 0
1.11/1.12 c logicor : 0.00 0 0 0 0 0 9 0 0 0
1.11/1.12 c root node : - 71 - - 71 - - - - -
1.11/1.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.11/1.12 c integral : 0 0 0 16 0 6 0 0 71 0 0 0
1.11/1.12 c knapsack : 20 7 16 1 0 1 0 0 0 0 0 0
1.11/1.12 c setppc : 79 7 16 1 0 1 0 0 0 0 0 0
1.11/1.12 c logicor : 4 2 5 0 0 0 0 0 0 0 0 0
1.11/1.12 c countsols : 0 0 0 1 0 3 0 0 0 0 0 0
1.11/1.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.11/1.12 c integral : 0.98 0.00 0.00 0.98 0.00 0.00 0.00
1.11/1.12 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
1.11/1.12 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.11/1.12 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.11/1.12 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.11/1.12 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.11/1.12 c vbounds : 0 0 0 0
1.11/1.12 c rootredcost : 0 0 0 0
1.11/1.12 c pseudoobj : 0 0 0 0
1.11/1.12 c Propagator Timings : TotalTime Propagate Resprop
1.11/1.12 c vbounds : 0.00 0.00 0.00
1.11/1.12 c rootredcost : 0.00 0.00 0.00
1.11/1.12 c pseudoobj : 0.00 0.00 0.00
1.11/1.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.11/1.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.11/1.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.11/1.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.11/1.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.11/1.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.11/1.12 c applied globally : - - - 0 0.0 - - -
1.11/1.12 c applied locally : - - - 0 0.0 - - -
1.11/1.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.11/1.12 c cut pool : 0.00 0 - - 0 - (maximal pool size: 128)
1.11/1.12 c redcost : 0.00 7 0 0 0 0
1.11/1.12 c impliedbounds : 0.00 7 0 0 0 0
1.11/1.12 c intobj : 0.00 0 0 0 0 0
1.11/1.12 c gomory : 0.03 7 0 0 109 0
1.11/1.12 c cgmip : 0.00 0 0 0 0 0
1.11/1.12 c closecuts : 0.00 0 0 0 0 0
1.11/1.12 c strongcg : 0.02 7 0 0 204 0
1.11/1.12 c cmir : 0.00 0 0 0 0 0
1.11/1.12 c flowcover : 0.00 0 0 0 0 0
1.11/1.12 c clique : 0.00 7 0 0 29 0
1.11/1.12 c zerohalf : 0.00 0 0 0 0 0
1.11/1.12 c mcf : 0.00 3 0 0 0 0
1.11/1.12 c oddcycle : 0.00 0 0 0 0 0
1.11/1.12 c rapidlearning : 0.02 1 0 0 0 29
1.11/1.12 c Pricers : Time Calls Vars
1.11/1.12 c problem variables: 0.00 0 0
1.11/1.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.11/1.12 c relpscost : 0.98 15 0 71 0 0 0
1.11/1.12 c pscost : 0.00 0 0 0 0 0 0
1.11/1.12 c inference : 0.00 0 0 0 0 0 0
1.11/1.12 c mostinf : 0.00 0 0 0 0 0 0
1.11/1.12 c leastinf : 0.00 0 0 0 0 0 0
1.11/1.12 c fullstrong : 0.00 0 0 0 0 0 0
1.11/1.12 c allfullstrong : 0.00 0 0 0 0 0 0
1.11/1.12 c random : 0.00 0 0 0 0 0 0
1.11/1.12 c Primal Heuristics : Time Calls Found
1.11/1.12 c LP solutions : 0.00 - 0
1.11/1.12 c pseudo solutions : 0.00 - 0
1.11/1.12 c trivial : 0.00 1 0
1.11/1.12 c shiftandpropagate: 0.00 0 0
1.11/1.12 c simplerounding : 0.00 0 0
1.11/1.12 c zirounding : 0.00 0 0
1.11/1.12 c rounding : 0.00 0 0
1.11/1.12 c shifting : 0.00 0 0
1.11/1.12 c intshifting : 0.00 0 0
1.11/1.12 c oneopt : 0.00 0 0
1.11/1.12 c twoopt : 0.00 0 0
1.11/1.12 c fixandinfer : 0.00 0 0
1.11/1.12 c feaspump : 0.00 0 0
1.11/1.12 c clique : 0.00 0 0
1.11/1.12 c coefdiving : 0.00 0 0
1.11/1.12 c pscostdiving : 0.00 0 0
1.11/1.12 c fracdiving : 0.00 0 0
1.11/1.12 c veclendiving : 0.00 0 0
1.11/1.12 c intdiving : 0.00 0 0
1.11/1.12 c actconsdiving : 0.00 0 0
1.11/1.12 c objpscostdiving : 0.00 0 0
1.11/1.12 c rootsoldiving : 0.00 0 0
1.11/1.12 c linesearchdiving : 0.00 0 0
1.11/1.12 c guideddiving : 0.00 0 0
1.11/1.12 c octane : 0.00 0 0
1.11/1.12 c rens : 0.00 0 0
1.11/1.12 c rins : 0.00 0 0
1.11/1.12 c localbranching : 0.00 0 0
1.11/1.12 c mutation : 0.00 0 0
1.11/1.12 c crossover : 0.00 0 0
1.11/1.12 c dins : 0.00 0 0
1.11/1.12 c vbounds : 0.00 0 0
1.11/1.12 c undercover : 0.00 0 0
1.11/1.12 c subnlp : 0.00 0 0
1.11/1.12 c trysol : 0.00 0 0
1.11/1.12 c LP : Time Calls Iterations Iter/call Iter/sec
1.11/1.12 c primal LP : 0.00 0 0 0.00 -
1.11/1.12 c dual LP : 0.03 23 840 36.52 31770.05
1.11/1.12 c lex dual LP : 0.00 0 0 0.00 -
1.11/1.12 c barrier LP : 0.00 0 0 0.00 -
1.11/1.12 c diving/probing LP: 0.00 0 0 0.00 -
1.11/1.12 c strong branching : 0.98 144 28866 200.46 29561.71
1.11/1.12 c (at root node) : - 144 28866 200.46 -
1.11/1.12 c conflict analysis: 0.00 0 0 0.00 -
1.11/1.12 c B&B Tree :
1.11/1.12 c number of runs : 3
1.11/1.12 c nodes : 1
1.11/1.12 c nodes (total) : 3
1.11/1.12 c nodes left : 0
1.11/1.12 c max depth : 0
1.11/1.12 c max depth (total): 0
1.11/1.12 c backtracks : 0 (0.0%)
1.11/1.12 c delayed cutoffs : 0
1.11/1.12 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.11/1.12 c avg switch length: 2.00
1.11/1.12 c switching time : 0.00
1.11/1.12 c Solution :
1.11/1.12 c Solutions found : 1 (1 improvements)
1.11/1.12 c First Solution : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.12 seconds, depth 0, found by <relaxation>)
1.11/1.12 c Primal Bound : +0.00000000000000e+00 (in run 3, after 1 nodes, 1.12 seconds, depth 0, found by <relaxation>)
1.11/1.12 c Dual Bound : +0.00000000000000e+00
1.11/1.12 c Gap : 0.00 %
1.11/1.12 c Root Dual Bound : +0.00000000000000e+00
1.11/1.12 c Root Iterations : 840
1.11/1.13 c Time complete: 1.12.