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-2704028-1278548328.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 | 103 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 147 | - |1186k| 0 | 53 | 169 | 228 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 178 | - |1284k| 0 | 58 | 169 | 228 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 206 | - |1312k| 0 | 63 | 169 | 228 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 252 | - |1392k| 0 | 61 | 169 | 228 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 265 | - |1409k| 0 | 64 | 169 | 228 | 169 | 109 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 285 | - |1353k| 0 | 60 | 169 | 177 | 169 | 109 | 36 | 0 | 10 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 0 | 345 | - |1328k| 0 | 50 | 169 | 154 | 169 | 109 | 36 | 0 | 20 | 0.000000e+00 | -- | Inf
0.89/0.91 c 0.9s| 1 | 0 | 369 | - |1325k| 0 | 54 | 169 | 152 | 169 | 109 | 36 | 0 | 32 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 426 | - |1320k| 0 | 48 | 169 | 146 | 169 | 109 | 36 | 0 | 42 | 0.000000e+00 | -- | Inf
1.10/1.13 c 1.1s| 1 | 0 | 437 | - |1309k| 0 | 48 | 169 | 136 | 169 | 109 | 36 | 0 | 47 | 0.000000e+00 | -- | Inf
1.19/1.21 c 1.2s| 1 | 0 | 508 | - |1308k| 0 | 44 | 169 | 134 | 169 | 97 | 36 | 0 | 53 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.3s| 1 | 0 | 533 | - |1302k| 0 | 48 | 169 | 129 | 169 | 97 | 36 | 0 | 66 | 0.000000e+00 | -- | Inf
1.19/1.29 c 1.3s| 1 | 0 | 533 | - |1302k| 0 | - | 169 | 129 | 169 | 97 | 36 | 0 | 71 | 0.000000e+00 | -- | Inf
1.19/1.29 c (run 1, node 1) restarting after 38 global fixings of integer variables
1.19/1.29 c
1.19/1.29 c (restart) converted 24 cuts from the global cut pool into linear constraints
1.19/1.29 c
1.19/1.29 c presolving:
1.29/1.30 c (round 1) 38 del vars, 19 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 81 clqs
1.29/1.30 c (round 2) 38 del vars, 23 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 62 upgd conss, 16 impls, 81 clqs
1.29/1.31 c (round 3) 38 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 62 upgd conss, 16 impls, 81 clqs
1.29/1.31 c presolving (4 rounds):
1.29/1.31 c 38 deleted vars, 25 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.29/1.31 c 16 implications, 81 cliques
1.29/1.31 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 128 constraints
1.29/1.31 c 7 constraints of type <knapsack>
1.29/1.31 c 85 constraints of type <setppc>
1.29/1.31 c 36 constraints of type <logicor>
1.29/1.31 c transformed objective value is always integral (scale: 1)
1.29/1.31 c Presolving Time: 0.03
1.29/1.31 c
1.29/1.32 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.32 c 1.3s| 1 | 0 | 630 | - | 872k| 0 | 46 | 131 | 128 | 131 | 92 | 0 | 0 | 71 | 0.000000e+00 | -- | Inf
1.29/1.34 c 1.3s| 1 | 0 | 651 | - |1103k| 0 | 52 | 131 | 128 | 131 | 107 | 15 | 0 | 71 | 0.000000e+00 | -- | Inf
1.39/1.49 c 1.5s| 1 | 0 | 681 | - |1103k| 0 | 53 | 131 | 128 | 131 | 107 | 15 | 0 | 90 | 0.000000e+00 | -- | Inf
1.49/1.57 c 1.6s| 1 | 0 | 705 | - |1102k| 0 | 49 | 131 | 125 | 131 | 107 | 15 | 0 | 97 | 0.000000e+00 | -- | Inf
1.59/1.62 c 1.6s| 1 | 0 | 763 | - |1102k| 0 | 46 | 131 | 124 | 131 | 107 | 15 | 0 | 102 | 0.000000e+00 | -- | Inf
1.59/1.68 c 1.7s| 1 | 0 | 801 | - |1101k| 0 | 46 | 131 | 123 | 131 | 107 | 15 | 0 | 108 | 0.000000e+00 | -- | Inf
1.69/1.73 c 1.7s| 1 | 0 | 824 | - |1101k| 0 | 40 | 131 | 123 | 131 | 107 | 15 | 0 | 113 | 0.000000e+00 | -- | Inf
1.69/1.78 c 1.8s| 1 | 0 | 824 | - |1101k| 0 | - | 131 | 123 | 131 | 107 | 15 | 0 | 118 | 0.000000e+00 | -- | Inf
1.69/1.78 c (run 2, node 1) restarting after 30 global fixings of integer variables
1.69/1.78 c
1.69/1.78 c (restart) converted 15 cuts from the global cut pool into linear constraints
1.69/1.78 c
1.69/1.78 c presolving:
1.69/1.79 c (round 1) 69 del vars, 34 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 52 impls, 52 clqs
1.69/1.79 c (round 2) 69 del vars, 39 del conss, 0 chg bounds, 6 chg sides, 11 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.80 c (round 3) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 17 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.80 c (round 4) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 22 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.80 c (round 5) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 24 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.80 c (round 6) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 26 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 7) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 28 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 8) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 29 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 9) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 31 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 10) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 33 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 11) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 35 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 12) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 37 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 13) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 39 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.81 c (round 14) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 41 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.82 c (round 15) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 42 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.82 c (round 16) 69 del vars, 49 del conss, 0 chg bounds, 6 chg sides, 43 chg coeffs, 14 upgd conss, 52 impls, 52 clqs
1.79/1.82 c presolving (17 rounds):
1.79/1.82 c 69 deleted vars, 49 deleted constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 43 changed coefficients
1.79/1.82 c 52 implications, 52 cliques
1.79/1.82 c presolved problem has 62 variables (62 bin, 0 int, 0 impl, 0 cont) and 89 constraints
1.79/1.82 c 15 constraints of type <knapsack>
1.79/1.82 c 62 constraints of type <setppc>
1.79/1.82 c 12 constraints of type <logicor>
1.79/1.82 c transformed objective value is always integral (scale: 1)
1.79/1.82 c Presolving Time: 0.07
1.79/1.82 c
1.79/1.82 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.82 c 1.8s| 1 | 0 | 877 | - | 822k| 0 | 31 | 62 | 89 | 62 | 77 | 0 | 0 | 118 | 0.000000e+00 | -- | Inf
1.79/1.84 c 1.8s| 1 | 0 | 928 | - |1033k| 0 | - | 62 | 89 | 62 | 90 | 13 | 0 | 118 | -- | -- | 0.00%
1.79/1.84 c 1.8s| 1 | 0 | 928 | - |1033k| 0 | - | 62 | 89 | 62 | 90 | 13 | 0 | 118 | -- | -- | 0.00%
1.79/1.84 c
1.79/1.84 c SCIP Status : problem is solved [infeasible]
1.79/1.84 c Solving Time (sec) : 1.82
1.79/1.84 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.79/1.84 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.79/1.84 c Dual Bound : +1.00000000000000e+20
1.79/1.84 c Gap : 0.00 %
1.79/1.84 s UNSATISFIABLE
1.79/1.84 c SCIP Status : problem is solved [infeasible]
1.79/1.84 c Solving Time : 1.82
1.79/1.84 c Original Problem :
1.79/1.84 c Problem name : HOME/instance-2704028-1278548328.opb
1.79/1.84 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.84 c Constraints : 101 initial, 101 maximal
1.79/1.84 c Presolved Problem :
1.79/1.84 c Problem name : t_HOME/instance-2704028-1278548328.opb
1.79/1.84 c Variables : 62 (62 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.84 c Constraints : 89 initial, 89 maximal
1.79/1.84 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.79/1.84 c trivial : 0.00 68 0 0 0 0 0 0 0
1.79/1.84 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c implics : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c probing : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c knapsack : 0.04 0 0 0 0 0 0 6 43
1.79/1.84 c setppc : 0.01 39 0 0 0 0 30 0 0
1.79/1.84 c linear : 0.01 0 0 0 0 0 48 0 0
1.79/1.84 c logicor : 0.00 0 0 0 0 0 24 0 0
1.79/1.84 c root node : - 68 - - 68 - - - -
1.79/1.84 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.79/1.84 c integral : 0 0 0 14 0 0 68 0 0 0
1.79/1.84 c knapsack : 15 7 15 0 0 0 0 0 0 0
1.79/1.84 c setppc : 62 7 15 0 0 0 0 0 0 0
1.79/1.84 c logicor : 12 2 5 0 0 0 0 0 0 0
1.79/1.84 c countsols : 0 0 0 0 0 0 0 0 0 0
1.79/1.84 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.79/1.84 c integral : 1.40 0.00 0.00 1.40 0.00
1.79/1.84 c knapsack : 0.01 0.01 0.00 0.00 0.00
1.79/1.84 c setppc : 0.00 0.00 0.00 0.00 0.00
1.79/1.84 c logicor : 0.00 0.00 0.00 0.00 0.00
1.79/1.84 c countsols : 0.00 0.00 0.00 0.00 0.00
1.79/1.84 c Propagators : Time Calls Cutoffs DomReds
1.79/1.84 c vbounds : 0.00 3 0 0
1.79/1.84 c rootredcost : 0.00 0 0 0
1.79/1.84 c pseudoobj : 0.00 0 0 0
1.79/1.84 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.79/1.84 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.84 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.84 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.84 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.84 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.84 c applied globally : - - - 0 0.0 - - -
1.79/1.84 c applied locally : - - - 0 0.0 - - -
1.79/1.84 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.79/1.84 c cut pool : 0.00 0 - - 0 - (maximal pool size: 117)
1.79/1.84 c redcost : 0.00 7 0 0 0 0
1.79/1.84 c impliedbounds : 0.00 7 0 0 0 0
1.79/1.84 c intobj : 0.00 0 0 0 0 0
1.79/1.84 c cgmip : 0.00 0 0 0 0 0
1.79/1.84 c gomory : 0.05 7 0 0 68 0
1.79/1.84 c strongcg : 0.05 7 0 0 238 0
1.79/1.84 c cmir : 0.00 0 0 0 0 0
1.79/1.84 c flowcover : 0.00 0 0 0 0 0
1.79/1.84 c clique : 0.00 7 0 0 37 0
1.79/1.84 c zerohalf : 0.00 0 0 0 0 0
1.79/1.84 c mcf : 0.00 3 0 0 0 0
1.79/1.84 c rapidlearning : 0.16 1 0 0 0 155
1.79/1.84 c Pricers : Time Calls Vars
1.79/1.84 c problem variables: 0.00 0 0
1.79/1.84 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.79/1.84 c relpscost : 1.40 14 0 68 0 0 0
1.79/1.84 c pscost : 0.00 0 0 0 0 0 0
1.79/1.84 c inference : 0.00 0 0 0 0 0 0
1.79/1.84 c mostinf : 0.00 0 0 0 0 0 0
1.79/1.84 c leastinf : 0.00 0 0 0 0 0 0
1.79/1.84 c fullstrong : 0.00 0 0 0 0 0 0
1.79/1.84 c allfullstrong : 0.00 0 0 0 0 0 0
1.79/1.84 c random : 0.00 0 0 0 0 0 0
1.79/1.84 c Primal Heuristics : Time Calls Found
1.79/1.84 c LP solutions : 0.00 - 0
1.79/1.84 c pseudo solutions : 0.00 - 0
1.79/1.84 c trivial : 0.00 1 0
1.79/1.84 c simplerounding : 0.00 0 0
1.79/1.84 c zirounding : 0.00 0 0
1.79/1.84 c rounding : 0.00 0 0
1.79/1.84 c shifting : 0.00 0 0
1.79/1.84 c intshifting : 0.00 0 0
1.79/1.84 c oneopt : 0.00 0 0
1.79/1.84 c twoopt : 0.00 0 0
1.79/1.84 c fixandinfer : 0.00 0 0
1.79/1.84 c feaspump : 0.00 0 0
1.79/1.84 c coefdiving : 0.00 0 0
1.79/1.84 c pscostdiving : 0.00 0 0
1.79/1.84 c fracdiving : 0.00 0 0
1.79/1.84 c veclendiving : 0.00 0 0
1.79/1.84 c intdiving : 0.00 0 0
1.79/1.84 c actconsdiving : 0.00 0 0
1.79/1.84 c objpscostdiving : 0.00 0 0
1.79/1.84 c rootsoldiving : 0.00 0 0
1.79/1.84 c linesearchdiving : 0.00 0 0
1.79/1.84 c guideddiving : 0.00 0 0
1.79/1.84 c octane : 0.00 0 0
1.79/1.84 c rens : 0.00 0 0
1.79/1.84 c rins : 0.00 0 0
1.79/1.84 c localbranching : 0.00 0 0
1.79/1.84 c mutation : 0.00 0 0
1.79/1.84 c crossover : 0.00 0 0
1.79/1.84 c dins : 0.00 0 0
1.79/1.84 c undercover : 0.00 0 0
1.79/1.84 c nlp : 0.00 0 0
1.79/1.84 c trysol : 0.00 0 0
1.79/1.84 c LP : Time Calls Iterations Iter/call Iter/sec
1.79/1.84 c primal LP : 0.00 0 0 0.00 -
1.79/1.84 c dual LP : 0.07 22 928 42.18 14061.03
1.79/1.84 c lex dual LP : 0.00 0 0 0.00 -
1.79/1.84 c barrier LP : 0.00 0 0 0.00 -
1.79/1.84 c diving/probing LP: 0.00 0 0 0.00 -
1.79/1.84 c strong branching : 1.40 118 15338 129.98 10948.21
1.79/1.84 c (at root node) : - 118 15338 129.98 -
1.79/1.84 c conflict analysis: 0.00 0 0 0.00 -
1.79/1.84 c B&B Tree :
1.79/1.84 c number of runs : 3
1.79/1.84 c nodes : 1
1.79/1.84 c nodes (total) : 3
1.79/1.84 c nodes left : 0
1.79/1.84 c max depth : 0
1.79/1.84 c max depth (total): 0
1.79/1.84 c backtracks : 0 (0.0%)
1.79/1.84 c delayed cutoffs : 0
1.79/1.84 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.79/1.84 c avg switch length: 2.00
1.79/1.84 c switching time : 0.00
1.79/1.84 c Solution :
1.79/1.84 c Solutions found : 0 (0 improvements)
1.79/1.84 c Primal Bound : infeasible
1.79/1.84 c Dual Bound : -
1.79/1.84 c Gap : 0.00 %
1.79/1.84 c Root Dual Bound : -
1.79/1.84 c Root Iterations : 928
1.79/1.84 c Time complete: 1.84.