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: a3bf3a4-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-3690503-1338016948.opb>
0.00/0.06 c original problem has 7578 variables (7578 bin, 0 int, 0 impl, 0 cont) and 21401 constraints
0.00/0.06 c problem read in 0.06
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c presolving settings loaded
0.09/0.14 c presolving:
0.29/0.34 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.37 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.47 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.49/0.51 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.59 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.58/0.63 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.58/0.66 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.58/0.67 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.68 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.69 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.69/0.71 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.69/0.72 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.79 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.79/0.86 c presolving (14 rounds):
0.79/0.86 c 1399 deleted vars, 21073 deleted constraints, 6235 added constraints, 532 tightened bounds, 0 added holes, 450 changed sides, 948 changed coefficients
0.79/0.86 c 431230 implications, 465 cliques
0.79/0.86 c presolved problem has 6179 variables (6179 bin, 0 int, 0 impl, 0 cont) and 6554 constraints
0.79/0.86 c 900 constraints of type <knapsack>
0.79/0.86 c 587 constraints of type <setppc>
0.79/0.86 c 5060 constraints of type <and>
0.79/0.86 c 7 constraints of type <logicor>
0.79/0.86 c transformed objective value is always integral (scale: 1)
0.79/0.86 c Presolving Time: 0.78
0.79/0.86 c - non default parameters ----------------------------------------------------------------------
0.79/0.86 c # SCIP version 2.1.1.4
0.79/0.86 c
0.79/0.86 c # maximal time in seconds to run
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.86 c limits/time = 1797
0.79/0.86 c
0.79/0.86 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.86 c limits/memory = 13950
0.79/0.86 c
0.79/0.86 c # solving stops, if the given number of solutions were found (-1: no limit)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c limits/solutions = 1
0.79/0.86 c
0.79/0.86 c # maximal number of separation rounds per node (-1: unlimited)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 5]
0.79/0.86 c separating/maxrounds = 1
0.79/0.86 c
0.79/0.86 c # maximal number of separation rounds in the root node (-1: unlimited)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c separating/maxroundsroot = 5
0.79/0.86 c
0.79/0.86 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.79/0.86 c # [type: int, range: [1,2], default: 1]
0.79/0.86 c timing/clocktype = 2
0.79/0.86 c
0.79/0.86 c # belongs reading time to solving time?
0.79/0.86 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.86 c timing/reading = TRUE
0.79/0.86 c
0.79/0.86 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.79/0.86 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.79/0.86 c constraints/knapsack/disaggregation = FALSE
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/coefdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/coefdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/coefdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 30]
0.79/0.86 c heuristics/crossover/freq = -1
0.79/0.86 c
0.79/0.86 c # number of nodes added to the contingent of the total nodes
0.79/0.86 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.86 c heuristics/crossover/nodesofs = 750
0.79/0.86 c
0.79/0.86 c # number of nodes without incumbent change that heuristic should wait
0.79/0.86 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.79/0.86 c heuristics/crossover/nwaitingnodes = 100
0.79/0.86 c
0.79/0.86 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.79/0.86 c # [type: real, range: [0,1], default: 0.1]
0.79/0.86 c heuristics/crossover/nodesquot = 0.15
0.79/0.86 c
0.79/0.86 c # minimum percentage of integer variables that have to be fixed
0.79/0.86 c # [type: real, range: [0,1], default: 0.666]
0.79/0.86 c heuristics/crossover/minfixingrate = 0.5
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.86 c heuristics/feaspump/freq = -1
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/feaspump/maxlpiterofs = 2000
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/fracdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/fracdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/fracdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/guideddiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/guideddiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/guideddiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/intdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/intshifting/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/linesearchdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.86 c heuristics/objpscostdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to total iteration number
0.79/0.86 c # [type: real, range: [0,1], default: 0.01]
0.79/0.86 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/oneopt/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/pscostdiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/pscostdiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/rens/freq = -1
0.79/0.86 c
0.79/0.86 c # minimum percentage of integer variables that have to be fixable
0.79/0.86 c # [type: real, range: [0,1], default: 0.5]
0.79/0.86 c heuristics/rens/minfixingrate = 0.3
0.79/0.86 c
0.79/0.86 c # number of nodes added to the contingent of the total nodes
0.79/0.86 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.86 c heuristics/rens/nodesofs = 2000
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.86 c heuristics/rootsoldiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.79/0.86 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/rounding/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/shiftandpropagate/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/shifting/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/simplerounding/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/subnlp/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/trivial/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/trysol/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c heuristics/undercover/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.86 c heuristics/veclendiving/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.86 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.86 c heuristics/veclendiving/maxlpiterquot = 0.075
0.79/0.86 c
0.79/0.86 c # additional number of allowed LP iterations
0.79/0.86 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.86 c heuristics/veclendiving/maxlpiterofs = 1500
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/zirounding/freq = -1
0.79/0.86 c
0.79/0.86 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c propagating/probing/maxprerounds = 0
0.79/0.86 c
0.79/0.86 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c separating/cmir/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.86 c separating/flowcover/freq = -1
0.79/0.86 c
0.79/0.86 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.86 c separating/rapidlearning/freq = 0
0.79/0.86 c
0.79/0.86 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.79/0.86 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.86 c heuristics/indoneopt/freq = -1
0.79/0.86 c
0.79/0.86 c -----------------------------------------------------------------------------------------------
0.79/0.86 c start solving
0.79/0.86 c
0.99/1.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.01 c 1.0s| 1 | 0 | 1372 | - | 52M| 0 |1073 |6179 |6554 |6179 | 11k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.96 c 3.0s| 1 | 0 | 3171 | - | 51M| 0 |1669 |6179 |6727 |6179 | 11k| 876 | 0 | 0 | 0.000000e+00 | -- | Inf
3.89/3.91 c 3.9s| 1 | 0 | 6156 | - | 52M| 0 |2066 |6179 |6727 |6179 | 12k|2016 | 0 | 0 | 0.000000e+00 | -- | Inf
4.68/4.76 c 4.8s| 1 | 0 | 8513 | - | 54M| 0 |2153 |6179 |6727 |6179 | 14k|3906 | 0 | 0 | 0.000000e+00 | -- | Inf
5.89/5.97 c 6.0s| 1 | 0 | 11538 | - | 55M| 0 |2307 |6179 |6727 |6179 | 16k|5754 | 0 | 0 | 0.000000e+00 | -- | Inf
8.08/8.13 c 8.1s| 1 | 0 | 15840 | - | 56M| 0 |2519 |6179 |6727 |6179 | 17k|6964 | 0 | 0 | 0.000000e+00 | -- | Inf
11.08/11.16 c 11.2s| 1 | 2 | 15840 | - | 56M| 0 |2519 |6179 |6727 |6179 | 17k|6964 | 0 | 10 | 0.000000e+00 | -- | Inf
11.08/11.16 c (run 1, node 1) restarting after 383 global fixings of integer variables
11.08/11.16 c
11.08/11.18 c (restart) converted 1169 cuts from the global cut pool into linear constraints
11.08/11.18 c
11.18/11.21 c presolving:
11.18/11.26 c (round 1) 818 del vars, 453 del conss, 0 add conss, 1 chg bounds, 116 chg sides, 498 chg coeffs, 3 upgd conss, 480049 impls, 346 clqs
11.18/11.27 c (round 2) 862 del vars, 494 del conss, 0 add conss, 1 chg bounds, 180 chg sides, 582 chg coeffs, 8 upgd conss, 480582 impls, 341 clqs
11.18/11.28 c (round 3) 872 del vars, 505 del conss, 0 add conss, 1 chg bounds, 180 chg sides, 586 chg coeffs, 16 upgd conss, 481818 impls, 340 clqs
11.29/11.31 c (round 4) 904 del vars, 657 del conss, 143 add conss, 1 chg bounds, 180 chg sides, 586 chg coeffs, 16 upgd conss, 504943 impls, 340 clqs
11.29/11.32 c (round 5) 915 del vars, 667 del conss, 143 add conss, 1 chg bounds, 180 chg sides, 593 chg coeffs, 16 upgd conss, 505635 impls, 473 clqs
11.29/11.36 c (round 6) 919 del vars, 866 del conss, 143 add conss, 1 chg bounds, 189 chg sides, 597 chg coeffs, 1539 upgd conss, 505635 impls, 473 clqs
11.38/11.42 c (round 7) 929 del vars, 1006 del conss, 169 add conss, 1 chg bounds, 206 chg sides, 630 chg coeffs, 1539 upgd conss, 535053 impls, 474 clqs
11.38/11.44 c (round 8) 959 del vars, 1024 del conss, 169 add conss, 1 chg bounds, 207 chg sides, 643 chg coeffs, 1539 upgd conss, 539461 impls, 467 clqs
11.38/11.46 c (round 9) 962 del vars, 1039 del conss, 169 add conss, 1 chg bounds, 207 chg sides, 649 chg coeffs, 1539 upgd conss, 539461 impls, 467 clqs
11.49/11.54 c (round 10) 1019 del vars, 1118 del conss, 190 add conss, 1 chg bounds, 207 chg sides, 649 chg coeffs, 1539 upgd conss, 547787 impls, 467 clqs
11.58/11.60 c (round 11) 1025 del vars, 1140 del conss, 196 add conss, 1 chg bounds, 207 chg sides, 649 chg coeffs, 1539 upgd conss, 548713 impls, 482 clqs
11.58/11.66 c (round 12) 1025 del vars, 1144 del conss, 199 add conss, 1 chg bounds, 207 chg sides, 649 chg coeffs, 1539 upgd conss, 548713 impls, 487 clqs
11.68/11.73 c presolving (13 rounds):
11.68/11.73 c 1025 deleted vars, 1144 deleted constraints, 199 added constraints, 1 tightened bounds, 0 added holes, 207 changed sides, 649 changed coefficients
11.68/11.73 c 548713 implications, 490 cliques
11.68/11.73 c presolved problem has 5154 variables (5154 bin, 0 int, 0 impl, 0 cont) and 6899 constraints
11.68/11.73 c 967 constraints of type <knapsack>
11.68/11.73 c 1517 constraints of type <setppc>
11.68/11.73 c 4023 constraints of type <and>
11.68/11.73 c 392 constraints of type <logicor>
11.68/11.73 c transformed objective value is always integral (scale: 1)
11.68/11.73 c Presolving Time: 1.31
11.68/11.74 c
11.79/11.89 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
11.79/11.89 c 11.9s| 1 | 0 | 17358 | - | 49M| 0 |1114 |5154 |6899 |5154 | 10k| 0 | 0 | 10 | 0.000000e+00 | -- | Inf
12.49/12.56 c 12.6s| 1 | 0 | 19774 | - | 50M| 0 |1647 |5154 |6899 |5154 | 11k| 759 | 0 | 10 | 0.000000e+00 | -- | Inf
15.19/15.21 c 15.2s| 1 | 2 | 19774 | - | 50M| 0 |1647 |5154 |6899 |5154 | 11k| 759 | 0 | 29 | 0.000000e+00 | -- | Inf
52.07/52.19 c 52.2s| 100 | 75 | 37388 | 176.1 | 52M| 57 | 908 |5154 |6939 |5154 | 11k|3327 | 40 | 544 | 0.000000e+00 | -- | Inf
56.87/56.91 c 56.9s| 200 | 43 | 47290 | 137.6 | 53M| 69 |1045 |5154 |6996 |5154 | 10k|4679 | 97 | 589 | 0.000000e+00 | -- | Inf
61.77/61.80 c 61.8s| 300 | 29 | 57403 | 125.4 | 53M| 69 |1409 |5154 |7106 |5154 | 11k|6715 | 207 | 620 | 0.000000e+00 | -- | Inf
67.16/67.21 c 67.2s| 400 | 28 | 67951 | 120.4 | 53M| 69 |1305 |5154 |7197 |5154 | 11k|8334 | 298 | 668 | 0.000000e+00 | -- | Inf
71.77/71.88 c 71.9s| 500 | 23 | 78023 | 116.5 | 53M| 69 |1113 |5154 |7343 |5154 | 10k|9765 | 444 | 716 | 0.000000e+00 | -- | Inf
76.27/76.33 c 76.3s| 600 | 19 | 86049 | 110.5 | 53M| 69 |1309 |5154 |7467 |5154 | 11k| 11k| 568 | 758 | 0.000000e+00 | -- | Inf
83.26/83.35 c 83.3s| 700 | 15 |102860 | 118.7 | 53M| 69 |1339 |5154 |7608 |5154 | 10k| 14k| 710 | 822 | 0.000000e+00 | -- | Inf
91.17/91.27 c 91.3s| 800 | 19 |120149 | 125.5 | 53M| 69 | 962 |5154 |7710 |5154 | 10k| 17k| 837 | 919 | 0.000000e+00 | -- | Inf
95.46/95.53 c 95.5s| 900 | 23 |130438 | 123.0 | 53M| 69 |1001 |5154 |7771 |5154 | 11k| 19k| 906 | 935 | 0.000000e+00 | -- | Inf
105.86/105.93 c 106s| 1000 | 28 |155292 | 135.5 | 53M| 69 |1065 |5154 |7860 |5154 | 10k| 23k|1020 |1025 | 0.000000e+00 | -- | Inf
111.95/112.07 c 112s| 1100 | 24 |170612 | 137.1 | 53M| 69 |1137 |5154 |7944 |5154 | 10k| 26k|1172 |1070 | 0.000000e+00 | -- | Inf
116.05/116.19 c 116s| 1200 | 22 |178343 | 132.1 | 53M| 69 | - |5154 |7984 | 0 | 0 | 27k|1251 |1102 | 0.000000e+00 | -- | Inf
121.56/121.60 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
121.56/121.60 c 122s| 1300 | 33 |190581 | 131.4 | 54M| 69 | - |5154 |8069 | 0 | 0 | 30k|1352 |1144 | 0.000000e+00 | -- | Inf
127.66/127.72 c 128s| 1400 | 33 |202597 | 130.6 | 54M| 69 |1061 |5154 |8122 |5154 | 10k| 33k|1457 |1196 | 0.000000e+00 | -- | Inf
132.75/132.81 c 133s| 1500 | 30 |213732 | 129.3 | 54M| 69 |1150 |5154 |8196 |5154 | 11k| 35k|1572 |1211 | 0.000000e+00 | -- | Inf
137.46/137.52 c 138s| 1600 | 25 |223216 | 127.2 | 54M| 69 | - |5154 |8295 | 0 | 0 | 37k|1724 |1252 | 0.000000e+00 | -- | Inf
142.96/143.07 c 143s| 1700 | 36 |234354 | 126.2 | 54M| 69 | 895 |5154 |8381 |5154 | 11k| 39k|1846 |1297 | 0.000000e+00 | -- | Inf
148.65/148.72 c 149s| 1800 | 29 |245290 | 125.3 | 54M| 69 |1154 |5154 |8489 |5154 | 10k| 41k|1985 |1342 | 0.000000e+00 | -- | Inf
153.75/153.81 c 154s| 1900 | 26 |257079 | 124.9 | 54M| 69 |1171 |5154 |8551 |5154 | 11k| 43k|2108 |1377 | 0.000000e+00 | -- | Inf
160.05/160.17 c 160s| 2000 | 24 |271234 | 125.7 | 54M| 69 |1343 |5154 |8628 |5154 | 11k| 46k|2236 |1422 | 0.000000e+00 | -- | Inf
166.35/166.47 c 166s| 2100 | 39 |286724 | 127.1 | 54M| 69 |1193 |5154 |8569 |5154 | 10k| 49k|2376 |1467 | 0.000000e+00 | -- | Inf
171.35/171.40 c 171s| 2200 | 26 |296411 | 125.7 | 54M| 69 |1167 |5154 |8633 |5154 | 10k| 50k|2470 |1501 | 0.000000e+00 | -- | Inf
178.65/178.70 c 179s| 2300 | 27 |314935 | 128.3 | 54M| 69 |1046 |5154 |8620 |5154 | 11k| 54k|2618 |1546 | 0.000000e+00 | -- | Inf
184.95/185.08 c 185s| 2400 | 30 |327579 | 128.3 | 54M| 69 |1099 |5154 |8635 |5154 | 11k| 56k|2724 |1591 | 0.000000e+00 | -- | Inf
190.34/190.46 c 190s| 2500 | 15 |340011 | 128.1 | 54M| 69 |1076 |5154 |8616 |5154 | 11k| 58k|2849 |1621 | 0.000000e+00 | -- | Inf
195.35/195.46 c 195s| 2600 | 11 |350854 | 127.3 | 54M| 69 | - |5154 |8666 | 0 | 0 | 60k|2927 |1648 | 0.000000e+00 | -- | Inf
204.84/204.94 c 205s| 2700 | 19 |374708 | 131.5 | 54M| 69 |1068 |5154 |8643 |5154 | 11k| 64k|3021 |1723 | 0.000000e+00 | -- | Inf
212.55/212.60 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
212.55/212.60 c 213s| 2800 | 37 |394119 | 133.7 | 54M| 69 | - |5154 |8573 | 0 | 0 | 68k|3114 |1768 | 0.000000e+00 | -- | Inf
220.14/220.20 c 220s| 2900 | 17 |410600 | 134.8 | 54M| 69 | - |5154 |8496 | 0 | 0 | 71k|3188 |1843 | 0.000000e+00 | -- | Inf
228.65/228.73 c 229s| 3000 | 11 |432678 | 137.6 | 54M| 69 |1248 |5154 |8516 |5154 | 10k| 75k|3297 |1903 | 0.000000e+00 | -- | Inf
241.94/242.00 c 242s| 3100 | 22 |469004 | 144.9 | 54M| 69 | 933 |5154 |8461 |5154 | 11k| 80k|3396 |2007 | 0.000000e+00 | -- | Inf
248.44/248.52 c 249s| 3200 | 11 |484078 | 145.1 | 54M| 69 |1181 |5154 |8547 |5154 | 10k| 83k|3505 |2052 | 0.000000e+00 | -- | Inf
255.04/255.11 c 255s| 3300 | 5 |498909 | 145.2 | 53M| 69 |1114 |5154 |8521 |5154 | 11k| 86k|3620 |2096 | 0.000000e+00 | -- | Inf
260.34/260.43 c 260s| 3400 | 7 |509240 | 144.0 | 53M| 69 | - |5154 |8614 | 0 | 0 | 88k|3736 |2140 | 0.000000e+00 | -- | Inf
265.83/265.97 c 266s| 3500 | 8 |520128 | 143.0 | 53M| 69 | - |5154 |8685 | 0 | 0 | 90k|3832 |2184 | 0.000000e+00 | -- | Inf
272.24/272.30 c
272.24/272.30 c SCIP Status : problem is solved [infeasible]
272.24/272.30 c Solving Time (sec) : 272.30
272.24/272.30 c Solving Nodes : 3595 (total of 3596 nodes in 2 runs)
272.24/272.30 c Primal Bound : +1.00000000000000e+20 (0 solutions)
272.24/272.30 c Dual Bound : +1.00000000000000e+20
272.24/272.30 c Gap : 0.00 %
272.24/272.30 s UNSATISFIABLE
272.24/272.30 c SCIP Status : problem is solved [infeasible]
272.24/272.30 c Total Time : 272.30
272.24/272.30 c solving : 272.30
272.24/272.30 c presolving : 1.31 (included in solving)
272.24/272.30 c reading : 0.06 (included in solving)
272.24/272.30 c copying : 0.02 (1 #copies) (minimal 0.02, maximal 0.02, average 0.02)
272.24/272.30 c Original Problem :
272.24/272.30 c Problem name : HOME/instance-3690503-1338016948.opb
272.24/272.30 c Variables : 7578 (7578 binary, 0 integer, 0 implicit integer, 0 continuous)
272.24/272.30 c Constraints : 21401 initial, 21401 maximal
272.24/272.30 c Objective sense : minimize
272.24/272.30 c Presolved Problem :
272.24/272.30 c Problem name : t_HOME/instance-3690503-1338016948.opb
272.24/272.30 c Variables : 5154 (5154 binary, 0 integer, 0 implicit integer, 0 continuous)
272.24/272.30 c Constraints : 6899 initial, 8757 maximal
272.24/272.30 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
272.24/272.30 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c trivial : 0.01 0.00 422 0 0 0 0 0 0 0 0
272.24/272.30 c dualfix : 0.01 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c gateextraction : 0.06 0.00 0 0 0 0 0 17011 5668 0 0
272.24/272.30 c implics : 0.06 0.00 0 718 0 0 0 0 0 0 0
272.24/272.30 c components : 0.01 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
272.24/272.30 c knapsack : 0.03 0.00 0 0 0 0 0 0 0 18 47
272.24/272.30 c setppc : 0.09 0.00 0 127 0 0 0 325 0 0 0
272.24/272.30 c and : 0.54 0.00 43 571 0 0 0 1208 766 0 365
272.24/272.30 c linear : 0.29 0.00 539 4 0 533 0 3665 0 639 1185
272.24/272.30 c logicor : 0.11 0.00 0 0 0 0 0 8 0 0 0
272.24/272.30 c root node : - - 474 - - 474 - - - - -
272.24/272.30 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
272.24/272.30 c integral : 0 0 0 0 2796 0 2 0 12 123 0 0 5460
272.24/272.30 c knapsack : 967 967 7 40727 0 0 0 168 0 263 1402 0 0
272.24/272.30 c setppc : 1517 1517 7 40727 0 0 0 64163 186 96378 0 0 0
272.24/272.30 c and : 4023 4023 2755 40541 0 0 0 215221 1063 526838 139390 0 0
272.24/272.30 c logicor : 392+ 2360 7 19191 0 0 0 26442 368 16147 8 0 0
272.24/272.30 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
272.24/272.30 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
272.24/272.30 c integral : 111.55 0.00 0.00 0.00 111.55 0.00 0.00 0.00
272.24/272.30 c knapsack : 0.70 0.00 0.01 0.68 0.00 0.00 0.00 0.00
272.24/272.30 c setppc : 0.83 0.00 0.00 0.79 0.00 0.00 0.00 0.04
272.24/272.30 c and : 5.33 0.00 2.64 2.58 0.00 0.00 0.00 0.12
272.24/272.30 c logicor : 0.35 0.00 0.00 0.32 0.00 0.00 0.00 0.04
272.24/272.30 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
272.24/272.30 c Propagators : #Propagate #ResProp Cutoffs DomReds
272.24/272.30 c rootredcost : 0 0 0 0
272.24/272.30 c pseudoobj : 0 0 0 0
272.24/272.30 c vbounds : 0 0 0 0
272.24/272.30 c redcost : 5289 0 0 0
272.24/272.30 c probing : 0 0 0 0
272.24/272.30 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
272.24/272.30 c rootredcost : 0.01 0.00 0.00 0.01 0.00
272.24/272.30 c pseudoobj : 0.01 0.00 0.00 0.01 0.00
272.24/272.30 c vbounds : 0.01 0.00 0.00 0.01 0.00
272.24/272.30 c redcost : 0.45 0.00 0.00 0.45 0.00
272.24/272.30 c probing : 0.00 0.00 0.00 0.00 0.00
272.24/272.30 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
272.24/272.30 c propagation : 0.34 1617 1487 9743 30.1 186 19.0 -
272.24/272.30 c infeasible LP : 0.01 6 6 13 5.8 0 0.0 0
272.24/272.30 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
272.24/272.30 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
272.24/272.30 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
272.24/272.30 c applied globally : - - - 3941 23.3 - - -
272.24/272.30 c applied locally : - - - 0 0.0 - - -
272.24/272.30 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
272.24/272.30 c cut pool : 0.00 0 - - 0 - (maximal pool size: 1019)
272.24/272.30 c closecuts : 0.00 0.00 0 0 0 0 0
272.24/272.30 c impliedbounds : 0.03 0.00 6 0 0 11719 0
272.24/272.30 c intobj : 0.00 0.00 0 0 0 0 0
272.24/272.30 c gomory : 0.10 0.00 6 0 0 300 0
272.24/272.30 c cgmip : 0.00 0.00 0 0 0 0 0
272.24/272.30 c strongcg : 1.11 0.00 6 0 0 3000 0
272.24/272.30 c cmir : 0.00 0.00 0 0 0 0 0
272.24/272.30 c flowcover : 0.00 0.00 0 0 0 0 0
272.24/272.30 c clique : 0.48 0.00 4 0 0 31 0
272.24/272.30 c zerohalf : 0.00 0.00 0 0 0 0 0
272.24/272.30 c mcf : 0.02 0.00 2 0 0 0 0
272.24/272.30 c oddcycle : 0.00 0.00 0 0 0 0 0
272.24/272.30 c rapidlearning : 1.40 0.00 1 0 383 0 718
272.24/272.30 c Pricers : ExecTime SetupTime Calls Vars
272.24/272.30 c problem variables: 0.00 - 0 0
272.24/272.30 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
272.24/272.30 c relpscost : 111.54 0.00 2796 12 123 0 0 5460
272.24/272.30 c pscost : 0.00 0.00 0 0 0 0 0 0
272.24/272.30 c inference : 0.00 0.00 0 0 0 0 0 0
272.24/272.30 c mostinf : 0.00 0.00 0 0 0 0 0 0
272.24/272.30 c leastinf : 0.00 0.00 0 0 0 0 0 0
272.24/272.30 c fullstrong : 0.00 0.00 0 0 0 0 0 0
272.24/272.30 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
272.24/272.30 c random : 0.00 0.00 0 0 0 0 0 0
272.24/272.30 c Primal Heuristics : ExecTime SetupTime Calls Found
272.24/272.30 c LP solutions : 0.00 - - 0
272.24/272.30 c pseudo solutions : 0.00 - - 0
272.24/272.30 c smallcard : 0.00 0.00 0 0
272.24/272.30 c trivial : 0.00 0.00 1 0
272.24/272.30 c shiftandpropagate: 0.00 0.00 0 0
272.24/272.30 c simplerounding : 0.00 0.00 0 0
272.24/272.30 c zirounding : 0.00 0.00 0 0
272.24/272.30 c rounding : 0.00 0.00 0 0
272.24/272.30 c shifting : 0.00 0.00 0 0
272.24/272.30 c intshifting : 0.00 0.00 0 0
272.24/272.30 c oneopt : 0.00 0.00 0 0
272.24/272.30 c twoopt : 0.00 0.00 0 0
272.24/272.30 c indtwoopt : 0.00 0.00 0 0
272.24/272.30 c indoneopt : 0.00 0.00 0 0
272.24/272.30 c fixandinfer : 0.00 0.00 0 0
272.24/272.30 c feaspump : 0.00 0.00 0 0
272.24/272.30 c clique : 0.00 0.00 0 0
272.24/272.30 c indrounding : 0.00 0.00 0 0
272.24/272.30 c indcoefdiving : 0.00 0.00 0 0
272.24/272.30 c coefdiving : 0.00 0.00 0 0
272.24/272.30 c pscostdiving : 0.00 0.00 0 0
272.24/272.30 c nlpdiving : 0.00 0.00 0 0
272.24/272.30 c fracdiving : 0.00 0.00 0 0
272.24/272.30 c veclendiving : 0.00 0.00 0 0
272.24/272.30 c intdiving : 0.00 0.00 0 0
272.24/272.30 c actconsdiving : 0.00 0.00 0 0
272.24/272.30 c objpscostdiving : 0.00 0.00 0 0
272.24/272.30 c rootsoldiving : 0.00 0.00 0 0
272.24/272.30 c linesearchdiving : 0.00 0.00 0 0
272.24/272.30 c guideddiving : 0.00 0.00 0 0
272.24/272.30 c octane : 0.00 0.00 0 0
272.24/272.30 c rens : 0.00 0.00 0 0
272.24/272.30 c rins : 0.00 0.00 0 0
272.24/272.30 c localbranching : 0.00 0.00 0 0
272.24/272.30 c mutation : 0.00 0.00 0 0
272.24/272.30 c crossover : 0.00 0.00 0 0
272.24/272.30 c dins : 0.00 0.00 0 0
272.24/272.30 c vbounds : 0.00 0.00 0 0
272.24/272.30 c undercover : 0.00 0.00 0 0
272.24/272.30 c subnlp : 0.00 0.00 0 0
272.24/272.30 c trysol : 0.00 0.00 0 0
272.24/272.30 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
272.24/272.30 c primal LP : 0.01 2 0 0.00 0.00 0.01 2
272.24/272.30 c dual LP : 131.32 5296 533532 100.74 4062.91 0.00 0
272.24/272.30 c lex dual LP : 0.00 0 0 0.00 -
272.24/272.30 c barrier LP : 0.00 0 0 0.00 - 0.00 0
272.24/272.30 c diving/probing LP: 0.00 0 0 0.00 -
272.24/272.30 c strong branching : 110.47 2234 384803 172.25 3483.28
272.24/272.30 c (at root node) : - 29 17154 591.52 -
272.24/272.30 c conflict analysis: 0.00 0 0 0.00 -
272.24/272.30 c B&B Tree :
272.24/272.30 c number of runs : 2
272.24/272.30 c nodes : 3595
272.24/272.30 c nodes (total) : 3596
272.24/272.30 c nodes left : 0
272.24/272.30 c max depth : 69
272.24/272.30 c max depth (total): 69
272.24/272.30 c backtracks : 842 (23.4%)
272.24/272.30 c delayed cutoffs : 1864
272.24/272.30 c repropagations : 2735 (219715 domain reductions, 771 cutoffs)
272.24/272.30 c avg switch length: 3.34
272.24/272.30 c switching time : 2.19
272.24/272.30 c Solution :
272.24/272.30 c Solutions found : 0 (0 improvements)
272.24/272.30 c Primal Bound : infeasible
272.24/272.30 c Dual Bound : -
272.24/272.30 c Gap : 0.00 %
272.24/272.30 c Root Dual Bound : +0.00000000000000e+00
272.24/272.30 c Root Iterations : 19774
272.24/272.38 c Time complete: 272.32.