0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-2704000-1278548312.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.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 72 constraints of type <setppc>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1790
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 129 | - | 743k| 0 | 45 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 173 | - |1137k| 0 | 56 | 169 | 198 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 205 | - |1368k| 0 | 54 | 169 | 198 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 233 | - |1586k| 0 | 62 | 169 | 198 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 280 | - |1608k| 0 | 59 | 169 | 198 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.30/0.31 c 0.3s| 1 | 0 | 288 | - |1693k| 0 | 62 | 169 | 198 | 169 | 108 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 317 | - |1677k| 0 | 61 | 169 | 183 | 169 | 108 | 35 | 0 | 12 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 0 | 335 | - |1645k| 0 | 60 | 169 | 155 | 169 | 108 | 35 | 0 | 22 | 0.000000e+00 | -- | Inf
0.89/0.98 c 1.0s| 1 | 0 | 397 | - |1641k| 0 | 60 | 169 | 152 | 169 | 108 | 35 | 0 | 32 | 0.000000e+00 | -- | Inf
0.99/1.10 c 1.1s| 1 | 0 | 428 | - |1623k| 0 | 57 | 169 | 135 | 169 | 108 | 35 | 0 | 38 | 0.000000e+00 | -- | Inf
1.29/1.37 c 1.4s| 1 | 0 | 490 | - |1622k| 0 | 52 | 169 | 134 | 169 | 108 | 35 | 0 | 51 | 0.000000e+00 | -- | Inf
1.49/1.52 c 1.5s| 1 | 0 | 508 | - |1597k| 0 | 52 | 169 | 111 | 169 | 98 | 35 | 0 | 61 | 0.000000e+00 | -- | Inf
1.49/1.58 c 1.6s| 1 | 0 | 554 | - |1591k| 0 | 50 | 169 | 106 | 169 | 98 | 35 | 0 | 67 | 0.000000e+00 | -- | Inf
1.59/1.63 c 1.6s| 1 | 0 | 554 | - |1591k| 0 | - | 169 | 106 | 169 | 98 | 35 | 0 | 72 | 0.000000e+00 | -- | Inf
1.59/1.63 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.59/1.63 c
1.59/1.63 c (restart) converted 25 cuts from the global cut pool into linear constraints
1.59/1.63 c
1.59/1.63 c presolving:
1.59/1.64 c (round 1) 38 del vars, 3 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 81 clqs
1.59/1.64 c (round 2) 38 del vars, 7 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 81 clqs
1.59/1.64 c (round 3) 38 del vars, 10 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 52 upgd conss, 18 impls, 81 clqs
1.59/1.65 c (round 4) 38 del vars, 14 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 52 upgd conss, 18 impls, 81 clqs
1.59/1.65 c presolving (5 rounds):
1.59/1.65 c 38 deleted vars, 14 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
1.59/1.65 c 18 implications, 81 cliques
1.59/1.65 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 117 constraints
1.59/1.65 c 8 constraints of type <knapsack>
1.59/1.65 c 84 constraints of type <setppc>
1.59/1.65 c 25 constraints of type <logicor>
1.59/1.65 c transformed objective value is always integral (scale: 1)
1.59/1.65 c Presolving Time: 0.03
1.59/1.65 c
1.59/1.66 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.66 c 1.6s| 1 | 0 | 644 | - | 872k| 0 | 46 | 131 | 117 | 131 | 92 | 0 | 0 | 72 | 0.000000e+00 | -- | Inf
1.59/1.68 c 1.7s| 1 | 0 | 695 | - |1094k| 0 | 54 | 131 | 117 | 131 | 105 | 13 | 0 | 72 | 0.000000e+00 | -- | Inf
1.79/1.81 c 1.8s| 1 | 0 | 721 | - |1094k| 0 | 55 | 131 | 116 | 131 | 105 | 13 | 0 | 85 | 0.000000e+00 | -- | Inf
1.89/1.91 c 1.9s| 1 | 0 | 740 | - |1093k| 0 | 55 | 131 | 114 | 131 | 105 | 13 | 0 | 94 | 0.000000e+00 | -- | Inf
1.89/1.98 c 2.0s| 1 | 0 | 808 | - |1092k| 0 | 46 | 131 | 113 | 131 | 105 | 13 | 0 | 99 | 0.000000e+00 | -- | Inf
1.99/2.04 c 2.0s| 1 | 0 | 849 | - |1092k| 0 | 48 | 131 | 112 | 131 | 105 | 13 | 0 | 106 | 0.000000e+00 | -- | Inf
1.99/2.07 c 2.1s| 1 | 0 | 869 | - |1092k| 0 | 47 | 131 | 111 | 131 | 105 | 13 | 0 | 111 | 0.000000e+00 | -- | Inf
2.10/2.10 c 2.1s| 1 | 0 | 869 | - |1092k| 0 | - | 131 | 111 | 131 | 105 | 13 | 0 | 117 | 0.000000e+00 | -- | Inf
2.10/2.10 c (run 2, node 1) restarting after 30 global fixings of integer variables
2.10/2.10 c
2.10/2.10 c (restart) converted 13 cuts from the global cut pool into linear constraints
2.10/2.10 c
2.10/2.10 c presolving:
2.10/2.11 c (round 1) 31 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 38 impls, 73 clqs
2.10/2.12 c (round 2) 31 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 38 impls, 73 clqs
2.10/2.12 c (round 3) 31 del vars, 26 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 38 impls, 73 clqs
2.10/2.12 c presolving (4 rounds):
2.10/2.12 c 31 deleted vars, 26 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.10/2.12 c 38 implications, 73 cliques
2.10/2.12 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 98 constraints
2.10/2.12 c 15 constraints of type <knapsack>
2.10/2.12 c 77 constraints of type <setppc>
2.10/2.12 c 6 constraints of type <logicor>
2.10/2.12 c transformed objective value is always integral (scale: 1)
2.10/2.12 c Presolving Time: 0.05
2.10/2.12 c
2.10/2.13 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.10/2.13 c 2.1s| 1 | 0 | 957 | - | 882k| 0 | 35 | 100 | 98 | 100 | 92 | 0 | 0 | 117 | 0.000000e+00 | -- | Inf
2.10/2.15 c 2.1s| 1 | 0 | 1039 | - |1238k| 0 | - | 100 | 98 | 100 | 107 | 15 | 0 | 117 | -- | -- | 0.00%
2.10/2.15 c 2.1s| 1 | 0 | 1039 | - |1238k| 0 | - | 100 | 98 | 100 | 107 | 15 | 0 | 117 | -- | -- | 0.00%
2.10/2.15 c
2.10/2.15 c SCIP Status : problem is solved [infeasible]
2.10/2.15 c Solving Time (sec) : 2.14
2.10/2.15 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
2.10/2.15 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.10/2.15 c Dual Bound : +1.00000000000000e+20
2.10/2.15 c Gap : 0.00 %
2.10/2.15 s UNSATISFIABLE
2.10/2.15 c SCIP Status : problem is solved [infeasible]
2.10/2.15 c Solving Time : 2.14
2.10/2.15 c Original Problem :
2.10/2.15 c Problem name : HOME/instance-2704000-1278548312.opb
2.10/2.15 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.15 c Constraints : 101 initial, 101 maximal
2.10/2.15 c Presolved Problem :
2.10/2.15 c Problem name : t_HOME/instance-2704000-1278548312.opb
2.10/2.15 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.15 c Constraints : 98 initial, 98 maximal
2.10/2.15 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.10/2.15 c trivial : 0.00 68 0 0 0 0 0 0 0
2.10/2.15 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.10/2.15 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.10/2.15 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.10/2.15 c implics : 0.00 0 0 0 0 0 0 0 0
2.10/2.15 c probing : 0.00 0 0 0 0 0 0 0 0
2.10/2.15 c knapsack : 0.03 0 0 0 0 0 0 0 0
2.10/2.15 c setppc : 0.01 0 1 0 0 0 14 0 0
2.10/2.15 c linear : 0.01 0 0 0 0 0 36 3 0
2.10/2.15 c logicor : 0.00 0 0 0 0 0 18 0 0
2.10/2.15 c root node : - 68 - - 68 - - - -
2.10/2.15 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.10/2.15 c integral : 0 0 0 14 0 0 68 0 0 0
2.10/2.15 c knapsack : 15 7 15 0 0 0 0 0 0 0
2.10/2.15 c setppc : 77 7 15 0 0 0 0 0 0 0
2.10/2.15 c logicor : 6 2 7 0 0 0 0 0 0 0
2.10/2.15 c countsols : 0 0 0 0 0 0 0 0 0 0
2.10/2.15 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.10/2.15 c integral : 1.70 0.00 0.00 1.70 0.00
2.10/2.15 c knapsack : 0.01 0.01 0.00 0.00 0.00
2.10/2.15 c setppc : 0.00 0.00 0.00 0.00 0.00
2.10/2.15 c logicor : 0.00 0.00 0.00 0.00 0.00
2.10/2.15 c countsols : 0.00 0.00 0.00 0.00 0.00
2.10/2.15 c Propagators : Time Calls Cutoffs DomReds
2.10/2.15 c vbounds : 0.00 3 0 0
2.10/2.15 c rootredcost : 0.00 0 0 0
2.10/2.15 c pseudoobj : 0.00 0 0 0
2.10/2.15 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.10/2.15 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.15 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.15 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.15 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.15 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.15 c applied globally : - - - 0 0.0 - - -
2.10/2.15 c applied locally : - - - 0 0.0 - - -
2.10/2.15 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.10/2.15 c cut pool : 0.00 0 - - 0 - (maximal pool size: 133)
2.10/2.15 c redcost : 0.00 7 0 0 0 0
2.10/2.15 c impliedbounds : 0.00 7 0 0 0 0
2.10/2.15 c intobj : 0.00 0 0 0 0 0
2.10/2.15 c cgmip : 0.00 0 0 0 0 0
2.10/2.15 c gomory : 0.05 7 0 0 72 0
2.10/2.15 c strongcg : 0.05 7 0 0 315 0
2.10/2.15 c cmir : 0.00 0 0 0 0 0
2.10/2.15 c flowcover : 0.00 0 0 0 0 0
2.10/2.15 c clique : 0.00 7 0 0 33 0
2.10/2.15 c zerohalf : 0.00 0 0 0 0 0
2.10/2.15 c mcf : 0.00 3 0 0 0 0
2.10/2.15 c rapidlearning : 0.17 1 0 0 0 125
2.10/2.15 c Pricers : Time Calls Vars
2.10/2.15 c problem variables: 0.00 0 0
2.10/2.15 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.10/2.15 c relpscost : 1.70 14 0 68 0 0 0
2.10/2.15 c pscost : 0.00 0 0 0 0 0 0
2.10/2.15 c inference : 0.00 0 0 0 0 0 0
2.10/2.15 c mostinf : 0.00 0 0 0 0 0 0
2.10/2.15 c leastinf : 0.00 0 0 0 0 0 0
2.10/2.15 c fullstrong : 0.00 0 0 0 0 0 0
2.10/2.15 c allfullstrong : 0.00 0 0 0 0 0 0
2.10/2.15 c random : 0.00 0 0 0 0 0 0
2.10/2.15 c Primal Heuristics : Time Calls Found
2.10/2.15 c LP solutions : 0.00 - 0
2.10/2.15 c pseudo solutions : 0.00 - 0
2.10/2.15 c trivial : 0.00 1 0
2.10/2.15 c simplerounding : 0.00 0 0
2.10/2.15 c zirounding : 0.00 0 0
2.10/2.15 c rounding : 0.00 0 0
2.10/2.15 c shifting : 0.00 0 0
2.10/2.15 c intshifting : 0.00 0 0
2.10/2.15 c oneopt : 0.00 0 0
2.10/2.15 c twoopt : 0.00 0 0
2.10/2.15 c fixandinfer : 0.00 0 0
2.10/2.15 c feaspump : 0.00 0 0
2.10/2.15 c coefdiving : 0.00 0 0
2.10/2.15 c pscostdiving : 0.00 0 0
2.10/2.15 c fracdiving : 0.00 0 0
2.10/2.15 c veclendiving : 0.00 0 0
2.10/2.15 c intdiving : 0.00 0 0
2.10/2.15 c actconsdiving : 0.00 0 0
2.10/2.15 c objpscostdiving : 0.00 0 0
2.10/2.15 c rootsoldiving : 0.00 0 0
2.10/2.15 c linesearchdiving : 0.00 0 0
2.10/2.15 c guideddiving : 0.00 0 0
2.10/2.15 c octane : 0.00 0 0
2.10/2.15 c rens : 0.00 0 0
2.10/2.15 c rins : 0.00 0 0
2.10/2.15 c localbranching : 0.00 0 0
2.10/2.15 c mutation : 0.00 0 0
2.10/2.15 c crossover : 0.00 0 0
2.10/2.15 c dins : 0.00 0 0
2.10/2.15 c undercover : 0.00 0 0
2.10/2.15 c nlp : 0.00 0 0
2.10/2.15 c trysol : 0.00 0 0
2.10/2.15 c LP : Time Calls Iterations Iter/call Iter/sec
2.10/2.15 c primal LP : 0.00 0 0 0.00 -
2.10/2.15 c dual LP : 0.07 22 1039 47.23 13853.33
2.10/2.15 c lex dual LP : 0.00 0 0 0.00 -
2.10/2.15 c barrier LP : 0.00 0 0 0.00 -
2.10/2.15 c diving/probing LP: 0.00 0 0 0.00 -
2.10/2.15 c strong branching : 1.70 117 17931 153.26 10541.61
2.10/2.15 c (at root node) : - 117 17931 153.26 -
2.10/2.15 c conflict analysis: 0.00 0 0 0.00 -
2.10/2.15 c B&B Tree :
2.10/2.15 c number of runs : 3
2.10/2.15 c nodes : 1
2.10/2.15 c nodes (total) : 3
2.10/2.15 c nodes left : 0
2.10/2.15 c max depth : 0
2.10/2.15 c max depth (total): 0
2.10/2.15 c backtracks : 0 (0.0%)
2.10/2.15 c delayed cutoffs : 0
2.10/2.15 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.10/2.15 c avg switch length: 2.00
2.10/2.15 c switching time : 0.00
2.10/2.15 c Solution :
2.10/2.15 c Solutions found : 0 (0 improvements)
2.10/2.15 c Primal Bound : infeasible
2.10/2.15 c Dual Bound : -
2.10/2.15 c Gap : 0.00 %
2.10/2.15 c Root Dual Bound : -
2.10/2.15 c Root Iterations : 1039
2.10/2.16 c Time complete: 2.16.