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-2704006-1278548315.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 | 106 | - | 743k| 0 | 44 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 141 | - |1195k| 0 | 49 | 169 | 228 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 176 | - |1465k| 0 | 56 | 169 | 228 | 169 | 93 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 227 | - |1603k| 0 | 61 | 169 | 228 | 169 | 99 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 274 | - |1617k| 0 | 57 | 169 | 228 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 316 | - |1626k| 0 | 55 | 169 | 228 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.48 c 0.5s| 1 | 0 | 344 | - |1605k| 0 | 55 | 169 | 207 | 169 | 104 | 31 | 0 | 12 | 0.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 359 | - |1573k| 0 | 58 | 169 | 179 | 169 | 104 | 31 | 0 | 25 | 0.000000e+00 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 362 | - |1570k| 0 | 57 | 169 | 176 | 169 | 104 | 31 | 0 | 37 | 0.000000e+00 | -- | Inf
0.89/0.99 c 1.0s| 1 | 0 | 376 | - |1564k| 0 | 57 | 169 | 171 | 169 | 104 | 31 | 0 | 49 | 0.000000e+00 | -- | Inf
1.00/1.07 c 1.1s| 1 | 0 | 384 | - |1546k| 0 | 57 | 169 | 153 | 169 | 104 | 31 | 0 | 54 | 0.000000e+00 | -- | Inf
1.09/1.16 c 1.1s| 1 | 0 | 391 | - |1477k| 0 | 55 | 169 | 93 | 169 | 101 | 31 | 0 | 60 | 0.000000e+00 | -- | Inf
1.29/1.35 c 1.3s| 1 | 0 | 404 | - |1476k| 0 | 55 | 169 | 91 | 169 | 101 | 31 | 0 | 73 | 0.000000e+00 | -- | Inf
1.39/1.48 c 1.5s| 1 | 0 | 422 | - |1474k| 0 | 58 | 169 | 89 | 169 | 101 | 31 | 0 | 83 | 0.000000e+00 | -- | Inf
1.59/1.67 c 1.7s| 1 | 0 | 422 | - |1474k| 0 | - | 169 | 89 | 169 | 101 | 31 | 0 | 96 | 0.000000e+00 | -- | Inf
1.59/1.67 c (run 1, node 1) restarting after 37 global fixings of integer variables
1.59/1.67 c
1.59/1.67 c (restart) converted 28 cuts from the global cut pool into linear constraints
1.59/1.67 c
1.59/1.67 c presolving:
1.59/1.68 c (round 1) 37 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 45 upgd conss, 14 impls, 80 clqs
1.59/1.69 c (round 2) 37 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 45 upgd conss, 14 impls, 80 clqs
1.59/1.69 c presolving (3 rounds):
1.59/1.69 c 37 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.59/1.69 c 14 implications, 80 cliques
1.59/1.69 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 115 constraints
1.59/1.69 c 14 constraints of type <knapsack>
1.59/1.69 c 84 constraints of type <setppc>
1.59/1.69 c 17 constraints of type <logicor>
1.59/1.69 c transformed objective value is always integral (scale: 1)
1.59/1.69 c Presolving Time: 0.03
1.59/1.69 c
1.59/1.70 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.70 c 1.7s| 1 | 0 | 503 | - | 955k| 0 | 43 | 132 | 115 | 132 | 98 | 0 | 0 | 96 | 0.000000e+00 | -- | Inf
1.69/1.72 c 1.7s| 1 | 0 | 528 | - |1213k| 0 | 54 | 132 | 115 | 132 | 113 | 15 | 0 | 96 | 0.000000e+00 | -- | Inf
1.89/1.95 c 1.9s| 1 | 0 | 531 | - |1213k| 0 | 53 | 132 | 114 | 132 | 113 | 15 | 0 | 114 | 0.000000e+00 | -- | Inf
2.09/2.16 c 2.1s| 1 | 0 | 533 | - |1213k| 0 | 54 | 132 | 114 | 132 | 113 | 15 | 0 | 131 | 0.000000e+00 | -- | Inf
2.29/2.38 c 2.4s| 1 | 0 | 542 | - |1212k| 0 | 55 | 132 | 113 | 132 | 113 | 15 | 0 | 147 | 0.000000e+00 | -- | Inf
2.49/2.53 c 2.5s| 1 | 0 | 561 | - |1212k| 0 | 57 | 132 | 113 | 132 | 113 | 15 | 0 | 156 | 0.000000e+00 | -- | Inf
2.69/2.75 c 2.7s| 1 | 0 | 569 | - |1212k| 0 | 58 | 132 | 113 | 132 | 113 | 15 | 0 | 168 | 0.000000e+00 | -- | Inf
2.79/2.88 c 2.9s| 1 | 0 | 578 | - |1211k| 0 | 56 | 132 | 110 | 132 | 113 | 15 | 0 | 176 | 0.000000e+00 | -- | Inf
2.89/2.93 c 2.9s| 1 | 0 | 582 | - |1211k| 0 | 57 | 132 | 110 | 132 | 113 | 15 | 0 | 180 | 0.000000e+00 | -- | Inf
2.89/2.99 c 3.0s| 1 | 0 | 585 | - |1211k| 0 | 57 | 132 | 110 | 132 | 113 | 15 | 0 | 184 | 0.000000e+00 | -- | Inf
2.99/3.03 c 3.0s| 1 | 2 | 585 | - |1212k| 0 | 57 | 132 | 110 | 132 | 113 | 15 | 0 | 186 | 0.000000e+00 | -- | Inf
2.99/3.03 c (run 2, node 1) restarting after 25 global fixings of integer variables
2.99/3.03 c
2.99/3.03 c (restart) converted 12 cuts from the global cut pool into linear constraints
2.99/3.03 c
2.99/3.03 c presolving:
2.99/3.04 c (round 1) 25 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 16 impls, 82 clqs
2.99/3.05 c (round 2) 25 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 16 impls, 82 clqs
2.99/3.05 c presolving (3 rounds):
2.99/3.05 c 25 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.99/3.05 c 16 implications, 82 cliques
2.99/3.05 c presolved problem has 107 variables (107 bin, 0 int, 0 impl, 0 cont) and 120 constraints
2.99/3.05 c 22 constraints of type <knapsack>
2.99/3.05 c 82 constraints of type <setppc>
2.99/3.05 c 16 constraints of type <logicor>
2.99/3.05 c transformed objective value is always integral (scale: 1)
2.99/3.05 c Presolving Time: 0.06
2.99/3.05 c
2.99/3.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.99/3.06 c 3.0s| 1 | 0 | 659 | - | 985k| 0 | 45 | 107 | 120 | 107 | 104 | 0 | 0 | 186 | 0.000000e+00 | -- | Inf
2.99/3.08 c 3.1s| 1 | 0 | 682 | - |1201k| 0 | 58 | 107 | 120 | 107 | 118 | 14 | 0 | 186 | 0.000000e+00 | -- | Inf
3.19/3.28 c 3.3s| 1 | 2 | 682 | - |1201k| 0 | 58 | 107 | 120 | 107 | 118 | 14 | 0 | 203 | 0.000000e+00 | -- | Inf
3.99/4.03 c
3.99/4.03 c SCIP Status : problem is solved [infeasible]
3.99/4.03 c Solving Time (sec) : 4.02
3.99/4.03 c Solving Nodes : 9 (total of 11 nodes in 3 runs)
3.99/4.03 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.99/4.03 c Dual Bound : +1.00000000000000e+20
3.99/4.03 c Gap : 0.00 %
3.99/4.03 s UNSATISFIABLE
3.99/4.03 c SCIP Status : problem is solved [infeasible]
3.99/4.03 c Solving Time : 4.02
3.99/4.03 c Original Problem :
3.99/4.03 c Problem name : HOME/instance-2704006-1278548315.opb
3.99/4.03 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.03 c Constraints : 101 initial, 101 maximal
3.99/4.03 c Presolved Problem :
3.99/4.03 c Problem name : t_HOME/instance-2704006-1278548315.opb
3.99/4.03 c Variables : 107 (107 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.03 c Constraints : 120 initial, 122 maximal
3.99/4.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.99/4.03 c trivial : 0.00 62 0 0 0 0 0 0 0
3.99/4.03 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.99/4.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.99/4.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.99/4.03 c implics : 0.00 0 0 0 0 0 0 0 0
3.99/4.03 c probing : 0.00 0 0 0 0 0 0 0 0
3.99/4.03 c knapsack : 0.03 0 0 0 0 0 0 0 0
3.99/4.03 c setppc : 0.01 0 0 0 0 0 4 0 0
3.99/4.03 c linear : 0.01 0 0 0 0 0 28 0 0
3.99/4.03 c logicor : 0.00 0 0 0 0 0 0 0 0
3.99/4.03 c root node : - 135 - - 135 - - - -
3.99/4.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.99/4.03 c integral : 0 0 0 49 0 1 166 0 0 10
3.99/4.03 c knapsack : 22 7 72 0 0 0 3 0 0 0
3.99/4.03 c setppc : 82 7 72 0 0 0 133 0 0 0
3.99/4.03 c logicor : 16+ 2 30 0 0 0 1 0 0 0
3.99/4.03 c countsols : 0 0 0 0 0 0 0 0 0 0
3.99/4.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.99/4.03 c integral : 3.55 0.00 0.00 3.55 0.00
3.99/4.03 c knapsack : 0.02 0.01 0.01 0.00 0.00
3.99/4.03 c setppc : 0.00 0.00 0.00 0.00 0.00
3.99/4.03 c logicor : 0.00 0.00 0.00 0.00 0.00
3.99/4.03 c countsols : 0.00 0.00 0.00 0.00 0.00
3.99/4.03 c Propagators : Time Calls Cutoffs DomReds
3.99/4.03 c vbounds : 0.00 3 0 0
3.99/4.03 c rootredcost : 0.00 0 0 0
3.99/4.03 c pseudoobj : 0.00 0 0 0
3.99/4.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.99/4.03 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.03 c infeasible LP : 0.00 4 3 5 7.6 0 0.0 0
3.99/4.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.03 c applied globally : - - - 4 9.5 - - -
3.99/4.03 c applied locally : - - - 0 0.0 - - -
3.99/4.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.99/4.03 c cut pool : 0.00 0 - - 0 - (maximal pool size: 83)
3.99/4.03 c redcost : 0.00 14 0 0 0 0
3.99/4.03 c impliedbounds : 0.00 7 0 0 0 0
3.99/4.03 c intobj : 0.00 0 0 0 0 0
3.99/4.03 c cgmip : 0.00 0 0 0 0 0
3.99/4.03 c gomory : 0.05 7 0 0 3 0
3.99/4.03 c strongcg : 0.06 7 0 0 305 0
3.99/4.03 c cmir : 0.00 0 0 0 0 0
3.99/4.03 c flowcover : 0.00 0 0 0 0 0
3.99/4.03 c clique : 0.00 7 0 0 33 0
3.99/4.03 c zerohalf : 0.00 0 0 0 0 0
3.99/4.03 c mcf : 0.00 3 0 0 0 0
3.99/4.03 c rapidlearning : 0.16 1 0 0 0 155
3.99/4.03 c Pricers : Time Calls Vars
3.99/4.03 c problem variables: 0.00 0 0
3.99/4.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.99/4.03 c relpscost : 3.55 49 1 166 0 0 10
3.99/4.03 c pscost : 0.00 0 0 0 0 0 0
3.99/4.03 c inference : 0.00 0 0 0 0 0 0
3.99/4.03 c mostinf : 0.00 0 0 0 0 0 0
3.99/4.03 c leastinf : 0.00 0 0 0 0 0 0
3.99/4.03 c fullstrong : 0.00 0 0 0 0 0 0
3.99/4.03 c allfullstrong : 0.00 0 0 0 0 0 0
3.99/4.03 c random : 0.00 0 0 0 0 0 0
3.99/4.03 c Primal Heuristics : Time Calls Found
3.99/4.03 c LP solutions : 0.00 - 0
3.99/4.03 c pseudo solutions : 0.00 - 0
3.99/4.03 c trivial : 0.00 1 0
3.99/4.03 c simplerounding : 0.00 0 0
3.99/4.03 c zirounding : 0.00 0 0
3.99/4.03 c rounding : 0.00 0 0
3.99/4.03 c shifting : 0.00 0 0
3.99/4.03 c intshifting : 0.00 0 0
3.99/4.03 c oneopt : 0.00 0 0
3.99/4.03 c twoopt : 0.00 0 0
3.99/4.03 c fixandinfer : 0.00 0 0
3.99/4.03 c feaspump : 0.00 0 0
3.99/4.03 c coefdiving : 0.00 0 0
3.99/4.03 c pscostdiving : 0.00 0 0
3.99/4.03 c fracdiving : 0.00 0 0
3.99/4.03 c veclendiving : 0.00 0 0
3.99/4.03 c intdiving : 0.00 0 0
3.99/4.03 c actconsdiving : 0.00 0 0
3.99/4.03 c objpscostdiving : 0.00 0 0
3.99/4.03 c rootsoldiving : 0.00 0 0
3.99/4.03 c linesearchdiving : 0.00 0 0
3.99/4.03 c guideddiving : 0.00 0 0
3.99/4.03 c octane : 0.00 0 0
3.99/4.03 c rens : 0.00 0 0
3.99/4.03 c rins : 0.00 0 0
3.99/4.03 c localbranching : 0.00 0 0
3.99/4.03 c mutation : 0.00 0 0
3.99/4.03 c crossover : 0.00 0 0
3.99/4.03 c dins : 0.00 0 0
3.99/4.03 c undercover : 0.00 0 0
3.99/4.03 c nlp : 0.00 0 0
3.99/4.03 c trysol : 0.00 0 0
3.99/4.03 c LP : Time Calls Iterations Iter/call Iter/sec
3.99/4.03 c primal LP : 0.00 0 0 0.00 -
3.99/4.03 c dual LP : 0.09 60 1238 20.63 13170.35
3.99/4.03 c lex dual LP : 0.00 0 0 0.00 -
3.99/4.03 c barrier LP : 0.00 0 0 0.00 -
3.99/4.03 c diving/probing LP: 0.00 0 0 0.00 -
3.99/4.03 c strong branching : 3.54 433 38853 89.73 10963.20
3.99/4.03 c (at root node) : - 203 27959 137.73 -
3.99/4.03 c conflict analysis: 0.00 0 0 0.00 -
3.99/4.03 c B&B Tree :
3.99/4.03 c number of runs : 3
3.99/4.03 c nodes : 9
3.99/4.03 c nodes (total) : 11
3.99/4.03 c nodes left : 0
3.99/4.03 c max depth : 4
3.99/4.03 c max depth (total): 4
3.99/4.03 c backtracks : 0 (0.0%)
3.99/4.03 c delayed cutoffs : 0
3.99/4.03 c repropagations : 6 (1 domain reductions, 0 cutoffs)
3.99/4.03 c avg switch length: 3.56
3.99/4.03 c switching time : 0.00
3.99/4.03 c Solution :
3.99/4.03 c Solutions found : 0 (0 improvements)
3.99/4.03 c Primal Bound : infeasible
3.99/4.03 c Dual Bound : -
3.99/4.03 c Gap : 0.00 %
3.99/4.03 c Root Dual Bound : +0.00000000000000e+00
3.99/4.03 c Root Iterations : 682
3.99/4.04 c Time complete: 4.03.