0.19/0.22 c SCIP version 1.1.0.7
0.19/0.22 c LP-Solver SoPlex 1.4.1
0.19/0.22 c user parameter file <scip.set> not found - using default parameters
0.19/0.22 c read problem <HOME/instance-1868634-1245130251.opb>
0.19/0.22 c original problem has 5072 variables (5072 bin, 0 int, 0 impl, 0 cont) and 12829 constraints
0.19/0.29 c No objective function, only one solution is needed.
0.19/0.29 c start presolving problem
0.19/0.29 c presolving:
0.49/0.53 c (round 1) 442 del vars, 272 del conss, 109 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250891 impls, 0 clqs
0.49/0.55 c (round 2) 443 del vars, 989 del conss, 110 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250891 impls, 0 clqs
0.49/0.56 c (round 3) 445 del vars, 992 del conss, 112 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250891 impls, 0 clqs
0.49/0.57 c (round 4) 447 del vars, 997 del conss, 114 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250897 impls, 0 clqs
0.49/0.59 c (round 5) 451 del vars, 1003 del conss, 118 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250897 impls, 0 clqs
0.59/0.60 c (round 6) 458 del vars, 1013 del conss, 122 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250923 impls, 0 clqs
0.59/0.61 c (round 7) 465 del vars, 1030 del conss, 126 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250955 impls, 0 clqs
0.59/0.62 c (round 8) 472 del vars, 1047 del conss, 130 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250973 impls, 0 clqs
0.59/0.64 c (round 9) 479 del vars, 1064 del conss, 134 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251029 impls, 0 clqs
0.59/0.65 c (round 10) 486 del vars, 1081 del conss, 138 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251085 impls, 0 clqs
0.59/0.66 c (round 11) 496 del vars, 1104 del conss, 142 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251179 impls, 0 clqs
0.59/0.67 c (round 12) 503 del vars, 1127 del conss, 146 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251197 impls, 0 clqs
0.59/0.69 c (round 13) 512 del vars, 1146 del conss, 150 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251417 impls, 0 clqs
0.69/0.70 c (round 14) 523 del vars, 1167 del conss, 154 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 251949 impls, 0 clqs
0.69/0.71 c (round 15) 530 del vars, 1196 del conss, 158 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 252007 impls, 0 clqs
0.69/0.72 c (round 16) 538 del vars, 1218 del conss, 162 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 252151 impls, 0 clqs
0.69/0.74 c (round 17) 547 del vars, 1237 del conss, 166 chg bounds, 560 chg sides, 1248 chg coeffs, 0 upgd conss, 252453 impls, 0 clqs
0.69/0.75 c (round 18) 555 del vars, 1268 del conss, 172 chg bounds, 560 chg sides, 1248 chg coeffs, 0 upgd conss, 252457 impls, 0 clqs
0.69/0.76 c (round 19) 564 del vars, 1285 del conss, 178 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252463 impls, 0 clqs
0.69/0.77 c (round 20) 571 del vars, 1303 del conss, 182 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252475 impls, 0 clqs
0.69/0.78 c (round 21) 578 del vars, 1320 del conss, 186 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252499 impls, 0 clqs
0.69/0.80 c (round 22) 586 del vars, 1337 del conss, 190 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252559 impls, 0 clqs
0.79/0.81 c (round 23) 592 del vars, 1355 del conss, 196 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252561 impls, 0 clqs
0.79/0.82 c (round 24) 613 del vars, 1398 del conss, 210 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252867 impls, 0 clqs
0.79/0.85 c (round 25) 714 del vars, 1630 del conss, 276 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 255842 impls, 0 clqs
0.79/0.86 c (round 26) 730 del vars, 1743 del conss, 287 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256435 impls, 0 clqs
0.79/0.87 c (round 27) 737 del vars, 1763 del conss, 291 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256463 impls, 0 clqs
0.79/0.88 c (round 28) 743 del vars, 1783 del conss, 297 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256465 impls, 0 clqs
0.79/0.90 c (round 29) 751 del vars, 1798 del conss, 301 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256543 impls, 0 clqs
0.89/0.91 c (round 30) 759 del vars, 1820 del conss, 307 chg bounds, 564 chg sides, 1252 chg coeffs, 0 upgd conss, 256549 impls, 0 clqs
0.89/0.92 c (round 31) 767 del vars, 1845 del conss, 313 chg bounds, 564 chg sides, 1252 chg coeffs, 0 upgd conss, 256699 impls, 0 clqs
0.89/0.95 c (round 32) 883 del vars, 2087 del conss, 386 chg bounds, 566 chg sides, 1254 chg coeffs, 0 upgd conss, 259737 impls, 0 clqs
0.89/0.96 c (round 33) 890 del vars, 2203 del conss, 392 chg bounds, 566 chg sides, 1254 chg coeffs, 0 upgd conss, 259813 impls, 0 clqs
0.89/0.97 c (round 34) 898 del vars, 2220 del conss, 398 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 259997 impls, 0 clqs
0.89/0.98 c (round 35) 904 del vars, 2237 del conss, 404 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 259999 impls, 0 clqs
0.89/0.99 c (round 36) 920 del vars, 2270 del conss, 415 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260418 impls, 0 clqs
0.99/1.01 c (round 37) 926 del vars, 2293 del conss, 421 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260420 impls, 0 clqs
0.99/1.02 c (round 38) 932 del vars, 2306 del conss, 427 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260422 impls, 0 clqs
0.99/1.03 c (round 39) 938 del vars, 2319 del conss, 433 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260424 impls, 0 clqs
0.99/1.04 c (round 40) 950 del vars, 2336 del conss, 455 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260878 impls, 0 clqs
0.99/1.06 c (round 41) 1000 del vars, 2448 del conss, 461 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262390 impls, 0 clqs
0.99/1.07 c (round 42) 1008 del vars, 2516 del conss, 466 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262448 impls, 0 clqs
0.99/1.08 c (round 43) 1016 del vars, 2534 del conss, 470 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262586 impls, 0 clqs
0.99/1.09 c (round 44) 1028 del vars, 2570 del conss, 479 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262614 impls, 0 clqs
1.10/1.10 c (round 45) 1041 del vars, 2591 del conss, 485 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263198 impls, 0 clqs
1.10/1.12 c (round 46) 1052 del vars, 2622 del conss, 493 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263274 impls, 0 clqs
1.10/1.13 c (round 47) 1060 del vars, 2647 del conss, 501 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263418 impls, 0 clqs
1.10/1.14 c (round 48) 1076 del vars, 2677 del conss, 515 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263648 impls, 0 clqs
1.10/1.15 c (round 49) 1100 del vars, 2729 del conss, 532 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 264039 impls, 0 clqs
1.10/1.17 c (round 50) 1139 del vars, 2818 del conss, 555 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 265445 impls, 0 clqs
1.10/1.18 c (round 51) 1160 del vars, 2899 del conss, 570 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 266173 impls, 0 clqs
1.10/1.20 c (round 52) 1179 del vars, 2957 del conss, 582 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 266808 impls, 0 clqs
1.19/1.22 c (round 53) 1267 del vars, 3164 del conss, 640 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 267996 impls, 0 clqs
1.19/1.23 c (round 54) 1320 del vars, 3373 del conss, 685 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 268515 impls, 0 clqs
1.19/1.25 c (round 55) 1353 del vars, 3465 del conss, 709 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 269383 impls, 0 clqs
1.19/1.26 c (round 56) 1392 del vars, 3571 del conss, 727 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270698 impls, 0 clqs
1.19/1.27 c (round 57) 1410 del vars, 3649 del conss, 731 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270996 impls, 0 clqs
1.19/1.28 c (round 58) 1415 del vars, 3682 del conss, 735 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270998 impls, 0 clqs
1.19/1.29 c (round 59) 1421 del vars, 3695 del conss, 741 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 271076 impls, 0 clqs
1.29/1.31 c (round 60) 1433 del vars, 3719 del conss, 750 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 271325 impls, 0 clqs
1.29/1.32 c (round 61) 1451 del vars, 3762 del conss, 760 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 272489 impls, 0 clqs
1.29/1.33 c (round 62) 1465 del vars, 3805 del conss, 767 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 273032 impls, 0 clqs
1.29/1.34 c (round 63) 1473 del vars, 3837 del conss, 771 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 273128 impls, 0 clqs
1.29/1.39 c (round 64) 1928 del vars, 4866 del conss, 1100 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 281318 impls, 0 clqs
1.39/1.40 c (round 65) 1969 del vars, 5303 del conss, 1118 chg bounds, 569 chg sides, 1259 chg coeffs, 0 upgd conss, 284940 impls, 0 clqs
1.39/1.42 c (round 66) 1997 del vars, 5411 del conss, 1135 chg bounds, 569 chg sides, 1260 chg coeffs, 0 upgd conss, 287724 impls, 0 clqs
1.39/1.43 c (round 67) 2018 del vars, 5476 del conss, 1143 chg bounds, 569 chg sides, 1260 chg coeffs, 0 upgd conss, 288342 impls, 0 clqs
1.39/1.44 c (round 68) 2031 del vars, 5532 del conss, 1151 chg bounds, 572 chg sides, 1263 chg coeffs, 0 upgd conss, 288579 impls, 0 clqs
1.39/1.45 c (round 69) 2034 del vars, 5551 del conss, 1151 chg bounds, 573 chg sides, 1265 chg coeffs, 0 upgd conss, 288607 impls, 0 clqs
1.39/1.46 c (round 70) 2042 del vars, 5576 del conss, 1155 chg bounds, 574 chg sides, 1266 chg coeffs, 0 upgd conss, 288779 impls, 0 clqs
1.39/1.46 c (round 71) 2042 del vars, 5586 del conss, 1155 chg bounds, 574 chg sides, 1266 chg coeffs, 0 upgd conss, 288779 impls, 0 clqs
1.49/1.57 c (round 72) 2042 del vars, 5611 del conss, 1155 chg bounds, 574 chg sides, 1266 chg coeffs, 7199 upgd conss, 288779 impls, 0 clqs
1.59/1.66 c (round 73) 2175 del vars, 5630 del conss, 1155 chg bounds, 574 chg sides, 1266 chg coeffs, 7199 upgd conss, 288779 impls, 0 clqs
1.69/1.71 c presolving (74 rounds):
1.69/1.71 c 2175 deleted vars, 5630 deleted constraints, 1155 tightened bounds, 0 added holes, 574 changed sides, 1266 changed coefficients
1.69/1.71 c 288779 implications, 0 cliques
1.69/1.71 c presolved problem has 2897 variables (2897 bin, 0 int, 0 impl, 0 cont) and 7199 constraints
1.69/1.71 c 1032 constraints of type <knapsack>
1.69/1.71 c 6167 constraints of type <logicor>
1.69/1.71 c transformed objective value is always integral (scale: 1)
1.69/1.71 c Presolving Time: 1.10
1.69/1.71 c SATUNSAT-LIN
1.69/1.71 c -----------------------------------------------------------------------------------------------
1.69/1.71 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 0]
1.69/1.71 c separating/flowcover/freq = c -1
1.69/1.71 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 0]
1.69/1.71 c separating/cmir/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/veclendiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.71 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.69/1.71 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/veclendiving/freq = c -1
1.69/1.71 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.71 c heuristics/simplerounding/freq = c -1
1.69/1.71 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/shifting/freq = c -1
1.69/1.71 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.71 c heuristics/rounding/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.69/1.71 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.69/1.71 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 20]
1.69/1.71 c heuristics/rootsoldiving/freq = c -1
1.69/1.71 c # number of nodes added to the contingent of the total nodes
1.69/1.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.69/1.71 c heuristics/rens/nodesofs = c 2000
1.69/1.71 c # minimum percentage of integer variables that have to be fixable
1.69/1.71 c # [type: real, range: [0,1], default: 0.5]
1.69/1.71 c heuristics/rens/minfixingrate = c 0.3
1.69/1.71 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 0]
1.69/1.71 c heuristics/rens/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.71 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.69/1.71 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/pscostdiving/freq = c -1
1.69/1.71 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 1]
1.69/1.71 c heuristics/oneopt/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to total iteration number
1.69/1.71 c # [type: real, range: [0,1], default: 0.01]
1.69/1.71 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.69/1.71 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 20]
1.69/1.71 c heuristics/objpscostdiving/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.71 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.69/1.71 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/linesearchdiving/freq = c -1
1.69/1.71 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/intshifting/freq = c -1
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.71 c heuristics/intdiving/maxlpiterquot = c 0.075
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/guideddiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.71 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.69/1.71 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/guideddiving/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/fracdiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.71 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.69/1.71 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/fracdiving/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/feaspump/maxlpiterofs = c 2000
1.69/1.71 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 20]
1.69/1.71 c heuristics/feaspump/freq = c -1
1.69/1.71 c # minimum percentage of integer variables that have to be fixed
1.69/1.71 c # [type: real, range: [0,1], default: 0.666]
1.69/1.71 c heuristics/crossover/minfixingrate = c 0.5
1.69/1.71 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.69/1.71 c # [type: real, range: [0,1], default: 0.1]
1.69/1.71 c heuristics/crossover/nodesquot = c 0.15
1.69/1.71 c # number of nodes without incumbent change that heuristic should wait
1.69/1.71 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.69/1.71 c heuristics/crossover/nwaitingnodes = c 100
1.69/1.71 c # number of nodes added to the contingent of the total nodes
1.69/1.71 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.69/1.71 c heuristics/crossover/nodesofs = c 750
1.69/1.71 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 30]
1.69/1.71 c heuristics/crossover/freq = c -1
1.69/1.71 c # additional number of allowed LP iterations
1.69/1.71 c # [type: int, range: [0,2147483647], default: 1000]
1.69/1.71 c heuristics/coefdiving/maxlpiterofs = c 1500
1.69/1.71 c # maximal fraction of diving LP iterations compared to node LP iterations
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.69/1.71 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.69/1.71 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 10]
1.69/1.71 c heuristics/coefdiving/freq = c -1
1.69/1.71 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.71 c presolving/probing/maxrounds = c 0
1.69/1.71 c # should presolving try to simplify knapsacks
1.69/1.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.69/1.71 c constraints/knapsack/simplifyinequalities = c TRUE
1.69/1.71 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.69/1.71 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.69/1.71 c constraints/knapsack/disaggregation = c FALSE
1.69/1.71 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.71 c constraints/knapsack/maxnumcardlift = c 0
1.69/1.71 c # should presolving try to simplify inequalities
1.69/1.71 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.69/1.71 c constraints/linear/simplifyinequalities = c TRUE
1.69/1.71 c # maximal number of separation rounds in the root node (-1: unlimited)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.71 c separating/maxroundsroot = c 5
1.69/1.71 c # maximal number of separation rounds per node (-1: unlimited)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 5]
1.69/1.71 c separating/maxrounds = c 1
1.69/1.71 c # solving stops, if the given number of solutions were found (-1: no limit)
1.69/1.71 c # [type: int, range: [-1,2147483647], default: -1]
1.69/1.71 c limits/solutions = c 1
1.69/1.71 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.69/1.71 c limits/memory = c 1620
1.69/1.71 c # maximal time in seconds to run
1.69/1.71 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.69/1.71 c limits/time = c 1791
1.69/1.71 c # frequency for displaying node information lines
1.69/1.71 c # [type: int, range: [-1,2147483647], default: 100]
1.69/1.71 c display/freq = c 10000
1.69/1.71 c -----------------------------------------------------------------------------------------------
1.69/1.71 c start solving problem
1.69/1.71 c
2.19/2.25 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.19/2.25 c 1.7s| 1 | 0 | 1271 | 26M| 0 | 802 |2897 |7199 |7199 |2897 |7199 | 0 | 0 | 0 | 5.782867e+02 | -- | Inf
3.19/3.28 c 2.7s| 1 | 0 | 1695 | 26M| 0 | 739 |2897 |7199 |7199 |2897 |7257 | 58 | 0 | 0 | 6.224282e+02 | -- | Inf
4.49/4.52 c 3.9s| 1 | 0 | 2246 | 26M| 0 | 759 |2897 |7199 |7199 |2897 |7320 | 121 | 0 | 0 | 6.523128e+02 | -- | Inf
5.68/5.72 c 5.1s| 1 | 0 | 2679 | 26M| 0 | 873 |2897 |7199 |7199 |2897 |7461 | 262 | 0 | 0 | 6.599467e+02 | -- | Inf
7.29/7.33 c 6.7s| 1 | 0 | 3463 | 27M| 0 | 997 |2897 |7199 |7199 |2897 |7580 | 381 | 0 | 0 | 6.669028e+02 | -- | Inf
9.69/9.77 c 9.1s| 1 | 0 | 4204 | 27M| 0 | 931 |2897 |7199 |7199 |2897 |7671 | 472 | 0 | 0 | 6.708560e+02 | -- | Inf
29.08/29.15 c 28.4s| 1 | 2 | 4204 | 27M| 0 | 931 |2897 |7199 |7199 |2897 |7671 | 472 | 0 | 26 | 6.708560e+02 | -- | Inf
1102.45/1102.80 c
1102.45/1102.80 c SCIP Status : problem is solved [infeasible]
1102.45/1102.80 c Solving Time (sec) : 1098.40
1102.45/1102.80 c Solving Nodes : 6536
1102.45/1102.80 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1102.45/1102.80 c Dual Bound : +1.00000000000000e+20
1102.45/1102.80 c Gap : 0.00 %
1102.45/1102.80 c NODE 6536
1102.45/1102.80 c DUAL BOUND 1e+20
1102.45/1102.80 c PRIMAL BOUND 1e+20
1102.45/1102.80 c GAP 0
1102.45/1102.80 s UNSATISFIABLE
1102.45/1102.80 c SCIP Status : problem is solved [infeasible]
1102.45/1102.80 c Solving Time : 1098.40
1102.45/1102.80 c Original Problem :
1102.45/1102.80 c Problem name : HOME/instance-1868634-1245130251.opb
1102.45/1102.80 c Variables : 5072 (5072 binary, 0 integer, 0 implicit integer, 0 continuous)
1102.45/1102.80 c Constraints : 12829 initial, 12829 maximal
1102.45/1102.80 c Presolved Problem :
1102.45/1102.80 c Problem name : t_HOME/instance-1868634-1245130251.opb
1102.45/1102.80 c Variables : 2897 (2897 binary, 0 integer, 0 implicit integer, 0 continuous)
1102.45/1102.80 c Constraints : 7199 initial, 7580 maximal
1102.45/1102.80 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1102.45/1102.80 c trivial : 0.10 28 0 0 0 0 0 0 0
1102.45/1102.80 c dualfix : 0.02 2 0 0 0 0 0 0 0
1102.45/1102.80 c boundshift : 0.00 0 0 0 0 0 0 0 0
1102.45/1102.80 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1102.45/1102.80 c implics : 0.15 0 870 0 0 0 0 0 0
1102.45/1102.80 c probing : 0.00 0 0 0 0 0 0 0 0
1102.45/1102.80 c knapsack : 0.09 0 0 0 0 0 0 0 0
1102.45/1102.80 c linear : 0.63 1129 146 0 1155 0 5630 574 1266
1102.45/1102.80 c logicor : 0.05 0 0 0 0 0 0 0 0
1102.45/1102.80 c root node : - 89 - - 89 - - - -
1102.45/1102.80 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1102.45/1102.80 c integral : 0 0 0 6204 0 320 324 0 0 11550
1102.45/1102.80 c knapsack : 1032 5 31611 0 0 49 23406 970 0 0
1102.45/1102.80 c logicor : 6167+ 5 26501 0 0 19 86614 0 0 0
1102.45/1102.80 c countsols : 0 0 0 0 0 0 0 0 0 0
1102.45/1102.80 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1102.45/1102.80 c integral : 519.19 0.00 0.00 519.19 0.00
1102.45/1102.80 c knapsack : 2.71 0.04 2.67 0.00 0.00
1102.45/1102.80 c logicor : 0.90 0.00 0.90 0.00 0.00
1102.45/1102.80 c countsols : 0.00 0.00 0.00 0.00 0.00
1102.45/1102.80 c Propagators : Time Calls Cutoffs DomReds
1102.45/1102.80 c rootredcost : 0.02 0 0 0
1102.45/1102.80 c pseudoobj : 5.43 31680 0 0
1102.45/1102.80 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1102.45/1102.80 c propagation : 0.00 68 67 184 11.2 6 5.8 -
1102.45/1102.80 c infeasible LP : 0.70 380 380 415 4.5 2 2.5 0
1102.45/1102.80 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1102.45/1102.80 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1102.45/1102.80 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1102.45/1102.80 c applied globally : - - - 527 5.3 - - -
1102.45/1102.80 c applied locally : - - - 0 0.0 - - -
1102.45/1102.80 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1102.45/1102.80 c cut pool : 0.00 4 - - 252 - (maximal pool size: 1097)
1102.45/1102.80 c redcost : 1.65 6099 0 0 0 0
1102.45/1102.80 c impliedbounds : 0.00 5 0 0 0 0
1102.45/1102.80 c intobj : 0.00 0 0 0 0 0
1102.45/1102.80 c gomory : 1.84 5 0 0 2177 0
1102.45/1102.80 c strongcg : 1.99 5 0 0 1464 0
1102.45/1102.80 c cmir : 0.00 0 0 0 0 0
1102.45/1102.80 c flowcover : 0.00 0 0 0 0 0
1102.45/1102.80 c clique : 0.08 5 0 0 23 0
1102.45/1102.80 c zerohalf : 0.00 0 0 0 0 0
1102.45/1102.80 c mcf : 0.05 1 0 0 0 0
1102.45/1102.80 c Pricers : Time Calls Vars
1102.45/1102.80 c problem variables: 0.00 0 0
1102.45/1102.80 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1102.45/1102.80 c relpscost : 519.18 6204 320 324 0 0 11550
1102.45/1102.80 c pscost : 0.00 0 0 0 0 0 0
1102.45/1102.80 c inference : 0.00 0 0 0 0 0 0
1102.45/1102.80 c mostinf : 0.00 0 0 0 0 0 0
1102.45/1102.80 c leastinf : 0.00 0 0 0 0 0 0
1102.45/1102.80 c fullstrong : 0.00 0 0 0 0 0 0
1102.45/1102.80 c allfullstrong : 0.00 0 0 0 0 0 0
1102.45/1102.80 c random : 0.00 0 0 0 0 0 0
1102.45/1102.80 c Primal Heuristics : Time Calls Found
1102.45/1102.80 c LP solutions : 0.00 - 0
1102.45/1102.80 c pseudo solutions : 0.00 - 0
1102.45/1102.80 c simplerounding : 0.00 0 0
1102.45/1102.80 c rounding : 0.00 0 0
1102.45/1102.80 c shifting : 0.00 0 0
1102.45/1102.80 c intshifting : 0.00 0 0
1102.45/1102.80 c oneopt : 0.00 0 0
1102.45/1102.80 c fixandinfer : 0.00 0 0
1102.45/1102.80 c feaspump : 0.00 0 0
1102.45/1102.80 c coefdiving : 0.00 0 0
1102.45/1102.80 c pscostdiving : 0.00 0 0
1102.45/1102.80 c fracdiving : 0.00 0 0
1102.45/1102.80 c veclendiving : 0.00 0 0
1102.45/1102.80 c intdiving : 0.00 0 0
1102.45/1102.80 c actconsdiving : 0.00 0 0
1102.45/1102.80 c objpscostdiving : 0.00 0 0
1102.45/1102.80 c rootsoldiving : 0.00 0 0
1102.45/1102.80 c linesearchdiving : 0.00 0 0
1102.45/1102.80 c guideddiving : 0.00 0 0
1102.45/1102.80 c octane : 0.00 0 0
1102.45/1102.80 c rens : 0.00 0 0
1102.45/1102.80 c rins : 0.00 0 0
1102.45/1102.80 c localbranching : 0.00 0 0
1102.45/1102.80 c mutation : 0.00 0 0
1102.45/1102.80 c crossover : 0.00 0 0
1102.45/1102.80 c dins : 0.00 0 0
1102.45/1102.80 c LP : Time Calls Iterations Iter/call Iter/sec
1102.45/1102.80 c primal LP : 0.01 0 0 0.00 0.00
1102.45/1102.80 c dual LP : 532.60 6519 534934 82.06 1004.38
1102.45/1102.80 c barrier LP : 0.00 0 0 0.00 -
1102.45/1102.80 c diving/probing LP: 0.00 0 0 0.00 -
1102.45/1102.80 c strong branching : 517.20 2822 380393 134.80 735.49
1102.45/1102.80 c (at root node) : - 26 13268 510.31 -
1102.45/1102.80 c conflict analysis: 0.00 0 0 0.00 -
1102.45/1102.80 c B&B Tree :
1102.45/1102.80 c number of runs : 1
1102.45/1102.80 c nodes : 6536
1102.45/1102.80 c nodes (total) : 6536
1102.45/1102.80 c nodes left : 0
1102.45/1102.80 c max depth : 109
1102.45/1102.80 c max depth (total): 109
1102.45/1102.80 c backtracks : 517 (7.9%)
1102.45/1102.80 c delayed cutoffs : 5015
1102.45/1102.80 c repropagations : 5128 (1949 domain reductions, 7 cutoffs)
1102.45/1102.80 c avg switch length: 5.19
1102.45/1102.80 c switching time : 2.68
1102.45/1102.80 c Solution :
1102.45/1102.80 c Solutions found : 0 (0 improvements)
1102.45/1102.80 c Primal Bound : infeasible
1102.45/1102.80 c Dual Bound : -
1102.45/1102.80 c Gap : 0.00 %
1102.45/1102.80 c Root Dual Bound : +6.70855992493826e+02
1102.45/1102.89 c Time complete: 1102.55.