0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664027-1276330718.opb>
8.89/8.91 c original problem has 168111 variables (168111 bin, 0 int, 0 impl, 0 cont) and 487525 constraints
8.89/8.91 c problem read
8.89/8.91 c No objective function, only one solution is needed.
8.89/8.93 c presolving settings loaded
8.89/8.93 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
11.49/11.55 c presolving:
21.09/21.19 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
21.99/22.01 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.48/22.58 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.09/23.15 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
23.69/23.73 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.28/24.31 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
24.79/24.89 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.39/25.47 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
25.98/26.04 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.58/26.62 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.09/27.19 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
27.69/27.77 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.29/28.35 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
28.88/28.92 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.38/29.49 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
29.99/30.06 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.58/30.63 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.19/31.20 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
31.68/31.77 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.28/32.34 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
32.90/32.91 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.38/33.48 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
33.99/34.05 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.59/34.61 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.09/35.18 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
35.68/35.75 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.29/36.31 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
36.78/36.88 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.38/37.44 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
37.98/38.01 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.49/38.58 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.08/39.15 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.68/39.71 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.18/40.28 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
40.79/40.85 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.38/41.43 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
41.88/41.99 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.48/42.55 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.08/43.12 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.58/43.68 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.18/44.25 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
44.78/44.81 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.28/45.38 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
45.88/45.95 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.48/46.53 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
46.98/47.09 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.58/47.67 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.18/48.24 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
48.78/48.80 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.28/49.36 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
49.88/49.92 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.38/50.47 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.38/51.45 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.38/52.42 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
53.78/53.81 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.29/58.36 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
59.98/60.06 c presolving (57 rounds):
59.98/60.06 c 10224 deleted vars, 28346 deleted constraints, 5310 tightened bounds, 0 added holes, 9399 changed sides, 19538 changed coefficients
59.98/60.06 c 10377727 implications, 0 cliques
59.98/60.06 c presolved problem has 157887 variables (157887 bin, 0 int, 0 impl, 0 cont) and 459179 constraints
59.98/60.06 c 18798 constraints of type <knapsack>
59.98/60.06 c 440381 constraints of type <logicor>
59.98/60.06 c transformed objective value is always integral (scale: 1)
59.98/60.06 c Presolving Time: 35.74
59.98/60.06 c - non default parameters ----------------------------------------------------------------------
59.98/60.06 c # SCIP version 1.2.1.2
59.98/60.06 c
59.98/60.06 c # frequency for displaying node information lines
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 100]
59.98/60.06 c display/freq = 10000
59.98/60.06 c
59.98/60.06 c # maximal time in seconds to run
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
59.98/60.06 c limits/time = 1791.08
59.98/60.06 c
59.98/60.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
59.98/60.06 c limits/memory = 1620
59.98/60.06 c
59.98/60.06 c # solving stops, if the given number of solutions were found (-1: no limit)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: -1]
59.98/60.06 c limits/solutions = 1
59.98/60.06 c
59.98/60.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 1]
59.98/60.06 c lp/solvefreq = -1
59.98/60.06 c
59.98/60.06 c # maximal number of separation rounds per node (-1: unlimited)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 5]
59.98/60.06 c separating/maxrounds = 1
59.98/60.06 c
59.98/60.06 c # maximal number of separation rounds in the root node (-1: unlimited)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: -1]
59.98/60.06 c separating/maxroundsroot = 5
59.98/60.06 c
59.98/60.06 c # should presolving try to simplify inequalities
59.98/60.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
59.98/60.06 c constraints/linear/simplifyinequalities = TRUE
59.98/60.06 c
59.98/60.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
59.98/60.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
59.98/60.06 c constraints/knapsack/disaggregation = FALSE
59.98/60.06 c
59.98/60.06 c # should presolving try to simplify knapsacks
59.98/60.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
59.98/60.06 c constraints/knapsack/simplifyinequalities = TRUE
59.98/60.06 c
59.98/60.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: -1]
59.98/60.06 c presolving/probing/maxrounds = 0
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/coefdiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
59.98/60.06 c heuristics/coefdiving/maxlpiterquot = 0.075
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/coefdiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 30]
59.98/60.06 c heuristics/crossover/freq = -1
59.98/60.06 c
59.98/60.06 c # number of nodes added to the contingent of the total nodes
59.98/60.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
59.98/60.06 c heuristics/crossover/nodesofs = 750
59.98/60.06 c
59.98/60.06 c # number of nodes without incumbent change that heuristic should wait
59.98/60.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
59.98/60.06 c heuristics/crossover/nwaitingnodes = 100
59.98/60.06 c
59.98/60.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
59.98/60.06 c # [type: real, range: [0,1], default: 0.1]
59.98/60.06 c heuristics/crossover/nodesquot = 0.15
59.98/60.06 c
59.98/60.06 c # minimum percentage of integer variables that have to be fixed
59.98/60.06 c # [type: real, range: [0,1], default: 0.666]
59.98/60.06 c heuristics/crossover/minfixingrate = 0.5
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 20]
59.98/60.06 c heuristics/feaspump/freq = -1
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/feaspump/maxlpiterofs = 2000
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/fracdiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
59.98/60.06 c heuristics/fracdiving/maxlpiterquot = 0.075
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/fracdiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/guideddiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
59.98/60.06 c heuristics/guideddiving/maxlpiterquot = 0.075
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/guideddiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
59.98/60.06 c heuristics/intdiving/maxlpiterquot = 0.075
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/intshifting/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/linesearchdiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
59.98/60.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 1]
59.98/60.06 c heuristics/nlp/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 20]
59.98/60.06 c heuristics/objpscostdiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to total iteration number
59.98/60.06 c # [type: real, range: [0,1], default: 0.01]
59.98/60.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 1]
59.98/60.06 c heuristics/oneopt/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/pscostdiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
59.98/60.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/pscostdiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 0]
59.98/60.06 c heuristics/rens/freq = -1
59.98/60.06 c
59.98/60.06 c # minimum percentage of integer variables that have to be fixable
59.98/60.06 c # [type: real, range: [0,1], default: 0.5]
59.98/60.06 c heuristics/rens/minfixingrate = 0.3
59.98/60.06 c
59.98/60.06 c # number of nodes added to the contingent of the total nodes
59.98/60.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
59.98/60.06 c heuristics/rens/nodesofs = 2000
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 20]
59.98/60.06 c heuristics/rootsoldiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
59.98/60.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 1]
59.98/60.06 c heuristics/rounding/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/shifting/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 1]
59.98/60.06 c heuristics/simplerounding/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 0]
59.98/60.06 c heuristics/trivial/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 1]
59.98/60.06 c heuristics/trysol/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 10]
59.98/60.06 c heuristics/veclendiving/freq = -1
59.98/60.06 c
59.98/60.06 c # maximal fraction of diving LP iterations compared to node LP iterations
59.98/60.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
59.98/60.06 c heuristics/veclendiving/maxlpiterquot = 0.075
59.98/60.06 c
59.98/60.06 c # additional number of allowed LP iterations
59.98/60.06 c # [type: int, range: [0,2147483647], default: 1000]
59.98/60.06 c heuristics/veclendiving/maxlpiterofs = 1500
59.98/60.06 c
59.98/60.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 1]
59.98/60.06 c heuristics/zirounding/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 0]
59.98/60.06 c separating/cmir/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: 0]
59.98/60.06 c separating/flowcover/freq = -1
59.98/60.06 c
59.98/60.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
59.98/60.06 c # [type: int, range: [-1,2147483647], default: -1]
59.98/60.06 c separating/rapidlearning/freq = 0
59.98/60.06 c
59.98/60.06 c -----------------------------------------------------------------------------------------------
59.98/60.06 c start solving
60.18/60.22 c
60.77/60.83 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
60.77/60.83 c 37.7s| 1 | 2 | 0 | - | 977M| 0 | - | 157k| 459k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1800.08/1800.50 c pressed CTRL-C 1 times (5 times for forcing termination)
1800.19/1800.68 c
1800.19/1800.68 c SCIP Status : solving was interrupted [user interrupt]
1800.19/1800.68 c Solving Time (sec) : 1776.20
1800.19/1800.68 c Solving Nodes : 5831
1800.19/1800.68 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1800.19/1800.68 c Dual Bound : +0.00000000000000e+00
1800.19/1800.68 c Gap : infinite
1800.19/1800.68 s UNKNOWN
1800.19/1800.68 c SCIP Status : solving was interrupted [user interrupt]
1800.19/1800.68 c Solving Time : 1776.20
1800.19/1800.68 c Original Problem :
1800.19/1800.68 c Problem name : HOME/instance-2664027-1276330718.opb
1800.19/1800.68 c Variables : 168111 (168111 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.19/1800.68 c Constraints : 487525 initial, 487525 maximal
1800.19/1800.68 c Presolved Problem :
1800.19/1800.68 c Problem name : t_HOME/instance-2664027-1276330718.opb
1800.19/1800.68 c Variables : 157887 (157887 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.19/1800.68 c Constraints : 459179 initial, 459366 maximal
1800.19/1800.68 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1800.19/1800.68 c trivial : 1.78 93 0 0 0 0 0 0 0
1800.19/1800.68 c dualfix : 1.71 0 0 0 0 0 0 0 0
1800.19/1800.68 c boundshift : 0.00 0 0 0 0 0 0 0 0
1800.19/1800.68 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1800.19/1800.68 c implics : 5.28 0 4810 0 0 0 0 0 0
1800.19/1800.68 c probing : 0.00 0 0 0 0 0 0 0 0
1800.19/1800.68 c knapsack : 0.31 0 0 0 0 0 0 0 0
1800.19/1800.68 c linear : 23.82 5303 18 0 5310 0 28346 9399 19538
1800.19/1800.68 c logicor : 1.00 0 0 0 0 0 0 0 0
1800.19/1800.68 c root node : - 2 - - 2 - - - -
1800.19/1800.68 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1800.19/1800.68 c integral : 0 0 0 0 0 0 0 0 0 0
1800.19/1800.68 c knapsack : 18798 0 68465 0 5781 6 6776 0 0 0
1800.19/1800.68 c logicor : 440381+ 0 65911 0 5781 70 2994941 0 0 0
1800.19/1800.68 c countsols : 0 0 0 0 5780 0 0 0 0 0
1800.19/1800.68 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1800.19/1800.68 c integral : 0.00 0.00 0.00 0.00 0.00
1800.19/1800.68 c knapsack : 174.84 0.00 174.76 0.00 0.08
1800.19/1800.68 c logicor : 1249.92 0.00 23.70 0.00 1226.22
1800.19/1800.68 c countsols : 0.00 0.00 0.00 0.00 0.00
1800.19/1800.68 c Propagators : Time Calls Cutoffs DomReds
1800.19/1800.68 c vbounds : 0.07 1 0 0
1800.19/1800.68 c rootredcost : 0.08 0 0 0
1800.19/1800.68 c pseudoobj : 0.05 0 0 0
1800.19/1800.68 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1800.19/1800.68 c propagation : 0.01 76 76 387 39.3 25 11.4 -
1800.19/1800.68 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1800.19/1800.68 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1800.19/1800.68 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1800.19/1800.68 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1800.19/1800.68 c applied globally : - - - 250 31.3 - - -
1800.19/1800.68 c applied locally : - - - 0 0.0 - - -
1800.19/1800.68 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1800.19/1800.68 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1800.19/1800.68 c redcost : 0.00 0 0 0 0 0
1800.19/1800.68 c impliedbounds : 0.00 0 0 0 0 0
1800.19/1800.68 c intobj : 0.00 0 0 0 0 0
1800.19/1800.68 c cgmip : 0.00 0 0 0 0 0
1800.19/1800.68 c gomory : 0.00 0 0 0 0 0
1800.19/1800.68 c strongcg : 0.00 0 0 0 0 0
1800.19/1800.68 c cmir : 0.00 0 0 0 0 0
1800.19/1800.68 c flowcover : 0.00 0 0 0 0 0
1800.19/1800.68 c clique : 0.00 0 0 0 0 0
1800.19/1800.68 c zerohalf : 0.00 0 0 0 0 0
1800.19/1800.68 c mcf : 0.00 0 0 0 0 0
1800.19/1800.68 c rapidlearning : 0.00 0 0 0 0 0
1800.19/1800.68 c Pricers : Time Calls Vars
1800.19/1800.68 c problem variables: 0.00 0 0
1800.19/1800.68 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1800.19/1800.68 c relpscost : 0.00 0 0 0 0 0 0
1800.19/1800.68 c pscost : 0.00 0 0 0 0 0 0
1800.19/1800.68 c inference : 293.53 5780 0 0 0 0 11560
1800.19/1800.68 c mostinf : 0.00 0 0 0 0 0 0
1800.19/1800.68 c leastinf : 0.00 0 0 0 0 0 0
1800.19/1800.68 c fullstrong : 0.00 0 0 0 0 0 0
1800.19/1800.68 c allfullstrong : 0.00 0 0 0 0 0 0
1800.19/1800.68 c random : 0.00 0 0 0 0 0 0
1800.19/1800.68 c Primal Heuristics : Time Calls Found
1800.19/1800.68 c LP solutions : 0.00 - 0
1800.19/1800.68 c pseudo solutions : 0.00 - 0
1800.19/1800.68 c trivial : 0.36 1 0
1800.19/1800.68 c simplerounding : 0.00 0 0
1800.19/1800.68 c zirounding : 0.00 0 0
1800.19/1800.68 c rounding : 0.00 0 0
1800.19/1800.68 c shifting : 0.00 0 0
1800.19/1800.68 c intshifting : 0.00 0 0
1800.19/1800.68 c oneopt : 0.00 0 0
1800.19/1800.68 c twoopt : 0.00 0 0
1800.19/1800.68 c fixandinfer : 0.00 0 0
1800.19/1800.68 c feaspump : 0.00 0 0
1800.19/1800.68 c coefdiving : 0.00 0 0
1800.19/1800.68 c pscostdiving : 0.00 0 0
1800.19/1800.68 c fracdiving : 0.00 0 0
1800.19/1800.68 c veclendiving : 0.00 0 0
1800.19/1800.68 c intdiving : 0.00 0 0
1800.19/1800.68 c actconsdiving : 0.00 0 0
1800.19/1800.68 c objpscostdiving : 0.00 0 0
1800.19/1800.68 c rootsoldiving : 0.00 0 0
1800.19/1800.68 c linesearchdiving : 0.00 0 0
1800.19/1800.68 c guideddiving : 0.00 0 0
1800.19/1800.68 c octane : 0.00 0 0
1800.19/1800.68 c rens : 0.00 0 0
1800.19/1800.68 c rins : 0.00 0 0
1800.19/1800.68 c localbranching : 0.00 0 0
1800.19/1800.68 c mutation : 0.00 0 0
1800.19/1800.68 c crossover : 0.00 0 0
1800.19/1800.68 c dins : 0.00 0 0
1800.19/1800.68 c undercover : 0.00 0 0
1800.19/1800.68 c nlp : 0.00 0 0
1800.19/1800.68 c trysol : 0.00 0 0
1800.19/1800.68 c LP : Time Calls Iterations Iter/call Iter/sec
1800.19/1800.68 c primal LP : 0.00 0 0 0.00 -
1800.19/1800.68 c dual LP : 0.00 0 0 0.00 -
1800.19/1800.68 c lex dual LP : 0.00 0 0 0.00 -
1800.19/1800.68 c barrier LP : 0.00 0 0 0.00 -
1800.19/1800.68 c diving/probing LP: 0.00 0 0 0.00 -
1800.19/1800.68 c strong branching : 0.00 0 0 0.00 -
1800.19/1800.68 c (at root node) : - 0 0 0.00 -
1800.19/1800.68 c conflict analysis: 0.00 0 0 0.00 -
1800.19/1800.68 c B&B Tree :
1800.19/1800.68 c number of runs : 1
1800.19/1800.68 c nodes : 5831
1800.19/1800.68 c nodes (total) : 5831
1800.19/1800.68 c nodes left : 5608
1800.19/1800.68 c max depth : 638
1800.19/1800.68 c max depth (total): 638
1800.19/1800.68 c backtracks : 44 (0.8%)
1800.19/1800.68 c delayed cutoffs : 122
1800.19/1800.68 c repropagations : 2136 (89555 domain reductions, 25 cutoffs)
1800.19/1800.68 c avg switch length: 2.72
1800.19/1800.68 c switching time : 13.69
1800.19/1800.68 c Solution :
1800.19/1800.68 c Solutions found : 0 (0 improvements)
1800.19/1800.68 c Primal Bound : -
1800.19/1800.68 c Dual Bound : +0.00000000000000e+00
1800.19/1800.68 c Gap : infinite
1800.19/1800.68 c Root Dual Bound : +0.00000000000000e+00
1800.19/1800.68 c Root Iterations : 0