0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3485667-1307750194.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.00 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 = 1797
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 | 91 | - | 762k| 0 | 41 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.03 c 0.0s| 1 | 0 | 115 | - |1058k| 0 | 48 | 169 | 116 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.04 c 0.0s| 1 | 0 | 128 | - |1107k| 0 | 50 | 169 | 116 | 169 | 92 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.05 c 0.0s| 1 | 0 | 140 | - |1117k| 0 | 54 | 169 | 116 | 169 | 96 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.05 c 0.1s| 1 | 0 | 168 | - |1127k| 0 | 52 | 169 | 116 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.06 c 0.1s| 1 | 0 | 194 | - |1141k| 0 | 52 | 169 | 116 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 205 | - |1138k| 0 | 50 | 169 | 113 | 169 | 100 | 27 | 0 | 15 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 225 | - |1097k| 0 | 52 | 169 | 74 | 169 | 100 | 27 | 0 | 30 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 240 | - |1097k| 0 | 52 | 169 | 74 | 169 | 100 | 27 | 0 | 37 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 250 | - |1097k| 0 | 53 | 169 | 74 | 169 | 100 | 27 | 0 | 43 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.4s| 1 | 0 | 264 | - |1097k| 0 | 55 | 169 | 74 | 169 | 100 | 27 | 0 | 48 | 0.000000e+00 | -- | Inf
0.29/0.40 c 0.4s| 1 | 0 | 275 | - |1097k| 0 | 57 | 169 | 74 | 169 | 95 | 27 | 0 | 55 | 0.000000e+00 | -- | Inf
0.39/0.43 c 0.4s| 1 | 0 | 275 | - |1097k| 0 | - | 169 | 74 | 169 | 95 | 27 | 0 | 61 | 0.000000e+00 | -- | Inf
0.39/0.43 c (run 1, node 1) restarting after 34 global fixings of integer variables
0.39/0.43 c
0.39/0.43 c (restart) converted 21 cuts from the global cut pool into linear constraints
0.39/0.43 c
0.39/0.43 c presolving:
0.39/0.43 c (round 1) 34 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 12 impls, 78 clqs
0.39/0.43 c (round 2) 34 del vars, 3 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 12 impls, 78 clqs
0.39/0.43 c presolving (3 rounds):
0.39/0.43 c 34 deleted vars, 3 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.43 c 12 implications, 78 cliques
0.39/0.43 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 92 constraints
0.39/0.43 c 9 constraints of type <knapsack>
0.39/0.43 c 82 constraints of type <setppc>
0.39/0.43 c 1 constraints of type <logicor>
0.39/0.43 c transformed objective value is always integral (scale: 1)
0.39/0.43 c Presolving Time: 0.01
0.39/0.43 c
0.39/0.44 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.44 c 0.4s| 1 | 0 | 378 | - | 885k| 0 | 48 | 135 | 92 | 135 | 91 | 0 | 0 | 61 | 0.000000e+00 | -- | Inf
0.39/0.45 c 0.4s| 1 | 0 | 419 | - |1138k| 0 | 49 | 135 | 92 | 135 | 101 | 10 | 0 | 61 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 448 | - |1138k| 0 | 54 | 135 | 92 | 135 | 101 | 10 | 0 | 67 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.5s| 1 | 0 | 469 | - |1138k| 0 | 50 | 135 | 92 | 135 | 101 | 10 | 0 | 79 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 517 | - |1138k| 0 | 48 | 135 | 92 | 135 | 101 | 10 | 0 | 84 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 593 | - |1134k| 0 | 36 | 135 | 83 | 135 | 101 | 10 | 0 | 90 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 593 | - |1134k| 0 | 36 | 135 | 83 | 135 | 101 | 10 | 0 | 95 | cutoff | -- | 0.00%
0.49/0.53 c
0.49/0.53 c SCIP Status : problem is solved [infeasible]
0.49/0.53 c Solving Time (sec) : 0.53
0.49/0.53 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.49/0.53 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.49/0.53 c Dual Bound : +1.00000000000000e+20
0.49/0.53 c Gap : 0.00 %
0.49/0.53 s UNSATISFIABLE
0.49/0.53 c SCIP Status : problem is solved [infeasible]
0.49/0.53 c Total Time : 0.53
0.49/0.53 c solving : 0.53
0.49/0.53 c presolving : 0.01 (included in solving)
0.49/0.53 c reading : 0.00 (included in solving)
0.49/0.53 c Original Problem :
0.49/0.53 c Problem name : HOME/instance-3485667-1307750194.opb
0.49/0.53 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 101 initial, 101 maximal
0.49/0.53 c Presolved Problem :
0.49/0.53 c Problem name : t_HOME/instance-3485667-1307750194.opb
0.49/0.53 c Variables : 135 (135 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 92 initial, 92 maximal
0.49/0.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.53 c trivial : 0.00 34 0 0 0 0 0 0 0 0
0.49/0.53 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
0.49/0.53 c setppc : 0.00 0 0 0 0 0 3 0 0 0
0.49/0.53 c linear : 0.00 0 0 0 0 0 28 0 0 0
0.49/0.53 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c root node : - 77 - - 77 - - - - -
0.49/0.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.53 c integral : 0 0 0 12 0 2 0 1 54 0 0 0
0.49/0.53 c knapsack : 9 6 13 0 0 0 0 0 0 0 0 0
0.49/0.53 c setppc : 82 6 13 0 0 0 0 0 23 0 0 0
0.49/0.53 c logicor : 1 1 2 0 0 0 0 0 0 0 0 0
0.49/0.53 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.49/0.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.53 c integral : 0.44 0.00 0.00 0.44 0.00 0.00 0.00
0.49/0.53 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.53 c vbounds : 0 0 0 0
0.49/0.53 c rootredcost : 0 0 0 0
0.49/0.53 c pseudoobj : 0 0 0 0
0.49/0.53 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.53 c vbounds : 0.00 0.00 0.00
0.49/0.53 c rootredcost : 0.00 0.00 0.00
0.49/0.53 c pseudoobj : 0.00 0.00 0.00
0.49/0.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.53 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.53 c applied globally : - - - 0 0.0 - - -
0.49/0.53 c applied locally : - - - 0 0.0 - - -
0.49/0.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.53 c cut pool : 0.00 0 - - 0 - (maximal pool size: 74)
0.49/0.53 c redcost : 0.00 6 0 0 0 0
0.49/0.53 c impliedbounds : 0.00 6 0 0 0 0
0.49/0.53 c intobj : 0.00 0 0 0 0 0
0.49/0.53 c gomory : 0.02 6 0 0 4 0
0.49/0.53 c cgmip : 0.00 0 0 0 0 0
0.49/0.53 c closecuts : 0.00 0 0 0 0 0
0.49/0.53 c strongcg : 0.02 6 0 0 148 0
0.49/0.53 c cmir : 0.00 0 0 0 0 0
0.49/0.53 c flowcover : 0.00 0 0 0 0 0
0.49/0.53 c clique : 0.00 6 0 0 20 0
0.49/0.53 c zerohalf : 0.00 0 0 0 0 0
0.49/0.53 c mcf : 0.00 2 0 0 0 0
0.49/0.53 c oddcycle : 0.00 0 0 0 0 0
0.49/0.53 c rapidlearning : 0.02 1 0 0 0 43
0.49/0.53 c Pricers : Time Calls Vars
0.49/0.53 c problem variables: 0.00 0 0
0.49/0.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.53 c relpscost : 0.44 12 1 54 0 0 0
0.49/0.53 c pscost : 0.00 0 0 0 0 0 0
0.49/0.53 c inference : 0.00 0 0 0 0 0 0
0.49/0.53 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.53 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.53 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c random : 0.00 0 0 0 0 0 0
0.49/0.53 c Primal Heuristics : Time Calls Found
0.49/0.53 c LP solutions : 0.00 - 0
0.49/0.53 c pseudo solutions : 0.00 - 0
0.49/0.53 c trivial : 0.00 1 0
0.49/0.53 c shiftandpropagate: 0.00 0 0
0.49/0.53 c simplerounding : 0.00 0 0
0.49/0.53 c zirounding : 0.00 0 0
0.49/0.53 c rounding : 0.00 0 0
0.49/0.53 c shifting : 0.00 0 0
0.49/0.53 c intshifting : 0.00 0 0
0.49/0.53 c oneopt : 0.00 0 0
0.49/0.53 c twoopt : 0.00 0 0
0.49/0.53 c fixandinfer : 0.00 0 0
0.49/0.53 c feaspump : 0.00 0 0
0.49/0.53 c clique : 0.00 0 0
0.49/0.53 c coefdiving : 0.00 0 0
0.49/0.53 c pscostdiving : 0.00 0 0
0.49/0.53 c fracdiving : 0.00 0 0
0.49/0.53 c veclendiving : 0.00 0 0
0.49/0.53 c intdiving : 0.00 0 0
0.49/0.53 c actconsdiving : 0.00 0 0
0.49/0.53 c objpscostdiving : 0.00 0 0
0.49/0.53 c rootsoldiving : 0.00 0 0
0.49/0.53 c linesearchdiving : 0.00 0 0
0.49/0.53 c guideddiving : 0.00 0 0
0.49/0.53 c octane : 0.00 0 0
0.49/0.53 c rens : 0.00 0 0
0.49/0.53 c rins : 0.00 0 0
0.49/0.53 c localbranching : 0.00 0 0
0.49/0.53 c mutation : 0.00 0 0
0.49/0.53 c crossover : 0.00 0 0
0.49/0.53 c dins : 0.00 0 0
0.49/0.53 c vbounds : 0.00 0 0
0.49/0.53 c undercover : 0.00 0 0
0.49/0.53 c subnlp : 0.00 0 0
0.49/0.53 c trysol : 0.00 0 0
0.49/0.53 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.53 c primal LP : 0.00 0 0 0.00 -
0.49/0.53 c dual LP : 0.02 18 593 32.94 35817.83
0.49/0.53 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.53 c barrier LP : 0.00 0 0 0.00 -
0.49/0.53 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.53 c strong branching : 0.44 95 15102 158.97 34250.18
0.49/0.53 c (at root node) : - 95 15102 158.97 -
0.49/0.53 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.53 c B&B Tree :
0.49/0.53 c number of runs : 2
0.49/0.53 c nodes : 1
0.49/0.53 c nodes (total) : 2
0.49/0.53 c nodes left : 0
0.49/0.53 c max depth : 0
0.49/0.53 c max depth (total): 0
0.49/0.53 c backtracks : 0 (0.0%)
0.49/0.53 c delayed cutoffs : 0
0.49/0.53 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.53 c avg switch length: 2.00
0.49/0.53 c switching time : 0.00
0.49/0.53 c Solution :
0.49/0.53 c Solutions found : 0 (0 improvements)
0.49/0.53 c Primal Bound : infeasible
0.49/0.53 c Dual Bound : -
0.49/0.53 c Gap : 0.00 %
0.49/0.53 c Root Dual Bound : -
0.49/0.53 c Root Iterations : 593
0.49/0.53 c Time complete: 0.53.