0.00/0.01 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3451215-1307067617.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.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 | 227 | - | 770k| 0 | 39 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 255 | - |1253k| 0 | 50 | 169 | 112 | 169 | 87 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 292 | - |1260k| 0 | 59 | 169 | 112 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.05 c 0.1s| 1 | 0 | 317 | - |1268k| 0 | 59 | 169 | 112 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.06 c 0.1s| 1 | 0 | 351 | - |1275k| 0 | 61 | 169 | 112 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.07 c 0.1s| 1 | 0 | 360 | - |1277k| 0 | 62 | 169 | 112 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 464 | - |1251k| 0 | 56 | 169 | 88 | 169 | 110 | 37 | 0 | 8 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 514 | - |1251k| 0 | 56 | 169 | 88 | 169 | 110 | 37 | 0 | 19 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 660 | - |1236k| 0 | 51 | 169 | 74 | 169 | 110 | 37 | 0 | 24 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 723 | - |1236k| 0 | 49 | 169 | 74 | 169 | 110 | 37 | 0 | 32 | 0.000000e+00 | -- | Inf
0.29/0.38 c 0.4s| 1 | 0 | 767 | - |1236k| 0 | 50 | 169 | 74 | 169 | 110 | 37 | 0 | 39 | 0.000000e+00 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 902 | - |1235k| 0 | 37 | 169 | 73 | 169 | 97 | 37 | 0 | 45 | 0.000000e+00 | -- | Inf
0.39/0.41 c 0.4s| 1 | 0 | 902 | - |1235k| 0 | - | 169 | 73 | 169 | 97 | 37 | 0 | 50 | 0.000000e+00 | -- | Inf
0.39/0.41 c (run 1, node 1) restarting after 35 global fixings of integer variables
0.39/0.41 c
0.39/0.41 c (restart) converted 24 cuts from the global cut pool into linear constraints
0.39/0.41 c
0.39/0.41 c presolving:
0.39/0.41 c (round 1) 35 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 28 impls, 79 clqs
0.39/0.41 c (round 2) 35 del vars, 1 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 24 upgd conss, 28 impls, 79 clqs
0.39/0.41 c (round 3) 35 del vars, 8 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 24 upgd conss, 28 impls, 79 clqs
0.39/0.41 c presolving (4 rounds):
0.39/0.41 c 35 deleted vars, 8 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.39/0.41 c 28 implications, 79 cliques
0.39/0.41 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 89 constraints
0.39/0.41 c 4 constraints of type <knapsack>
0.39/0.41 c 84 constraints of type <setppc>
0.39/0.41 c 1 constraints of type <logicor>
0.39/0.41 c transformed objective value is always integral (scale: 1)
0.39/0.41 c Presolving Time: 0.01
0.39/0.41 c
0.39/0.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.42 c * 0.4s| 1 | 0 | 963 | - | 800k| 0 | - | 134 | 89 | 134 | 88 | 0 | 0 | 50 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.39/0.42 c 0.4s| 1 | 0 | 963 | - | 800k| 0 | - | 134 | 89 | 134 | 88 | 0 | 0 | 50 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.39/0.42 c
0.39/0.42 c SCIP Status : problem is solved [optimal solution found]
0.39/0.42 c Solving Time (sec) : 0.41
0.39/0.42 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.39/0.42 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.39/0.42 c Dual Bound : +0.00000000000000e+00
0.39/0.42 c Gap : 0.00 %
0.39/0.42 s SATISFIABLE
0.39/0.42 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
0.39/0.42 v -x147 x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
0.39/0.42 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 -x108 -x107 -x106
0.39/0.42 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
0.39/0.42 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
0.39/0.42 v -x56 -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
0.39/0.42 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
0.39/0.42 v -x4 -x3 -x2 -x1
0.39/0.42 c SCIP Status : problem is solved [optimal solution found]
0.39/0.42 c Total Time : 0.41
0.39/0.42 c solving : 0.41
0.39/0.42 c presolving : 0.01 (included in solving)
0.39/0.42 c reading : 0.00 (included in solving)
0.39/0.42 c Original Problem :
0.39/0.42 c Problem name : HOME/instance-3451215-1307067617.opb
0.39/0.42 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.42 c Constraints : 101 initial, 101 maximal
0.39/0.42 c Presolved Problem :
0.39/0.42 c Problem name : t_HOME/instance-3451215-1307067617.opb
0.39/0.42 c Variables : 134 (134 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.42 c Constraints : 89 initial, 89 maximal
0.39/0.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.39/0.42 c trivial : 0.00 35 0 0 0 0 0 0 0 0
0.39/0.42 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c setppc : 0.00 0 0 0 0 0 7 0 0 0
0.39/0.42 c linear : 0.00 0 0 0 0 0 29 0 1 0
0.39/0.42 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.39/0.42 c root node : - 35 - - 35 - - - - -
0.39/0.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.39/0.42 c integral : 0 0 0 7 0 4 0 0 35 0 0 0
0.39/0.42 c knapsack : 4 5 8 0 0 1 0 0 0 0 0 0
0.39/0.42 c setppc : 84 5 8 0 0 1 0 0 0 0 0 0
0.39/0.42 c logicor : 1 0 1 0 0 0 0 0 0 0 0 0
0.39/0.42 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.39/0.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.39/0.42 c integral : 0.32 0.00 0.00 0.32 0.00 0.00 0.00
0.39/0.42 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.42 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.42 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.42 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.42 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.39/0.42 c vbounds : 0 0 0 0
0.39/0.42 c rootredcost : 0 0 0 0
0.39/0.42 c pseudoobj : 0 0 0 0
0.39/0.42 c Propagator Timings : TotalTime Propagate Resprop
0.39/0.42 c vbounds : 0.00 0.00 0.00
0.39/0.42 c rootredcost : 0.00 0.00 0.00
0.39/0.42 c pseudoobj : 0.00 0.00 0.00
0.39/0.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.42 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.42 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.42 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.39/0.42 c applied globally : - - - 0 0.0 - - -
0.39/0.42 c applied locally : - - - 0 0.0 - - -
0.39/0.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.42 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.42 c redcost : 0.00 5 0 0 0 0
0.39/0.42 c impliedbounds : 0.00 5 0 0 0 0
0.39/0.42 c intobj : 0.00 0 0 0 0 0
0.39/0.42 c gomory : 0.02 5 0 0 53 0
0.39/0.42 c cgmip : 0.00 0 0 0 0 0
0.39/0.42 c closecuts : 0.00 0 0 0 0 0
0.39/0.42 c strongcg : 0.01 5 0 0 54 0
0.39/0.42 c cmir : 0.00 0 0 0 0 0
0.39/0.42 c flowcover : 0.00 0 0 0 0 0
0.39/0.42 c clique : 0.00 5 0 0 30 0
0.39/0.42 c zerohalf : 0.00 0 0 0 0 0
0.39/0.42 c mcf : 0.00 1 0 0 0 0
0.39/0.42 c oddcycle : 0.00 0 0 0 0 0
0.39/0.42 c rapidlearning : 0.02 1 0 0 0 39
0.39/0.42 c Pricers : Time Calls Vars
0.39/0.42 c problem variables: 0.00 0 0
0.39/0.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.42 c relpscost : 0.32 7 0 35 0 0 0
0.39/0.42 c pscost : 0.00 0 0 0 0 0 0
0.39/0.42 c inference : 0.00 0 0 0 0 0 0
0.39/0.42 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.42 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.42 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.42 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.42 c random : 0.00 0 0 0 0 0 0
0.39/0.42 c Primal Heuristics : Time Calls Found
0.39/0.42 c LP solutions : 0.00 - 0
0.39/0.42 c pseudo solutions : 0.00 - 0
0.39/0.42 c trivial : 0.00 1 0
0.39/0.42 c shiftandpropagate: 0.00 0 0
0.39/0.42 c simplerounding : 0.00 0 0
0.39/0.42 c zirounding : 0.00 0 0
0.39/0.42 c rounding : 0.00 0 0
0.39/0.42 c shifting : 0.00 0 0
0.39/0.42 c intshifting : 0.00 0 0
0.39/0.42 c oneopt : 0.00 0 0
0.39/0.42 c twoopt : 0.00 0 0
0.39/0.42 c fixandinfer : 0.00 0 0
0.39/0.42 c feaspump : 0.00 0 0
0.39/0.42 c clique : 0.00 0 0
0.39/0.42 c coefdiving : 0.00 0 0
0.39/0.42 c pscostdiving : 0.00 0 0
0.39/0.42 c fracdiving : 0.00 0 0
0.39/0.42 c veclendiving : 0.00 0 0
0.39/0.42 c intdiving : 0.00 0 0
0.39/0.42 c actconsdiving : 0.00 0 0
0.39/0.42 c objpscostdiving : 0.00 0 0
0.39/0.42 c rootsoldiving : 0.00 0 0
0.39/0.42 c linesearchdiving : 0.00 0 0
0.39/0.42 c guideddiving : 0.00 0 0
0.39/0.42 c octane : 0.00 0 0
0.39/0.42 c rens : 0.00 0 0
0.39/0.42 c rins : 0.00 0 0
0.39/0.42 c localbranching : 0.00 0 0
0.39/0.42 c mutation : 0.00 0 0
0.39/0.42 c crossover : 0.00 0 0
0.39/0.42 c dins : 0.00 0 0
0.39/0.42 c vbounds : 0.00 0 0
0.39/0.42 c undercover : 0.00 0 0
0.39/0.42 c subnlp : 0.00 0 0
0.39/0.42 c trysol : 0.00 0 0
0.39/0.42 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.42 c primal LP : 0.00 0 0 0.00 -
0.39/0.42 c dual LP : 0.03 13 963 74.08 37835.93
0.39/0.42 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.42 c barrier LP : 0.00 0 0 0.00 -
0.39/0.42 c diving/probing LP: 0.00 0 0 0.00 -
0.39/0.42 c strong branching : 0.32 50 11292 225.84 35152.82
0.39/0.42 c (at root node) : - 50 11292 225.84 -
0.39/0.42 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.42 c B&B Tree :
0.39/0.42 c number of runs : 2
0.39/0.42 c nodes : 1
0.39/0.42 c nodes (total) : 2
0.39/0.42 c nodes left : 0
0.39/0.42 c max depth : 0
0.39/0.42 c max depth (total): 0
0.39/0.42 c backtracks : 0 (0.0%)
0.39/0.42 c delayed cutoffs : 0
0.39/0.42 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.39/0.42 c avg switch length: 2.00
0.39/0.42 c switching time : 0.00
0.39/0.42 c Solution :
0.39/0.42 c Solutions found : 1 (1 improvements)
0.39/0.42 c First Solution : +0.00000000000000e+00 (in run 2, after 1 nodes, 0.41 seconds, depth 0, found by <relaxation>)
0.39/0.42 c Primal Bound : +0.00000000000000e+00 (in run 2, after 1 nodes, 0.41 seconds, depth 0, found by <relaxation>)
0.39/0.42 c Dual Bound : +0.00000000000000e+00
0.39/0.42 c Gap : 0.00 %
0.39/0.42 c Root Dual Bound : +0.00000000000000e+00
0.39/0.42 c Root Iterations : 963
0.39/0.42 c Time complete: 0.41.