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-3452861-1307067419.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 | 182 | - | 762k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 209 | - |1030k| 0 | 51 | 169 | 114 | 169 | 87 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.1s| 1 | 0 | 249 | - |1289k| 0 | 53 | 169 | 114 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 287 | - |1521k| 0 | 58 | 169 | 114 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 307 | - |1530k| 0 | 64 | 169 | 114 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 331 | - |1535k| 0 | 64 | 169 | 114 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 370 | - |1523k| 0 | 58 | 169 | 102 | 169 | 110 | 37 | 0 | 13 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 393 | - |1523k| 0 | 57 | 169 | 102 | 169 | 110 | 37 | 0 | 22 | 0.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 488 | - |1523k| 0 | 56 | 169 | 102 | 169 | 110 | 37 | 0 | 30 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 532 | - |1495k| 0 | 51 | 169 | 74 | 169 | 110 | 37 | 0 | 35 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 0 | 546 | - |1495k| 0 | 51 | 169 | 74 | 169 | 110 | 37 | 0 | 42 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 563 | - |1494k| 0 | 50 | 169 | 73 | 169 | 99 | 37 | 0 | 48 | 0.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 0 | 563 | - |1494k| 0 | - | 169 | 73 | 169 | 99 | 37 | 0 | 53 | 0.000000e+00 | -- | Inf
0.39/0.44 c (run 1, node 1) restarting after 35 global fixings of integer variables
0.39/0.44 c
0.39/0.44 c (restart) converted 26 cuts from the global cut pool into linear constraints
0.39/0.44 c
0.39/0.44 c presolving:
0.39/0.44 c (round 1) 35 del vars, 2 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 12 impls, 81 clqs
0.39/0.44 c (round 2) 35 del vars, 2 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 25 upgd conss, 12 impls, 81 clqs
0.39/0.44 c (round 3) 35 del vars, 4 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 25 upgd conss, 12 impls, 81 clqs
0.39/0.44 c presolving (4 rounds):
0.39/0.44 c 35 deleted vars, 4 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.39/0.44 c 12 implications, 81 cliques
0.39/0.44 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 95 constraints
0.39/0.44 c 11 constraints of type <knapsack>
0.39/0.44 c 83 constraints of type <setppc>
0.39/0.44 c 1 constraints of type <logicor>
0.39/0.44 c transformed objective value is always integral (scale: 1)
0.39/0.44 c Presolving Time: 0.01
0.39/0.44 c
0.39/0.45 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.45 c 0.4s| 1 | 0 | 670 | - | 874k| 0 | 42 | 134 | 95 | 134 | 94 | 0 | 0 | 53 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 699 | - |1103k| 0 | 46 | 134 | 95 | 134 | 107 | 13 | 0 | 53 | 0.000000e+00 | -- | Inf
0.39/0.48 c 0.5s| 1 | 0 | 737 | - |1103k| 0 | 46 | 134 | 95 | 134 | 107 | 13 | 0 | 63 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.5s| 1 | 0 | 771 | - |1103k| 0 | 44 | 134 | 94 | 134 | 107 | 13 | 0 | 69 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 771 | - |1103k| 0 | 44 | 134 | 94 | 134 | 107 | 13 | 0 | 74 | cutoff | -- | 0.00%
0.49/0.50 c
0.49/0.50 c SCIP Status : problem is solved [infeasible]
0.49/0.50 c Solving Time (sec) : 0.50
0.49/0.50 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.49/0.50 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.49/0.50 c Dual Bound : +1.00000000000000e+20
0.49/0.50 c Gap : 0.00 %
0.49/0.50 s UNSATISFIABLE
0.49/0.50 c SCIP Status : problem is solved [infeasible]
0.49/0.50 c Total Time : 0.50
0.49/0.50 c solving : 0.50
0.49/0.50 c presolving : 0.01 (included in solving)
0.49/0.50 c reading : 0.00 (included in solving)
0.49/0.50 c Original Problem :
0.49/0.50 c Problem name : HOME/instance-3452861-1307067419.opb
0.49/0.50 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.50 c Constraints : 101 initial, 101 maximal
0.49/0.50 c Presolved Problem :
0.49/0.50 c Problem name : t_HOME/instance-3452861-1307067419.opb
0.49/0.50 c Variables : 134 (134 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.50 c Constraints : 95 initial, 95 maximal
0.49/0.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.50 c trivial : 0.00 35 0 0 0 0 0 0 0 0
0.49/0.50 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
0.49/0.50 c setppc : 0.00 0 0 0 0 0 2 0 0 0
0.49/0.50 c linear : 0.00 0 0 0 0 0 30 0 2 0
0.49/0.50 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.50 c root node : - 45 - - 45 - - - - -
0.49/0.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.50 c integral : 0 0 0 10 0 2 0 1 45 0 0 0
0.49/0.50 c knapsack : 11 6 10 0 0 0 0 0 0 0 0 0
0.49/0.50 c setppc : 83 6 10 0 0 0 0 0 0 0 0 0
0.49/0.50 c logicor : 1 1 1 0 0 0 0 0 0 0 0 0
0.49/0.50 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.49/0.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.50 c integral : 0.39 0.00 0.00 0.39 0.00 0.00 0.00
0.49/0.50 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.50 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.50 c vbounds : 0 0 0 0
0.49/0.50 c rootredcost : 0 0 0 0
0.49/0.50 c pseudoobj : 0 0 0 0
0.49/0.50 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.50 c vbounds : 0.00 0.00 0.00
0.49/0.50 c rootredcost : 0.00 0.00 0.00
0.49/0.50 c pseudoobj : 0.00 0.00 0.00
0.49/0.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.50 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.50 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.50 c applied globally : - - - 0 0.0 - - -
0.49/0.50 c applied locally : - - - 0 0.0 - - -
0.49/0.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.50 c cut pool : 0.00 0 - - 0 - (maximal pool size: 70)
0.49/0.50 c redcost : 0.00 6 0 0 0 0
0.49/0.50 c impliedbounds : 0.00 6 0 0 0 0
0.49/0.50 c intobj : 0.00 0 0 0 0 0
0.49/0.50 c gomory : 0.02 6 0 0 2 0
0.49/0.50 c cgmip : 0.00 0 0 0 0 0
0.49/0.50 c closecuts : 0.00 0 0 0 0 0
0.49/0.50 c strongcg : 0.02 6 0 0 234 0
0.49/0.50 c cmir : 0.00 0 0 0 0 0
0.49/0.50 c flowcover : 0.00 0 0 0 0 0
0.49/0.50 c clique : 0.00 6 0 0 26 0
0.49/0.50 c zerohalf : 0.00 0 0 0 0 0
0.49/0.50 c mcf : 0.00 2 0 0 0 0
0.49/0.50 c oddcycle : 0.00 0 0 0 0 0
0.49/0.50 c rapidlearning : 0.02 1 0 0 0 41
0.49/0.50 c Pricers : Time Calls Vars
0.49/0.50 c problem variables: 0.00 0 0
0.49/0.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.50 c relpscost : 0.39 10 1 45 0 0 0
0.49/0.50 c pscost : 0.00 0 0 0 0 0 0
0.49/0.50 c inference : 0.00 0 0 0 0 0 0
0.49/0.50 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.50 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.50 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.50 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.50 c random : 0.00 0 0 0 0 0 0
0.49/0.50 c Primal Heuristics : Time Calls Found
0.49/0.50 c LP solutions : 0.00 - 0
0.49/0.50 c pseudo solutions : 0.00 - 0
0.49/0.50 c trivial : 0.00 1 0
0.49/0.50 c shiftandpropagate: 0.00 0 0
0.49/0.50 c simplerounding : 0.00 0 0
0.49/0.50 c zirounding : 0.00 0 0
0.49/0.50 c rounding : 0.00 0 0
0.49/0.50 c shifting : 0.00 0 0
0.49/0.50 c intshifting : 0.00 0 0
0.49/0.50 c oneopt : 0.00 0 0
0.49/0.50 c twoopt : 0.00 0 0
0.49/0.50 c fixandinfer : 0.00 0 0
0.49/0.50 c feaspump : 0.00 0 0
0.49/0.50 c clique : 0.00 0 0
0.49/0.50 c coefdiving : 0.00 0 0
0.49/0.50 c pscostdiving : 0.00 0 0
0.49/0.50 c fracdiving : 0.00 0 0
0.49/0.50 c veclendiving : 0.00 0 0
0.49/0.50 c intdiving : 0.00 0 0
0.49/0.50 c actconsdiving : 0.00 0 0
0.49/0.50 c objpscostdiving : 0.00 0 0
0.49/0.50 c rootsoldiving : 0.00 0 0
0.49/0.50 c linesearchdiving : 0.00 0 0
0.49/0.50 c guideddiving : 0.00 0 0
0.49/0.50 c octane : 0.00 0 0
0.49/0.50 c rens : 0.00 0 0
0.49/0.50 c rins : 0.00 0 0
0.49/0.50 c localbranching : 0.00 0 0
0.49/0.50 c mutation : 0.00 0 0
0.49/0.50 c crossover : 0.00 0 0
0.49/0.50 c dins : 0.00 0 0
0.49/0.50 c vbounds : 0.00 0 0
0.49/0.50 c undercover : 0.00 0 0
0.49/0.50 c subnlp : 0.00 0 0
0.49/0.50 c trysol : 0.00 0 0
0.49/0.50 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.50 c primal LP : 0.00 0 0 0.00 -
0.49/0.50 c dual LP : 0.02 16 771 48.19 32026.25
0.49/0.50 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.50 c barrier LP : 0.00 0 0 0.00 -
0.49/0.50 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.50 c strong branching : 0.39 74 10909 147.42 28171.52
0.49/0.50 c (at root node) : - 74 10909 147.42 -
0.49/0.50 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.50 c B&B Tree :
0.49/0.50 c number of runs : 2
0.49/0.50 c nodes : 1
0.49/0.50 c nodes (total) : 2
0.49/0.50 c nodes left : 0
0.49/0.50 c max depth : 0
0.49/0.50 c max depth (total): 0
0.49/0.50 c backtracks : 0 (0.0%)
0.49/0.50 c delayed cutoffs : 0
0.49/0.50 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.50 c avg switch length: 2.00
0.49/0.50 c switching time : 0.00
0.49/0.50 c Solution :
0.49/0.50 c Solutions found : 0 (0 improvements)
0.49/0.50 c Primal Bound : infeasible
0.49/0.50 c Dual Bound : -
0.49/0.50 c Gap : 0.00 %
0.49/0.50 c Root Dual Bound : -
0.49/0.50 c Root Iterations : 771
0.49/0.50 c Time complete: 0.5.