4.88/4.92 c SCIP version 1.1.0.7
4.88/4.92 c LP-Solver SoPlex 1.4.1
4.88/4.92 c user parameter file <scip.set> not found - using default parameters
4.88/4.92 c read problem <HOME/instance-1868644-1245130554.opb>
4.88/4.92 c original problem has 109757 variables (109757 bin, 0 int, 0 impl, 0 cont) and 313451 constraints
6.28/6.35 c No objective function, only one solution is needed.
6.28/6.35 c start presolving problem
6.28/6.35 c presolving:
12.37/12.41 c (round 1) 4622 del vars, 6397 del conss, 2234 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6521941 impls, 0 clqs
12.78/12.85 c (round 2) 4623 del vars, 11996 del conss, 2235 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6521941 impls, 0 clqs
13.48/13.55 c (round 3) 4635 del vars, 12031 del conss, 2248 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6522414 impls, 0 clqs
13.77/13.85 c (round 4) 4700 del vars, 12087 del conss, 2258 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6523891 impls, 0 clqs
14.07/14.15 c (round 5) 4724 del vars, 12238 del conss, 2271 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6524470 impls, 0 clqs
14.38/14.45 c (round 6) 4764 del vars, 12320 del conss, 2285 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6525716 impls, 0 clqs
14.67/14.76 c (round 7) 4824 del vars, 12452 del conss, 2300 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6525988 impls, 0 clqs
14.98/15.06 c (round 8) 4909 del vars, 12647 del conss, 2316 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6527300 impls, 0 clqs
15.28/15.36 c (round 9) 4960 del vars, 12863 del conss, 2331 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6527848 impls, 0 clqs
15.58/15.66 c (round 10) 4990 del vars, 12990 del conss, 2344 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6528393 impls, 0 clqs
15.87/15.96 c (round 11) 5015 del vars, 13078 del conss, 2356 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6528901 impls, 0 clqs
16.17/16.25 c (round 12) 5067 del vars, 13170 del conss, 2364 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6530027 impls, 0 clqs
16.48/16.54 c (round 13) 5094 del vars, 13299 del conss, 2370 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6531219 impls, 0 clqs
16.77/16.84 c (round 14) 5104 del vars, 13361 del conss, 2377 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6531409 impls, 0 clqs
17.07/17.13 c (round 15) 5127 del vars, 13400 del conss, 2386 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6531807 impls, 0 clqs
17.38/17.42 c (round 16) 5175 del vars, 13496 del conss, 2401 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6532291 impls, 0 clqs
17.67/17.73 c (round 17) 5253 del vars, 13669 del conss, 2415 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6534887 impls, 0 clqs
17.97/18.02 c (round 18) 5271 del vars, 13834 del conss, 2423 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6535137 impls, 0 clqs
18.27/18.31 c (round 19) 5300 del vars, 13893 del conss, 2432 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6535941 impls, 0 clqs
18.58/18.61 c (round 20) 5348 del vars, 14000 del conss, 2443 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6536132 impls, 0 clqs
18.87/18.90 c (round 21) 5386 del vars, 14129 del conss, 2451 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6537024 impls, 0 clqs
19.08/19.19 c (round 22) 5398 del vars, 14211 del conss, 2461 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6537504 impls, 0 clqs
19.37/19.48 c (round 23) 5437 del vars, 14270 del conss, 2474 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6538171 impls, 0 clqs
19.67/19.77 c (round 24) 5464 del vars, 14373 del conss, 2487 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6538547 impls, 0 clqs
19.97/20.07 c (round 25) 5497 del vars, 14456 del conss, 2502 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6538969 impls, 0 clqs
20.27/20.36 c (round 26) 5520 del vars, 14537 del conss, 2513 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539237 impls, 0 clqs
20.57/20.64 c (round 27) 5543 del vars, 14609 del conss, 2526 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539519 impls, 0 clqs
20.88/20.93 c (round 28) 5555 del vars, 14657 del conss, 2532 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539577 impls, 0 clqs
21.17/21.21 c (round 29) 5568 del vars, 14700 del conss, 2539 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6539805 impls, 0 clqs
21.77/21.89 c (round 30) 5581 del vars, 14771 del conss, 2552 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6540041 impls, 0 clqs
22.07/22.18 c (round 31) 5647 del vars, 14817 del conss, 2559 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6540911 impls, 0 clqs
22.37/22.47 c (round 32) 5659 del vars, 14957 del conss, 2569 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6541197 impls, 0 clqs
22.67/22.76 c (round 33) 5679 del vars, 14998 del conss, 2579 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6541335 impls, 0 clqs
22.98/23.05 c (round 34) 5707 del vars, 15062 del conss, 2592 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6541521 impls, 0 clqs
23.27/23.34 c (round 35) 5751 del vars, 15162 del conss, 2609 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6542746 impls, 0 clqs
23.57/23.63 c (round 36) 5790 del vars, 15284 del conss, 2624 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6543446 impls, 0 clqs
23.87/23.92 c (round 37) 5815 del vars, 15383 del conss, 2639 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6543732 impls, 0 clqs
24.17/24.21 c (round 38) 5829 del vars, 15436 del conss, 2647 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6543808 impls, 0 clqs
24.37/24.50 c (round 39) 5842 del vars, 15483 del conss, 2654 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6544056 impls, 0 clqs
25.08/25.18 c (round 40) 5855 del vars, 15554 del conss, 2667 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6544290 impls, 0 clqs
25.37/25.47 c (round 41) 5921 del vars, 15600 del conss, 2674 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6545160 impls, 0 clqs
25.67/25.76 c (round 42) 5933 del vars, 15740 del conss, 2684 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6545624 impls, 0 clqs
25.97/26.06 c (round 43) 5954 del vars, 15781 del conss, 2694 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6546968 impls, 0 clqs
26.27/26.35 c (round 44) 6012 del vars, 15872 del conss, 2710 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6550112 impls, 0 clqs
26.57/26.65 c (round 45) 6049 del vars, 16034 del conss, 2727 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6550890 impls, 0 clqs
26.86/26.94 c (round 46) 6092 del vars, 16167 del conss, 2753 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6551734 impls, 0 clqs
27.17/27.23 c (round 47) 6111 del vars, 16241 del conss, 2762 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6553232 impls, 0 clqs
27.67/27.72 c (round 48) 6114 del vars, 16272 del conss, 2765 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6553238 impls, 0 clqs
27.97/28.02 c (round 49) 6148 del vars, 16309 del conss, 2769 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6553300 impls, 0 clqs
28.27/28.31 c (round 50) 6182 del vars, 16410 del conss, 2774 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6554108 impls, 0 clqs
28.47/28.60 c (round 51) 6192 del vars, 16485 del conss, 2782 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6554570 impls, 0 clqs
28.76/28.89 c (round 52) 6213 del vars, 16522 del conss, 2792 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6555288 impls, 0 clqs
29.07/29.19 c (round 53) 6259 del vars, 16605 del conss, 2805 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6557746 impls, 0 clqs
29.36/29.48 c (round 54) 6302 del vars, 16746 del conss, 2824 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558346 impls, 0 clqs
29.67/29.77 c (round 55) 6320 del vars, 16837 del conss, 2834 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558542 impls, 0 clqs
29.97/30.06 c (round 56) 6340 del vars, 16889 del conss, 2844 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6558750 impls, 0 clqs
30.26/30.35 c (round 57) 6354 del vars, 16939 del conss, 2852 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6559068 impls, 0 clqs
30.56/30.64 c (round 58) 6361 del vars, 16979 del conss, 2859 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6559120 impls, 0 clqs
31.07/31.12 c (round 59) 6371 del vars, 17031 del conss, 2869 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6559282 impls, 0 clqs
31.37/31.41 c (round 60) 6437 del vars, 17077 del conss, 2876 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560220 impls, 0 clqs
31.67/31.70 c (round 61) 6449 del vars, 17217 del conss, 2886 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560506 impls, 0 clqs
31.87/31.99 c (round 62) 6471 del vars, 17259 del conss, 2898 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560648 impls, 0 clqs
32.16/32.29 c (round 63) 6499 del vars, 17327 del conss, 2911 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6560802 impls, 0 clqs
32.47/32.58 c (round 64) 6543 del vars, 17427 del conss, 2927 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6563004 impls, 0 clqs
32.77/32.87 c (round 65) 6580 del vars, 17546 del conss, 2942 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6563620 impls, 0 clqs
33.06/33.16 c (round 66) 6605 del vars, 17643 del conss, 2957 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6563978 impls, 0 clqs
33.36/33.45 c (round 67) 6618 del vars, 17696 del conss, 2965 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6564078 impls, 0 clqs
33.67/33.74 c (round 68) 6633 del vars, 17755 del conss, 2980 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6564098 impls, 0 clqs
34.77/34.82 c (round 69) 6643 del vars, 17786 del conss, 2990 chg bounds, 8761 chg sides, 18368 chg coeffs, 0 upgd conss, 6564318 impls, 0 clqs
37.36/37.47 c (round 70) 6643 del vars, 17850 del conss, 2990 chg bounds, 8761 chg sides, 18368 chg coeffs, 295599 upgd conss, 6564346 impls, 0 clqs
90.84/90.92 c presolving (71 rounds):
90.84/90.92 c 6643 deleted vars, 17850 deleted constraints, 2990 tightened bounds, 0 added holes, 8761 changed sides, 18368 changed coefficients
90.84/90.92 c 6564346 implications, 0 cliques
90.84/90.92 c presolved problem has 103114 variables (103114 bin, 0 int, 0 impl, 0 cont) and 295601 constraints
90.84/90.92 c 17522 constraints of type <knapsack>
90.84/90.92 c 278079 constraints of type <logicor>
90.84/90.92 c transformed objective value is always integral (scale: 1)
90.84/90.92 c Presolving Time: 74.36
90.84/90.92 c SATUNSAT-LIN
90.84/90.92 c -----------------------------------------------------------------------------------------------
90.84/90.92 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 0]
90.84/90.92 c separating/flowcover/freq = c -1
90.84/90.92 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 0]
90.84/90.92 c separating/cmir/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/veclendiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
90.84/90.92 c heuristics/veclendiving/maxlpiterquot = c 0.075
90.84/90.92 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/veclendiving/freq = c -1
90.84/90.92 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 1]
90.84/90.92 c heuristics/simplerounding/freq = c -1
90.84/90.92 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/shifting/freq = c -1
90.84/90.92 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 1]
90.84/90.92 c heuristics/rounding/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/rootsoldiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
90.84/90.92 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
90.84/90.92 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 20]
90.84/90.92 c heuristics/rootsoldiving/freq = c -1
90.84/90.92 c # number of nodes added to the contingent of the total nodes
90.84/90.92 c # [type: longint, range: [0,9223372036854775807], default: 500]
90.84/90.92 c heuristics/rens/nodesofs = c 2000
90.84/90.92 c # minimum percentage of integer variables that have to be fixable
90.84/90.92 c # [type: real, range: [0,1], default: 0.5]
90.84/90.92 c heuristics/rens/minfixingrate = c 0.3
90.84/90.92 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 0]
90.84/90.92 c heuristics/rens/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/pscostdiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
90.84/90.92 c heuristics/pscostdiving/maxlpiterquot = c 0.075
90.84/90.92 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/pscostdiving/freq = c -1
90.84/90.92 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 1]
90.84/90.92 c heuristics/oneopt/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/objpscostdiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to total iteration number
90.84/90.92 c # [type: real, range: [0,1], default: 0.01]
90.84/90.92 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
90.84/90.92 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 20]
90.84/90.92 c heuristics/objpscostdiving/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/linesearchdiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
90.84/90.92 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
90.84/90.92 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/linesearchdiving/freq = c -1
90.84/90.92 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/intshifting/freq = c -1
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
90.84/90.92 c heuristics/intdiving/maxlpiterquot = c 0.075
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/guideddiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
90.84/90.92 c heuristics/guideddiving/maxlpiterquot = c 0.075
90.84/90.92 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/guideddiving/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/fracdiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
90.84/90.92 c heuristics/fracdiving/maxlpiterquot = c 0.075
90.84/90.92 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/fracdiving/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/feaspump/maxlpiterofs = c 2000
90.84/90.92 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 20]
90.84/90.92 c heuristics/feaspump/freq = c -1
90.84/90.92 c # minimum percentage of integer variables that have to be fixed
90.84/90.92 c # [type: real, range: [0,1], default: 0.666]
90.84/90.92 c heuristics/crossover/minfixingrate = c 0.5
90.84/90.92 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
90.84/90.92 c # [type: real, range: [0,1], default: 0.1]
90.84/90.92 c heuristics/crossover/nodesquot = c 0.15
90.84/90.92 c # number of nodes without incumbent change that heuristic should wait
90.84/90.92 c # [type: longint, range: [0,9223372036854775807], default: 200]
90.84/90.92 c heuristics/crossover/nwaitingnodes = c 100
90.84/90.92 c # number of nodes added to the contingent of the total nodes
90.84/90.92 c # [type: longint, range: [0,9223372036854775807], default: 500]
90.84/90.92 c heuristics/crossover/nodesofs = c 750
90.84/90.92 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 30]
90.84/90.92 c heuristics/crossover/freq = c -1
90.84/90.92 c # additional number of allowed LP iterations
90.84/90.92 c # [type: int, range: [0,2147483647], default: 1000]
90.84/90.92 c heuristics/coefdiving/maxlpiterofs = c 1500
90.84/90.92 c # maximal fraction of diving LP iterations compared to node LP iterations
90.84/90.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
90.84/90.92 c heuristics/coefdiving/maxlpiterquot = c 0.075
90.84/90.92 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: 10]
90.84/90.92 c heuristics/coefdiving/freq = c -1
90.84/90.92 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: -1]
90.84/90.92 c presolving/probing/maxrounds = c 0
90.84/90.92 c # should presolving try to simplify knapsacks
90.84/90.92 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
90.84/90.92 c constraints/knapsack/simplifyinequalities = c TRUE
90.84/90.92 c # should disaggregation of knapsack constraints be allowed in preprocessing?
90.84/90.92 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
90.84/90.92 c constraints/knapsack/disaggregation = c FALSE
90.84/90.92 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
90.84/90.92 c # [type: int, range: [-1,2147483647], default: -1]
90.84/90.92 c constraints/knapsack/maxnumcardlift = c 0
90.84/90.92 c # should presolving try to simplify inequalities
90.94/91.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
90.94/91.02 c constraints/linear/simplifyinequalities = c TRUE
90.94/91.02 c # maximal number of separation rounds in the root node (-1: unlimited)
90.94/91.02 c # [type: int, range: [-1,2147483647], default: -1]
90.94/91.02 c separating/maxroundsroot = c 5
90.94/91.02 c # maximal number of separation rounds per node (-1: unlimited)
90.94/91.02 c # [type: int, range: [-1,2147483647], default: 5]
90.94/91.02 c separating/maxrounds = c 1
90.94/91.02 c # solving stops, if the given number of solutions were found (-1: no limit)
90.94/91.02 c # [type: int, range: [-1,2147483647], default: -1]
90.94/91.02 c limits/solutions = c 1
90.94/91.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
90.94/91.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
90.94/91.02 c limits/memory = c 1620
90.94/91.02 c # maximal time in seconds to run
90.94/91.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
90.94/91.02 c limits/time = c 1791
90.94/91.02 c # frequency for displaying node information lines
90.94/91.02 c # [type: int, range: [-1,2147483647], default: 100]
90.94/91.02 c display/freq = c 10000
90.94/91.02 c -----------------------------------------------------------------------------------------------
90.94/91.02 c start solving problem
90.94/91.02 c
263.39/263.60 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
263.39/263.60 c 247s| 1 | 0 | 15795 | 790M| 0 | 11k| 103k| 295k| 295k| 103k| 295k| 0 | 0 | 0 | 4.155432e+03 | -- | Inf
481.02/481.27 c 463s| 1 | 0 | 18057 | 791M| 0 | 11k| 103k| 295k| 295k| 103k| 295k| 305 | 0 | 0 | 4.272324e+03 | -- | Inf
682.86/683.16 c 665s| 1 | 0 | 20304 | 791M| 0 | 10k| 103k| 295k| 295k| 103k| 296k| 497 | 0 | 0 | 4.316508e+03 | -- | Inf
900.68/901.07 c 883s| 1 | 0 | 23287 | 792M| 0 | 11k| 103k| 295k| 295k| 103k| 296k| 678 | 0 | 0 | 4.348495e+03 | -- | Inf
1112.82/1113.25 c 1095s| 1 | 0 | 25811 | 793M| 0 | 11k| 103k| 295k| 295k| 103k| 296k| 880 | 0 | 0 | 4.380231e+03 | -- | Inf
1321.54/1322.05 c 1303s| 1 | 0 | 28319 | 793M| 0 | 10k| 103k| 295k| 295k| 103k| 296k|1089 | 0 | 0 | 4.412203e+03 | -- | Inf
1800.68/1801.37 c 1782s| 1 | 2 | 28319 | 793M| 0 | 10k| 103k| 295k| 295k| 103k| 296k|1089 | 0 | 15 | 4.412203e+03 | -- | Inf
1800.68/1801.37 c
1800.68/1801.37 c SCIP Status : solving was interrupted [user interrupt]
1800.68/1801.37 c Solving Time (sec) : 1782.44
1800.68/1801.37 c Solving Nodes : 1
1800.68/1801.37 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1800.68/1801.37 c Dual Bound : +4.41220255092250e+03
1800.68/1801.37 c Gap : infinite
1800.68/1801.37 c NODE 1
1800.68/1801.37 c DUAL BOUND 4412.2
1800.68/1801.37 c PRIMAL BOUND 1e+20
1800.68/1801.37 c GAP 1e+20
1800.68/1801.37 s UNKNOWN
1800.68/1801.37 c SCIP Status : solving was interrupted [user interrupt]
1800.68/1801.37 c Solving Time : 1782.44
1800.68/1801.37 c Original Problem :
1800.68/1801.37 c Problem name : HOME/instance-1868644-1245130554.opb
1800.68/1801.37 c Variables : 109757 (109757 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.68/1801.37 c Constraints : 313451 initial, 313451 maximal
1800.68/1801.37 c Presolved Problem :
1800.68/1801.37 c Problem name : t_HOME/instance-1868644-1245130554.opb
1800.68/1801.37 c Variables : 103114 (103114 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.68/1801.37 c Constraints : 295601 initial, 295601 maximal
1800.68/1801.37 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1800.68/1801.37 c trivial : 1.50 11 0 0 0 0 0 0 0
1800.68/1801.37 c dualfix : 1.25 0 0 0 0 0 0 0 0
1800.68/1801.37 c boundshift : 0.00 0 0 0 0 0 0 0 0
1800.68/1801.37 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1800.68/1801.37 c implics : 3.98 0 3638 0 0 0 0 0 0
1800.68/1801.37 c probing : 0.00 0 0 0 0 0 0 0 0
1800.68/1801.37 c knapsack : 52.64 0 0 0 0 0 0 0 0
1800.68/1801.37 c linear : 13.53 2979 15 0 2990 0 17850 8761 18368
1800.68/1801.37 c logicor : 0.55 0 0 0 0 0 0 0 0
1800.68/1801.37 c root node : - 0 - - 0 - - - -
1800.68/1801.37 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1800.68/1801.37 c integral : 0 0 0 1 0 0 0 0 0 2
1800.68/1801.37 c knapsack : 17522 5 1 0 0 0 0 1000 0 0
1800.68/1801.37 c logicor : 278079 5 1 0 0 0 0 0 0 0
1800.68/1801.37 c countsols : 0 0 0 0 0 0 0 0 0 0
1800.68/1801.37 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1800.68/1801.37 c integral : 478.98 0.00 0.00 478.98 0.00
1800.68/1801.37 c knapsack : 0.03 0.03 0.00 0.00 0.00
1800.68/1801.37 c logicor : 0.40 0.16 0.24 0.00 0.00
1800.68/1801.37 c countsols : 0.00 0.00 0.00 0.00 0.00
1800.68/1801.37 c Propagators : Time Calls Cutoffs DomReds
1800.68/1801.37 c rootredcost : 0.00 0 0 0
1800.68/1801.37 c pseudoobj : 0.11 7 0 0
1800.68/1801.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1800.68/1801.37 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1800.68/1801.37 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1800.68/1801.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1800.68/1801.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1800.68/1801.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1800.68/1801.37 c applied globally : - - - 0 0.0 - - -
1800.68/1801.37 c applied locally : - - - 0 0.0 - - -
1800.68/1801.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1800.68/1801.37 c cut pool : 0.01 4 - - 586 - (maximal pool size: 3007)
1800.68/1801.37 c redcost : 0.11 5 0 0 0 0
1800.68/1801.37 c impliedbounds : 0.31 5 0 0 0 0
1800.68/1801.37 c intobj : 0.00 0 0 0 0 0
1800.68/1801.37 c gomory : 350.44 5 0 0 2500 0
1800.68/1801.37 c strongcg : 349.61 5 0 0 2500 0
1800.68/1801.37 c cmir : 0.00 0 0 0 0 0
1800.68/1801.37 c flowcover : 0.00 0 0 0 0 0
1800.68/1801.37 c clique : 13.12 5 0 0 32 0
1800.68/1801.37 c zerohalf : 0.00 0 0 0 0 0
1800.68/1801.37 c mcf : 17.54 1 0 0 0 0
1800.68/1801.37 c Pricers : Time Calls Vars
1800.68/1801.37 c problem variables: 0.00 0 0
1800.68/1801.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1800.68/1801.37 c relpscost : 478.98 1 0 0 0 0 2
1800.68/1801.37 c pscost : 0.00 0 0 0 0 0 0
1800.68/1801.37 c inference : 0.00 0 0 0 0 0 0
1800.68/1801.37 c mostinf : 0.00 0 0 0 0 0 0
1800.68/1801.37 c leastinf : 0.00 0 0 0 0 0 0
1800.68/1801.37 c fullstrong : 0.00 0 0 0 0 0 0
1800.68/1801.37 c allfullstrong : 0.00 0 0 0 0 0 0
1800.68/1801.37 c random : 0.00 0 0 0 0 0 0
1800.68/1801.37 c Primal Heuristics : Time Calls Found
1800.68/1801.37 c LP solutions : 0.00 - 0
1800.68/1801.37 c pseudo solutions : 0.00 - 0
1800.68/1801.37 c simplerounding : 0.00 0 0
1800.68/1801.37 c rounding : 0.00 0 0
1800.68/1801.37 c shifting : 0.00 0 0
1800.68/1801.37 c intshifting : 0.00 0 0
1800.68/1801.37 c oneopt : 0.00 0 0
1800.68/1801.37 c fixandinfer : 0.00 0 0
1800.68/1801.37 c feaspump : 0.00 0 0
1800.68/1801.37 c coefdiving : 0.00 0 0
1800.68/1801.37 c pscostdiving : 0.00 0 0
1800.68/1801.37 c fracdiving : 0.00 0 0
1800.68/1801.37 c veclendiving : 0.00 0 0
1800.68/1801.37 c intdiving : 0.00 0 0
1800.68/1801.37 c actconsdiving : 0.00 0 0
1800.68/1801.37 c objpscostdiving : 0.00 0 0
1800.68/1801.37 c rootsoldiving : 0.00 0 0
1800.68/1801.37 c linesearchdiving : 0.00 0 0
1800.68/1801.37 c guideddiving : 0.00 0 0
1800.68/1801.37 c octane : 0.00 0 0
1800.68/1801.37 c rens : 0.00 0 0
1800.68/1801.37 c rins : 0.00 0 0
1800.68/1801.37 c localbranching : 0.00 0 0
1800.68/1801.37 c mutation : 0.00 0 0
1800.68/1801.37 c crossover : 0.00 0 0
1800.68/1801.37 c dins : 0.00 0 0
1800.68/1801.37 c LP : Time Calls Iterations Iter/call Iter/sec
1800.68/1801.37 c primal LP : 0.00 0 0 0.00 -
1800.68/1801.37 c dual LP : 494.02 6 28319 4719.83 57.32
1800.68/1801.37 c barrier LP : 0.00 0 0 0.00 -
1800.68/1801.37 c diving/probing LP: 0.00 0 0 0.00 -
1800.68/1801.37 c strong branching : 478.97 15 14823 988.20 30.95
1800.68/1801.37 c (at root node) : - 15 14823 988.20 -
1800.68/1801.37 c conflict analysis: 0.00 0 0 0.00 -
1800.68/1801.37 c B&B Tree :
1800.68/1801.37 c number of runs : 1
1800.68/1801.37 c nodes : 1
1800.68/1801.37 c nodes (total) : 1
1800.68/1801.37 c nodes left : 2
1800.68/1801.37 c max depth : 0
1800.68/1801.37 c max depth (total): 0
1800.68/1801.37 c backtracks : 0 (0.0%)
1800.68/1801.37 c delayed cutoffs : 0
1800.68/1801.37 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1800.68/1801.37 c avg switch length: 1.00
1800.68/1801.37 c switching time : 0.00
1800.68/1801.37 c Solution :
1800.68/1801.37 c Solutions found : 0 (0 improvements)
1800.68/1801.37 c Primal Bound : -
1800.68/1801.37 c Dual Bound : +4.41220255092250e+03
1800.68/1801.37 c Gap : infinite
1800.68/1801.37 c Root Dual Bound : +4.41220255092250e+03