0.00/0.00 c SCIP version 2.0.1.5 [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-3451220-1307067619.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.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.0.1.5
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 | 97 | - | 770k| 0 | 43 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 124 | - |1047k| 0 | 56 | 169 | 114 | 169 | 87 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 171 | - |1280k| 0 | 55 | 169 | 114 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 205 | - |1508k| 0 | 62 | 169 | 114 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 249 | - |1520k| 0 | 66 | 169 | 114 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 297 | - |1530k| 0 | 68 | 169 | 114 | 169 | 112 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 301 | - |1525k| 0 | 69 | 169 | 109 | 169 | 112 | 39 | 0 | 13 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 307 | - |1522k| 0 | 69 | 169 | 107 | 169 | 112 | 39 | 0 | 27 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.4s| 1 | 0 | 320 | - |1522k| 0 | 66 | 169 | 107 | 169 | 112 | 39 | 0 | 39 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 341 | - |1521k| 0 | 68 | 169 | 105 | 169 | 112 | 39 | 0 | 49 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.6s| 1 | 0 | 356 | - |1521k| 0 | 66 | 169 | 105 | 169 | 112 | 39 | 0 | 61 | 0.000000e+00 | -- | Inf
0.59/0.66 c 0.7s| 1 | 0 | 362 | - |1521k| 0 | 66 | 169 | 105 | 169 | 108 | 39 | 0 | 75 | 0.000000e+00 | -- | Inf
0.69/0.72 c 0.7s| 1 | 0 | 371 | - |1520k| 0 | 64 | 169 | 104 | 169 | 108 | 39 | 0 | 83 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 384 | - |1520k| 0 | 66 | 169 | 104 | 169 | 108 | 39 | 0 | 100 | 0.000000e+00 | -- | Inf
0.79/0.89 c 0.9s| 1 | 0 | 384 | - |1520k| 0 | - | 169 | 104 | 169 | 108 | 39 | 0 | 106 | 0.000000e+00 | -- | Inf
0.79/0.89 c (run 1, node 1) restarting after 38 global fixings of integer variables
0.79/0.89 c
0.79/0.89 c (restart) converted 35 cuts from the global cut pool into linear constraints
0.79/0.89 c
0.79/0.89 c presolving:
0.79/0.90 c (round 1) 38 del vars, 27 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 22 impls, 83 clqs
0.89/0.90 c (round 2) 38 del vars, 29 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 22 impls, 83 clqs
0.89/0.90 c (round 3) 38 del vars, 29 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 38 upgd conss, 22 impls, 83 clqs
0.89/0.90 c (round 4) 38 del vars, 31 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 38 upgd conss, 22 impls, 83 clqs
0.89/0.90 c presolving (5 rounds):
0.89/0.90 c 38 deleted vars, 31 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.89/0.90 c 22 implications, 83 cliques
0.89/0.90 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 108 constraints
0.89/0.90 c 14 constraints of type <knapsack>
0.89/0.90 c 89 constraints of type <setppc>
0.89/0.90 c 5 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.01
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 | 475 | - | 960k| 0 | 46 | 131 | 108 | 131 | 103 | 0 | 0 | 106 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.9s| 1 | 0 | 495 | - |1213k| 0 | 48 | 131 | 108 | 131 | 112 | 9 | 0 | 106 | 0.000000e+00 | -- | Inf
0.89/0.95 c 1.0s| 1 | 0 | 501 | - |1213k| 0 | 48 | 131 | 108 | 131 | 112 | 9 | 0 | 125 | 0.000000e+00 | -- | Inf
0.89/0.98 c 1.0s| 1 | 0 | 505 | - |1213k| 0 | 48 | 131 | 108 | 131 | 112 | 9 | 0 | 142 | 0.000000e+00 | -- | Inf
1.01/1.02 c 1.0s| 1 | 0 | 512 | - |1212k| 0 | 49 | 131 | 107 | 131 | 112 | 9 | 0 | 159 | 0.000000e+00 | -- | Inf
1.01/1.04 c 1.0s| 1 | 0 | 518 | - |1212k| 0 | 48 | 131 | 107 | 131 | 112 | 9 | 0 | 165 | 0.000000e+00 | -- | Inf
1.01/1.05 c 1.0s| 1 | 0 | 523 | - |1212k| 0 | 48 | 131 | 106 | 131 | 112 | 9 | 0 | 169 | 0.000000e+00 | -- | Inf
1.01/1.06 c 1.1s| 1 | 0 | 528 | - |1211k| 0 | 49 | 131 | 105 | 131 | 112 | 9 | 0 | 173 | 0.000000e+00 | -- | Inf
1.01/1.07 c 1.1s| 1 | 0 | 530 | - |1211k| 0 | 48 | 131 | 105 | 131 | 112 | 9 | 0 | 178 | 0.000000e+00 | -- | Inf
1.01/1.07 c 1.1s| 1 | 0 | 531 | - |1211k| 0 | 48 | 131 | 105 | 131 | 112 | 9 | 0 | 179 | 0.000000e+00 | -- | Inf
1.01/1.07 c 1.1s| 1 | 0 | 532 | - |1211k| 0 | 48 | 131 | 105 | 131 | 112 | 9 | 0 | 180 | 0.000000e+00 | -- | Inf
1.01/1.07 c 1.1s| 1 | 2 | 532 | - |1212k| 0 | 48 | 131 | 105 | 131 | 112 | 9 | 0 | 180 | 0.000000e+00 | -- | Inf
1.01/1.07 c (run 2, node 1) restarting after 21 global fixings of integer variables
1.01/1.07 c
1.01/1.07 c (restart) converted 6 cuts from the global cut pool into linear constraints
1.01/1.07 c
1.01/1.07 c presolving:
1.01/1.08 c (round 1) 21 del vars, 2 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 6 upgd conss, 26 impls, 82 clqs
1.01/1.08 c presolving (2 rounds):
1.01/1.08 c 21 deleted vars, 2 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.01/1.08 c 26 implications, 82 cliques
1.01/1.08 c presolved problem has 110 variables (110 bin, 0 int, 0 impl, 0 cont) and 109 constraints
1.01/1.08 c 18 constraints of type <knapsack>
1.01/1.08 c 86 constraints of type <setppc>
1.01/1.08 c 5 constraints of type <logicor>
1.01/1.08 c transformed objective value is always integral (scale: 1)
1.01/1.08 c Presolving Time: 0.02
1.01/1.08 c
1.01/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.01/1.08 c 1.1s| 1 | 0 | 602 | - | 958k| 0 | 43 | 110 | 109 | 110 | 104 | 0 | 0 | 180 | 0.000000e+00 | -- | Inf
1.01/1.09 c 1.1s| 1 | 0 | 625 | - |1206k| 0 | 55 | 110 | 109 | 110 | 116 | 12 | 0 | 180 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 2 | 625 | - |1206k| 0 | 55 | 110 | 109 | 110 | 116 | 12 | 0 | 197 | 0.000000e+00 | -- | Inf
1.49/1.52 c
1.49/1.52 c SCIP Status : problem is solved [infeasible]
1.49/1.52 c Solving Time (sec) : 1.52
1.49/1.52 c Solving Nodes : 13 (total of 15 nodes in 3 runs)
1.49/1.52 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.49/1.52 c Dual Bound : +1.00000000000000e+20
1.49/1.52 c Gap : 0.00 %
1.49/1.52 s UNSATISFIABLE
1.49/1.52 c SCIP Status : problem is solved [infeasible]
1.49/1.52 c Total Time : 1.52
1.49/1.52 c solving : 1.52
1.49/1.52 c presolving : 0.02 (included in solving)
1.49/1.52 c reading : 0.00 (included in solving)
1.49/1.52 c Original Problem :
1.49/1.52 c Problem name : HOME/instance-3451220-1307067619.opb
1.49/1.52 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.52 c Constraints : 101 initial, 101 maximal
1.49/1.52 c Presolved Problem :
1.49/1.52 c Problem name : t_HOME/instance-3451220-1307067619.opb
1.49/1.52 c Variables : 110 (110 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.52 c Constraints : 109 initial, 114 maximal
1.49/1.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.49/1.52 c trivial : 0.00 59 0 0 0 0 0 0 0 0
1.49/1.52 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.49/1.52 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.49/1.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.49/1.52 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
1.49/1.52 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.49/1.52 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.49/1.52 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
1.49/1.52 c setppc : 0.00 0 0 0 0 0 4 0 0 0
1.49/1.52 c linear : 0.00 0 0 0 0 0 57 0 2 0
1.49/1.52 c logicor : 0.00 0 0 0 0 0 0 0 0 0
1.49/1.52 c root node : - 107 - - 107 - - - - -
1.49/1.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.49/1.52 c integral : 0 0 0 65 0 3 0 4 196 0 0 14
1.49/1.52 c knapsack : 18 7 85 0 0 0 0 0 0 0 0 0
1.49/1.52 c setppc : 86 7 85 0 0 0 37 0 190 0 0 0
1.49/1.52 c logicor : 5+ 2 24 0 0 0 0 0 1 0 0 0
1.49/1.52 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
1.49/1.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.49/1.52 c integral : 1.37 0.00 0.00 1.37 0.00 0.00 0.00
1.49/1.52 c knapsack : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.52 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.52 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.52 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.49/1.52 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.49/1.52 c vbounds : 0 0 0 0
1.49/1.52 c rootredcost : 0 0 0 0
1.49/1.52 c pseudoobj : 0 0 0 0
1.49/1.52 c Propagator Timings : TotalTime Propagate Resprop
1.49/1.52 c vbounds : 0.00 0.00 0.00
1.49/1.52 c rootredcost : 0.00 0.00 0.00
1.49/1.52 c pseudoobj : 0.00 0.00 0.00
1.49/1.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.52 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.52 c infeasible LP : 0.00 3 2 5 19.0 0 0.0 0
1.49/1.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.52 c applied globally : - - - 5 19.0 - - -
1.49/1.52 c applied locally : - - - 0 0.0 - - -
1.49/1.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.52 c cut pool : 0.00 0 - - 0 - (maximal pool size: 92)
1.49/1.52 c redcost : 0.00 18 0 0 0 0
1.49/1.52 c impliedbounds : 0.00 7 0 0 0 0
1.49/1.52 c intobj : 0.00 0 0 0 0 0
1.49/1.52 c gomory : 0.02 7 0 0 12 0
1.49/1.52 c cgmip : 0.00 0 0 0 0 0
1.49/1.52 c closecuts : 0.00 0 0 0 0 0
1.49/1.52 c strongcg : 0.02 7 0 0 332 0
1.49/1.52 c cmir : 0.00 0 0 0 0 0
1.49/1.52 c flowcover : 0.00 0 0 0 0 0
1.49/1.52 c clique : 0.00 7 0 0 40 0
1.49/1.52 c zerohalf : 0.00 0 0 0 0 0
1.49/1.52 c mcf : 0.00 3 0 0 0 0
1.49/1.52 c oddcycle : 0.00 0 0 0 0 0
1.49/1.52 c rapidlearning : 0.02 1 0 0 0 41
1.49/1.52 c Pricers : Time Calls Vars
1.49/1.52 c problem variables: 0.00 0 0
1.49/1.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.52 c relpscost : 1.37 65 4 196 0 0 14
1.49/1.52 c pscost : 0.00 0 0 0 0 0 0
1.49/1.52 c inference : 0.00 0 0 0 0 0 0
1.49/1.52 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.52 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.52 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.52 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.52 c random : 0.00 0 0 0 0 0 0
1.49/1.52 c Primal Heuristics : Time Calls Found
1.49/1.52 c LP solutions : 0.00 - 0
1.49/1.52 c pseudo solutions : 0.00 - 0
1.49/1.52 c trivial : 0.00 1 0
1.49/1.52 c shiftandpropagate: 0.00 0 0
1.49/1.52 c simplerounding : 0.00 0 0
1.49/1.52 c zirounding : 0.00 0 0
1.49/1.52 c rounding : 0.00 0 0
1.49/1.52 c shifting : 0.00 0 0
1.49/1.52 c intshifting : 0.00 0 0
1.49/1.52 c oneopt : 0.00 0 0
1.49/1.52 c twoopt : 0.00 0 0
1.49/1.52 c fixandinfer : 0.00 0 0
1.49/1.52 c feaspump : 0.00 0 0
1.49/1.52 c clique : 0.00 0 0
1.49/1.52 c coefdiving : 0.00 0 0
1.49/1.52 c pscostdiving : 0.00 0 0
1.49/1.52 c fracdiving : 0.00 0 0
1.49/1.52 c veclendiving : 0.00 0 0
1.49/1.52 c intdiving : 0.00 0 0
1.49/1.52 c actconsdiving : 0.00 0 0
1.49/1.52 c objpscostdiving : 0.00 0 0
1.49/1.52 c rootsoldiving : 0.00 0 0
1.49/1.52 c linesearchdiving : 0.00 0 0
1.49/1.52 c guideddiving : 0.00 0 0
1.49/1.52 c octane : 0.00 0 0
1.49/1.52 c rens : 0.00 0 0
1.49/1.52 c rins : 0.00 0 0
1.49/1.52 c localbranching : 0.00 0 0
1.49/1.52 c mutation : 0.00 0 0
1.49/1.52 c crossover : 0.00 0 0
1.49/1.52 c dins : 0.00 0 0
1.49/1.52 c vbounds : 0.00 0 0
1.49/1.52 c undercover : 0.00 0 0
1.49/1.52 c subnlp : 0.00 0 0
1.49/1.52 c trysol : 0.00 0 0
1.49/1.52 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.52 c primal LP : 0.00 0 0 0.00 -
1.49/1.52 c dual LP : 0.04 75 1450 19.33 35403.85
1.49/1.52 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.52 c barrier LP : 0.00 0 0 0.00 -
1.49/1.52 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.52 c strong branching : 1.37 500 47264 94.53 34439.01
1.49/1.52 c (at root node) : - 197 31052 157.62 -
1.49/1.52 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.52 c B&B Tree :
1.49/1.52 c number of runs : 3
1.49/1.52 c nodes : 13
1.49/1.52 c nodes (total) : 15
1.49/1.52 c nodes left : 0
1.49/1.52 c max depth : 6
1.49/1.52 c max depth (total): 6
1.49/1.52 c backtracks : 1 (7.7%)
1.49/1.52 c delayed cutoffs : 0
1.49/1.52 c repropagations : 1 (17 domain reductions, 0 cutoffs)
1.49/1.52 c avg switch length: 2.00
1.49/1.52 c switching time : 0.00
1.49/1.52 c Solution :
1.49/1.52 c Solutions found : 0 (0 improvements)
1.49/1.52 c Primal Bound : infeasible
1.49/1.52 c Dual Bound : -
1.49/1.52 c Gap : 0.00 %
1.49/1.52 c Root Dual Bound : +0.00000000000000e+00
1.49/1.52 c Root Iterations : 625
1.49/1.53 c Time complete: 1.53.