0.19/0.26 c SCIP version 1.1.0.7
0.19/0.26 c LP-Solver Clp 1.8.2
0.19/0.26 c user parameter file <scip.set> not found - using default parameters
0.19/0.26 c read problem <HOME/instance-1868621-1245129644.opb>
0.19/0.26 c original problem has 5985 variables (5985 bin, 0 int, 0 impl, 0 cont) and 15365 constraints
0.29/0.34 c No objective function, only one solution is needed.
0.29/0.34 c start presolving problem
0.29/0.34 c presolving:
0.59/0.62 c (round 1) 477 del vars, 305 del conss, 117 chg bounds, 686 chg sides, 1488 chg coeffs, 0 upgd conss, 290791 impls, 0 clqs
0.59/0.64 c (round 2) 478 del vars, 1079 del conss, 118 chg bounds, 686 chg sides, 1488 chg coeffs, 0 upgd conss, 290791 impls, 0 clqs
0.59/0.66 c (round 3) 480 del vars, 1082 del conss, 120 chg bounds, 686 chg sides, 1488 chg coeffs, 0 upgd conss, 290791 impls, 0 clqs
0.59/0.67 c (round 4) 482 del vars, 1088 del conss, 123 chg bounds, 687 chg sides, 1490 chg coeffs, 0 upgd conss, 290792 impls, 0 clqs
0.59/0.69 c (round 5) 487 del vars, 1097 del conss, 128 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290793 impls, 0 clqs
0.69/0.70 c (round 6) 495 del vars, 1109 del conss, 132 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290821 impls, 0 clqs
0.69/0.72 c (round 7) 502 del vars, 1126 del conss, 136 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290853 impls, 0 clqs
0.69/0.73 c (round 8) 512 del vars, 1147 del conss, 141 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290913 impls, 0 clqs
0.69/0.75 c (round 9) 522 del vars, 1177 del conss, 145 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 291015 impls, 0 clqs
0.69/0.76 c (round 10) 529 del vars, 1200 del conss, 149 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 291071 impls, 0 clqs
0.69/0.78 c (round 11) 538 del vars, 1219 del conss, 153 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 291329 impls, 0 clqs
0.69/0.79 c (round 12) 549 del vars, 1240 del conss, 157 chg bounds, 692 chg sides, 1496 chg coeffs, 0 upgd conss, 291873 impls, 0 clqs
0.79/0.81 c (round 13) 556 del vars, 1269 del conss, 161 chg bounds, 692 chg sides, 1496 chg coeffs, 0 upgd conss, 291889 impls, 0 clqs
0.79/0.82 c (round 14) 574 del vars, 1307 del conss, 170 chg bounds, 692 chg sides, 1496 chg coeffs, 0 upgd conss, 292150 impls, 0 clqs
0.79/0.84 c (round 15) 583 del vars, 1336 del conss, 174 chg bounds, 694 chg sides, 1498 chg coeffs, 0 upgd conss, 292472 impls, 0 clqs
0.79/0.85 c (round 16) 591 del vars, 1365 del conss, 178 chg bounds, 694 chg sides, 1498 chg coeffs, 0 upgd conss, 292494 impls, 0 clqs
0.79/0.87 c (round 17) 600 del vars, 1384 del conss, 182 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 292518 impls, 0 clqs
0.79/0.88 c (round 18) 607 del vars, 1410 del conss, 188 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 292520 impls, 0 clqs
0.79/0.89 c (round 19) 614 del vars, 1425 del conss, 194 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 292522 impls, 0 clqs
0.89/0.91 c (round 20) 631 del vars, 1457 del conss, 203 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293157 impls, 0 clqs
0.89/0.92 c (round 21) 638 del vars, 1484 del conss, 207 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293181 impls, 0 clqs
0.89/0.94 c (round 22) 646 del vars, 1501 del conss, 211 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293241 impls, 0 clqs
0.89/0.95 c (round 23) 653 del vars, 1525 del conss, 217 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293245 impls, 0 clqs
0.89/0.97 c (round 24) 661 del vars, 1540 del conss, 223 chg bounds, 698 chg sides, 1502 chg coeffs, 0 upgd conss, 293251 impls, 0 clqs
0.89/0.98 c (round 25) 668 del vars, 1565 del conss, 229 chg bounds, 698 chg sides, 1502 chg coeffs, 0 upgd conss, 293359 impls, 0 clqs
0.99/1.00 c (round 26) 708 del vars, 1641 del conss, 251 chg bounds, 700 chg sides, 1504 chg coeffs, 0 upgd conss, 295093 impls, 0 clqs
0.99/1.02 c (round 27) 716 del vars, 1696 del conss, 255 chg bounds, 700 chg sides, 1504 chg coeffs, 0 upgd conss, 295199 impls, 0 clqs
0.99/1.03 c (round 28) 728 del vars, 1721 del conss, 262 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 295571 impls, 0 clqs
0.99/1.05 c (round 29) 737 del vars, 1747 del conss, 266 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 295819 impls, 0 clqs
0.99/1.06 c (round 30) 756 del vars, 1795 del conss, 278 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296025 impls, 0 clqs
0.99/1.08 c (round 31) 763 del vars, 1824 del conss, 284 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296027 impls, 0 clqs
0.99/1.09 c (round 32) 769 del vars, 1837 del conss, 290 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296029 impls, 0 clqs
1.09/1.10 c (round 33) 775 del vars, 1850 del conss, 296 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296031 impls, 0 clqs
1.09/1.12 c (round 34) 783 del vars, 1865 del conss, 302 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296039 impls, 0 clqs
1.09/1.13 c (round 35) 789 del vars, 1882 del conss, 308 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296041 impls, 0 clqs
1.09/1.15 c (round 36) 801 del vars, 1900 del conss, 342 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296273 impls, 0 clqs
1.09/1.17 c (round 37) 874 del vars, 2056 del conss, 351 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298040 impls, 0 clqs
1.09/1.18 c (round 38) 888 del vars, 2158 del conss, 361 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298498 impls, 0 clqs
1.19/1.20 c (round 39) 895 del vars, 2178 del conss, 365 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298514 impls, 0 clqs
1.19/1.21 c (round 40) 914 del vars, 2221 del conss, 377 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298742 impls, 0 clqs
1.19/1.23 c (round 41) 934 del vars, 2278 del conss, 388 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299787 impls, 0 clqs
1.19/1.24 c (round 42) 937 del vars, 2302 del conss, 390 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299805 impls, 0 clqs
1.19/1.26 c (round 43) 941 del vars, 2310 del conss, 394 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299805 impls, 0 clqs
1.19/1.27 c (round 44) 947 del vars, 2321 del conss, 400 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299861 impls, 0 clqs
1.19/1.29 c (round 45) 955 del vars, 2337 del conss, 408 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 300041 impls, 0 clqs
1.29/1.30 c (round 46) 973 del vars, 2370 del conss, 422 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 300303 impls, 0 clqs
1.29/1.32 c (round 47) 999 del vars, 2427 del conss, 440 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 300995 impls, 0 clqs
1.29/1.34 c (round 48) 1036 del vars, 2515 del conss, 463 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 302021 impls, 0 clqs
1.29/1.35 c (round 49) 1059 del vars, 2597 del conss, 478 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 302863 impls, 0 clqs
1.29/1.37 c (round 50) 1076 del vars, 2654 del conss, 490 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 303492 impls, 0 clqs
1.29/1.39 c (round 51) 1219 del vars, 2985 del conss, 592 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 305384 impls, 0 clqs
1.39/1.41 c (round 52) 1248 del vars, 3170 del conss, 611 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 306168 impls, 0 clqs
1.39/1.43 c (round 53) 1277 del vars, 3237 del conss, 628 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 307210 impls, 0 clqs
1.39/1.44 c (round 54) 1284 del vars, 3289 del conss, 633 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 307564 impls, 0 clqs
1.39/1.46 c (round 55) 1310 del vars, 3350 del conss, 650 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 307784 impls, 0 clqs
1.39/1.47 c (round 56) 1329 del vars, 3406 del conss, 656 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308127 impls, 0 clqs
1.39/1.49 c (round 57) 1335 del vars, 3439 del conss, 662 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308243 impls, 0 clqs
1.49/1.50 c (round 58) 1344 del vars, 3461 del conss, 670 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308563 impls, 0 clqs
1.49/1.52 c (round 59) 1356 del vars, 3489 del conss, 679 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308774 impls, 0 clqs
1.49/1.53 c (round 60) 1367 del vars, 3518 del conss, 687 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308973 impls, 0 clqs
1.49/1.54 c (round 61) 1382 del vars, 3556 del conss, 695 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 309335 impls, 0 clqs
1.49/1.56 c (round 62) 1386 del vars, 3576 del conss, 699 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 309335 impls, 0 clqs
1.49/1.57 c (round 63) 1399 del vars, 3597 del conss, 707 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 309801 impls, 0 clqs
1.49/1.58 c (round 64) 1416 del vars, 3648 del conss, 715 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 310085 impls, 0 clqs
1.59/1.60 c (round 65) 1419 del vars, 3677 del conss, 718 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 310087 impls, 0 clqs
1.59/1.61 c (round 66) 1424 del vars, 3687 del conss, 721 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 310095 impls, 0 clqs
1.59/1.63 c (round 67) 1453 del vars, 3743 del conss, 738 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 311039 impls, 0 clqs
1.59/1.64 c (round 68) 1456 del vars, 3784 del conss, 740 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 311043 impls, 0 clqs
1.59/1.65 c (round 69) 1463 del vars, 3796 del conss, 745 chg bounds, 703 chg sides, 1507 chg coeffs, 0 upgd conss, 311069 impls, 0 clqs
1.59/1.67 c (round 70) 1538 del vars, 3963 del conss, 789 chg bounds, 704 chg sides, 1508 chg coeffs, 0 upgd conss, 312527 impls, 0 clqs
1.59/1.68 c (round 71) 1553 del vars, 4064 del conss, 795 chg bounds, 704 chg sides, 1510 chg coeffs, 0 upgd conss, 312809 impls, 0 clqs
1.69/1.70 c (round 72) 1574 del vars, 4116 del conss, 802 chg bounds, 704 chg sides, 1511 chg coeffs, 0 upgd conss, 313511 impls, 0 clqs
1.69/1.71 c (round 73) 1591 del vars, 4177 del conss, 809 chg bounds, 707 chg sides, 1515 chg coeffs, 0 upgd conss, 313748 impls, 0 clqs
1.69/1.73 c (round 74) 1598 del vars, 4213 del conss, 811 chg bounds, 709 chg sides, 1519 chg coeffs, 0 upgd conss, 313784 impls, 0 clqs
1.69/1.74 c (round 75) 1613 del vars, 4261 del conss, 816 chg bounds, 711 chg sides, 1522 chg coeffs, 0 upgd conss, 313994 impls, 0 clqs
1.69/1.75 c (round 76) 1613 del vars, 4277 del conss, 816 chg bounds, 711 chg sides, 1522 chg coeffs, 0 upgd conss, 313994 impls, 0 clqs
1.79/1.89 c (round 77) 1613 del vars, 4309 del conss, 816 chg bounds, 711 chg sides, 1522 chg coeffs, 11038 upgd conss, 313994 impls, 0 clqs
1.98/2.02 c (round 78) 1739 del vars, 4327 del conss, 816 chg bounds, 711 chg sides, 1522 chg coeffs, 11038 upgd conss, 313994 impls, 0 clqs
1.98/2.10 c presolving (79 rounds):
1.98/2.10 c 1739 deleted vars, 4327 deleted constraints, 816 tightened bounds, 0 added holes, 711 changed sides, 1522 changed coefficients
1.98/2.10 c 313994 implications, 0 cliques
1.98/2.10 c presolved problem has 4246 variables (4246 bin, 0 int, 0 impl, 0 cont) and 11038 constraints
1.98/2.10 c 1280 constraints of type <knapsack>
1.98/2.10 c 9758 constraints of type <logicor>
1.98/2.10 c transformed objective value is always integral (scale: 1)
1.98/2.10 c Presolving Time: 1.37
1.98/2.10 c SATUNSAT-LIN
1.98/2.10 c -----------------------------------------------------------------------------------------------
1.98/2.10 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 0]
1.98/2.10 c separating/flowcover/freq = c -1
1.98/2.10 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 0]
1.98/2.10 c separating/cmir/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/veclendiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.98/2.10 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.98/2.10 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/veclendiving/freq = c -1
1.98/2.10 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 1]
1.98/2.10 c heuristics/simplerounding/freq = c -1
1.98/2.10 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/shifting/freq = c -1
1.98/2.10 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 1]
1.98/2.10 c heuristics/rounding/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.98/2.10 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.98/2.10 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 20]
1.98/2.10 c heuristics/rootsoldiving/freq = c -1
1.98/2.10 c # number of nodes added to the contingent of the total nodes
1.98/2.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.98/2.10 c heuristics/rens/nodesofs = c 2000
1.98/2.10 c # minimum percentage of integer variables that have to be fixable
1.98/2.10 c # [type: real, range: [0,1], default: 0.5]
1.98/2.10 c heuristics/rens/minfixingrate = c 0.3
1.98/2.10 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 0]
1.98/2.10 c heuristics/rens/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.98/2.10 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.98/2.10 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/pscostdiving/freq = c -1
1.98/2.10 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 1]
1.98/2.10 c heuristics/oneopt/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to total iteration number
1.98/2.10 c # [type: real, range: [0,1], default: 0.01]
1.98/2.10 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.98/2.10 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 20]
1.98/2.10 c heuristics/objpscostdiving/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.98/2.10 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.98/2.10 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/linesearchdiving/freq = c -1
1.98/2.10 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/intshifting/freq = c -1
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.98/2.10 c heuristics/intdiving/maxlpiterquot = c 0.075
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/guideddiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.98/2.10 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.98/2.10 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/guideddiving/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/fracdiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.98/2.10 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.98/2.10 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/fracdiving/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/feaspump/maxlpiterofs = c 2000
1.98/2.10 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 20]
1.98/2.10 c heuristics/feaspump/freq = c -1
1.98/2.10 c # minimum percentage of integer variables that have to be fixed
1.98/2.10 c # [type: real, range: [0,1], default: 0.666]
1.98/2.10 c heuristics/crossover/minfixingrate = c 0.5
1.98/2.10 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.98/2.10 c # [type: real, range: [0,1], default: 0.1]
1.98/2.10 c heuristics/crossover/nodesquot = c 0.15
1.98/2.10 c # number of nodes without incumbent change that heuristic should wait
1.98/2.10 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.98/2.10 c heuristics/crossover/nwaitingnodes = c 100
1.98/2.10 c # number of nodes added to the contingent of the total nodes
1.98/2.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.98/2.10 c heuristics/crossover/nodesofs = c 750
1.98/2.10 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 30]
1.98/2.10 c heuristics/crossover/freq = c -1
1.98/2.10 c # additional number of allowed LP iterations
1.98/2.10 c # [type: int, range: [0,2147483647], default: 1000]
1.98/2.10 c heuristics/coefdiving/maxlpiterofs = c 1500
1.98/2.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.98/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.98/2.10 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.98/2.10 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: 10]
1.98/2.10 c heuristics/coefdiving/freq = c -1
1.98/2.10 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: -1]
1.98/2.10 c presolving/probing/maxrounds = c 0
1.98/2.10 c # should presolving try to simplify knapsacks
1.98/2.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.98/2.10 c constraints/knapsack/simplifyinequalities = c TRUE
1.98/2.10 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.98/2.10 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.98/2.10 c constraints/knapsack/disaggregation = c FALSE
1.98/2.10 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.98/2.10 c # [type: int, range: [-1,2147483647], default: -1]
1.98/2.10 c constraints/knapsack/maxnumcardlift = c 0
1.98/2.10 c # should presolving try to simplify inequalities
2.09/2.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.09/2.10 c constraints/linear/simplifyinequalities = c TRUE
2.09/2.10 c # maximal number of separation rounds in the root node (-1: unlimited)
2.09/2.10 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.10 c separating/maxroundsroot = c 5
2.09/2.10 c # maximal number of separation rounds per node (-1: unlimited)
2.09/2.10 c # [type: int, range: [-1,2147483647], default: 5]
2.09/2.10 c separating/maxrounds = c 1
2.09/2.10 c # solving stops, if the given number of solutions were found (-1: no limit)
2.09/2.10 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.10 c limits/solutions = c 1
2.09/2.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.09/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.09/2.10 c limits/memory = c 1620
2.09/2.10 c # maximal time in seconds to run
2.09/2.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.09/2.10 c limits/time = c 1791
2.09/2.10 c # frequency for displaying node information lines
2.09/2.10 c # [type: int, range: [-1,2147483647], default: 100]
2.09/2.10 c display/freq = c 10000
2.09/2.10 c -----------------------------------------------------------------------------------------------
2.09/2.10 c start solving problem
2.09/2.10 c
2.38/2.49 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.38/2.49 c 1.8s| 1 | 0 | 1647 | 35M| 0 |1244 |4246 | 11k| 11k|4246 | 11k| 0 | 0 | 0 | 6.464520e+02 | -- | Inf
4.58/4.64 c 3.9s| 1 | 0 | 2163 | 35M| 0 |1126 |4246 | 11k| 11k|4246 | 11k| 63 | 0 | 0 | 6.933135e+02 | -- | Inf
6.78/6.83 c 6.0s| 1 | 0 | 2973 | 35M| 0 |1162 |4246 | 11k| 11k|4246 | 11k| 135 | 0 | 0 | 7.141633e+02 | -- | Inf
9.58/9.68 c 8.9s| 1 | 0 | 3752 | 35M| 0 |1208 |4246 | 11k| 11k|4246 | 11k| 293 | 0 | 0 | 7.207352e+02 | -- | Inf
12.18/12.26 c 11.4s| 1 | 0 | 4476 | 36M| 0 |1307 |4246 | 11k| 11k|4246 | 11k| 413 | 0 | 0 | 7.256589e+02 | -- | Inf
18.37/18.40 c 17.6s| 1 | 0 | 5737 | 36M| 0 |1438 |4246 | 11k| 11k|4246 | 11k| 572 | 0 | 0 | 7.322851e+02 | -- | Inf
26.67/26.73 c 25.8s| 1 | 2 | 5737 | 36M| 0 |1438 |4246 | 11k| 11k|4246 | 11k| 572 | 0 | 17 | 7.322851e+02 | -- | Inf
530.39/530.66 c
530.39/530.66 c SCIP Status : problem is solved [infeasible]
530.39/530.66 c Solving Time (sec) : 527.52
530.39/530.66 c Solving Nodes : 288
530.39/530.66 c Primal Bound : +1.00000000000000e+20 (0 solutions)
530.39/530.66 c Dual Bound : +1.00000000000000e+20
530.39/530.66 c Gap : 0.00 %
530.39/530.66 c NODE 288
530.39/530.66 c DUAL BOUND 1e+20
530.39/530.66 c PRIMAL BOUND 1e+20
530.39/530.66 c GAP 0
530.39/530.66 s UNSATISFIABLE
530.39/530.66 c SCIP Status : problem is solved [infeasible]
530.39/530.66 c Solving Time : 527.52
530.39/530.66 c Original Problem :
530.39/530.66 c Problem name : HOME/instance-1868621-1245129644.opb
530.39/530.66 c Variables : 5985 (5985 binary, 0 integer, 0 implicit integer, 0 continuous)
530.39/530.66 c Constraints : 15365 initial, 15365 maximal
530.39/530.66 c Presolved Problem :
530.39/530.66 c Problem name : t_HOME/instance-1868621-1245129644.opb
530.39/530.66 c Variables : 4246 (4246 binary, 0 integer, 0 implicit integer, 0 continuous)
530.39/530.66 c Constraints : 11038 initial, 11052 maximal
530.39/530.66 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
530.39/530.66 c trivial : 0.04 36 0 0 0 0 0 0 0
530.39/530.66 c dualfix : 0.02 1 0 0 0 0 0 0 0
530.39/530.66 c boundshift : 0.00 0 0 0 0 0 0 0 0
530.39/530.66 c inttobinary : 0.00 0 0 0 0 0 0 0 0
530.39/530.66 c implics : 0.12 0 773 0 0 0 0 0 0
530.39/530.66 c probing : 0.00 0 0 0 0 0 0 0 0
530.39/530.66 c knapsack : 0.15 0 0 0 0 0 0 0 0
530.39/530.66 c linear : 0.85 782 147 0 816 0 4327 711 1522
530.39/530.66 c logicor : 0.07 0 0 0 0 0 0 0 0
530.39/530.66 c root node : - 53 - - 53 - - - -
530.39/530.66 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
530.39/530.66 c integral : 0 0 0 239 0 1 114 0 0 420
530.39/530.66 c knapsack : 1280 5 5134 0 0 0 0 1000 0 0
530.39/530.66 c logicor : 9758+ 5 5042 0 0 114 57751 0 0 0
530.39/530.66 c countsols : 0 0 0 0 0 0 0 0 0 0
530.39/530.66 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
530.39/530.66 c integral : 278.35 0.00 0.00 278.35 0.00
530.39/530.66 c knapsack : 0.47 0.02 0.45 0.00 0.00
530.39/530.66 c logicor : 0.70 0.00 0.70 0.00 0.00
530.39/530.66 c countsols : 0.00 0.00 0.00 0.00 0.00
530.39/530.66 c Propagators : Time Calls Cutoffs DomReds
530.39/530.66 c rootredcost : 0.00 0 0 0
530.39/530.66 c pseudoobj : 1.94 5158 0 0
530.39/530.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
530.39/530.66 c propagation : 0.02 114 101 288 9.2 42 7.0 -
530.39/530.66 c infeasible LP : 0.00 7 0 0 0.0 0 0.0 0
530.39/530.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
530.39/530.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
530.39/530.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
530.39/530.66 c applied globally : - - - 237 8.2 - - -
530.39/530.66 c applied locally : - - - 0 0.0 - - -
530.39/530.66 c Separators : Time Calls Cutoffs DomReds Cuts Conss
530.39/530.66 c cut pool : 0.00 4 - - 268 - (maximal pool size: 1247)
530.39/530.66 c redcost : 0.12 220 0 0 0 0
530.39/530.66 c impliedbounds : 0.02 5 0 0 0 0
530.39/530.66 c intobj : 0.00 0 0 0 0 0
530.39/530.66 c gomory : 5.04 5 0 0 2137 0
530.39/530.66 c strongcg : 4.96 5 0 0 1330 0
530.39/530.66 c cmir : 0.00 0 0 0 0 0
530.39/530.66 c flowcover : 0.00 0 0 0 0 0
530.39/530.66 c clique : 0.20 5 0 0 37 0
530.39/530.66 c zerohalf : 0.00 0 0 0 0 0
530.39/530.66 c mcf : 0.05 1 0 0 0 0
530.39/530.66 c Pricers : Time Calls Vars
530.39/530.66 c problem variables: 0.00 0 0
530.39/530.66 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
530.39/530.66 c relpscost : 278.35 239 1 114 0 0 420
530.39/530.66 c pscost : 0.00 0 0 0 0 0 0
530.39/530.66 c inference : 0.00 0 0 0 0 0 0
530.39/530.66 c mostinf : 0.00 0 0 0 0 0 0
530.39/530.66 c leastinf : 0.00 0 0 0 0 0 0
530.39/530.66 c fullstrong : 0.00 0 0 0 0 0 0
530.39/530.66 c allfullstrong : 0.00 0 0 0 0 0 0
530.39/530.66 c random : 0.00 0 0 0 0 0 0
530.39/530.66 c Primal Heuristics : Time Calls Found
530.39/530.66 c LP solutions : 0.00 - 0
530.39/530.66 c pseudo solutions : 0.00 - 0
530.39/530.66 c simplerounding : 0.00 0 0
530.39/530.66 c rounding : 0.00 0 0
530.39/530.66 c shifting : 0.00 0 0
530.39/530.66 c intshifting : 0.00 0 0
530.39/530.66 c oneopt : 0.00 0 0
530.39/530.66 c fixandinfer : 0.00 0 0
530.39/530.66 c feaspump : 0.00 0 0
530.39/530.66 c coefdiving : 0.00 0 0
530.39/530.66 c pscostdiving : 0.00 0 0
530.39/530.66 c fracdiving : 0.00 0 0
530.39/530.66 c veclendiving : 0.00 0 0
530.39/530.66 c intdiving : 0.00 0 0
530.39/530.66 c actconsdiving : 0.00 0 0
530.39/530.66 c objpscostdiving : 0.00 0 0
530.39/530.66 c rootsoldiving : 0.00 0 0
530.39/530.66 c linesearchdiving : 0.00 0 0
530.39/530.66 c guideddiving : 0.00 0 0
530.39/530.66 c octane : 0.00 0 0
530.39/530.66 c rens : 0.00 0 0
530.39/530.66 c rins : 0.00 0 0
530.39/530.66 c localbranching : 0.00 0 0
530.39/530.66 c mutation : 0.00 0 0
530.39/530.66 c crossover : 0.00 0 0
530.39/530.66 c dins : 0.00 0 0
530.39/530.66 c LP : Time Calls Iterations Iter/call Iter/sec
530.39/530.66 c primal LP : 0.23 0 0 0.00 0.00
530.39/530.66 c dual LP : 231.75 251 178855 712.57 771.76
530.39/530.66 c barrier LP : 0.00 0 0 0.00 -
530.39/530.66 c diving/probing LP: 0.00 0 0 0.00 -
530.39/530.66 c strong branching : 278.06 559 195043 348.91 701.44
530.39/530.66 c (at root node) : - 17 4615 271.47 -
530.39/530.66 c conflict analysis: 0.00 0 0 0.00 -
530.39/530.66 c B&B Tree :
530.39/530.66 c number of runs : 1
530.39/530.66 c nodes : 288
530.39/530.66 c nodes (total) : 288
530.39/530.66 c nodes left : 0
530.39/530.66 c max depth : 14
530.39/530.66 c max depth (total): 14
530.39/530.66 c backtracks : 133 (46.2%)
530.39/530.66 c delayed cutoffs : 133
530.39/530.66 c repropagations : 372 (9770 domain reductions, 44 cutoffs)
530.39/530.66 c avg switch length: 6.03
530.39/530.66 c switching time : 0.85
530.39/530.66 c Solution :
530.39/530.66 c Solutions found : 0 (0 improvements)
530.39/530.66 c Primal Bound : infeasible
530.39/530.66 c Dual Bound : -
530.39/530.66 c Gap : 0.00 %
530.39/530.66 c Root Dual Bound : +7.32285138952165e+02
530.48/530.76 c Time complete: 530.54.