0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2667170-1276274394.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.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 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
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.2
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 = 1800
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 # 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 # 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.04 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 | 111 | - | 743k| 0 | 46 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 135 | - |1181k| 0 | 49 | 169 | 216 | 169 | 83 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 163 | - |1450k| 0 | 53 | 169 | 216 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 191 | - |1563k| 0 | 55 | 169 | 216 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 218 | - |1693k| 0 | 62 | 169 | 216 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 297 | - |1714k| 0 | 67 | 169 | 216 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.5s| 1 | 0 | 420 | - |1691k| 0 | 54 | 169 | 194 | 169 | 109 | 36 | 0 | 12 | 0.000000e+00 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 465 | - |1654k| 0 | 48 | 169 | 160 | 169 | 109 | 36 | 0 | 25 | 0.000000e+00 | -- | Inf
0.89/0.96 c 0.9s| 1 | 0 | 536 | - |1650k| 0 | 45 | 169 | 156 | 169 | 109 | 36 | 0 | 36 | 0.000000e+00 | -- | Inf
1.00/1.00 c 0.9s| 1 | 0 | 545 | - |1645k| 0 | 48 | 169 | 152 | 169 | 109 | 36 | 0 | 41 | 0.000000e+00 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 551 | - |1642k| 0 | 44 | 169 | 149 | 169 | 109 | 36 | 0 | 47 | 0.000000e+00 | -- | Inf
1.00/1.09 c 1.0s| 1 | 0 | 583 | - |1638k| 0 | 43 | 169 | 145 | 169 | 101 | 36 | 0 | 55 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 583 | - |1638k| 0 | - | 169 | 145 | 169 | 101 | 36 | 0 | 62 | 0.000000e+00 | -- | Inf
1.10/1.14 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.10/1.14 c
1.10/1.14 c (restart) converted 28 cuts from the global cut pool into linear constraints
1.10/1.14 c
1.10/1.14 c presolving:
1.10/1.15 c (round 1) 34 del vars, 18 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 83 clqs
1.10/1.15 c (round 2) 34 del vars, 21 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 83 clqs
1.10/1.16 c (round 3) 34 del vars, 23 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 81 upgd conss, 18 impls, 83 clqs
1.10/1.17 c presolving (4 rounds):
1.10/1.17 c 34 deleted vars, 23 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
1.10/1.17 c 18 implications, 83 cliques
1.10/1.17 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 150 constraints
1.10/1.17 c 7 constraints of type <knapsack>
1.10/1.17 c 84 constraints of type <setppc>
1.10/1.17 c 59 constraints of type <logicor>
1.10/1.17 c transformed objective value is always integral (scale: 1)
1.10/1.17 c Presolving Time: 0.03
1.10/1.17 c
1.10/1.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.17 c 1.1s| 1 | 0 | 675 | - | 896k| 0 | 43 | 135 | 150 | 135 | 96 | 0 | 0 | 62 | 0.000000e+00 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 724 | - |1122k| 0 | 50 | 135 | 150 | 135 | 109 | 13 | 0 | 62 | 0.000000e+00 | -- | Inf
1.39/1.46 c 1.4s| 1 | 0 | 768 | - |1122k| 0 | 45 | 135 | 149 | 135 | 109 | 13 | 0 | 82 | 0.000000e+00 | -- | Inf
1.49/1.55 c 1.5s| 1 | 0 | 798 | - |1122k| 0 | 42 | 135 | 148 | 135 | 109 | 13 | 0 | 90 | 0.000000e+00 | -- | Inf
1.59/1.63 c 1.5s| 1 | 0 | 850 | - |1122k| 0 | 41 | 135 | 147 | 135 | 109 | 13 | 0 | 98 | 0.000000e+00 | -- | Inf
1.59/1.66 c 1.6s| 1 | 0 | 855 | - |1121k| 0 | 41 | 135 | 145 | 135 | 109 | 13 | 0 | 103 | 0.000000e+00 | -- | Inf
1.59/1.69 c 1.6s| 1 | 0 | 868 | - |1121k| 0 | 39 | 135 | 144 | 135 | 109 | 13 | 0 | 108 | 0.000000e+00 | -- | Inf
1.69/1.71 c 1.6s| 1 | 0 | 868 | - |1121k| 0 | - | 135 | 144 | 135 | 109 | 13 | 0 | 113 | 0.000000e+00 | -- | Inf
1.69/1.71 c (run 2, node 1) restarting after 30 global fixings of integer variables
1.69/1.71 c
1.69/1.71 c (restart) converted 13 cuts from the global cut pool into linear constraints
1.69/1.71 c
1.69/1.72 c presolving:
1.69/1.72 c (round 1) 46 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 38 impls, 71 clqs
1.69/1.73 c (round 2) 46 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 38 impls, 71 clqs
1.69/1.74 c (round 3) 46 del vars, 47 del conss, 0 chg bounds, 19 chg sides, 21 chg coeffs, 12 upgd conss, 38 impls, 71 clqs
1.69/1.74 c (round 4) 46 del vars, 47 del conss, 0 chg bounds, 19 chg sides, 24 chg coeffs, 12 upgd conss, 38 impls, 71 clqs
1.69/1.75 c (round 5) 46 del vars, 47 del conss, 0 chg bounds, 44 chg sides, 51 chg coeffs, 12 upgd conss, 38 impls, 71 clqs
1.69/1.75 c (round 6) 46 del vars, 47 del conss, 0 chg bounds, 44 chg sides, 52 chg coeffs, 12 upgd conss, 38 impls, 71 clqs
1.69/1.75 c presolving (7 rounds):
1.69/1.75 c 46 deleted vars, 47 deleted constraints, 0 tightened bounds, 0 added holes, 44 changed sides, 52 changed coefficients
1.69/1.75 c 38 implications, 71 cliques
1.69/1.75 c presolved problem has 89 variables (89 bin, 0 int, 0 impl, 0 cont) and 110 constraints
1.69/1.75 c 15 constraints of type <knapsack>
1.69/1.75 c 76 constraints of type <setppc>
1.69/1.75 c 19 constraints of type <logicor>
1.69/1.75 c transformed objective value is always integral (scale: 1)
1.69/1.75 c Presolving Time: 0.06
1.69/1.75 c
1.69/1.75 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.69/1.75 c 1.6s| 1 | 0 | 934 | - | 887k| 0 | - | 89 | 110 | 89 | 93 | 0 | 0 | 113 | -- | -- | 0.00%
1.69/1.75 c 1.6s| 1 | 0 | 934 | - | 887k| 0 | - | 89 | 110 | 89 | 93 | 0 | 0 | 113 | -- | -- | 0.00%
1.69/1.75 c
1.69/1.75 c SCIP Status : problem is solved [infeasible]
1.69/1.75 c Solving Time (sec) : 1.65
1.69/1.75 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.69/1.75 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.69/1.75 c Dual Bound : +1.00000000000000e+20
1.69/1.75 c Gap : 0.00 %
1.69/1.75 s UNSATISFIABLE
1.69/1.75 c SCIP Status : problem is solved [infeasible]
1.69/1.75 c Solving Time : 1.65
1.69/1.75 c Original Problem :
1.69/1.75 c Problem name : HOME/instance-2667170-1276274394.opb
1.69/1.75 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.75 c Constraints : 101 initial, 101 maximal
1.69/1.75 c Presolved Problem :
1.69/1.75 c Problem name : t_HOME/instance-2667170-1276274394.opb
1.69/1.75 c Variables : 89 (89 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.75 c Constraints : 110 initial, 110 maximal
1.69/1.75 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.69/1.75 c trivial : 0.00 64 0 0 0 0 0 0 0
1.69/1.75 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.69/1.75 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.69/1.75 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.69/1.75 c implics : 0.00 0 0 0 0 0 0 0 0
1.69/1.75 c probing : 0.00 0 0 0 0 0 0 0 0
1.69/1.75 c knapsack : 0.03 0 0 0 0 0 0 44 52
1.69/1.75 c setppc : 0.01 16 0 0 0 0 11 0 0
1.69/1.75 c linear : 0.01 0 0 0 0 0 48 2 0
1.69/1.75 c logicor : 0.00 0 0 0 0 0 39 0 0
1.69/1.75 c root node : - 64 - - 64 - - - -
1.69/1.75 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.69/1.75 c integral : 0 0 0 13 0 0 64 0 0 0
1.69/1.75 c knapsack : 15 6 14 0 0 0 0 0 0 0
1.69/1.75 c setppc : 76 6 14 0 0 0 0 0 0 0
1.69/1.75 c logicor : 19 6 7 0 0 0 0 0 0 0
1.69/1.75 c countsols : 0 0 0 0 0 0 0 0 0 0
1.69/1.75 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.69/1.75 c integral : 1.25 0.00 0.00 1.25 0.00
1.69/1.75 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.69/1.75 c setppc : 0.00 0.00 0.00 0.00 0.00
1.69/1.75 c logicor : 0.00 0.00 0.00 0.00 0.00
1.69/1.75 c countsols : 0.00 0.00 0.00 0.00 0.00
1.69/1.75 c Propagators : Time Calls Cutoffs DomReds
1.69/1.75 c vbounds : 0.00 3 0 0
1.69/1.75 c rootredcost : 0.00 0 0 0
1.69/1.75 c pseudoobj : 0.00 0 0 0
1.69/1.75 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.69/1.75 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.75 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.75 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.75 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.75 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.75 c applied globally : - - - 0 0.0 - - -
1.69/1.75 c applied locally : - - - 0 0.0 - - -
1.69/1.75 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.69/1.75 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.69/1.75 c redcost : 0.00 6 0 0 0 0
1.69/1.75 c impliedbounds : 0.00 6 0 0 0 0
1.69/1.75 c intobj : 0.00 0 0 0 0 0
1.69/1.75 c cgmip : 0.00 0 0 0 0 0
1.69/1.75 c gomory : 0.05 6 0 0 8 0
1.69/1.75 c strongcg : 0.04 6 0 0 260 0
1.69/1.75 c cmir : 0.00 0 0 0 0 0
1.69/1.75 c flowcover : 0.00 0 0 0 0 0
1.69/1.75 c clique : 0.00 6 0 0 32 0
1.69/1.75 c zerohalf : 0.00 0 0 0 0 0
1.69/1.75 c mcf : 0.00 2 0 0 0 0
1.69/1.75 c rapidlearning : 0.15 1 0 0 0 143
1.69/1.75 c Pricers : Time Calls Vars
1.69/1.75 c problem variables: 0.00 0 0
1.69/1.75 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.69/1.75 c relpscost : 1.25 13 0 64 0 0 0
1.69/1.75 c pscost : 0.00 0 0 0 0 0 0
1.69/1.75 c inference : 0.00 0 0 0 0 0 0
1.69/1.75 c mostinf : 0.00 0 0 0 0 0 0
1.69/1.75 c leastinf : 0.00 0 0 0 0 0 0
1.69/1.75 c fullstrong : 0.00 0 0 0 0 0 0
1.69/1.75 c allfullstrong : 0.00 0 0 0 0 0 0
1.69/1.75 c random : 0.00 0 0 0 0 0 0
1.69/1.75 c Primal Heuristics : Time Calls Found
1.69/1.75 c LP solutions : 0.00 - 0
1.69/1.75 c pseudo solutions : 0.00 - 0
1.69/1.75 c trivial : 0.00 1 0
1.69/1.75 c simplerounding : 0.00 0 0
1.69/1.75 c zirounding : 0.00 0 0
1.69/1.75 c rounding : 0.00 0 0
1.69/1.75 c shifting : 0.00 0 0
1.69/1.75 c intshifting : 0.00 0 0
1.69/1.75 c oneopt : 0.00 0 0
1.69/1.75 c twoopt : 0.00 0 0
1.69/1.75 c fixandinfer : 0.00 0 0
1.69/1.75 c feaspump : 0.00 0 0
1.69/1.75 c coefdiving : 0.00 0 0
1.69/1.75 c pscostdiving : 0.00 0 0
1.69/1.75 c fracdiving : 0.00 0 0
1.69/1.75 c veclendiving : 0.00 0 0
1.69/1.75 c intdiving : 0.00 0 0
1.69/1.75 c actconsdiving : 0.00 0 0
1.69/1.75 c objpscostdiving : 0.00 0 0
1.69/1.75 c rootsoldiving : 0.00 0 0
1.69/1.75 c linesearchdiving : 0.00 0 0
1.69/1.75 c guideddiving : 0.00 0 0
1.69/1.75 c octane : 0.00 0 0
1.69/1.75 c rens : 0.00 0 0
1.69/1.75 c rins : 0.00 0 0
1.69/1.75 c localbranching : 0.00 0 0
1.69/1.75 c mutation : 0.00 0 0
1.69/1.75 c crossover : 0.00 0 0
1.69/1.75 c dins : 0.00 0 0
1.69/1.75 c undercover : 0.00 0 0
1.69/1.75 c nlp : 0.00 0 0
1.69/1.75 c trysol : 0.00 0 0
1.69/1.75 c LP : Time Calls Iterations Iter/call Iter/sec
1.69/1.75 c primal LP : 0.00 0 0 0.00 -
1.69/1.75 c dual LP : 0.07 20 934 46.70 13342.86
1.69/1.75 c lex dual LP : 0.00 0 0 0.00 -
1.69/1.75 c barrier LP : 0.00 0 0 0.00 -
1.69/1.75 c diving/probing LP: 0.00 0 0 0.00 -
1.69/1.75 c strong branching : 1.25 113 14153 125.25 11322.40
1.69/1.76 c (at root node) : - 113 14153 125.25 -
1.69/1.76 c conflict analysis: 0.00 0 0 0.00 -
1.69/1.76 c B&B Tree :
1.69/1.76 c number of runs : 3
1.69/1.76 c nodes : 1
1.69/1.76 c nodes (total) : 3
1.69/1.76 c nodes left : 0
1.69/1.76 c max depth : 0
1.69/1.76 c max depth (total): 0
1.69/1.76 c backtracks : 0 (0.0%)
1.69/1.76 c delayed cutoffs : 0
1.69/1.76 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.69/1.76 c avg switch length: 2.00
1.69/1.76 c switching time : 0.00
1.69/1.76 c Solution :
1.69/1.76 c Solutions found : 0 (0 improvements)
1.69/1.76 c Primal Bound : infeasible
1.69/1.76 c Dual Bound : -
1.69/1.76 c Gap : 0.00 %
1.69/1.76 c Root Dual Bound : -
1.69/1.76 c Root Iterations : 934
1.69/1.76 c Time complete: 1.76.