0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2666887-1276330797.opb>
9.29/9.37 c original problem has 168111 variables (168111 bin, 0 int, 0 impl, 0 cont) and 487525 constraints
9.29/9.37 c problem read
9.29/9.38 c No objective function, only one solution is needed.
9.29/9.39 c presolving settings loaded
12.00/12.05 c presolving:
21.58/21.65 c (round 1) 6008 del vars, 9423 del conss, 3237 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10333961 impls, 0 clqs
22.38/22.46 c (round 2) 6517 del vars, 17162 del conss, 3539 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10335953 impls, 0 clqs
22.99/23.02 c (round 3) 6521 del vars, 17479 del conss, 3543 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10335953 impls, 0 clqs
23.58/23.60 c (round 4) 6591 del vars, 17554 del conss, 3551 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10336079 impls, 0 clqs
24.09/24.18 c (round 5) 6663 del vars, 17762 del conss, 3562 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10336239 impls, 0 clqs
24.68/24.75 c (round 6) 6738 del vars, 17975 del conss, 3576 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10336941 impls, 0 clqs
25.29/25.33 c (round 7) 6815 del vars, 18195 del conss, 3593 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10337337 impls, 0 clqs
25.88/25.91 c (round 8) 6892 del vars, 18419 del conss, 3610 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10337602 impls, 0 clqs
26.39/26.48 c (round 9) 6970 del vars, 18648 del conss, 3629 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10337788 impls, 0 clqs
26.99/27.05 c (round 10) 7048 del vars, 18873 del conss, 3651 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10338004 impls, 0 clqs
27.58/27.63 c (round 11) 7152 del vars, 19157 del conss, 3700 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10338312 impls, 0 clqs
28.19/28.20 c (round 12) 7270 del vars, 19495 del conss, 3764 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10338856 impls, 0 clqs
28.69/28.78 c (round 13) 7372 del vars, 19790 del conss, 3813 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339234 impls, 0 clqs
29.28/29.35 c (round 14) 7446 del vars, 20016 del conss, 3835 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339396 impls, 0 clqs
29.89/29.92 c (round 15) 7514 del vars, 20218 del conss, 3852 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339538 impls, 0 clqs
30.38/30.49 c (round 16) 7580 del vars, 20419 del conss, 3868 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339694 impls, 0 clqs
30.98/31.06 c (round 17) 7646 del vars, 20616 del conss, 3885 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339822 impls, 0 clqs
31.58/31.62 c (round 18) 7712 del vars, 20813 del conss, 3903 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340020 impls, 0 clqs
32.08/32.18 c (round 19) 7778 del vars, 21010 del conss, 3922 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340168 impls, 0 clqs
32.68/32.75 c (round 20) 7844 del vars, 21207 del conss, 3942 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340364 impls, 0 clqs
33.27/33.32 c (round 21) 7910 del vars, 21404 del conss, 3963 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340492 impls, 0 clqs
33.77/33.88 c (round 22) 7976 del vars, 21601 del conss, 3985 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340620 impls, 0 clqs
34.38/34.45 c (round 23) 8042 del vars, 21798 del conss, 4008 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340812 impls, 0 clqs
34.98/35.01 c (round 24) 8108 del vars, 21995 del conss, 4032 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340940 impls, 0 clqs
35.48/35.58 c (round 25) 8174 del vars, 22192 del conss, 4057 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341068 impls, 0 clqs
36.08/36.14 c (round 26) 8240 del vars, 22389 del conss, 4083 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341196 impls, 0 clqs
36.57/36.70 c (round 27) 8306 del vars, 22586 del conss, 4110 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341364 impls, 0 clqs
37.18/37.23 c (round 28) 8372 del vars, 22783 del conss, 4138 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341536 impls, 0 clqs
37.77/37.80 c (round 29) 8454 del vars, 22996 del conss, 4167 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10343048 impls, 0 clqs
38.28/38.37 c (round 30) 8536 del vars, 23241 del conss, 4197 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10345752 impls, 0 clqs
38.87/38.93 c (round 31) 8618 del vars, 23486 del conss, 4228 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10348328 impls, 0 clqs
39.48/39.50 c (round 32) 8700 del vars, 23731 del conss, 4260 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10350798 impls, 0 clqs
39.97/40.07 c (round 33) 8766 del vars, 23960 del conss, 4293 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10352498 impls, 0 clqs
40.58/40.63 c (round 34) 8848 del vars, 24173 del conss, 4327 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10355926 impls, 0 clqs
41.17/41.20 c (round 35) 8930 del vars, 24418 del conss, 4362 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10356516 impls, 0 clqs
41.68/41.77 c (round 36) 9012 del vars, 24663 del conss, 4398 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10359546 impls, 0 clqs
42.27/42.33 c (round 37) 9049 del vars, 24844 del conss, 4435 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10359606 impls, 0 clqs
42.78/42.89 c (round 38) 9093 del vars, 24959 del conss, 4475 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10359796 impls, 0 clqs
43.37/43.46 c (round 39) 9148 del vars, 25098 del conss, 4518 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10360300 impls, 0 clqs
43.98/44.02 c (round 40) 9198 del vars, 25251 del conss, 4565 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10360493 impls, 0 clqs
44.47/44.58 c (round 41) 9268 del vars, 25415 del conss, 4617 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10361285 impls, 0 clqs
45.08/45.15 c (round 42) 9350 del vars, 25626 del conss, 4671 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10362483 impls, 0 clqs
45.67/45.72 c (round 43) 9434 del vars, 25868 del conss, 4722 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10363443 impls, 0 clqs
46.17/46.28 c (round 44) 9510 del vars, 26094 del conss, 4771 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10364787 impls, 0 clqs
46.77/46.86 c (round 45) 9576 del vars, 26320 del conss, 4824 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10368127 impls, 0 clqs
47.37/47.43 c (round 46) 9695 del vars, 26601 del conss, 4928 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10369066 impls, 0 clqs
47.97/48.00 c (round 47) 9914 del vars, 27048 del conss, 5038 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10372815 impls, 0 clqs
48.46/48.56 c (round 48) 10047 del vars, 27579 del conss, 5150 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10374641 impls, 0 clqs
49.07/49.13 c (round 49) 10106 del vars, 27850 del conss, 5199 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10375769 impls, 0 clqs
49.57/49.69 c (round 50) 10134 del vars, 27980 del conss, 5227 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10376229 impls, 0 clqs
50.17/50.24 c (round 51) 10155 del vars, 28051 del conss, 5244 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10376709 impls, 0 clqs
50.77/50.80 c (round 52) 10172 del vars, 28107 del conss, 5260 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377003 impls, 0 clqs
51.67/51.77 c (round 53) 10192 del vars, 28177 del conss, 5278 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377377 impls, 0 clqs
52.68/52.74 c (round 54) 10208 del vars, 28217 del conss, 5294 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377489 impls, 0 clqs
54.07/54.13 c (round 55) 10224 del vars, 28265 del conss, 5310 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377689 impls, 0 clqs
58.97/59.03 c (round 56) 10224 del vars, 28346 del conss, 5310 chg bounds, 9399 chg sides, 19538 chg coeffs, 459162 upgd conss, 10377727 impls, 0 clqs
60.67/60.71 c presolving (57 rounds):
60.67/60.71 c 10224 deleted vars, 28346 deleted constraints, 5310 tightened bounds, 0 added holes, 9399 changed sides, 19538 changed coefficients
60.67/60.71 c 10377727 implications, 0 cliques
60.67/60.71 c presolved problem has 157887 variables (157887 bin, 0 int, 0 impl, 0 cont) and 459179 constraints
60.67/60.71 c 18798 constraints of type <knapsack>
60.67/60.71 c 440381 constraints of type <logicor>
60.67/60.71 c transformed objective value is always integral (scale: 1)
60.67/60.71 c Presolving Time: 35.86
60.67/60.71 c - non default parameters ----------------------------------------------------------------------
60.67/60.71 c # SCIP version 1.2.1.2
60.67/60.71 c
60.67/60.71 c # frequency for displaying node information lines
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 100]
60.67/60.71 c display/freq = 10000
60.67/60.71 c
60.67/60.71 c # maximal time in seconds to run
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
60.67/60.71 c limits/time = 1790.61
60.67/60.71 c
60.67/60.71 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
60.67/60.71 c limits/memory = 1620
60.67/60.71 c
60.67/60.71 c # solving stops, if the given number of solutions were found (-1: no limit)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: -1]
60.67/60.71 c limits/solutions = 1
60.67/60.71 c
60.67/60.71 c # maximal number of separation rounds per node (-1: unlimited)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 5]
60.67/60.71 c separating/maxrounds = 1
60.67/60.71 c
60.67/60.71 c # maximal number of separation rounds in the root node (-1: unlimited)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: -1]
60.67/60.71 c separating/maxroundsroot = 5
60.67/60.71 c
60.67/60.71 c # should presolving try to simplify inequalities
60.67/60.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
60.67/60.71 c constraints/linear/simplifyinequalities = TRUE
60.67/60.71 c
60.67/60.71 c # should disaggregation of knapsack constraints be allowed in preprocessing?
60.67/60.71 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
60.67/60.71 c constraints/knapsack/disaggregation = FALSE
60.67/60.71 c
60.67/60.71 c # should presolving try to simplify knapsacks
60.67/60.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
60.67/60.71 c constraints/knapsack/simplifyinequalities = TRUE
60.67/60.71 c
60.67/60.71 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: -1]
60.67/60.71 c presolving/probing/maxrounds = 0
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/coefdiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
60.67/60.71 c heuristics/coefdiving/maxlpiterquot = 0.075
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/coefdiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 30]
60.67/60.71 c heuristics/crossover/freq = -1
60.67/60.71 c
60.67/60.71 c # number of nodes added to the contingent of the total nodes
60.67/60.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
60.67/60.71 c heuristics/crossover/nodesofs = 750
60.67/60.71 c
60.67/60.71 c # number of nodes without incumbent change that heuristic should wait
60.67/60.71 c # [type: longint, range: [0,9223372036854775807], default: 200]
60.67/60.71 c heuristics/crossover/nwaitingnodes = 100
60.67/60.71 c
60.67/60.71 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
60.67/60.71 c # [type: real, range: [0,1], default: 0.1]
60.67/60.71 c heuristics/crossover/nodesquot = 0.15
60.67/60.71 c
60.67/60.71 c # minimum percentage of integer variables that have to be fixed
60.67/60.71 c # [type: real, range: [0,1], default: 0.666]
60.67/60.71 c heuristics/crossover/minfixingrate = 0.5
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 20]
60.67/60.71 c heuristics/feaspump/freq = -1
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/feaspump/maxlpiterofs = 2000
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/fracdiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
60.67/60.71 c heuristics/fracdiving/maxlpiterquot = 0.075
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/fracdiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/guideddiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
60.67/60.71 c heuristics/guideddiving/maxlpiterquot = 0.075
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/guideddiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
60.67/60.71 c heuristics/intdiving/maxlpiterquot = 0.075
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/intshifting/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/linesearchdiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
60.67/60.71 c heuristics/linesearchdiving/maxlpiterquot = 0.075
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/linesearchdiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 1]
60.67/60.71 c heuristics/nlp/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 20]
60.67/60.71 c heuristics/objpscostdiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to total iteration number
60.67/60.71 c # [type: real, range: [0,1], default: 0.01]
60.67/60.71 c heuristics/objpscostdiving/maxlpiterquot = 0.015
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/objpscostdiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 1]
60.67/60.71 c heuristics/oneopt/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/pscostdiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
60.67/60.71 c heuristics/pscostdiving/maxlpiterquot = 0.075
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/pscostdiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 0]
60.67/60.71 c heuristics/rens/freq = -1
60.67/60.71 c
60.67/60.71 c # minimum percentage of integer variables that have to be fixable
60.67/60.71 c # [type: real, range: [0,1], default: 0.5]
60.67/60.71 c heuristics/rens/minfixingrate = 0.3
60.67/60.71 c
60.67/60.71 c # number of nodes added to the contingent of the total nodes
60.67/60.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
60.67/60.71 c heuristics/rens/nodesofs = 2000
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 20]
60.67/60.71 c heuristics/rootsoldiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
60.67/60.71 c heuristics/rootsoldiving/maxlpiterquot = 0.015
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/rootsoldiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 1]
60.67/60.71 c heuristics/rounding/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/shifting/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 1]
60.67/60.71 c heuristics/simplerounding/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 0]
60.67/60.71 c heuristics/trivial/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 1]
60.67/60.71 c heuristics/trysol/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 10]
60.67/60.71 c heuristics/veclendiving/freq = -1
60.67/60.71 c
60.67/60.71 c # maximal fraction of diving LP iterations compared to node LP iterations
60.67/60.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
60.67/60.71 c heuristics/veclendiving/maxlpiterquot = 0.075
60.67/60.71 c
60.67/60.71 c # additional number of allowed LP iterations
60.67/60.71 c # [type: int, range: [0,2147483647], default: 1000]
60.67/60.71 c heuristics/veclendiving/maxlpiterofs = 1500
60.67/60.71 c
60.67/60.71 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 1]
60.67/60.71 c heuristics/zirounding/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 0]
60.67/60.71 c separating/cmir/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: 0]
60.67/60.71 c separating/flowcover/freq = -1
60.67/60.71 c
60.67/60.71 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
60.67/60.71 c # [type: int, range: [-1,2147483647], default: -1]
60.67/60.71 c separating/rapidlearning/freq = 0
60.67/60.71 c
60.67/60.71 c -----------------------------------------------------------------------------------------------
60.67/60.71 c start solving
60.76/60.87 c
130.85/130.91 c pressed CTRL-C 1 times (5 times for forcing termination)