0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3485353-1307755510.opb>
1.69/1.73 c original problem has 109757 variables (109757 bin, 0 int, 0 impl, 0 cont) and 313451 constraints
1.69/1.73 c problem read
1.69/1.73 c No objective function, only one solution is needed.
1.69/1.74 c presolving settings loaded
2.79/2.81 c presolving:
5.29/5.39 c (round 1) 4625 del vars, 6402 del conss, 0 add conss, 2234 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6521963 impls, 0 clqs
5.50/5.51 c (round 2) 4627 del vars, 12003 del conss, 0 add conss, 2236 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6521963 impls, 0 clqs
5.50/5.59 c (round 3) 4637 del vars, 12035 del conss, 0 add conss, 2247 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6522436 impls, 0 clqs
5.60/5.65 c (round 4) 4702 del vars, 12091 del conss, 0 add conss, 2257 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6523703 impls, 0 clqs
5.69/5.71 c (round 5) 4726 del vars, 12242 del conss, 0 add conss, 2270 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6524282 impls, 0 clqs
5.69/5.76 c (round 6) 4766 del vars, 12324 del conss, 0 add conss, 2284 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6525528 impls, 0 clqs
5.79/5.82 c (round 7) 4826 del vars, 12456 del conss, 0 add conss, 2299 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6525800 impls, 0 clqs
5.79/5.88 c (round 8) 4911 del vars, 12651 del conss, 0 add conss, 2315 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6527112 impls, 0 clqs
5.89/5.94 c (round 9) 4962 del vars, 12867 del conss, 0 add conss, 2330 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6527660 impls, 0 clqs
5.89/6.00 c (round 10) 4992 del vars, 12994 del conss, 0 add conss, 2343 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6528205 impls, 0 clqs
5.99/6.05 c (round 11) 5017 del vars, 13082 del conss, 0 add conss, 2355 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6528713 impls, 0 clqs
6.09/6.11 c (round 12) 5069 del vars, 13174 del conss, 0 add conss, 2363 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6529839 impls, 0 clqs
6.09/6.16 c (round 13) 5096 del vars, 13303 del conss, 0 add conss, 2369 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6531031 impls, 0 clqs
6.19/6.22 c (round 14) 5106 del vars, 13365 del conss, 0 add conss, 2376 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6531221 impls, 0 clqs
6.19/6.27 c (round 15) 5129 del vars, 13404 del conss, 0 add conss, 2385 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6531619 impls, 0 clqs
6.29/6.33 c (round 16) 5177 del vars, 13500 del conss, 0 add conss, 2400 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6532103 impls, 0 clqs
6.29/6.39 c (round 17) 5255 del vars, 13673 del conss, 0 add conss, 2414 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6534699 impls, 0 clqs
6.39/6.44 c (round 18) 5273 del vars, 13838 del conss, 0 add conss, 2422 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6534949 impls, 0 clqs
6.49/6.50 c (round 19) 5302 del vars, 13897 del conss, 0 add conss, 2431 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6535753 impls, 0 clqs
6.49/6.56 c (round 20) 5350 del vars, 14004 del conss, 0 add conss, 2442 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6535944 impls, 0 clqs
6.60/6.61 c (round 21) 5388 del vars, 14133 del conss, 0 add conss, 2450 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6536836 impls, 0 clqs
6.60/6.67 c (round 22) 5400 del vars, 14215 del conss, 0 add conss, 2460 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6537316 impls, 0 clqs
6.70/6.72 c (round 23) 5439 del vars, 14274 del conss, 0 add conss, 2473 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6537983 impls, 0 clqs
6.70/6.78 c (round 24) 5466 del vars, 14377 del conss, 0 add conss, 2486 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6538359 impls, 0 clqs
6.79/6.83 c (round 25) 5499 del vars, 14460 del conss, 0 add conss, 2501 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6538781 impls, 0 clqs
6.79/6.88 c (round 26) 5522 del vars, 14541 del conss, 0 add conss, 2512 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539049 impls, 0 clqs
6.89/6.94 c (round 27) 5545 del vars, 14613 del conss, 0 add conss, 2525 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539331 impls, 0 clqs
6.89/6.99 c (round 28) 5557 del vars, 14661 del conss, 0 add conss, 2531 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539389 impls, 0 clqs
6.99/7.04 c (round 29) 5570 del vars, 14704 del conss, 0 add conss, 2538 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539617 impls, 0 clqs
7.09/7.16 c (round 30) 5583 del vars, 14775 del conss, 0 add conss, 2551 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539853 impls, 0 clqs
7.19/7.21 c (round 31) 5649 del vars, 14821 del conss, 0 add conss, 2558 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6540723 impls, 0 clqs
7.19/7.27 c (round 32) 5661 del vars, 14961 del conss, 0 add conss, 2568 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6541009 impls, 0 clqs
7.29/7.32 c (round 33) 5681 del vars, 15002 del conss, 0 add conss, 2578 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6541147 impls, 0 clqs
7.29/7.38 c (round 34) 5709 del vars, 15066 del conss, 0 add conss, 2591 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6541333 impls, 0 clqs
7.39/7.43 c (round 35) 5753 del vars, 15166 del conss, 0 add conss, 2608 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6542558 impls, 0 clqs
7.39/7.49 c (round 36) 5792 del vars, 15288 del conss, 0 add conss, 2623 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6543258 impls, 0 clqs
7.49/7.54 c (round 37) 5817 del vars, 15387 del conss, 0 add conss, 2638 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6543544 impls, 0 clqs
7.49/7.59 c (round 38) 5831 del vars, 15440 del conss, 0 add conss, 2646 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6543620 impls, 0 clqs
7.59/7.65 c (round 39) 5844 del vars, 15487 del conss, 0 add conss, 2653 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6543868 impls, 0 clqs
7.69/7.76 c (round 40) 5857 del vars, 15558 del conss, 0 add conss, 2666 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6544102 impls, 0 clqs
7.80/7.81 c (round 41) 5923 del vars, 15604 del conss, 0 add conss, 2673 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6544972 impls, 0 clqs
7.80/7.87 c (round 42) 5935 del vars, 15744 del conss, 0 add conss, 2683 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6545436 impls, 0 clqs
7.89/7.92 c (round 43) 5956 del vars, 15785 del conss, 0 add conss, 2693 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6546780 impls, 0 clqs
7.89/7.98 c (round 44) 6014 del vars, 15876 del conss, 0 add conss, 2709 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6549924 impls, 0 clqs
7.99/8.03 c (round 45) 6051 del vars, 16038 del conss, 0 add conss, 2726 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6550702 impls, 0 clqs
7.99/8.09 c (round 46) 6094 del vars, 16171 del conss, 0 add conss, 2752 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6551546 impls, 0 clqs
8.09/8.14 c (round 47) 6113 del vars, 16245 del conss, 0 add conss, 2761 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6553044 impls, 0 clqs
8.19/8.22 c (round 48) 6116 del vars, 16276 del conss, 0 add conss, 2764 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6553050 impls, 0 clqs
8.19/8.28 c (round 49) 6150 del vars, 16313 del conss, 0 add conss, 2768 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6553112 impls, 0 clqs
8.29/8.33 c (round 50) 6184 del vars, 16414 del conss, 0 add conss, 2773 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6553920 impls, 0 clqs
8.29/8.39 c (round 51) 6194 del vars, 16489 del conss, 0 add conss, 2781 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6554382 impls, 0 clqs
8.39/8.44 c (round 52) 6215 del vars, 16526 del conss, 0 add conss, 2791 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6555100 impls, 0 clqs
8.49/8.50 c (round 53) 6261 del vars, 16609 del conss, 0 add conss, 2804 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6557566 impls, 0 clqs
8.49/8.55 c (round 54) 6304 del vars, 16750 del conss, 0 add conss, 2823 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558166 impls, 0 clqs
8.59/8.61 c (round 55) 6322 del vars, 16841 del conss, 0 add conss, 2833 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558362 impls, 0 clqs
8.59/8.66 c (round 56) 6342 del vars, 16893 del conss, 0 add conss, 2843 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558586 impls, 0 clqs
8.69/8.71 c (round 57) 6356 del vars, 16943 del conss, 0 add conss, 2851 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558898 impls, 0 clqs
8.69/8.77 c (round 58) 6363 del vars, 16983 del conss, 0 add conss, 2858 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558950 impls, 0 clqs
8.79/8.85 c (round 59) 6373 del vars, 17035 del conss, 0 add conss, 2868 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6559112 impls, 0 clqs
8.90/8.90 c (round 60) 6439 del vars, 17081 del conss, 0 add conss, 2875 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560050 impls, 0 clqs
8.90/8.96 c (round 61) 6451 del vars, 17221 del conss, 0 add conss, 2885 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560336 impls, 0 clqs
8.99/9.01 c (round 62) 6473 del vars, 17263 del conss, 0 add conss, 2897 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560478 impls, 0 clqs
8.99/9.06 c (round 63) 6501 del vars, 17331 del conss, 0 add conss, 2910 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560632 impls, 0 clqs
9.09/9.12 c (round 64) 6545 del vars, 17431 del conss, 0 add conss, 2926 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6562834 impls, 0 clqs
9.09/9.17 c (round 65) 6582 del vars, 17550 del conss, 0 add conss, 2941 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6563458 impls, 0 clqs
9.19/9.23 c (round 66) 6607 del vars, 17647 del conss, 0 add conss, 2956 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6563752 impls, 0 clqs
9.19/9.28 c (round 67) 6620 del vars, 17700 del conss, 0 add conss, 2964 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6563852 impls, 0 clqs
9.29/9.34 c (round 68) 6635 del vars, 17759 del conss, 0 add conss, 2979 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6563872 impls, 0 clqs
9.49/9.50 c (round 69) 6645 del vars, 17790 del conss, 0 add conss, 2989 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6564092 impls, 0 clqs
10.49/10.59 c (round 70) 6645 del vars, 17854 del conss, 0 add conss, 2989 chg bounds, 8761 chg sides, 18368 chg coeffs, 295597 upgd conss, 6564120 impls, 0 clqs
11.10/11.12 c presolving (71 rounds):
11.10/11.12 c 6645 deleted vars, 17854 deleted constraints, 0 added constraints, 2989 tightened bounds, 0 added holes, 8761 changed sides, 18368 changed coefficients
11.10/11.12 c 6564120 implications, 0 cliques
11.10/11.12 c presolved problem has 103112 variables (103112 bin, 0 int, 0 impl, 0 cont) and 295597 constraints
11.10/11.12 c 17522 constraints of type <knapsack>
11.10/11.12 c 185599 constraints of type <setppc>
11.10/11.12 c 92476 constraints of type <logicor>
11.10/11.12 c transformed objective value is always integral (scale: 1)
11.10/11.12 c Presolving Time: 9.09
11.10/11.12 c - non default parameters ----------------------------------------------------------------------
11.10/11.12 c # SCIP version 2.0.1.4
11.10/11.12 c
11.10/11.12 c # frequency for displaying node information lines
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 100]
11.10/11.12 c display/freq = 10000
11.10/11.12 c
11.10/11.12 c # maximal time in seconds to run
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
11.10/11.12 c limits/time = 1797
11.10/11.12 c
11.10/11.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
11.10/11.12 c limits/memory = 13950
11.10/11.12 c
11.10/11.12 c # solving stops, if the given number of solutions were found (-1: no limit)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: -1]
11.10/11.12 c limits/solutions = 1
11.10/11.12 c
11.10/11.12 c # maximal number of separation rounds per node (-1: unlimited)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 5]
11.10/11.12 c separating/maxrounds = 1
11.10/11.12 c
11.10/11.12 c # maximal number of separation rounds in the root node (-1: unlimited)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: -1]
11.10/11.12 c separating/maxroundsroot = 5
11.10/11.12 c
11.10/11.12 c # default clock type (1: CPU user seconds, 2: wall clock time)
11.10/11.12 c # [type: int, range: [1,2], default: 1]
11.10/11.12 c timing/clocktype = 2
11.10/11.12 c
11.10/11.12 c # belongs reading time to solving time?
11.10/11.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.10/11.12 c timing/reading = TRUE
11.10/11.12 c
11.10/11.12 c # should presolving try to simplify inequalities
11.10/11.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.10/11.12 c constraints/linear/simplifyinequalities = TRUE
11.10/11.12 c
11.10/11.12 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
11.10/11.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.10/11.12 c constraints/indicator/addCouplingCons = TRUE
11.10/11.12 c
11.10/11.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
11.10/11.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
11.10/11.12 c constraints/knapsack/disaggregation = FALSE
11.10/11.12 c
11.10/11.12 c # should presolving try to simplify knapsacks
11.10/11.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
11.10/11.12 c constraints/knapsack/simplifyinequalities = TRUE
11.10/11.12 c
11.10/11.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: -1]
11.10/11.12 c presolving/probing/maxrounds = 0
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/coefdiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.10/11.12 c heuristics/coefdiving/maxlpiterquot = 0.075
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/coefdiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 30]
11.10/11.12 c heuristics/crossover/freq = -1
11.10/11.12 c
11.10/11.12 c # number of nodes added to the contingent of the total nodes
11.10/11.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
11.10/11.12 c heuristics/crossover/nodesofs = 750
11.10/11.12 c
11.10/11.12 c # number of nodes without incumbent change that heuristic should wait
11.10/11.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
11.10/11.12 c heuristics/crossover/nwaitingnodes = 100
11.10/11.12 c
11.10/11.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
11.10/11.12 c # [type: real, range: [0,1], default: 0.1]
11.10/11.12 c heuristics/crossover/nodesquot = 0.15
11.10/11.12 c
11.10/11.12 c # minimum percentage of integer variables that have to be fixed
11.10/11.12 c # [type: real, range: [0,1], default: 0.666]
11.10/11.12 c heuristics/crossover/minfixingrate = 0.5
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 20]
11.10/11.12 c heuristics/feaspump/freq = -1
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/feaspump/maxlpiterofs = 2000
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/fracdiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.10/11.12 c heuristics/fracdiving/maxlpiterquot = 0.075
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/fracdiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/guideddiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.10/11.12 c heuristics/guideddiving/maxlpiterquot = 0.075
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/guideddiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.10/11.12 c heuristics/intdiving/maxlpiterquot = 0.075
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/intshifting/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/linesearchdiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.10/11.12 c heuristics/linesearchdiving/maxlpiterquot = 0.075
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/linesearchdiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 20]
11.10/11.12 c heuristics/objpscostdiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to total iteration number
11.10/11.12 c # [type: real, range: [0,1], default: 0.01]
11.10/11.12 c heuristics/objpscostdiving/maxlpiterquot = 0.015
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/objpscostdiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 1]
11.10/11.12 c heuristics/oneopt/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/pscostdiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.10/11.12 c heuristics/pscostdiving/maxlpiterquot = 0.075
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/pscostdiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 0]
11.10/11.12 c heuristics/rens/freq = -1
11.10/11.12 c
11.10/11.12 c # minimum percentage of integer variables that have to be fixable
11.10/11.12 c # [type: real, range: [0,1], default: 0.5]
11.10/11.12 c heuristics/rens/minfixingrate = 0.3
11.10/11.12 c
11.10/11.12 c # number of nodes added to the contingent of the total nodes
11.10/11.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
11.10/11.12 c heuristics/rens/nodesofs = 2000
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 20]
11.10/11.12 c heuristics/rootsoldiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
11.10/11.12 c heuristics/rootsoldiving/maxlpiterquot = 0.015
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/rootsoldiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 1]
11.10/11.12 c heuristics/rounding/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 0]
11.10/11.12 c heuristics/shiftandpropagate/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/shifting/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 1]
11.10/11.12 c heuristics/simplerounding/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 1]
11.10/11.12 c heuristics/subnlp/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 0]
11.10/11.12 c heuristics/trivial/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 1]
11.10/11.12 c heuristics/trysol/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 0]
11.10/11.12 c heuristics/undercover/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 10]
11.10/11.12 c heuristics/veclendiving/freq = -1
11.10/11.12 c
11.10/11.12 c # maximal fraction of diving LP iterations compared to node LP iterations
11.10/11.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
11.10/11.12 c heuristics/veclendiving/maxlpiterquot = 0.075
11.10/11.12 c
11.10/11.12 c # additional number of allowed LP iterations
11.10/11.12 c # [type: int, range: [0,2147483647], default: 1000]
11.10/11.12 c heuristics/veclendiving/maxlpiterofs = 1500
11.10/11.12 c
11.10/11.12 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 1]
11.10/11.12 c heuristics/zirounding/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 0]
11.10/11.12 c separating/cmir/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: 0]
11.10/11.12 c separating/flowcover/freq = -1
11.10/11.12 c
11.10/11.12 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
11.10/11.12 c # [type: int, range: [-1,2147483647], default: -1]
11.10/11.12 c separating/rapidlearning/freq = 0
11.10/11.12 c
11.10/11.12 c -----------------------------------------------------------------------------------------------
11.10/11.12 c start solving
11.10/11.15 c
52.79/52.82 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
52.79/52.82 c 52.8s| 1 | 0 | 16298 | - | 795M| 0 | 10k| 103k| 295k| 103k| 295k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
95.49/95.58 c 95.6s| 1 | 0 | 19580 | - | 795M| 0 | 10k| 103k| 295k| 103k| 295k| 278 | 0 | 0 | 0.000000e+00 | -- | Inf
150.29/150.33 c 150s| 1 | 0 | 29822 | - | 796M| 0 | 12k| 103k| 295k| 103k| 296k| 459 | 0 | 0 | 0.000000e+00 | -- | Inf
429.59/429.62 c 430s| 1 | 0 | 64823 | - | 797M| 0 | 19k| 103k| 295k| 103k| 296k| 643 | 0 | 0 | 0.000000e+00 | -- | Inf
776.50/776.55 c 777s| 1 | 0 | 98098 | - | 798M| 0 | 23k| 103k| 295k| 103k| 296k| 872 | 0 | 0 | 0.000000e+00 | -- | Inf
1546.32/1546.36 c 1546s| 1 | 0 |159436 | - | 798M| 0 | 24k| 103k| 295k| 103k| 296k|1097 | 0 | 0 | 0.000000e+00 | -- | Inf
1799.62/1799.68 c 1800s| 1 | 2 |159436 | - | 798M| 0 | 24k| 103k| 295k| 103k| 296k|1097 | 0 | 43 | 0.000000e+00 | -- | Inf
1799.62/1799.68 c
1799.62/1799.68 c SCIP Status : solving was interrupted [time limit reached]
1799.62/1799.68 c Solving Time (sec) : 1799.68
1799.62/1799.68 c Solving Nodes : 1
1799.62/1799.68 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1799.62/1799.68 c Dual Bound : +0.00000000000000e+00
1799.62/1799.68 c Gap : infinite
1799.62/1799.68 s UNKNOWN
1799.62/1799.68 c SCIP Status : solving was interrupted [time limit reached]
1799.62/1799.68 c Total Time : 1799.68
1799.62/1799.68 c solving : 1799.68
1799.62/1799.68 c presolving : 9.09 (included in solving)
1799.62/1799.68 c reading : 1.73 (included in solving)
1799.62/1799.68 c Original Problem :
1799.62/1799.68 c Problem name : HOME/instance-3485353-1307755510.opb
1799.62/1799.68 c Variables : 109757 (109757 binary, 0 integer, 0 implicit integer, 0 continuous)
1799.62/1799.68 c Constraints : 313451 initial, 313451 maximal
1799.62/1799.68 c Presolved Problem :
1799.62/1799.68 c Problem name : t_HOME/instance-3485353-1307755510.opb
1799.62/1799.68 c Variables : 103112 (103112 binary, 0 integer, 0 implicit integer, 0 continuous)
1799.62/1799.68 c Constraints : 295597 initial, 295597 maximal
1799.62/1799.68 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1799.62/1799.68 c trivial : 0.37 11 0 0 0 0 0 0 0 0
1799.62/1799.68 c dualfix : 0.34 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c implics : 1.24 0 3638 0 0 0 0 0 0 0
1799.62/1799.68 c probing : 0.00 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c knapsack : 0.13 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c setppc : 0.27 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c linear : 5.60 2978 18 0 2989 0 17854 0 8761 18368
1799.62/1799.68 c logicor : 0.09 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c root node : - 0 - - 0 - - - - -
1799.62/1799.68 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1799.62/1799.68 c integral : 0 0 0 1 0 1 0 0 0 0 0 2
1799.62/1799.68 c knapsack : 17522 5 1 0 0 0 0 0 0 1003 0 0
1799.62/1799.68 c setppc : 185599 5 1 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c logicor : 92476 5 1 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
1799.62/1799.68 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1799.62/1799.68 c integral : 253.32 0.00 0.00 253.32 0.00 0.00 0.00
1799.62/1799.68 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
1799.62/1799.68 c setppc : 0.04 0.04 0.01 0.00 0.00 0.00 0.00
1799.62/1799.68 c logicor : 0.07 0.02 0.05 0.00 0.00 0.00 0.00
1799.62/1799.68 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1799.62/1799.68 c Propagators : #Propagate #Resprop Cutoffs DomReds
1799.62/1799.68 c vbounds : 0 0 0 0
1799.62/1799.68 c rootredcost : 0 0 0 0
1799.62/1799.68 c pseudoobj : 0 0 0 0
1799.62/1799.68 c Propagator Timings : TotalTime Propagate Resprop
1799.62/1799.68 c vbounds : 0.00 0.00 0.00
1799.62/1799.68 c rootredcost : 0.00 0.00 0.00
1799.62/1799.68 c pseudoobj : 0.00 0.00 0.00
1799.62/1799.68 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1799.62/1799.68 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1799.62/1799.68 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1799.62/1799.68 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1799.62/1799.68 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1799.62/1799.68 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1799.62/1799.68 c applied globally : - - - 0 0.0 - - -
1799.62/1799.68 c applied locally : - - - 0 0.0 - - -
1799.62/1799.68 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1799.62/1799.68 c cut pool : 0.00 4 - - 562 - (maximal pool size: 2765)
1799.62/1799.68 c redcost : 0.02 5 0 0 0 0
1799.62/1799.68 c impliedbounds : 0.13 5 0 0 0 0
1799.62/1799.68 c intobj : 0.00 0 0 0 0 0
1799.62/1799.68 c gomory : 118.75 5 0 0 2500 0
1799.62/1799.68 c cgmip : 0.00 0 0 0 0 0
1799.62/1799.68 c closecuts : 0.00 0 0 0 0 0
1799.62/1799.68 c strongcg : 138.13 5 0 0 2500 0
1799.62/1799.68 c cmir : 0.00 0 0 0 0 0
1799.62/1799.68 c flowcover : 0.00 0 0 0 0 0
1799.62/1799.68 c clique : 10.75 5 0 0 38 0
1799.62/1799.68 c zerohalf : 0.00 0 0 0 0 0
1799.62/1799.68 c mcf : 5.31 1 0 0 0 0
1799.62/1799.68 c oddcycle : 0.00 0 0 0 0 0
1799.62/1799.68 c rapidlearning : 0.00 0 0 0 0 0
1799.62/1799.68 c Pricers : Time Calls Vars
1799.62/1799.68 c problem variables: 0.00 0 0
1799.62/1799.68 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1799.62/1799.68 c relpscost : 253.32 1 0 0 0 0 2
1799.62/1799.68 c pscost : 0.00 0 0 0 0 0 0
1799.62/1799.68 c inference : 0.00 0 0 0 0 0 0
1799.62/1799.68 c mostinf : 0.00 0 0 0 0 0 0
1799.62/1799.68 c leastinf : 0.00 0 0 0 0 0 0
1799.62/1799.68 c fullstrong : 0.00 0 0 0 0 0 0
1799.62/1799.68 c allfullstrong : 0.00 0 0 0 0 0 0
1799.62/1799.68 c random : 0.00 0 0 0 0 0 0
1799.62/1799.68 c Primal Heuristics : Time Calls Found
1799.62/1799.68 c LP solutions : 0.00 - 0
1799.62/1799.68 c pseudo solutions : 0.00 - 0
1799.62/1799.68 c trivial : 0.08 1 0
1799.62/1799.68 c shiftandpropagate: 0.00 0 0
1799.62/1799.68 c simplerounding : 0.00 0 0
1799.62/1799.68 c zirounding : 0.00 0 0
1799.62/1799.68 c rounding : 0.00 0 0
1799.62/1799.68 c shifting : 0.00 0 0
1799.62/1799.68 c intshifting : 0.00 0 0
1799.62/1799.68 c oneopt : 0.00 0 0
1799.62/1799.68 c twoopt : 0.00 0 0
1799.62/1799.68 c fixandinfer : 0.00 0 0
1799.62/1799.68 c feaspump : 0.00 0 0
1799.62/1799.68 c clique : 0.00 0 0
1799.62/1799.68 c coefdiving : 0.00 0 0
1799.62/1799.68 c pscostdiving : 0.00 0 0
1799.62/1799.68 c fracdiving : 0.00 0 0
1799.62/1799.68 c veclendiving : 0.00 0 0
1799.62/1799.68 c intdiving : 0.00 0 0
1799.62/1799.68 c actconsdiving : 0.00 0 0
1799.62/1799.68 c objpscostdiving : 0.00 0 0
1799.62/1799.68 c rootsoldiving : 0.00 0 0
1799.62/1799.68 c linesearchdiving : 0.00 0 0
1799.62/1799.68 c guideddiving : 0.00 0 0
1799.62/1799.68 c octane : 0.00 0 0
1799.62/1799.68 c rens : 0.00 0 0
1799.62/1799.68 c rins : 0.00 0 0
1799.62/1799.68 c localbranching : 0.00 0 0
1799.62/1799.68 c mutation : 0.00 0 0
1799.62/1799.68 c crossover : 0.00 0 0
1799.62/1799.68 c dins : 0.00 0 0
1799.62/1799.68 c vbounds : 0.00 0 0
1799.62/1799.68 c undercover : 0.00 0 0
1799.62/1799.68 c subnlp : 0.00 0 0
1799.62/1799.68 c trysol : 0.00 0 0
1799.62/1799.68 c LP : Time Calls Iterations Iter/call Iter/sec
1799.62/1799.68 c primal LP : 0.00 0 0 0.00 -
1799.62/1799.68 c dual LP : 1260.85 6 159436 26572.67 126.45
1799.62/1799.68 c lex dual LP : 0.00 0 0 0.00 -
1799.62/1799.68 c barrier LP : 0.00 0 0 0.00 -
1799.62/1799.68 c diving/probing LP: 0.00 0 0 0.00 -
1799.62/1799.68 c strong branching : 253.30 43 43000 1000.00 169.76
1799.62/1799.68 c (at root node) : - 43 43000 1000.00 -
1799.62/1799.68 c conflict analysis: 0.00 0 0 0.00 -
1799.62/1799.68 c B&B Tree :
1799.62/1799.68 c number of runs : 1
1799.62/1799.68 c nodes : 1
1799.62/1799.68 c nodes (total) : 1
1799.62/1799.68 c nodes left : 2
1799.62/1799.68 c max depth : 0
1799.62/1799.68 c max depth (total): 0
1799.62/1799.68 c backtracks : 0 (0.0%)
1799.62/1799.68 c delayed cutoffs : 0
1799.62/1799.68 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1799.62/1799.68 c avg switch length: 1.00
1799.62/1799.68 c switching time : 0.00
1799.62/1799.68 c Solution :
1799.62/1799.68 c Solutions found : 0 (0 improvements)
1799.62/1799.68 c Primal Bound : -
1799.62/1799.68 c Dual Bound : +0.00000000000000e+00
1799.62/1799.68 c Gap : infinite
1799.62/1799.68 c Root Dual Bound : +0.00000000000000e+00
1799.62/1799.68 c Root Iterations : 159436