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-2664024-1276338346.opb>
3.99/4.08 c original problem has 77106 variables (77106 bin, 0 int, 0 impl, 0 cont) and 218779 constraints
3.99/4.08 c problem read
3.99/4.08 c No objective function, only one solution is needed.
3.99/4.09 c presolving settings loaded
3.99/4.09 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
5.19/5.29 c presolving:
9.29/9.39 c (round 1) 3223 del vars, 4042 del conss, 1432 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4306962 impls, 0 clqs
9.69/9.78 c (round 2) 3528 del vars, 8830 del conss, 1625 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307384 impls, 0 clqs
9.99/10.03 c (round 3) 3532 del vars, 9068 del conss, 1629 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307384 impls, 0 clqs
10.29/10.32 c (round 4) 3686 del vars, 9228 del conss, 1635 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307694 impls, 0 clqs
10.59/10.60 c (round 5) 3842 del vars, 9689 del conss, 1644 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307994 impls, 0 clqs
10.79/10.88 c (round 6) 4000 del vars, 10155 del conss, 1656 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4308326 impls, 0 clqs
11.09/11.16 c (round 7) 4160 del vars, 10625 del conss, 1669 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4309184 impls, 0 clqs
11.39/11.43 c (round 8) 4187 del vars, 10965 del conss, 1684 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4310077 impls, 0 clqs
11.59/11.69 c (round 9) 4234 del vars, 11062 del conss, 1701 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4311931 impls, 0 clqs
11.89/11.95 c (round 10) 4264 del vars, 11176 del conss, 1724 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4312518 impls, 0 clqs
12.19/12.21 c (round 11) 4318 del vars, 11278 del conss, 1752 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4313044 impls, 0 clqs
12.39/12.48 c (round 12) 4429 del vars, 11480 del conss, 1788 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4314522 impls, 0 clqs
12.69/12.75 c (round 13) 4533 del vars, 11796 del conss, 1823 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4317962 impls, 0 clqs
12.98/13.01 c (round 14) 4575 del vars, 12039 del conss, 1857 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4318428 impls, 0 clqs
13.19/13.28 c (round 15) 4632 del vars, 12158 del conss, 1887 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4321218 impls, 0 clqs
13.49/13.54 c (round 16) 4661 del vars, 12286 del conss, 1913 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4321458 impls, 0 clqs
13.69/13.79 c (round 17) 4712 del vars, 12384 del conss, 1939 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4321954 impls, 0 clqs
13.99/14.05 c (round 18) 4775 del vars, 12546 del conss, 1970 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4323036 impls, 0 clqs
14.29/14.31 c (round 19) 4843 del vars, 12728 del conss, 2001 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325306 impls, 0 clqs
14.48/14.57 c (round 20) 4872 del vars, 12873 del conss, 2026 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325454 impls, 0 clqs
14.78/14.82 c (round 21) 4914 del vars, 12961 del conss, 2052 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325596 impls, 0 clqs
14.99/15.08 c (round 22) 4978 del vars, 13101 del conss, 2083 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325879 impls, 0 clqs
15.30/15.34 c (round 23) 5036 del vars, 13274 del conss, 2109 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4326795 impls, 0 clqs
15.49/15.59 c (round 24) 5071 del vars, 13411 del conss, 2135 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4327427 impls, 0 clqs
15.79/15.85 c (round 25) 5142 del vars, 13554 del conss, 2169 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4328126 impls, 0 clqs
16.09/16.10 c (round 26) 5201 del vars, 13737 del conss, 2201 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4328702 impls, 0 clqs
16.29/16.36 c (round 27) 5264 del vars, 13935 del conss, 2242 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4329446 impls, 0 clqs
16.58/16.61 c (round 28) 5283 del vars, 14033 del conss, 2253 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4329650 impls, 0 clqs
16.79/16.86 c (round 29) 5295 del vars, 14079 del conss, 2260 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4329990 impls, 0 clqs
17.09/17.11 c (round 30) 5307 del vars, 14115 del conss, 2265 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4330402 impls, 0 clqs
17.29/17.36 c (round 31) 5312 del vars, 14146 del conss, 2270 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4330404 impls, 0 clqs
17.78/17.80 c (round 32) 5322 del vars, 14194 del conss, 2280 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4330470 impls, 0 clqs
17.98/18.06 c (round 33) 5384 del vars, 14238 del conss, 2287 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4331344 impls, 0 clqs
18.28/18.31 c (round 34) 5395 del vars, 14370 del conss, 2297 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4331626 impls, 0 clqs
18.49/18.56 c (round 35) 5445 del vars, 14434 del conss, 2311 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4332625 impls, 0 clqs
18.78/18.81 c (round 36) 5489 del vars, 14572 del conss, 2327 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4333101 impls, 0 clqs
18.99/19.07 c (round 37) 5544 del vars, 14744 del conss, 2360 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4333819 impls, 0 clqs
19.28/19.32 c (round 38) 5561 del vars, 14833 del conss, 2369 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4333983 impls, 0 clqs
19.48/19.57 c (round 39) 5573 del vars, 14875 del conss, 2376 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334123 impls, 0 clqs
19.79/19.82 c (round 40) 5585 del vars, 14911 del conss, 2381 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334535 impls, 0 clqs
19.99/20.07 c (round 41) 5590 del vars, 14942 del conss, 2386 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334537 impls, 0 clqs
20.48/20.50 c (round 42) 5600 del vars, 14990 del conss, 2396 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334603 impls, 0 clqs
20.69/20.75 c (round 43) 5662 del vars, 15034 del conss, 2403 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4335481 impls, 0 clqs
20.99/21.00 c (round 44) 5673 del vars, 15166 del conss, 2413 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4335763 impls, 0 clqs
21.18/21.26 c (round 45) 5722 del vars, 15229 del conss, 2427 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4337348 impls, 0 clqs
21.49/21.51 c (round 46) 5767 del vars, 15366 del conss, 2443 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4338388 impls, 0 clqs
21.68/21.76 c (round 47) 5822 del vars, 15540 del conss, 2476 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4339314 impls, 0 clqs
21.99/22.01 c (round 48) 5839 del vars, 15629 del conss, 2485 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4339570 impls, 0 clqs
22.18/22.26 c (round 49) 5851 del vars, 15671 del conss, 2492 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4339716 impls, 0 clqs
22.48/22.51 c (round 50) 5863 del vars, 15707 del conss, 2497 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4340128 impls, 0 clqs
22.68/22.76 c (round 51) 5868 del vars, 15738 del conss, 2502 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4340130 impls, 0 clqs
23.09/23.19 c (round 52) 5878 del vars, 15786 del conss, 2512 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4340196 impls, 0 clqs
23.38/23.45 c (round 53) 5940 del vars, 15830 del conss, 2519 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4341070 impls, 0 clqs
23.59/23.70 c (round 54) 5951 del vars, 15962 del conss, 2529 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4341352 impls, 0 clqs
23.88/23.95 c (round 55) 5974 del vars, 15999 del conss, 2542 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4341396 impls, 0 clqs
24.09/24.20 c (round 56) 6043 del vars, 16107 del conss, 2558 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4344558 impls, 0 clqs
24.38/24.45 c (round 57) 6098 del vars, 16331 del conss, 2591 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4345150 impls, 0 clqs
24.68/24.70 c (round 58) 6116 del vars, 16420 del conss, 2600 chg bounds, 6611 chg sides, 13855 chg coeffs, 0 upgd conss, 4345342 impls, 0 clqs
24.88/24.95 c (round 59) 6131 del vars, 16466 del conss, 2609 chg bounds, 6612 chg sides, 13856 chg coeffs, 0 upgd conss, 4345496 impls, 0 clqs
25.09/25.20 c (round 60) 6140 del vars, 16516 del conss, 2618 chg bounds, 6612 chg sides, 13856 chg coeffs, 0 upgd conss, 4345572 impls, 0 clqs
25.78/25.81 c (round 61) 6148 del vars, 16541 del conss, 2626 chg bounds, 6612 chg sides, 13856 chg coeffs, 0 upgd conss, 4345582 impls, 0 clqs
28.38/28.43 c (round 62) 6154 del vars, 16620 del conss, 2632 chg bounds, 6612 chg sides, 13856 chg coeffs, 202159 upgd conss, 4345666 impls, 0 clqs
29.18/29.23 c presolving (63 rounds):
29.18/29.23 c 6154 deleted vars, 16620 deleted constraints, 2632 tightened bounds, 0 added holes, 6612 changed sides, 13856 changed coefficients
29.18/29.23 c 4345666 implications, 0 cliques
29.18/29.23 c presolved problem has 70952 variables (70952 bin, 0 int, 0 impl, 0 cont) and 202159 constraints
29.18/29.23 c 13220 constraints of type <knapsack>
29.18/29.23 c 188939 constraints of type <logicor>
29.18/29.23 c transformed objective value is always integral (scale: 1)
29.18/29.23 c Presolving Time: 17.23
29.18/29.23 c - non default parameters ----------------------------------------------------------------------
29.18/29.23 c # SCIP version 1.2.1.2
29.18/29.23 c
29.18/29.23 c # frequency for displaying node information lines
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 100]
29.18/29.23 c display/freq = 10000
29.18/29.23 c
29.18/29.23 c # maximal time in seconds to run
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
29.18/29.23 c limits/time = 1795.91
29.18/29.23 c
29.18/29.23 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
29.18/29.23 c limits/memory = 1620
29.18/29.23 c
29.18/29.23 c # solving stops, if the given number of solutions were found (-1: no limit)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: -1]
29.18/29.23 c limits/solutions = 1
29.18/29.23 c
29.18/29.23 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 1]
29.18/29.23 c lp/solvefreq = -1
29.18/29.23 c
29.18/29.23 c # maximal number of separation rounds per node (-1: unlimited)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 5]
29.18/29.23 c separating/maxrounds = 1
29.18/29.23 c
29.18/29.23 c # maximal number of separation rounds in the root node (-1: unlimited)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: -1]
29.18/29.23 c separating/maxroundsroot = 5
29.18/29.23 c
29.18/29.23 c # should presolving try to simplify inequalities
29.18/29.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
29.18/29.23 c constraints/linear/simplifyinequalities = TRUE
29.18/29.23 c
29.18/29.23 c # should disaggregation of knapsack constraints be allowed in preprocessing?
29.18/29.23 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
29.18/29.23 c constraints/knapsack/disaggregation = FALSE
29.18/29.23 c
29.18/29.23 c # should presolving try to simplify knapsacks
29.18/29.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
29.18/29.23 c constraints/knapsack/simplifyinequalities = TRUE
29.18/29.23 c
29.18/29.23 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: -1]
29.18/29.23 c presolving/probing/maxrounds = 0
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/coefdiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.18/29.23 c heuristics/coefdiving/maxlpiterquot = 0.075
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/coefdiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 30]
29.18/29.23 c heuristics/crossover/freq = -1
29.18/29.23 c
29.18/29.23 c # number of nodes added to the contingent of the total nodes
29.18/29.23 c # [type: longint, range: [0,9223372036854775807], default: 500]
29.18/29.23 c heuristics/crossover/nodesofs = 750
29.18/29.23 c
29.18/29.23 c # number of nodes without incumbent change that heuristic should wait
29.18/29.23 c # [type: longint, range: [0,9223372036854775807], default: 200]
29.18/29.23 c heuristics/crossover/nwaitingnodes = 100
29.18/29.23 c
29.18/29.23 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
29.18/29.23 c # [type: real, range: [0,1], default: 0.1]
29.18/29.23 c heuristics/crossover/nodesquot = 0.15
29.18/29.23 c
29.18/29.23 c # minimum percentage of integer variables that have to be fixed
29.18/29.23 c # [type: real, range: [0,1], default: 0.666]
29.18/29.23 c heuristics/crossover/minfixingrate = 0.5
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 20]
29.18/29.23 c heuristics/feaspump/freq = -1
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/feaspump/maxlpiterofs = 2000
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/fracdiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.18/29.23 c heuristics/fracdiving/maxlpiterquot = 0.075
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/fracdiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/guideddiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.18/29.23 c heuristics/guideddiving/maxlpiterquot = 0.075
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/guideddiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.18/29.23 c heuristics/intdiving/maxlpiterquot = 0.075
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/intshifting/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/linesearchdiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.18/29.23 c heuristics/linesearchdiving/maxlpiterquot = 0.075
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/linesearchdiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 1]
29.18/29.23 c heuristics/nlp/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 20]
29.18/29.23 c heuristics/objpscostdiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to total iteration number
29.18/29.23 c # [type: real, range: [0,1], default: 0.01]
29.18/29.23 c heuristics/objpscostdiving/maxlpiterquot = 0.015
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/objpscostdiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 1]
29.18/29.23 c heuristics/oneopt/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/pscostdiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.18/29.23 c heuristics/pscostdiving/maxlpiterquot = 0.075
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/pscostdiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 0]
29.18/29.23 c heuristics/rens/freq = -1
29.18/29.23 c
29.18/29.23 c # minimum percentage of integer variables that have to be fixable
29.18/29.23 c # [type: real, range: [0,1], default: 0.5]
29.18/29.23 c heuristics/rens/minfixingrate = 0.3
29.18/29.23 c
29.18/29.23 c # number of nodes added to the contingent of the total nodes
29.18/29.23 c # [type: longint, range: [0,9223372036854775807], default: 500]
29.18/29.23 c heuristics/rens/nodesofs = 2000
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 20]
29.18/29.23 c heuristics/rootsoldiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
29.18/29.23 c heuristics/rootsoldiving/maxlpiterquot = 0.015
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/rootsoldiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 1]
29.18/29.23 c heuristics/rounding/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/shifting/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 1]
29.18/29.23 c heuristics/simplerounding/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 0]
29.18/29.23 c heuristics/trivial/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 1]
29.18/29.23 c heuristics/trysol/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 10]
29.18/29.23 c heuristics/veclendiving/freq = -1
29.18/29.23 c
29.18/29.23 c # maximal fraction of diving LP iterations compared to node LP iterations
29.18/29.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.18/29.23 c heuristics/veclendiving/maxlpiterquot = 0.075
29.18/29.23 c
29.18/29.23 c # additional number of allowed LP iterations
29.18/29.23 c # [type: int, range: [0,2147483647], default: 1000]
29.18/29.23 c heuristics/veclendiving/maxlpiterofs = 1500
29.18/29.23 c
29.18/29.23 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 1]
29.18/29.23 c heuristics/zirounding/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 0]
29.18/29.23 c separating/cmir/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: 0]
29.18/29.23 c separating/flowcover/freq = -1
29.18/29.23 c
29.18/29.23 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
29.18/29.23 c # [type: int, range: [-1,2147483647], default: -1]
29.18/29.23 c separating/rapidlearning/freq = 0
29.18/29.23 c
29.18/29.23 c -----------------------------------------------------------------------------------------------
29.18/29.23 c start solving
29.28/29.30 c
29.48/29.56 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
29.48/29.56 c 18.1s| 1 | 2 | 0 | - | 434M| 0 | - | 70k| 202k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
919.95/920.33 c 908s| 10000 | 9910 | 0 | 0.0 | 486M|4870 | - | 70k| 202k| 0 | 0 | 0 | 123 | 0 | 0.000000e+00 | -- | Inf
1800.03/1800.71 c pressed CTRL-C 1 times (5 times for forcing termination)
1800.12/1800.82 c
1800.12/1800.82 c SCIP Status : solving was interrupted [user interrupt]
1800.12/1800.82 c Solving Time (sec) : 1786.99
1800.12/1800.82 c Solving Nodes : 17643
1800.12/1800.82 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1800.12/1800.82 c Dual Bound : +0.00000000000000e+00
1800.12/1800.82 c Gap : infinite
1800.12/1800.82 s UNKNOWN
1800.12/1800.82 c SCIP Status : solving was interrupted [user interrupt]
1800.12/1800.82 c Solving Time : 1786.99
1800.12/1800.82 c Original Problem :
1800.12/1800.82 c Problem name : HOME/instance-2664024-1276338346.opb
1800.12/1800.82 c Variables : 77106 (77106 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.12/1800.82 c Constraints : 218779 initial, 218779 maximal
1800.12/1800.82 c Presolved Problem :
1800.12/1800.82 c Problem name : t_HOME/instance-2664024-1276338346.opb
1800.12/1800.82 c Variables : 70952 (70952 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.12/1800.82 c Constraints : 202159 initial, 202681 maximal
1800.12/1800.82 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1800.12/1800.82 c trivial : 0.92 36 0 0 0 0 0 0 0
1800.12/1800.82 c dualfix : 0.84 0 0 0 0 0 0 0 0
1800.12/1800.82 c boundshift : 0.00 0 0 0 0 0 0 0 0
1800.12/1800.82 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1800.12/1800.82 c implics : 2.57 0 3477 0 0 0 0 0 0
1800.12/1800.82 c probing : 0.00 0 0 0 0 0 0 0 0
1800.12/1800.82 c knapsack : 0.20 0 0 0 0 0 0 0 0
1800.12/1800.82 c linear : 11.47 2624 17 0 2632 0 16620 6612 13856
1800.12/1800.82 c logicor : 0.42 0 0 0 0 0 0 0 0
1800.12/1800.82 c root node : - 2 - - 2 - - - -
1800.12/1800.82 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1800.12/1800.82 c integral : 0 0 0 0 0 0 0 0 0 0
1800.12/1800.82 c knapsack : 13220 0 132204 0 17428 183 13624 0 0 0
1800.12/1800.82 c logicor : 188939+ 0 128129 0 17428 72 1827452 0 0 0
1800.12/1800.82 c countsols : 0 0 0 0 17428 0 0 0 0 0
1800.12/1800.82 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1800.12/1800.82 c integral : 0.00 0.00 0.00 0.00 0.00
1800.12/1800.82 c knapsack : 203.19 0.00 202.99 0.00 0.20
1800.12/1800.82 c logicor : 1261.08 0.00 15.89 0.00 1245.19
1800.12/1800.82 c countsols : 0.03 0.00 0.00 0.00 0.03
1800.12/1800.82 c Propagators : Time Calls Cutoffs DomReds
1800.12/1800.82 c vbounds : 0.14 1 0 0
1800.12/1800.82 c rootredcost : 0.12 0 0 0
1800.12/1800.82 c pseudoobj : 0.03 0 0 0
1800.12/1800.82 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1800.12/1800.82 c propagation : 0.05 255 255 1118 42.9 44 12.9 -
1800.12/1800.82 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1800.12/1800.82 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1800.12/1800.82 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1800.12/1800.82 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1800.12/1800.82 c applied globally : - - - 707 21.2 - - -
1800.12/1800.82 c applied locally : - - - 0 0.0 - - -
1800.12/1800.82 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1800.12/1800.82 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1800.12/1800.82 c redcost : 0.00 0 0 0 0 0
1800.12/1800.82 c impliedbounds : 0.00 0 0 0 0 0
1800.12/1800.82 c intobj : 0.00 0 0 0 0 0
1800.12/1800.82 c cgmip : 0.00 0 0 0 0 0
1800.12/1800.82 c gomory : 0.00 0 0 0 0 0
1800.12/1800.82 c strongcg : 0.00 0 0 0 0 0
1800.12/1800.82 c cmir : 0.00 0 0 0 0 0
1800.12/1800.82 c flowcover : 0.00 0 0 0 0 0
1800.12/1800.82 c clique : 0.00 0 0 0 0 0
1800.12/1800.82 c zerohalf : 0.00 0 0 0 0 0
1800.12/1800.82 c mcf : 0.00 0 0 0 0 0
1800.12/1800.82 c rapidlearning : 0.00 0 0 0 0 0
1800.12/1800.82 c Pricers : Time Calls Vars
1800.12/1800.82 c problem variables: 0.00 0 0
1800.12/1800.82 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1800.12/1800.82 c relpscost : 0.00 0 0 0 0 0 0
1800.12/1800.82 c pscost : 0.00 0 0 0 0 0 0
1800.12/1800.82 c inference : 288.20 17428 0 0 0 0 34856
1800.12/1800.82 c mostinf : 0.00 0 0 0 0 0 0
1800.12/1800.82 c leastinf : 0.00 0 0 0 0 0 0
1800.12/1800.82 c fullstrong : 0.00 0 0 0 0 0 0
1800.12/1800.82 c allfullstrong : 0.00 0 0 0 0 0 0
1800.12/1800.82 c random : 0.00 0 0 0 0 0 0
1800.12/1800.82 c Primal Heuristics : Time Calls Found
1800.12/1800.82 c LP solutions : 0.00 - 0
1800.12/1800.82 c pseudo solutions : 0.00 - 0
1800.12/1800.82 c trivial : 0.14 1 0
1800.12/1800.82 c simplerounding : 0.00 0 0
1800.12/1800.82 c zirounding : 0.00 0 0
1800.12/1800.82 c rounding : 0.00 0 0
1800.12/1800.82 c shifting : 0.00 0 0
1800.12/1800.82 c intshifting : 0.00 0 0
1800.12/1800.82 c oneopt : 0.00 0 0
1800.12/1800.82 c twoopt : 0.00 0 0
1800.12/1800.82 c fixandinfer : 0.00 0 0
1800.12/1800.82 c feaspump : 0.00 0 0
1800.12/1800.82 c coefdiving : 0.00 0 0
1800.12/1800.82 c pscostdiving : 0.00 0 0
1800.12/1800.82 c fracdiving : 0.00 0 0
1800.12/1800.82 c veclendiving : 0.00 0 0
1800.12/1800.82 c intdiving : 0.00 0 0
1800.12/1800.82 c actconsdiving : 0.00 0 0
1800.12/1800.82 c objpscostdiving : 0.00 0 0
1800.12/1800.82 c rootsoldiving : 0.00 0 0
1800.12/1800.82 c linesearchdiving : 0.00 0 0
1800.12/1800.82 c guideddiving : 0.00 0 0
1800.12/1800.82 c octane : 0.00 0 0
1800.12/1800.82 c rens : 0.00 0 0
1800.12/1800.82 c rins : 0.00 0 0
1800.12/1800.82 c localbranching : 0.00 0 0
1800.12/1800.82 c mutation : 0.00 0 0
1800.12/1800.82 c crossover : 0.00 0 0
1800.12/1800.82 c dins : 0.00 0 0
1800.12/1800.82 c undercover : 0.00 0 0
1800.12/1800.82 c nlp : 0.00 0 0
1800.12/1800.82 c trysol : 0.00 0 0
1800.12/1800.82 c LP : Time Calls Iterations Iter/call Iter/sec
1800.12/1800.82 c primal LP : 0.00 0 0 0.00 -
1800.12/1800.82 c dual LP : 0.00 0 0 0.00 -
1800.12/1800.82 c lex dual LP : 0.00 0 0 0.00 -
1800.12/1800.82 c barrier LP : 0.00 0 0 0.00 -
1800.12/1800.82 c diving/probing LP: 0.00 0 0 0.00 -
1800.12/1800.82 c strong branching : 0.00 0 0 0.00 -
1800.12/1800.82 c (at root node) : - 0 0 0.00 -
1800.12/1800.82 c conflict analysis: 0.00 0 0 0.00 -
1800.12/1800.82 c B&B Tree :
1800.12/1800.82 c number of runs : 1
1800.12/1800.82 c nodes : 17643
1800.12/1800.82 c nodes (total) : 17643
1800.12/1800.82 c nodes left : 17139
1800.12/1800.82 c max depth : 4870
1800.12/1800.82 c max depth (total): 4870
1800.12/1800.82 c backtracks : 62 (0.4%)
1800.12/1800.82 c delayed cutoffs : 75
1800.12/1800.82 c repropagations : 7246 (40955 domain reductions, 40 cutoffs)
1800.12/1800.82 c avg switch length: 2.79
1800.12/1800.82 c switching time : 9.51
1800.12/1800.82 c Solution :
1800.12/1800.82 c Solutions found : 0 (0 improvements)
1800.12/1800.82 c Primal Bound : -
1800.12/1800.82 c Dual Bound : +0.00000000000000e+00
1800.12/1800.82 c Gap : infinite
1800.12/1800.82 c Root Dual Bound : +0.00000000000000e+00
1800.12/1800.82 c Root Iterations : 0
1801.42/1802.14 c Time complete: 1801.46.