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-3452846-1307067408.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 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.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 | 83 | - | 762k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 109 | - |1028k| 0 | 49 | 169 | 114 | 169 | 83 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 129 | - |1274k| 0 | 52 | 169 | 114 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 165 | - |1441k| 0 | 56 | 169 | 114 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 179 | - |1469k| 0 | 61 | 169 | 114 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 193 | - |1502k| 0 | 66 | 169 | 114 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.15 c 0.1s| 1 | 0 | 198 | - |1498k| 0 | 67 | 169 | 110 | 169 | 108 | 35 | 0 | 11 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 215 | - |1493k| 0 | 64 | 169 | 105 | 169 | 108 | 35 | 0 | 23 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 224 | - |1493k| 0 | 64 | 169 | 105 | 169 | 108 | 35 | 0 | 34 | 0.000000e+00 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 231 | - |1493k| 0 | 65 | 169 | 105 | 169 | 108 | 35 | 0 | 53 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 239 | - |1493k| 0 | 65 | 169 | 105 | 169 | 108 | 35 | 0 | 58 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 245 | - |1493k| 0 | 65 | 169 | 105 | 169 | 104 | 35 | 0 | 64 | 0.000000e+00 | -- | Inf
0.49/0.58 c 0.6s| 1 | 0 | 251 | - |1493k| 0 | 63 | 169 | 105 | 169 | 104 | 35 | 0 | 77 | 0.000000e+00 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 263 | - |1493k| 0 | 65 | 169 | 105 | 169 | 104 | 35 | 0 | 89 | 0.000000e+00 | -- | Inf
0.68/0.71 c 0.7s| 1 | 0 | 263 | - |1493k| 0 | - | 169 | 105 | 169 | 104 | 35 | 0 | 100 | 0.000000e+00 | -- | Inf
0.68/0.71 c (run 1, node 1) restarting after 34 global fixings of integer variables
0.68/0.71 c
0.68/0.71 c (restart) converted 31 cuts from the global cut pool into linear constraints
0.68/0.71 c
0.68/0.71 c presolving:
0.68/0.71 c (round 1) 34 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 62 upgd conss, 14 impls, 89 clqs
0.68/0.71 c (round 2) 34 del vars, 2 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 62 upgd conss, 14 impls, 89 clqs
0.68/0.72 c presolving (3 rounds):
0.68/0.72 c 34 deleted vars, 2 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.68/0.72 c 14 implications, 89 cliques
0.68/0.72 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 134 constraints
0.68/0.72 c 8 constraints of type <knapsack>
0.68/0.72 c 95 constraints of type <setppc>
0.68/0.72 c 31 constraints of type <logicor>
0.68/0.72 c transformed objective value is always integral (scale: 1)
0.68/0.72 c Presolving Time: 0.01
0.68/0.72 c
0.68/0.72 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.68/0.72 c 0.7s| 1 | 0 | 355 | - | 885k| 0 | 44 | 135 | 134 | 135 | 103 | 0 | 0 | 100 | 0.000000e+00 | -- | Inf
0.68/0.73 c 0.7s| 1 | 0 | 394 | - |1120k| 0 | 56 | 135 | 134 | 135 | 116 | 13 | 0 | 100 | 0.000000e+00 | -- | Inf
0.68/0.79 c 0.8s| 1 | 0 | 395 | - |1120k| 0 | 55 | 135 | 134 | 135 | 116 | 13 | 0 | 118 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 405 | - |1120k| 0 | 54 | 135 | 134 | 135 | 116 | 13 | 0 | 156 | 0.000000e+00 | -- | Inf
0.89/0.95 c 1.0s| 1 | 0 | 410 | - |1120k| 0 | 53 | 135 | 134 | 135 | 116 | 13 | 0 | 163 | 0.000000e+00 | -- | Inf
0.89/0.96 c 1.0s| 1 | 0 | 415 | - |1120k| 0 | 55 | 135 | 134 | 135 | 116 | 13 | 0 | 166 | 0.000000e+00 | -- | Inf
0.89/0.97 c 1.0s| 1 | 0 | 422 | - |1119k| 0 | 54 | 135 | 133 | 135 | 116 | 13 | 0 | 170 | 0.000000e+00 | -- | Inf
0.89/0.99 c 1.0s| 1 | 0 | 426 | - |1119k| 0 | 55 | 135 | 132 | 135 | 116 | 13 | 0 | 175 | 0.000000e+00 | -- | Inf
0.89/1.01 c 1.0s| 1 | 0 | 430 | - |1119k| 0 | 55 | 135 | 132 | 135 | 116 | 13 | 0 | 178 | 0.000000e+00 | -- | Inf
0.99/1.02 c 1.0s| 1 | 0 | 435 | - |1119k| 0 | 55 | 135 | 132 | 135 | 116 | 13 | 0 | 181 | 0.000000e+00 | -- | Inf
0.99/1.03 c 1.0s| 1 | 2 | 435 | - |1119k| 0 | 55 | 135 | 132 | 135 | 116 | 13 | 0 | 184 | 0.000000e+00 | -- | Inf
0.99/1.03 c (run 2, node 1) restarting after 18 global fixings of integer variables
0.99/1.03 c
0.99/1.03 c (restart) converted 9 cuts from the global cut pool into linear constraints
0.99/1.03 c
0.99/1.03 c presolving:
0.99/1.03 c (round 1) 18 del vars, 11 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 18 impls, 90 clqs
0.99/1.03 c (round 2) 18 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 18 impls, 90 clqs
0.99/1.03 c presolving (3 rounds):
0.99/1.03 c 18 deleted vars, 12 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.99/1.03 c 18 implications, 90 cliques
0.99/1.03 c presolved problem has 117 variables (117 bin, 0 int, 0 impl, 0 cont) and 129 constraints
0.99/1.03 c 13 constraints of type <knapsack>
0.99/1.03 c 94 constraints of type <setppc>
0.99/1.03 c 22 constraints of type <logicor>
0.99/1.03 c transformed objective value is always integral (scale: 1)
0.99/1.03 c Presolving Time: 0.02
0.99/1.03 c
0.99/1.04 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.04 c 1.0s| 1 | 0 | 509 | - | 906k| 0 | 48 | 117 | 129 | 117 | 107 | 0 | 0 | 184 | 0.000000e+00 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 528 | - |1127k| 0 | 55 | 117 | 129 | 117 | 118 | 11 | 0 | 184 | 0.000000e+00 | -- | Inf
0.99/1.11 c 1.1s| 1 | 0 | 529 | - |1127k| 0 | 54 | 117 | 129 | 117 | 118 | 11 | 0 | 202 | 0.000000e+00 | -- | Inf
1.19/1.21 c 1.2s| 1 | 0 | 537 | - |1127k| 0 | 56 | 117 | 128 | 117 | 118 | 11 | 0 | 239 | 0.000000e+00 | -- | Inf
1.19/1.23 c 1.2s| 1 | 2 | 537 | - |1127k| 0 | 56 | 117 | 128 | 117 | 118 | 11 | 0 | 244 | 0.000000e+00 | -- | Inf
1.79/1.87 c
1.79/1.87 c SCIP Status : problem is solved [infeasible]
1.79/1.87 c Solving Time (sec) : 1.86
1.79/1.87 c Solving Nodes : 25 (total of 27 nodes in 3 runs)
1.79/1.87 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.79/1.87 c Dual Bound : +1.00000000000000e+20
1.79/1.87 c Gap : 0.00 %
1.79/1.87 s UNSATISFIABLE
1.79/1.87 c SCIP Status : problem is solved [infeasible]
1.79/1.87 c Total Time : 1.86
1.79/1.87 c solving : 1.86
1.79/1.87 c presolving : 0.02 (included in solving)
1.79/1.87 c reading : 0.00 (included in solving)
1.79/1.87 c Original Problem :
1.79/1.87 c Problem name : HOME/instance-3452846-1307067408.opb
1.79/1.87 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.87 c Constraints : 101 initial, 101 maximal
1.79/1.87 c Presolved Problem :
1.79/1.87 c Problem name : t_HOME/instance-3452846-1307067408.opb
1.79/1.87 c Variables : 117 (117 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.87 c Constraints : 129 initial, 133 maximal
1.79/1.87 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.79/1.87 c trivial : 0.00 52 0 0 0 0 0 0 0 0
1.79/1.87 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.79/1.87 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.79/1.87 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.79/1.87 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.79/1.87 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.79/1.87 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
1.79/1.87 c setppc : 0.00 0 0 0 0 0 4 0 0 0
1.79/1.87 c linear : 0.00 0 0 0 0 0 29 0 0 0
1.79/1.87 c logicor : 0.00 0 0 0 0 0 9 0 0 0
1.79/1.87 c root node : - 121 - - 121 - - - - -
1.79/1.87 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.79/1.87 c integral : 0 0 0 89 0 3 0 9 235 0 0 26
1.79/1.87 c knapsack : 13 7 140 0 0 0 2 0 8 0 0 0
1.79/1.87 c setppc : 94 7 140 0 0 0 38 1 366 0 0 0
1.79/1.87 c logicor : 22+ 2 37 0 0 0 0 0 3 0 0 0
1.79/1.87 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
1.79/1.87 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.79/1.87 c integral : 1.70 0.00 0.00 1.70 0.00 0.00 0.00
1.79/1.87 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.79/1.87 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.79/1.87 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.79/1.87 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.79/1.87 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.79/1.87 c vbounds : 0 0 0 0
1.79/1.87 c rootredcost : 0 0 0 0
1.79/1.87 c pseudoobj : 0 0 0 0
1.79/1.87 c Propagator Timings : TotalTime Propagate Resprop
1.79/1.87 c vbounds : 0.00 0.00 0.00
1.79/1.87 c rootredcost : 0.00 0.00 0.00
1.79/1.87 c pseudoobj : 0.00 0.00 0.00
1.79/1.87 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.79/1.87 c propagation : 0.00 1 1 2 11.5 0 0.0 -
1.79/1.87 c infeasible LP : 0.00 3 3 6 7.0 0 0.0 0
1.79/1.87 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.87 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.87 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.87 c applied globally : - - - 6 8.7 - - -
1.79/1.87 c applied locally : - - - 0 0.0 - - -
1.79/1.87 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.79/1.87 c cut pool : 0.00 0 - - 0 - (maximal pool size: 78)
1.79/1.87 c redcost : 0.00 28 0 0 0 0
1.79/1.87 c impliedbounds : 0.00 7 0 0 0 0
1.79/1.87 c intobj : 0.00 0 0 0 0 0
1.79/1.87 c gomory : 0.02 7 0 0 0 0
1.79/1.87 c cgmip : 0.00 0 0 0 0 0
1.79/1.87 c closecuts : 0.00 0 0 0 0 0
1.79/1.87 c strongcg : 0.02 7 0 0 323 0
1.79/1.87 c cmir : 0.00 0 0 0 0 0
1.79/1.87 c flowcover : 0.00 0 0 0 0 0
1.79/1.87 c clique : 0.00 7 0 0 45 0
1.79/1.87 c zerohalf : 0.00 0 0 0 0 0
1.79/1.87 c mcf : 0.00 3 0 0 0 0
1.79/1.87 c oddcycle : 0.00 0 0 0 0 0
1.79/1.87 c rapidlearning : 0.02 1 0 0 0 41
1.79/1.87 c Pricers : Time Calls Vars
1.79/1.87 c problem variables: 0.00 0 0
1.79/1.87 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.79/1.87 c relpscost : 1.70 89 9 235 0 0 26
1.79/1.87 c pscost : 0.00 0 0 0 0 0 0
1.79/1.87 c inference : 0.00 0 0 0 0 0 0
1.79/1.87 c mostinf : 0.00 0 0 0 0 0 0
1.79/1.87 c leastinf : 0.00 0 0 0 0 0 0
1.79/1.87 c fullstrong : 0.00 0 0 0 0 0 0
1.79/1.87 c allfullstrong : 0.00 0 0 0 0 0 0
1.79/1.87 c random : 0.00 0 0 0 0 0 0
1.79/1.87 c Primal Heuristics : Time Calls Found
1.79/1.87 c LP solutions : 0.00 - 0
1.79/1.87 c pseudo solutions : 0.00 - 0
1.79/1.87 c trivial : 0.00 1 0
1.79/1.87 c shiftandpropagate: 0.00 0 0
1.79/1.87 c simplerounding : 0.00 0 0
1.79/1.87 c zirounding : 0.00 0 0
1.79/1.87 c rounding : 0.00 0 0
1.79/1.87 c shifting : 0.00 0 0
1.79/1.87 c intshifting : 0.00 0 0
1.79/1.87 c oneopt : 0.00 0 0
1.79/1.87 c twoopt : 0.00 0 0
1.79/1.87 c fixandinfer : 0.00 0 0
1.79/1.87 c feaspump : 0.00 0 0
1.79/1.87 c clique : 0.00 0 0
1.79/1.87 c coefdiving : 0.00 0 0
1.79/1.87 c pscostdiving : 0.00 0 0
1.79/1.87 c fracdiving : 0.00 0 0
1.79/1.87 c veclendiving : 0.00 0 0
1.79/1.87 c intdiving : 0.00 0 0
1.79/1.87 c actconsdiving : 0.00 0 0
1.79/1.87 c objpscostdiving : 0.00 0 0
1.79/1.87 c rootsoldiving : 0.00 0 0
1.79/1.87 c linesearchdiving : 0.00 0 0
1.79/1.87 c guideddiving : 0.00 0 0
1.79/1.87 c octane : 0.00 0 0
1.79/1.87 c rens : 0.00 0 0
1.79/1.87 c rins : 0.00 0 0
1.79/1.87 c localbranching : 0.00 0 0
1.79/1.87 c mutation : 0.00 0 0
1.79/1.87 c crossover : 0.00 0 0
1.79/1.87 c dins : 0.00 0 0
1.79/1.87 c vbounds : 0.00 0 0
1.79/1.87 c undercover : 0.00 0 0
1.79/1.87 c subnlp : 0.00 0 0
1.79/1.87 c trysol : 0.00 0 0
1.79/1.87 c LP : Time Calls Iterations Iter/call Iter/sec
1.79/1.87 c primal LP : 0.00 0 0 0.00 -
1.79/1.87 c dual LP : 0.05 99 1658 16.75 31055.09
1.79/1.87 c lex dual LP : 0.00 0 0 0.00 -
1.79/1.87 c barrier LP : 0.00 0 0 0.00 -
1.79/1.87 c diving/probing LP: 0.00 0 0 0.00 -
1.79/1.87 c strong branching : 1.70 744 54567 73.34 32155.47
1.79/1.87 c (at root node) : - 244 32005 131.17 -
1.79/1.87 c conflict analysis: 0.00 0 0 0.00 -
1.79/1.87 c B&B Tree :
1.79/1.87 c number of runs : 3
1.79/1.87 c nodes : 25
1.79/1.87 c nodes (total) : 27
1.79/1.87 c nodes left : 0
1.79/1.87 c max depth : 11
1.79/1.87 c max depth (total): 11
1.79/1.87 c backtracks : 1 (4.0%)
1.79/1.87 c delayed cutoffs : 0
1.79/1.87 c repropagations : 22 (3 domain reductions, 0 cutoffs)
1.79/1.87 c avg switch length: 5.20
1.79/1.87 c switching time : 0.00
1.79/1.87 c Solution :
1.79/1.87 c Solutions found : 0 (0 improvements)
1.79/1.87 c Primal Bound : infeasible
1.79/1.87 c Dual Bound : -
1.79/1.87 c Gap : 0.00 %
1.79/1.87 c Root Dual Bound : +0.00000000000000e+00
1.79/1.87 c Root Iterations : 537
1.79/1.87 c Time complete: 1.86.