0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691669-1338029190.opb>
0.04/0.07 c original problem has 7578 variables (7578 bin, 0 int, 0 impl, 0 cont) and 21401 constraints
0.04/0.07 c problem read in 0.07
0.04/0.07 c No objective function, only one solution is needed.
0.04/0.07 c presolving settings loaded
0.09/0.12 c presolving:
0.29/0.31 c (round 1) 1250 del vars, 1917 del conss, 0 add conss, 530 chg bounds, 450 chg sides, 932 chg coeffs, 0 upgd conss, 420742 impls, 0 clqs
0.29/0.34 c (round 2) 1252 del vars, 3420 del conss, 0 add conss, 532 chg bounds, 450 chg sides, 932 chg coeffs, 0 upgd conss, 420894 impls, 0 clqs
0.39/0.43 c (round 3) 1252 del vars, 3426 del conss, 0 add conss, 532 chg bounds, 450 chg sides, 932 chg coeffs, 17987 upgd conss, 420894 impls, 0 clqs
0.39/0.46 c (round 4) 1252 del vars, 3430 del conss, 0 add conss, 532 chg bounds, 450 chg sides, 932 chg coeffs, 17987 upgd conss, 420894 impls, 0 clqs
0.49/0.53 c (round 5) 1252 del vars, 20441 del conss, 5668 add conss, 532 chg bounds, 450 chg sides, 932 chg coeffs, 17987 upgd conss, 420894 impls, 0 clqs
0.49/0.56 c (round 6) 1344 del vars, 20886 del conss, 6111 add conss, 532 chg bounds, 450 chg sides, 933 chg coeffs, 17987 upgd conss, 424272 impls, 6 clqs
0.49/0.58 c (round 7) 1363 del vars, 20983 del conss, 6202 add conss, 532 chg bounds, 450 chg sides, 939 chg coeffs, 17987 upgd conss, 429906 impls, 448 clqs
0.49/0.59 c (round 8) 1375 del vars, 20994 del conss, 6202 add conss, 532 chg bounds, 450 chg sides, 940 chg coeffs, 17987 upgd conss, 429906 impls, 457 clqs
0.58/0.61 c (round 9) 1382 del vars, 21019 del conss, 6202 add conss, 532 chg bounds, 450 chg sides, 946 chg coeffs, 17987 upgd conss, 429906 impls, 457 clqs
0.58/0.61 c (round 10) 1383 del vars, 21020 del conss, 6202 add conss, 532 chg bounds, 450 chg sides, 947 chg coeffs, 17987 upgd conss, 429906 impls, 457 clqs
0.58/0.63 c (round 11) 1388 del vars, 21039 del conss, 6221 add conss, 532 chg bounds, 450 chg sides, 947 chg coeffs, 17987 upgd conss, 430352 impls, 457 clqs
0.58/0.65 c (round 12) 1391 del vars, 21053 del conss, 6233 add conss, 532 chg bounds, 450 chg sides, 947 chg coeffs, 17987 upgd conss, 430366 impls, 458 clqs
0.69/0.71 c (round 13) 1399 del vars, 21073 del conss, 6235 add conss, 532 chg bounds, 450 chg sides, 948 chg coeffs, 17987 upgd conss, 431230 impls, 465 clqs
0.69/0.78 c presolving (14 rounds):
0.69/0.78 c 1399 deleted vars, 21073 deleted constraints, 6235 added constraints, 532 tightened bounds, 0 added holes, 450 changed sides, 948 changed coefficients
0.69/0.78 c 431230 implications, 465 cliques
0.69/0.78 c presolved problem has 6179 variables (6179 bin, 0 int, 0 impl, 0 cont) and 6554 constraints
0.69/0.78 c 900 constraints of type <knapsack>
0.69/0.78 c 587 constraints of type <setppc>
0.69/0.78 c 5060 constraints of type <and>
0.69/0.78 c 7 constraints of type <logicor>
0.69/0.78 c transformed objective value is always integral (scale: 1)
0.69/0.78 c Presolving Time: 0.67
0.69/0.78 c - non default parameters ----------------------------------------------------------------------
0.69/0.78 c # SCIP version 2.1.1.4
0.69/0.78 c
0.69/0.78 c # maximal time in seconds to run
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.78 c limits/time = 1797
0.69/0.78 c
0.69/0.78 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.78 c limits/memory = 13950
0.69/0.78 c
0.69/0.78 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.78 c limits/solutions = 1
0.69/0.78 c
0.69/0.78 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.78 c separating/maxrounds = 1
0.69/0.78 c
0.69/0.78 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.78 c separating/maxroundsroot = 5
0.69/0.78 c
0.69/0.78 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.69/0.78 c # [type: int, range: [1,2], default: 1]
0.69/0.78 c timing/clocktype = 2
0.69/0.78 c
0.69/0.78 c # belongs reading time to solving time?
0.69/0.78 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.78 c timing/reading = TRUE
0.69/0.78 c
0.69/0.78 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.78 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.78 c constraints/knapsack/disaggregation = FALSE
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/coefdiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.78 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.78 c heuristics/crossover/freq = -1
0.69/0.78 c
0.69/0.78 c # number of nodes added to the contingent of the total nodes
0.69/0.78 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.78 c heuristics/crossover/nodesofs = 750
0.69/0.78 c
0.69/0.78 c # number of nodes without incumbent change that heuristic should wait
0.69/0.78 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.78 c heuristics/crossover/nwaitingnodes = 100
0.69/0.78 c
0.69/0.78 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.78 c # [type: real, range: [0,1], default: 0.1]
0.69/0.78 c heuristics/crossover/nodesquot = 0.15
0.69/0.78 c
0.69/0.78 c # minimum percentage of integer variables that have to be fixed
0.69/0.78 c # [type: real, range: [0,1], default: 0.666]
0.69/0.78 c heuristics/crossover/minfixingrate = 0.5
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.78 c heuristics/feaspump/freq = -1
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/fracdiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.78 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/guideddiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.78 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.78 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/intshifting/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/linesearchdiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.78 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.78 c heuristics/objpscostdiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.78 c # [type: real, range: [0,1], default: 0.01]
0.69/0.78 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c heuristics/oneopt/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/pscostdiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.78 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.78 c heuristics/rens/freq = -1
0.69/0.78 c
0.69/0.78 c # minimum percentage of integer variables that have to be fixable
0.69/0.78 c # [type: real, range: [0,1], default: 0.5]
0.69/0.78 c heuristics/rens/minfixingrate = 0.3
0.69/0.78 c
0.69/0.78 c # number of nodes added to the contingent of the total nodes
0.69/0.78 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.78 c heuristics/rens/nodesofs = 2000
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.78 c heuristics/rootsoldiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.78 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c heuristics/rounding/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.78 c heuristics/shiftandpropagate/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/shifting/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c heuristics/simplerounding/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c heuristics/subnlp/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.78 c heuristics/trivial/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c heuristics/trysol/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.78 c heuristics/undercover/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.78 c heuristics/veclendiving/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.78 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.78 c
0.69/0.78 c # additional number of allowed LP iterations
0.69/0.78 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.78 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c heuristics/zirounding/freq = -1
0.69/0.78 c
0.69/0.78 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.78 c propagating/probing/maxprerounds = 0
0.69/0.78 c
0.69/0.78 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.78 c separating/cmir/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.78 c separating/flowcover/freq = -1
0.69/0.78 c
0.69/0.78 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.78 c separating/rapidlearning/freq = 0
0.69/0.78 c
0.69/0.78 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c heuristics/indoneopt/freq = -1
0.69/0.78 c
0.69/0.78 c -----------------------------------------------------------------------------------------------
0.69/0.78 c start solving
0.69/0.78 c
0.89/0.93 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.93 c 0.9s| 1 | 0 | 1372 | - | 55M| 0 |1073 |6179 |6554 |6179 | 11k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.92 c 2.9s| 1 | 0 | 3398 | - | 55M| 0 |1743 |6179 |6912 |6179 | 11k| 881 | 0 | 0 | 0.000000e+00 | -- | Inf
3.59/3.68 c 3.7s| 1 | 0 | 5803 | - | 56M| 0 |1870 |6179 |6912 |6179 | 12k|2092 | 0 | 0 | 0.000000e+00 | -- | Inf
4.39/4.44 c 4.4s| 1 | 0 | 7935 | - | 57M| 0 |2103 |6179 |6912 |6179 | 14k|3528 | 0 | 0 | 0.000000e+00 | -- | Inf
5.49/5.59 c 5.6s| 1 | 0 | 10619 | - | 58M| 0 |2248 |6179 |6912 |6179 | 15k|4769 | 0 | 0 | 0.000000e+00 | -- | Inf
8.29/8.33 c 8.3s| 1 | 0 | 15323 | - | 60M| 0 |2693 |6179 |6912 |6179 | 16k|6137 | 0 | 0 | 0.000000e+00 | -- | Inf
12.29/12.31 c 12.3s| 1 | 2 | 15323 | - | 60M| 0 |2693 |6179 |6912 |6179 | 16k|6137 | 0 | 10 | 0.000000e+00 | -- | Inf
12.29/12.31 c (run 1, node 1) restarting after 383 global fixings of integer variables
12.29/12.31 c
12.29/12.33 c (restart) converted 1017 cuts from the global cut pool into linear constraints
12.29/12.33 c
12.29/12.35 c presolving:
12.38/12.40 c (round 1) 815 del vars, 456 del conss, 0 add conss, 2 chg bounds, 243 chg sides, 577 chg coeffs, 5 upgd conss, 479753 impls, 346 clqs
12.38/12.41 c (round 2) 863 del vars, 497 del conss, 0 add conss, 2 chg bounds, 343 chg sides, 703 chg coeffs, 10 upgd conss, 480294 impls, 339 clqs
12.38/12.46 c (round 3) 872 del vars, 816 del conss, 0 add conss, 2 chg bounds, 352 chg sides, 706 chg coeffs, 1452 upgd conss, 481524 impls, 338 clqs
12.49/12.50 c (round 4) 904 del vars, 940 del conss, 118 add conss, 2 chg bounds, 365 chg sides, 751 chg coeffs, 1453 upgd conss, 504651 impls, 338 clqs
12.49/12.52 c (round 5) 916 del vars, 954 del conss, 118 add conss, 2 chg bounds, 367 chg sides, 762 chg coeffs, 1453 upgd conss, 505355 impls, 450 clqs
12.49/12.54 c (round 6) 920 del vars, 962 del conss, 118 add conss, 2 chg bounds, 367 chg sides, 767 chg coeffs, 1453 upgd conss, 505355 impls, 450 clqs
12.49/12.59 c (round 7) 930 del vars, 998 del conss, 145 add conss, 2 chg bounds, 369 chg sides, 767 chg coeffs, 1453 upgd conss, 534773 impls, 450 clqs
12.58/12.61 c (round 8) 960 del vars, 1019 del conss, 145 add conss, 2 chg bounds, 369 chg sides, 769 chg coeffs, 1453 upgd conss, 539181 impls, 443 clqs
12.58/12.64 c (round 9) 963 del vars, 1038 del conss, 145 add conss, 2 chg bounds, 369 chg sides, 772 chg coeffs, 1453 upgd conss, 539181 impls, 443 clqs
12.69/12.73 c (round 10) 1020 del vars, 1203 del conss, 166 add conss, 2 chg bounds, 369 chg sides, 772 chg coeffs, 1453 upgd conss, 547101 impls, 443 clqs
12.79/12.80 c (round 11) 1026 del vars, 1216 del conss, 172 add conss, 2 chg bounds, 369 chg sides, 772 chg coeffs, 1453 upgd conss, 548031 impls, 458 clqs
12.79/12.86 c (round 12) 1026 del vars, 1229 del conss, 175 add conss, 2 chg bounds, 369 chg sides, 772 chg coeffs, 1453 upgd conss, 548031 impls, 463 clqs
12.88/12.94 c presolving (13 rounds):
12.88/12.94 c 1026 deleted vars, 1229 deleted constraints, 175 added constraints, 2 tightened bounds, 0 added holes, 369 changed sides, 772 changed coefficients
12.88/12.94 c 548031 implications, 466 cliques
12.88/12.94 c presolved problem has 5153 variables (5153 bin, 0 int, 0 impl, 0 cont) and 6823 constraints
12.88/12.94 c 953 constraints of type <knapsack>
12.88/12.94 c 1387 constraints of type <setppc>
12.88/12.94 c 4047 constraints of type <and>
12.88/12.94 c 436 constraints of type <logicor>
12.88/12.94 c transformed objective value is always integral (scale: 1)
12.88/12.94 c Presolving Time: 1.26
12.88/12.94 c
12.99/13.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
12.99/13.10 c 13.1s| 1 | 0 | 17071 | - | 53M| 0 |1163 |5153 |6823 |5153 | 10k| 0 | 0 | 10 | 0.000000e+00 | -- | Inf
13.49/13.58 c 13.6s| 1 | 0 | 18719 | - | 54M| 0 |1645 |5153 |6823 |5153 | 11k| 951 | 0 | 10 | 0.000000e+00 | -- | Inf
15.79/15.85 c 15.9s| 1 | 2 | 18719 | - | 54M| 0 |1645 |5153 |6823 |5153 | 11k| 951 | 0 | 27 | 0.000000e+00 | -- | Inf
50.48/50.51 c 50.5s| 100 | 26 | 35279 | 165.6 | 55M| 31 | - |5153 |6918 | 0 | 0 |3046 | 95 | 540 | 0.000000e+00 | -- | Inf
52.58/52.65 c 52.6s| 200 | 27 | 41121 | 112.0 | 56M| 49 | 821 |5153 |6999 |5153 | 10k|3679 | 176 | 540 | 0.000000e+00 | -- | Inf
59.78/59.84 c 59.8s| 300 | 35 | 58119 | 131.3 | 56M| 49 |1125 |5153 |7163 |5153 | 10k|6417 | 340 | 588 | 0.000000e+00 | -- | Inf
63.37/63.44 c 63.4s| 400 | 32 | 64332 | 114.0 | 56M| 49 | - |5153 |7300 | 0 | 0 |7471 | 477 | 628 | 0.000000e+00 | -- | Inf
69.87/69.93 c 69.9s| 500 | 39 | 80611 | 123.8 | 56M| 49 |1159 |5153 |7436 |5153 | 11k| 10k| 613 | 676 | 0.000000e+00 | -- | Inf
76.27/76.35 c 76.3s| 600 | 41 | 95783 | 128.4 | 57M| 49 |1101 |5153 |7578 |5153 | 10k| 13k| 755 | 722 | 0.000000e+00 | -- | Inf
80.07/80.14 c 80.1s| 700 | 51 |104224 | 122.2 | 57M| 49 | 720 |5153 |7643 |5153 | 10k| 14k| 821 | 754 | 0.000000e+00 | -- | Inf
85.57/85.67 c 85.7s| 800 | 41 |115209 | 120.6 | 57M| 49 | - |5153 |7763 | 0 | 0 | 16k| 951 | 813 | 0.000000e+00 | -- | Inf
90.56/90.68 c 90.7s| 900 | 37 |128415 | 121.9 | 57M| 49 | 826 |5153 |7864 |5153 | 10k| 18k|1073 | 844 | 0.000000e+00 | -- | Inf
99.16/99.24 c 99.2s| 1000 | 28 |150702 | 132.0 | 56M| 49 |1110 |5153 |7929 |5153 | 11k| 21k|1204 | 908 | 0.000000e+00 | -- | Inf
101.86/101.90 c 102s| 1100 | 26 |156271 | 125.0 | 56M| 49 |1017 |5153 |8022 |5153 | 11k| 22k|1305 | 924 | 0.000000e+00 | -- | Inf
108.66/108.70 c 109s| 1200 | 22 |171159 | 127.0 | 57M| 49 | - |5153 |8025 | 0 | 0 | 24k|1366 | 971 | 0.000000e+00 | -- | Inf
114.56/114.63 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
114.56/114.63 c 115s| 1300 | 31 |185300 | 128.1 | 57M| 49 | - |5153 |8020 | 0 | 0 | 26k|1433 |1016 | 0.000000e+00 | -- | Inf
120.46/120.51 c 121s| 1400 | 22 |199779 | 129.3 | 57M| 49 | - |5153 |7979 | 0 | 0 | 29k|1529 |1047 | 0.000000e+00 | -- | Inf
127.05/127.17 c 127s| 1500 | 25 |214723 | 130.7 | 57M| 49 |1087 |5153 |7982 |5153 | 10k| 32k|1618 |1108 | 0.000000e+00 | -- | Inf
132.16/132.28 c 132s| 1600 | 20 |225051 | 129.0 | 57M| 49 | - |5153 |8021 | 0 | 0 | 33k|1696 |1153 | 0.000000e+00 | -- | Inf
138.86/138.98 c 139s| 1700 | 22 |243792 | 132.4 | 57M| 49 |1247 |5153 |8051 |5153 | 11k| 36k|1782 |1199 | 0.000000e+00 | -- | Inf
147.76/147.89 c 148s| 1800 | 17 |263376 | 135.9 | 57M| 49 |1736 |5153 |8123 |5153 | 10k| 40k|1903 |1273 | 0.000000e+00 | -- | Inf
156.16/156.23 c 156s| 1900 | 14 |284842 | 140.1 | 57M| 49 | - |5153 |8167 | 0 | 0 | 44k|2034 |1334 | 0.000000e+00 | -- | Inf
163.35/163.42 c 163s| 2000 | 24 |302483 | 141.9 | 57M| 49 | 753 |5153 |8168 |5153 | 10k| 47k|2117 |1409 | 0.000000e+00 | -- | Inf
171.35/171.48 c 171s| 2100 | 15 |323514 | 145.1 | 57M| 49 |1008 |5153 |8131 |5153 | 10k| 51k|2238 |1469 | 0.000000e+00 | -- | Inf
178.55/178.69 c 179s| 2200 | 21 |341859 | 146.9 | 57M| 49 | - |5153 |8199 | 0 | 0 | 54k|2382 |1514 | 0.000000e+00 | -- | Inf
183.95/184.01 c 184s| 2300 | 11 |355420 | 146.4 | 57M| 49 | - |5153 |8264 | 0 | 0 | 57k|2506 |1559 | 0.000000e+00 | -- | Inf
189.84/189.90 c 190s| 2400 | 14 |368386 | 145.7 | 57M| 49 |1165 |5153 |8357 |5153 | 10k| 59k|2620 |1604 | 0.000000e+00 | -- | Inf
194.56/194.60 c 195s| 2500 | 23 |377786 | 143.6 | 57M| 49 | 876 |5153 |8456 |5153 | 11k| 60k|2737 |1652 | 0.000000e+00 | -- | Inf
199.64/199.71 c 200s| 2600 | 11 |389856 | 142.7 | 57M| 49 |1310 |5153 |8548 |5153 | 11k| 63k|2862 |1682 | 0.000000e+00 | -- | Inf
205.44/205.53 c 206s| 2700 | 15 |404091 | 142.7 | 57M| 49 | - |5153 |8608 | 0 | 0 | 65k|2986 |1722 | 0.000000e+00 | -- | Inf
212.54/212.61 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
212.54/212.61 c 213s| 2800 | 22 |421034 | 143.7 | 57M| 49 |1129 |5153 |8642 |5153 | 11k| 68k|3102 |1771 | 0.000000e+00 | -- | Inf
220.04/220.15 c 220s| 2900 | 25 |439468 | 145.1 | 57M| 49 | - |5153 |8683 | 0 | 0 | 70k|3199 |1816 | 0.000000e+00 | -- | Inf
230.04/230.13 c 230s| 3000 | 8 |466680 | 149.3 | 57M| 49 |1377 |5153 |8654 |5153 | 11k| 76k|3288 |1891 | 0.000000e+00 | -- | Inf
239.04/239.12 c 239s| 3100 | 8 |490410 | 152.2 | 57M| 49 |1215 |5153 |8665 |5153 | 11k| 79k|3417 |1964 | 0.000000e+00 | -- | Inf
246.84/246.95 c 247s| 3200 | 10 |511273 | 153.9 | 56M| 49 | 771 |5153 |8325 |5153 | 10k| 83k|3515 |2023 | 0.000000e+00 | -- | Inf
251.44/251.55 c
251.44/251.55 c SCIP Status : problem is solved [infeasible]
251.44/251.55 c Solving Time (sec) : 251.55
251.44/251.55 c Solving Nodes : 3228 (total of 3229 nodes in 2 runs)
251.44/251.55 c Primal Bound : +1.00000000000000e+20 (0 solutions)
251.44/251.55 c Dual Bound : +1.00000000000000e+20
251.44/251.55 c Gap : 0.00 %
251.44/251.55 s UNSATISFIABLE
251.44/251.55 c SCIP Status : problem is solved [infeasible]
251.44/251.55 c Total Time : 251.55
251.44/251.55 c solving : 251.55
251.44/251.55 c presolving : 1.26 (included in solving)
251.44/251.55 c reading : 0.07 (included in solving)
251.44/251.55 c copying : 0.02 (1 #copies) (minimal 0.02, maximal 0.02, average 0.02)
251.44/251.55 c Original Problem :
251.44/251.55 c Problem name : HOME/instance-3691669-1338029190.opb
251.44/251.55 c Variables : 7578 (7578 binary, 0 integer, 0 implicit integer, 0 continuous)
251.44/251.55 c Constraints : 21401 initial, 21401 maximal
251.44/251.55 c Objective sense : minimize
251.44/251.55 c Presolved Problem :
251.44/251.55 c Problem name : t_HOME/instance-3691669-1338029190.opb
251.44/251.55 c Variables : 5153 (5153 binary, 0 integer, 0 implicit integer, 0 continuous)
251.44/251.55 c Constraints : 6823 initial, 8695 maximal
251.44/251.55 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
251.44/251.55 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c trivial : 0.01 0.00 426 0 0 0 0 0 0 0 0
251.44/251.55 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c gateextraction : 0.05 0.00 0 0 0 0 0 17011 5668 0 0
251.44/251.55 c implics : 0.06 0.00 0 719 0 0 0 0 0 0 0
251.44/251.55 c components : 0.01 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
251.44/251.55 c knapsack : 0.03 0.00 0 0 0 0 0 1 0 15 50
251.44/251.55 c setppc : 0.09 0.00 0 127 0 0 0 320 0 2 0
251.44/251.55 c and : 0.51 0.00 42 571 0 0 0 1184 742 0 365
251.44/251.55 c linear : 0.28 0.01 536 4 0 534 0 3780 0 802 1305
251.44/251.55 c logicor : 0.19 0.00 0 0 0 0 0 6 0 0 0
251.44/251.55 c root node : - - 642 - - 642 - - - - -
251.44/251.55 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
251.44/251.55 c integral : 0 0 0 0 2500 0 2 0 5 111 0 0 4904
251.44/251.55 c knapsack : 953 953 7 35792 0 0 0 995 0 503 1404 0 0
251.44/251.55 c setppc : 1387 1387 7 35792 0 0 0 45512 159 77199 1 0 0
251.44/251.55 c and : 4047 4047 2471 35633 0 0 0 178642 935 441171 128649 0 0
251.44/251.55 c logicor : 436+ 2308 7 17950 0 0 0 20972 329 16325 16 0 0
251.44/251.55 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
251.44/251.55 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
251.44/251.55 c integral : 106.57 0.00 0.00 0.00 106.57 0.00 0.00 0.00
251.44/251.55 c knapsack : 0.51 0.00 0.01 0.49 0.00 0.00 0.00 0.00
251.44/251.55 c setppc : 0.52 0.00 0.00 0.49 0.00 0.00 0.00 0.02
251.44/251.55 c and : 3.61 0.00 1.67 1.86 0.00 0.00 0.00 0.08
251.44/251.55 c logicor : 0.25 0.00 0.00 0.23 0.00 0.00 0.00 0.02
251.44/251.55 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
251.44/251.55 c Propagators : #Propagate #ResProp Cutoffs DomReds
251.44/251.55 c rootredcost : 0 0 0 0
251.44/251.55 c pseudoobj : 0 0 0 0
251.44/251.55 c vbounds : 0 0 0 0
251.44/251.55 c redcost : 4707 0 0 0
251.44/251.55 c probing : 0 0 0 0
251.44/251.55 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
251.44/251.55 c rootredcost : 0.01 0.00 0.00 0.01 0.00
251.44/251.55 c pseudoobj : 0.01 0.00 0.00 0.01 0.00
251.44/251.55 c vbounds : 0.01 0.00 0.00 0.01 0.00
251.44/251.55 c redcost : 0.35 0.00 0.00 0.35 0.00
251.44/251.55 c probing : 0.00 0.00 0.00 0.00 0.00
251.44/251.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
251.44/251.55 c propagation : 0.24 1423 1346 8635 28.9 216 13.9 -
251.44/251.55 c infeasible LP : 0.01 7 7 25 15.0 5 4.0 0
251.44/251.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
251.44/251.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
251.44/251.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
251.44/251.55 c applied globally : - - - 3551 20.5 - - -
251.44/251.55 c applied locally : - - - 0 0.0 - - -
251.44/251.55 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
251.44/251.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 1192)
251.44/251.55 c closecuts : 0.00 0.00 0 0 0 0 0
251.44/251.55 c impliedbounds : 0.02 0.00 6 0 0 10432 0
251.44/251.55 c intobj : 0.00 0.00 0 0 0 0 0
251.44/251.55 c gomory : 0.08 0.00 6 0 0 300 0
251.44/251.55 c cgmip : 0.00 0.00 0 0 0 0 0
251.44/251.55 c strongcg : 0.84 0.00 6 0 0 3000 0
251.44/251.55 c cmir : 0.00 0.00 0 0 0 0 0
251.44/251.55 c flowcover : 0.00 0.00 0 0 0 0 0
251.44/251.55 c clique : 0.64 0.00 6 0 0 43 0
251.44/251.55 c zerohalf : 0.00 0.00 0 0 0 0 0
251.44/251.55 c mcf : 0.01 0.00 2 0 0 0 0
251.44/251.55 c oddcycle : 0.00 0.00 0 0 0 0 0
251.44/251.55 c rapidlearning : 1.40 0.00 1 0 383 0 901
251.44/251.55 c Pricers : ExecTime SetupTime Calls Vars
251.44/251.55 c problem variables: 0.00 - 0 0
251.44/251.55 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
251.44/251.55 c relpscost : 106.56 0.00 2500 5 111 0 0 4904
251.44/251.55 c pscost : 0.00 0.00 0 0 0 0 0 0
251.44/251.55 c inference : 0.00 0.00 0 0 0 0 0 0
251.44/251.55 c mostinf : 0.00 0.00 0 0 0 0 0 0
251.44/251.55 c leastinf : 0.00 0.00 0 0 0 0 0 0
251.44/251.55 c fullstrong : 0.00 0.00 0 0 0 0 0 0
251.44/251.55 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
251.44/251.55 c random : 0.00 0.00 0 0 0 0 0 0
251.44/251.55 c Primal Heuristics : ExecTime SetupTime Calls Found
251.44/251.55 c LP solutions : 0.00 - - 0
251.44/251.55 c pseudo solutions : 0.00 - - 0
251.44/251.55 c smallcard : 0.00 0.00 0 0
251.44/251.55 c trivial : 0.00 0.00 1 0
251.44/251.55 c shiftandpropagate: 0.00 0.00 0 0
251.44/251.55 c simplerounding : 0.00 0.00 0 0
251.44/251.55 c zirounding : 0.00 0.00 0 0
251.44/251.55 c rounding : 0.00 0.00 0 0
251.44/251.55 c shifting : 0.00 0.00 0 0
251.44/251.55 c intshifting : 0.00 0.00 0 0
251.44/251.55 c oneopt : 0.00 0.00 0 0
251.44/251.55 c twoopt : 0.00 0.00 0 0
251.44/251.55 c indtwoopt : 0.00 0.00 0 0
251.44/251.55 c indoneopt : 0.00 0.00 0 0
251.44/251.55 c fixandinfer : 0.00 0.00 0 0
251.44/251.55 c feaspump : 0.00 0.00 0 0
251.44/251.55 c clique : 0.00 0.00 0 0
251.44/251.55 c indrounding : 0.00 0.00 0 0
251.44/251.55 c indcoefdiving : 0.00 0.00 0 0
251.44/251.55 c coefdiving : 0.00 0.00 0 0
251.44/251.55 c pscostdiving : 0.00 0.00 0 0
251.44/251.55 c nlpdiving : 0.00 0.00 0 0
251.44/251.55 c fracdiving : 0.00 0.00 0 0
251.44/251.55 c veclendiving : 0.00 0.00 0 0
251.44/251.55 c intdiving : 0.00 0.00 0 0
251.44/251.55 c actconsdiving : 0.00 0.00 0 0
251.44/251.55 c objpscostdiving : 0.00 0.00 0 0
251.44/251.55 c rootsoldiving : 0.00 0.00 0 0
251.44/251.55 c linesearchdiving : 0.00 0.00 0 0
251.44/251.55 c guideddiving : 0.00 0.00 0 0
251.44/251.55 c octane : 0.00 0.00 0 0
251.44/251.55 c rens : 0.00 0.00 0 0
251.44/251.55 c rins : 0.00 0.00 0 0
251.44/251.55 c localbranching : 0.00 0.00 0 0
251.44/251.55 c mutation : 0.00 0.00 0 0
251.44/251.55 c crossover : 0.00 0.00 0 0
251.44/251.55 c dins : 0.00 0.00 0 0
251.44/251.55 c vbounds : 0.00 0.00 0 0
251.44/251.55 c undercover : 0.00 0.00 0 0
251.44/251.55 c subnlp : 0.00 0.00 0 0
251.44/251.55 c trysol : 0.00 0.00 0 0
251.44/251.55 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
251.44/251.55 c primal LP : 0.01 2 0 0.00 0.00 0.01 2
251.44/251.55 c dual LP : 123.00 4715 521816 110.67 4242.39 0.00 0
251.44/251.55 c lex dual LP : 0.00 0 0 0.00 -
251.44/251.55 c barrier LP : 0.00 0 0 0.00 - 0.00 0
251.44/251.55 c diving/probing LP: 0.00 0 0 0.00 -
251.44/251.55 c strong branching : 105.79 2053 379303 184.76 3585.31
251.44/251.55 c (at root node) : - 27 16174 599.04 -
251.44/251.55 c conflict analysis: 0.00 0 0 0.00 -
251.44/251.55 c B&B Tree :
251.44/251.55 c number of runs : 2
251.44/251.55 c nodes : 3228
251.44/251.55 c nodes (total) : 3229
251.44/251.55 c nodes left : 0
251.44/251.55 c max depth : 49
251.44/251.55 c max depth (total): 49
251.44/251.55 c backtracks : 736 (22.8%)
251.44/251.55 c delayed cutoffs : 1675
251.44/251.55 c repropagations : 2882 (180948 domain reductions, 663 cutoffs)
251.44/251.55 c avg switch length: 3.41
251.44/251.55 c switching time : 1.55
251.44/251.55 c Solution :
251.44/251.55 c Solutions found : 0 (0 improvements)
251.44/251.55 c Primal Bound : infeasible
251.44/251.55 c Dual Bound : -
251.44/251.55 c Gap : 0.00 %
251.44/251.55 c Root Dual Bound : +0.00000000000000e+00
251.44/251.55 c Root Iterations : 18719
251.54/251.61 c Time complete: 251.55.