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-3452790-1307067370.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.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 | 95 | - | 762k| 0 | 39 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 125 | - |1008k| 0 | 51 | 169 | 116 | 169 | 88 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 175 | - |1161k| 0 | 56 | 169 | 116 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 205 | - |1199k| 0 | 59 | 169 | 116 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 225 | - |1273k| 0 | 62 | 169 | 116 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.06/0.08 c 0.1s| 1 | 0 | 257 | - |1414k| 0 | 63 | 169 | 116 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 269 | - |1407k| 0 | 66 | 169 | 109 | 169 | 111 | 38 | 0 | 12 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 275 | - |1407k| 0 | 66 | 169 | 109 | 169 | 111 | 38 | 0 | 23 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 299 | - |1402k| 0 | 61 | 169 | 105 | 169 | 111 | 38 | 0 | 33 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 0 | 312 | - |1384k| 0 | 60 | 169 | 87 | 169 | 111 | 38 | 0 | 42 | 0.000000e+00 | -- | Inf
0.38/0.43 c 0.4s| 1 | 0 | 335 | - |1369k| 0 | 57 | 169 | 75 | 169 | 111 | 38 | 0 | 47 | 0.000000e+00 | -- | Inf
0.38/0.49 c 0.5s| 1 | 0 | 347 | - |1369k| 0 | 57 | 169 | 75 | 169 | 101 | 38 | 0 | 58 | 0.000000e+00 | -- | Inf
0.48/0.53 c 0.5s| 1 | 0 | 372 | - |1369k| 0 | 55 | 169 | 75 | 169 | 101 | 38 | 0 | 70 | 0.000000e+00 | -- | Inf
0.48/0.55 c 0.5s| 1 | 0 | 372 | - |1369k| 0 | - | 169 | 75 | 169 | 101 | 38 | 0 | 79 | 0.000000e+00 | -- | Inf
0.48/0.55 c (run 1, node 1) restarting after 35 global fixings of integer variables
0.48/0.55 c
0.48/0.55 c (restart) converted 28 cuts from the global cut pool into linear constraints
0.48/0.55 c
0.48/0.55 c presolving:
0.48/0.55 c (round 1) 35 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 87 clqs
0.48/0.56 c (round 2) 35 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 29 upgd conss, 14 impls, 87 clqs
0.48/0.56 c (round 3) 35 del vars, 2 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 29 upgd conss, 14 impls, 87 clqs
0.48/0.56 c presolving (4 rounds):
0.48/0.56 c 35 deleted vars, 2 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.48/0.56 c 14 implications, 87 cliques
0.48/0.56 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.48/0.56 c 7 constraints of type <knapsack>
0.48/0.56 c 92 constraints of type <setppc>
0.48/0.56 c 2 constraints of type <logicor>
0.48/0.56 c transformed objective value is always integral (scale: 1)
0.48/0.56 c Presolving Time: 0.01
0.48/0.56 c
0.48/0.56 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.48/0.56 c 0.6s| 1 | 0 | 467 | - | 839k| 0 | 40 | 134 | 101 | 134 | 99 | 0 | 0 | 79 | 0.000000e+00 | -- | Inf
0.48/0.57 c 0.6s| 1 | 0 | 494 | - |1104k| 0 | 51 | 134 | 101 | 134 | 108 | 9 | 0 | 79 | 0.000000e+00 | -- | Inf
0.58/0.61 c 0.6s| 1 | 0 | 510 | - |1103k| 0 | 51 | 134 | 101 | 134 | 108 | 9 | 0 | 100 | 0.000000e+00 | -- | Inf
0.58/0.64 c 0.6s| 1 | 0 | 542 | - |1103k| 0 | 48 | 134 | 101 | 134 | 108 | 9 | 0 | 117 | 0.000000e+00 | -- | Inf
0.58/0.66 c 0.7s| 1 | 0 | 563 | - |1103k| 0 | 49 | 134 | 101 | 134 | 108 | 9 | 0 | 125 | 0.000000e+00 | -- | Inf
0.58/0.67 c 0.7s| 1 | 0 | 580 | - |1103k| 0 | 48 | 134 | 100 | 134 | 108 | 9 | 0 | 131 | 0.000000e+00 | -- | Inf
0.58/0.67 c 0.7s| 1 | 0 | 589 | - |1103k| 0 | 50 | 134 | 99 | 134 | 108 | 9 | 0 | 137 | 0.000000e+00 | -- | Inf
0.58/0.68 c 0.7s| 1 | 0 | 589 | - |1103k| 0 | - | 134 | 99 | 134 | 108 | 9 | 0 | 142 | 0.000000e+00 | -- | Inf
0.58/0.68 c (run 2, node 1) restarting after 30 global fixings of integer variables
0.58/0.68 c
0.58/0.68 c (restart) converted 9 cuts from the global cut pool into linear constraints
0.58/0.68 c
0.58/0.68 c presolving:
0.58/0.68 c (round 1) 33 del vars, 4 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 24 impls, 81 clqs
0.58/0.69 c (round 2) 33 del vars, 7 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 24 impls, 81 clqs
0.58/0.69 c (round 3) 33 del vars, 9 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 24 impls, 81 clqs
0.58/0.69 c presolving (4 rounds):
0.58/0.69 c 33 deleted vars, 9 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.58/0.69 c 24 implications, 81 cliques
0.58/0.69 c presolved problem has 101 variables (101 bin, 0 int, 0 impl, 0 cont) and 99 constraints
0.58/0.69 c 11 constraints of type <knapsack>
0.58/0.69 c 86 constraints of type <setppc>
0.58/0.69 c 2 constraints of type <logicor>
0.58/0.69 c transformed objective value is always integral (scale: 1)
0.58/0.69 c Presolving Time: 0.02
0.58/0.69 c
0.58/0.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.58/0.69 c 0.7s| 1 | 0 | 662 | - | 835k| 0 | 42 | 101 | 99 | 101 | 97 | 0 | 0 | 142 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 688 | - |1090k| 0 | 45 | 101 | 99 | 101 | 106 | 9 | 0 | 142 | 0.000000e+00 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 719 | - |1089k| 0 | 40 | 101 | 99 | 101 | 106 | 9 | 0 | 151 | 0.000000e+00 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 719 | - |1089k| 0 | 40 | 101 | 99 | 101 | 106 | 9 | 0 | 152 | cutoff | -- | 0.00%
0.69/0.71 c
0.69/0.71 c SCIP Status : problem is solved [infeasible]
0.69/0.71 c Solving Time (sec) : 0.71
0.69/0.71 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.69/0.71 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.69/0.71 c Dual Bound : +1.00000000000000e+20
0.69/0.71 c Gap : 0.00 %
0.69/0.71 s UNSATISFIABLE
0.69/0.71 c SCIP Status : problem is solved [infeasible]
0.69/0.71 c Total Time : 0.71
0.69/0.72 c solving : 0.71
0.69/0.72 c presolving : 0.02 (included in solving)
0.69/0.72 c reading : 0.00 (included in solving)
0.69/0.72 c Original Problem :
0.69/0.72 c Problem name : HOME/instance-3452790-1307067370.opb
0.69/0.72 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.72 c Constraints : 101 initial, 101 maximal
0.69/0.72 c Presolved Problem :
0.69/0.72 c Problem name : t_HOME/instance-3452790-1307067370.opb
0.69/0.72 c Variables : 101 (101 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.72 c Constraints : 99 initial, 99 maximal
0.69/0.72 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.69/0.72 c trivial : 0.00 65 0 0 0 0 0 0 0 0
0.69/0.72 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.72 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.72 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.72 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.72 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.72 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
0.69/0.72 c setppc : 0.00 0 1 0 0 0 10 0 0 0
0.69/0.72 c linear : 0.00 2 0 0 0 0 29 0 1 0
0.69/0.72 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.69/0.72 c root node : - 70 - - 70 - - - - -
0.69/0.72 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.69/0.72 c integral : 0 0 0 16 0 3 0 1 70 0 0 0
0.69/0.72 c knapsack : 11 7 16 0 0 0 0 0 0 0 0 0
0.69/0.72 c setppc : 86 7 16 0 0 0 0 0 0 0 0 0
0.69/0.72 c logicor : 2 2 2 0 0 0 0 0 0 0 0 0
0.69/0.72 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.69/0.72 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.69/0.72 c integral : 0.59 0.00 0.00 0.59 0.00 0.00 0.00
0.69/0.72 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.72 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.72 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.72 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.72 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.69/0.72 c vbounds : 0 0 0 0
0.69/0.72 c rootredcost : 0 0 0 0
0.69/0.72 c pseudoobj : 0 0 0 0
0.69/0.72 c Propagator Timings : TotalTime Propagate Resprop
0.69/0.72 c vbounds : 0.00 0.00 0.00
0.69/0.72 c rootredcost : 0.00 0.00 0.00
0.69/0.72 c pseudoobj : 0.00 0.00 0.00
0.69/0.72 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.72 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.72 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.72 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.72 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.72 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.72 c applied globally : - - - 0 0.0 - - -
0.69/0.72 c applied locally : - - - 0 0.0 - - -
0.69/0.72 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.72 c cut pool : 0.00 0 - - 0 - (maximal pool size: 92)
0.69/0.72 c redcost : 0.00 7 0 0 0 0
0.69/0.72 c impliedbounds : 0.00 7 0 0 0 0
0.69/0.72 c intobj : 0.00 0 0 0 0 0
0.69/0.72 c gomory : 0.02 7 0 0 16 0
0.69/0.72 c cgmip : 0.00 0 0 0 0 0
0.69/0.72 c closecuts : 0.00 0 0 0 0 0
0.69/0.72 c strongcg : 0.02 7 0 0 297 0
0.69/0.72 c cmir : 0.00 0 0 0 0 0
0.69/0.72 c flowcover : 0.00 0 0 0 0 0
0.69/0.72 c clique : 0.00 7 0 0 35 0
0.69/0.72 c zerohalf : 0.00 0 0 0 0 0
0.69/0.72 c mcf : 0.00 3 0 0 0 0
0.69/0.72 c oddcycle : 0.00 0 0 0 0 0
0.69/0.72 c rapidlearning : 0.02 1 0 0 0 43
0.69/0.72 c Pricers : Time Calls Vars
0.69/0.72 c problem variables: 0.00 0 0
0.69/0.72 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.72 c relpscost : 0.59 16 1 70 0 0 0
0.69/0.72 c pscost : 0.00 0 0 0 0 0 0
0.69/0.72 c inference : 0.00 0 0 0 0 0 0
0.69/0.72 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.72 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.72 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.72 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.72 c random : 0.00 0 0 0 0 0 0
0.69/0.72 c Primal Heuristics : Time Calls Found
0.69/0.72 c LP solutions : 0.00 - 0
0.69/0.72 c pseudo solutions : 0.00 - 0
0.69/0.72 c trivial : 0.00 1 0
0.69/0.72 c shiftandpropagate: 0.00 0 0
0.69/0.72 c simplerounding : 0.00 0 0
0.69/0.72 c zirounding : 0.00 0 0
0.69/0.72 c rounding : 0.00 0 0
0.69/0.72 c shifting : 0.00 0 0
0.69/0.72 c intshifting : 0.00 0 0
0.69/0.72 c oneopt : 0.00 0 0
0.69/0.72 c twoopt : 0.00 0 0
0.69/0.72 c fixandinfer : 0.00 0 0
0.69/0.72 c feaspump : 0.00 0 0
0.69/0.72 c clique : 0.00 0 0
0.69/0.72 c coefdiving : 0.00 0 0
0.69/0.72 c pscostdiving : 0.00 0 0
0.69/0.72 c fracdiving : 0.00 0 0
0.69/0.72 c veclendiving : 0.00 0 0
0.69/0.72 c intdiving : 0.00 0 0
0.69/0.72 c actconsdiving : 0.00 0 0
0.69/0.72 c objpscostdiving : 0.00 0 0
0.69/0.72 c rootsoldiving : 0.00 0 0
0.69/0.72 c linesearchdiving : 0.00 0 0
0.69/0.72 c guideddiving : 0.00 0 0
0.69/0.72 c octane : 0.00 0 0
0.69/0.72 c rens : 0.00 0 0
0.69/0.72 c rins : 0.00 0 0
0.69/0.72 c localbranching : 0.00 0 0
0.69/0.72 c mutation : 0.00 0 0
0.69/0.72 c crossover : 0.00 0 0
0.69/0.72 c dins : 0.00 0 0
0.69/0.72 c vbounds : 0.00 0 0
0.69/0.72 c undercover : 0.00 0 0
0.69/0.72 c subnlp : 0.00 0 0
0.69/0.72 c trysol : 0.00 0 0
0.69/0.72 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.72 c primal LP : 0.00 0 0 0.00 -
0.69/0.72 c dual LP : 0.02 23 719 31.26 32259.51
0.69/0.72 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.72 c barrier LP : 0.00 0 0 0.00 -
0.69/0.72 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.72 c strong branching : 0.59 152 17250 113.49 29426.31
0.69/0.72 c (at root node) : - 152 17250 113.49 -
0.69/0.72 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.72 c B&B Tree :
0.69/0.72 c number of runs : 3
0.69/0.72 c nodes : 1
0.69/0.72 c nodes (total) : 3
0.69/0.72 c nodes left : 0
0.69/0.72 c max depth : 0
0.69/0.72 c max depth (total): 0
0.69/0.72 c backtracks : 0 (0.0%)
0.69/0.72 c delayed cutoffs : 0
0.69/0.72 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.72 c avg switch length: 2.00
0.69/0.72 c switching time : 0.00
0.69/0.72 c Solution :
0.69/0.72 c Solutions found : 0 (0 improvements)
0.69/0.72 c Primal Bound : infeasible
0.69/0.72 c Dual Bound : -
0.69/0.72 c Gap : 0.00 %
0.69/0.72 c Root Dual Bound : -
0.69/0.72 c Root Iterations : 719
0.69/0.72 c Time complete: 0.71.