0.09/0.15 c SCIP version 1.1.0.7
0.09/0.15 c LP-Solver Clp 1.8.2
0.09/0.15 c user parameter file <scip.set> not found - using default parameters
0.09/0.15 c read problem <HOME/instance-1868603-1245129071.opb>
0.09/0.15 c original problem has 3655 variables (3655 bin, 0 int, 0 impl, 0 cont) and 8686 constraints
0.09/0.20 c No objective function, only one solution is needed.
0.09/0.20 c start presolving problem
0.09/0.20 c presolving:
0.29/0.34 c (round 1) 403 del vars, 245 del conss, 81 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150967 impls, 0 clqs
0.29/0.36 c (round 2) 404 del vars, 905 del conss, 82 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150967 impls, 0 clqs
0.29/0.37 c (round 3) 408 del vars, 913 del conss, 86 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150973 impls, 0 clqs
0.29/0.37 c (round 4) 412 del vars, 919 del conss, 90 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150973 impls, 0 clqs
0.29/0.38 c (round 5) 419 del vars, 929 del conss, 94 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151045 impls, 0 clqs
0.29/0.39 c (round 6) 426 del vars, 946 del conss, 98 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151147 impls, 0 clqs
0.39/0.40 c (round 7) 444 del vars, 983 del conss, 106 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151617 impls, 0 clqs
0.39/0.41 c (round 8) 451 del vars, 1014 del conss, 110 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151657 impls, 0 clqs
0.39/0.42 c (round 9) 460 del vars, 1033 del conss, 114 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151861 impls, 0 clqs
0.39/0.43 c (round 10) 471 del vars, 1054 del conss, 118 chg bounds, 356 chg sides, 758 chg coeffs, 0 upgd conss, 152197 impls, 0 clqs
0.39/0.44 c (round 11) 481 del vars, 1089 del conss, 123 chg bounds, 356 chg sides, 758 chg coeffs, 0 upgd conss, 152454 impls, 0 clqs
0.39/0.44 c (round 12) 490 del vars, 1110 del conss, 127 chg bounds, 358 chg sides, 760 chg coeffs, 0 upgd conss, 152724 impls, 0 clqs
0.39/0.45 c (round 13) 501 del vars, 1142 del conss, 133 chg bounds, 358 chg sides, 760 chg coeffs, 0 upgd conss, 152981 impls, 0 clqs
0.39/0.46 c (round 14) 511 del vars, 1164 del conss, 137 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153259 impls, 0 clqs
0.39/0.47 c (round 15) 518 del vars, 1189 del conss, 141 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153283 impls, 0 clqs
0.39/0.48 c (round 16) 524 del vars, 1207 del conss, 147 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153285 impls, 0 clqs
0.39/0.49 c (round 17) 530 del vars, 1220 del conss, 153 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153287 impls, 0 clqs
0.39/0.50 c (round 18) 536 del vars, 1233 del conss, 159 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153289 impls, 0 clqs
0.49/0.50 c (round 19) 543 del vars, 1249 del conss, 165 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153341 impls, 0 clqs
0.49/0.51 c (round 20) 550 del vars, 1261 del conss, 169 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153381 impls, 0 clqs
0.49/0.52 c (round 21) 564 del vars, 1295 del conss, 178 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153483 impls, 0 clqs
0.49/0.53 c (round 22) 570 del vars, 1316 del conss, 184 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153485 impls, 0 clqs
0.49/0.54 c (round 23) 579 del vars, 1335 del conss, 191 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153736 impls, 0 clqs
0.49/0.55 c (round 24) 588 del vars, 1354 del conss, 197 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 154030 impls, 0 clqs
0.49/0.55 c (round 25) 604 del vars, 1394 del conss, 208 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 154252 impls, 0 clqs
0.49/0.56 c (round 26) 629 del vars, 1445 del conss, 232 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 154284 impls, 0 clqs
0.49/0.57 c (round 27) 682 del vars, 1522 del conss, 260 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 155583 impls, 0 clqs
0.49/0.59 c (round 28) 730 del vars, 1671 del conss, 285 chg bounds, 364 chg sides, 766 chg coeffs, 0 upgd conss, 156493 impls, 0 clqs
0.49/0.60 c (round 29) 737 del vars, 1730 del conss, 287 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 156677 impls, 0 clqs
0.59/0.60 c (round 30) 758 del vars, 1784 del conss, 306 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 156748 impls, 0 clqs
0.59/0.61 c (round 31) 781 del vars, 1831 del conss, 317 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 156985 impls, 0 clqs
0.59/0.62 c (round 32) 787 del vars, 1865 del conss, 322 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157006 impls, 0 clqs
0.59/0.63 c (round 33) 795 del vars, 1884 del conss, 328 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157114 impls, 0 clqs
0.59/0.64 c (round 34) 803 del vars, 1904 del conss, 334 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157236 impls, 0 clqs
0.59/0.64 c (round 35) 807 del vars, 1918 del conss, 338 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157340 impls, 0 clqs
0.59/0.65 c (round 36) 819 del vars, 1940 del conss, 346 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 158170 impls, 0 clqs
0.59/0.67 c (round 37) 904 del vars, 2109 del conss, 393 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 159539 impls, 0 clqs
0.59/0.69 c (round 38) 965 del vars, 2325 del conss, 429 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 163901 impls, 0 clqs
0.59/0.69 c (round 39) 971 del vars, 2386 del conss, 435 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 163901 impls, 0 clqs
0.69/0.70 c (round 40) 997 del vars, 2441 del conss, 449 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 165552 impls, 0 clqs
0.69/0.71 c (round 41) 1016 del vars, 2504 del conss, 459 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 165750 impls, 0 clqs
0.69/0.72 c (round 42) 1026 del vars, 2548 del conss, 468 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 165786 impls, 0 clqs
0.69/0.73 c (round 43) 1040 del vars, 2586 del conss, 477 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166002 impls, 0 clqs
0.69/0.74 c (round 44) 1048 del vars, 2612 del conss, 482 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166036 impls, 0 clqs
0.69/0.74 c (round 45) 1061 del vars, 2640 del conss, 489 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166196 impls, 0 clqs
0.69/0.75 c (round 46) 1074 del vars, 2678 del conss, 496 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166210 impls, 0 clqs
0.69/0.76 c (round 47) 1078 del vars, 2708 del conss, 499 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166214 impls, 0 clqs
0.69/0.77 c (round 48) 1081 del vars, 2716 del conss, 501 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166220 impls, 0 clqs
0.69/0.77 c (round 49) 1089 del vars, 2733 del conss, 507 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166364 impls, 0 clqs
0.69/0.78 c (round 50) 1102 del vars, 2768 del conss, 514 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166552 impls, 0 clqs
0.69/0.79 c (round 51) 1108 del vars, 2793 del conss, 516 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166692 impls, 0 clqs
0.69/0.80 c (round 52) 1117 del vars, 2820 del conss, 521 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166835 impls, 0 clqs
0.79/0.80 c (round 53) 1121 del vars, 2839 del conss, 524 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166845 impls, 0 clqs
0.79/0.81 c (round 54) 1127 del vars, 2850 del conss, 528 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166855 impls, 0 clqs
0.79/0.82 c (round 55) 1135 del vars, 2873 del conss, 532 chg bounds, 367 chg sides, 769 chg coeffs, 0 upgd conss, 167017 impls, 0 clqs
0.79/0.82 c (round 56) 1139 del vars, 2891 del conss, 534 chg bounds, 368 chg sides, 771 chg coeffs, 0 upgd conss, 167029 impls, 0 clqs
0.79/0.83 c (round 57) 1155 del vars, 2922 del conss, 541 chg bounds, 369 chg sides, 773 chg coeffs, 0 upgd conss, 167296 impls, 0 clqs
0.79/0.84 c (round 58) 1166 del vars, 2959 del conss, 544 chg bounds, 369 chg sides, 773 chg coeffs, 0 upgd conss, 167473 impls, 0 clqs
0.79/0.85 c (round 59) 1174 del vars, 2986 del conss, 546 chg bounds, 372 chg sides, 776 chg coeffs, 0 upgd conss, 167589 impls, 0 clqs
0.79/0.85 c (round 60) 1178 del vars, 3002 del conss, 546 chg bounds, 374 chg sides, 780 chg coeffs, 0 upgd conss, 167613 impls, 0 clqs
0.79/0.86 c (round 61) 1179 del vars, 3014 del conss, 546 chg bounds, 375 chg sides, 781 chg coeffs, 0 upgd conss, 167623 impls, 0 clqs
0.79/0.87 c (round 62) 1180 del vars, 3017 del conss, 546 chg bounds, 376 chg sides, 782 chg coeffs, 0 upgd conss, 167633 impls, 0 clqs
0.79/0.87 c (round 63) 1180 del vars, 3020 del conss, 546 chg bounds, 376 chg sides, 782 chg coeffs, 0 upgd conss, 167633 impls, 0 clqs
0.89/0.95 c (round 64) 1180 del vars, 3047 del conss, 546 chg bounds, 376 chg sides, 782 chg coeffs, 5620 upgd conss, 167633 impls, 0 clqs
1.00/1.00 c (round 65) 1313 del vars, 3066 del conss, 546 chg bounds, 376 chg sides, 782 chg coeffs, 5620 upgd conss, 167633 impls, 0 clqs
1.00/1.02 c (round 66) 1316 del vars, 3073 del conss, 546 chg bounds, 376 chg sides, 782 chg coeffs, 5620 upgd conss, 167633 impls, 0 clqs
1.00/1.05 c presolving (67 rounds):
1.00/1.05 c 1316 deleted vars, 3073 deleted constraints, 546 tightened bounds, 0 added holes, 376 changed sides, 782 changed coefficients
1.00/1.05 c 167633 implications, 0 cliques
1.00/1.05 c presolved problem has 2338 variables (2338 bin, 0 int, 0 impl, 0 cont) and 5613 constraints
1.00/1.05 c 624 constraints of type <knapsack>
1.00/1.05 c 4989 constraints of type <logicor>
1.00/1.05 c transformed objective value is always integral (scale: 1)
1.00/1.05 c Presolving Time: 0.67
1.00/1.05 c SATUNSAT-LIN
1.00/1.05 c -----------------------------------------------------------------------------------------------
1.00/1.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.05 c separating/flowcover/freq = c -1
1.00/1.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.05 c separating/cmir/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/veclendiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.05 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.00/1.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/veclendiving/freq = c -1
1.00/1.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.05 c heuristics/simplerounding/freq = c -1
1.00/1.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/shifting/freq = c -1
1.00/1.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.05 c heuristics/rounding/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.00/1.05 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.00/1.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.05 c heuristics/rootsoldiving/freq = c -1
1.00/1.05 c # number of nodes added to the contingent of the total nodes
1.00/1.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.05 c heuristics/rens/nodesofs = c 2000
1.00/1.05 c # minimum percentage of integer variables that have to be fixable
1.00/1.05 c # [type: real, range: [0,1], default: 0.5]
1.00/1.05 c heuristics/rens/minfixingrate = c 0.3
1.00/1.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.05 c heuristics/rens/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.05 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.00/1.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/pscostdiving/freq = c -1
1.00/1.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.05 c heuristics/oneopt/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to total iteration number
1.00/1.05 c # [type: real, range: [0,1], default: 0.01]
1.00/1.05 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.00/1.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.05 c heuristics/objpscostdiving/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.05 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.00/1.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/linesearchdiving/freq = c -1
1.00/1.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/intshifting/freq = c -1
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.05 c heuristics/intdiving/maxlpiterquot = c 0.075
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/guideddiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.05 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.00/1.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/guideddiving/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/fracdiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.05 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.00/1.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/fracdiving/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/feaspump/maxlpiterofs = c 2000
1.00/1.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.05 c heuristics/feaspump/freq = c -1
1.00/1.05 c # minimum percentage of integer variables that have to be fixed
1.00/1.05 c # [type: real, range: [0,1], default: 0.666]
1.00/1.05 c heuristics/crossover/minfixingrate = c 0.5
1.00/1.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.00/1.05 c # [type: real, range: [0,1], default: 0.1]
1.00/1.05 c heuristics/crossover/nodesquot = c 0.15
1.00/1.05 c # number of nodes without incumbent change that heuristic should wait
1.00/1.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.00/1.05 c heuristics/crossover/nwaitingnodes = c 100
1.00/1.05 c # number of nodes added to the contingent of the total nodes
1.00/1.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.05 c heuristics/crossover/nodesofs = c 750
1.00/1.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 30]
1.00/1.05 c heuristics/crossover/freq = c -1
1.00/1.05 c # additional number of allowed LP iterations
1.00/1.05 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.05 c heuristics/coefdiving/maxlpiterofs = c 1500
1.00/1.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.05 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.00/1.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.05 c heuristics/coefdiving/freq = c -1
1.00/1.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.05 c presolving/probing/maxrounds = c 0
1.00/1.05 c # should presolving try to simplify knapsacks
1.00/1.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.05 c constraints/knapsack/simplifyinequalities = c TRUE
1.00/1.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.00/1.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.00/1.05 c constraints/knapsack/disaggregation = c FALSE
1.00/1.05 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.05 c constraints/knapsack/maxnumcardlift = c 0
1.00/1.05 c # should presolving try to simplify inequalities
1.00/1.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.05 c constraints/linear/simplifyinequalities = c TRUE
1.00/1.05 c # maximal number of separation rounds in the root node (-1: unlimited)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.05 c separating/maxroundsroot = c 5
1.00/1.05 c # maximal number of separation rounds per node (-1: unlimited)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 5]
1.00/1.05 c separating/maxrounds = c 1
1.00/1.05 c # solving stops, if the given number of solutions were found (-1: no limit)
1.00/1.05 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.05 c limits/solutions = c 1
1.00/1.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.05 c limits/memory = c 1620
1.00/1.05 c # maximal time in seconds to run
1.00/1.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.05 c limits/time = c 1791
1.00/1.05 c # frequency for displaying node information lines
1.00/1.05 c # [type: int, range: [-1,2147483647], default: 100]
1.00/1.05 c display/freq = c 10000
1.00/1.05 c -----------------------------------------------------------------------------------------------
1.00/1.05 c start solving problem
1.00/1.05 c
1.09/1.13 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.09/1.13 c 0.8s| 1 | 0 | 585 | 19M| 0 | 448 |2338 |5613 |5613 |2338 |5613 | 0 | 0 | 0 | 5.539541e+02 | -- | Inf
1.39/1.47 c 1.1s| 1 | 0 | 800 | 19M| 0 | 419 |2338 |5613 |5613 |2338 |5675 | 62 | 0 | 0 | 6.022335e+02 | -- | Inf
1.69/1.77 c 1.4s| 1 | 0 | 1034 | 19M| 0 | 491 |2338 |5613 |5613 |2338 |5752 | 139 | 0 | 0 | 6.290961e+02 | -- | Inf
2.09/2.13 c 1.7s| 1 | 0 | 1340 | 19M| 0 | 494 |2338 |5613 |5613 |2338 |5896 | 283 | 0 | 0 | 6.358913e+02 | -- | Inf
2.49/2.56 c 2.1s| 1 | 0 | 1742 | 19M| 0 | 557 |2338 |5613 |5613 |2338 |6025 | 412 | 0 | 0 | 6.428072e+02 | -- | Inf
2.89/2.97 c 2.6s| 1 | 0 | 2065 | 19M| 0 | 572 |2338 |5613 |5613 |2338 |6113 | 500 | 0 | 0 | 6.457155e+02 | -- | Inf
3.29/3.38 c 3.0s| 1 | 2 | 2065 | 19M| 0 | 572 |2338 |5613 |5613 |2338 |6113 | 500 | 0 | 17 | 6.457155e+02 | -- | Inf
304.41/304.50 c 302s| 10000 | 7924 |330069 | 46M| 81 | 207 |2338 |6066 |2023 |2338 |6083 | 500 |1156 |3477 | 6.903748e+02 | -- | Inf
562.45/562.61 c 558s| 20000 | 16071 |691607 | 71M| 84 | 255 |2338 |5996 |1873 |2338 |6083 | 500 |2160 |6253 | 6.951082e+02 | -- | Inf
787.99/788.28 c 783s| 30000 | 24398 |986806 | 95M| 84 | 240 |2338 |6104 |1782 |2338 |6083 | 500 |3067 |7755 | 7.002438e+02 | -- | Inf
1035.42/1035.71 c 1029s| 40000 | 32777 | 1366k| 119M| 84 | 224 |2338 |6023 |2029 |2338 |6083 | 500 |3768 |9401 | 7.042705e+02 | -- | Inf
1298.76/1299.18 c 1290s| 50000 | 39703 | 1863k| 141M| 84 | 190 |2338 |5958 |1744 |2338 |6083 | 500 |4301 | 11k| 7.068642e+02 | -- | Inf
1569.58/1570.06 c 1559s| 60000 | 43630 | 2377k| 156M| 86 | 206 |2338 |5953 |1705 |2338 |6083 | 500 |5023 | 12k| 7.090414e+02 | -- | Inf
1800.03/1800.51 c
1800.03/1800.51 c SCIP Status : solving was interrupted [user interrupt]
1800.03/1800.51 c Solving Time (sec) : 1787.88
1800.03/1800.51 c Solving Nodes : 67722
1800.03/1800.51 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1800.03/1800.51 c Dual Bound : +7.11714444565704e+02
1800.03/1800.51 c Gap : infinite
1800.03/1800.51 c NODE 67722
1800.03/1800.51 c DUAL BOUND 711.714
1800.03/1800.51 c PRIMAL BOUND 1e+20
1800.03/1800.51 c GAP 1e+20
1800.03/1800.51 s UNKNOWN
1800.03/1800.51 c SCIP Status : solving was interrupted [user interrupt]
1800.03/1800.51 c Solving Time : 1787.88
1800.03/1800.51 c Original Problem :
1800.03/1800.51 c Problem name : HOME/instance-1868603-1245129071.opb
1800.03/1800.51 c Variables : 3655 (3655 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.03/1800.51 c Constraints : 8686 initial, 8686 maximal
1800.03/1800.51 c Presolved Problem :
1800.03/1800.51 c Problem name : t_HOME/instance-1868603-1245129071.opb
1800.03/1800.51 c Variables : 2338 (2338 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.03/1800.51 c Constraints : 5613 initial, 6181 maximal
1800.03/1800.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1800.03/1800.51 c trivial : 0.05 7 0 0 0 0 0 0 0
1800.03/1800.51 c dualfix : 0.00 1 0 0 0 0 0 0 0
1800.03/1800.51 c boundshift : 0.00 0 0 0 0 0 0 0 0
1800.03/1800.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1800.03/1800.51 c implics : 0.10 0 613 0 0 0 0 0 0
1800.03/1800.51 c probing : 0.00 0 0 0 0 0 0 0 0
1800.03/1800.51 c knapsack : 0.05 2 0 0 0 0 4 0 0
1800.03/1800.51 c linear : 0.36 541 151 0 546 0 3066 376 782
1800.03/1800.51 c logicor : 0.06 1 0 0 0 0 3 0 0
1800.03/1800.51 c root node : - 26 - - 26 - - - -
1800.03/1800.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1800.03/1800.51 c integral : 0 0 0 64724 0 312 3384 0 0 126416
1800.03/1800.51 c knapsack : 624 5 277397 0 0 1345 246127 949 0 0
1800.03/1800.51 c logicor : 4989+ 5 236959 0 0 983 684214 0 0 0
1800.03/1800.51 c countsols : 0 0 0 0 0 0 0 0 0 0
1800.03/1800.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1800.03/1800.51 c integral : 303.80 0.00 0.00 303.80 0.00
1800.03/1800.51 c knapsack : 14.53 0.01 14.52 0.00 0.00
1800.03/1800.51 c logicor : 7.10 0.00 7.10 0.00 0.00
1800.03/1800.51 c countsols : 0.00 0.00 0.00 0.00 0.00
1800.03/1800.51 c Propagators : Time Calls Cutoffs DomReds
1800.03/1800.51 c rootredcost : 0.17 0 0 0
1800.03/1800.51 c pseudoobj : 34.45 277991 0 0
1800.03/1800.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1800.03/1800.51 c propagation : 0.15 2328 2317 7630 15.6 1299 5.2 -
1800.03/1800.51 c infeasible LP : 1.58 2237 0 0 0.0 0 0.0 0
1800.03/1800.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1800.03/1800.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1800.03/1800.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1800.03/1800.51 c applied globally : - - - 5327 11.5 - - -
1800.03/1800.51 c applied locally : - - - 0 0.0 - - -
1800.03/1800.51 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1800.03/1800.51 c cut pool : 0.00 4 - - 272 - (maximal pool size: 1094)
1800.03/1800.51 c redcost : 11.13 63831 0 0 0 0
1800.03/1800.51 c impliedbounds : 0.01 5 0 0 0 0
1800.03/1800.51 c intobj : 0.00 0 0 0 0 0
1800.03/1800.51 c gomory : 0.61 5 0 0 2500 0
1800.03/1800.51 c strongcg : 0.59 5 0 0 2500 0
1800.03/1800.51 c cmir : 0.00 0 0 0 0 0
1800.03/1800.51 c flowcover : 0.00 0 0 0 0 0
1800.03/1800.51 c clique : 0.09 5 0 0 29 0
1800.03/1800.51 c zerohalf : 0.00 0 0 0 0 0
1800.03/1800.51 c mcf : 0.01 1 0 0 0 0
1800.03/1800.51 c Pricers : Time Calls Vars
1800.03/1800.51 c problem variables: 0.00 0 0
1800.03/1800.51 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1800.03/1800.51 c relpscost : 303.57 64724 312 3384 0 0 126416
1800.03/1800.51 c pscost : 0.00 0 0 0 0 0 0
1800.03/1800.51 c inference : 0.00 0 0 0 0 0 0
1800.03/1800.51 c mostinf : 0.00 0 0 0 0 0 0
1800.03/1800.51 c leastinf : 0.00 0 0 0 0 0 0
1800.03/1800.51 c fullstrong : 0.00 0 0 0 0 0 0
1800.03/1800.51 c allfullstrong : 0.00 0 0 0 0 0 0
1800.03/1800.51 c random : 0.00 0 0 0 0 0 0
1800.03/1800.51 c Primal Heuristics : Time Calls Found
1800.03/1800.51 c LP solutions : 0.00 - 0
1800.03/1800.51 c pseudo solutions : 0.00 - 0
1800.03/1800.51 c simplerounding : 0.00 0 0
1800.03/1800.51 c rounding : 0.00 0 0
1800.03/1800.51 c shifting : 0.00 0 0
1800.03/1800.51 c intshifting : 0.00 0 0
1800.03/1800.51 c oneopt : 0.00 0 0
1800.03/1800.51 c fixandinfer : 0.00 0 0
1800.03/1800.51 c feaspump : 0.00 0 0
1800.03/1800.51 c coefdiving : 0.00 0 0
1800.03/1800.51 c pscostdiving : 0.00 0 0
1800.03/1800.51 c fracdiving : 0.00 0 0
1800.03/1800.51 c veclendiving : 0.00 0 0
1800.03/1800.51 c intdiving : 0.00 0 0
1800.03/1800.51 c actconsdiving : 0.00 0 0
1800.03/1800.51 c objpscostdiving : 0.00 0 0
1800.03/1800.51 c rootsoldiving : 0.00 0 0
1800.03/1800.51 c linesearchdiving : 0.00 0 0
1800.03/1800.51 c guideddiving : 0.00 0 0
1800.03/1800.51 c octane : 0.00 0 0
1800.03/1800.51 c rens : 0.00 0 0
1800.03/1800.51 c rins : 0.00 0 0
1800.03/1800.51 c localbranching : 0.00 0 0
1800.03/1800.51 c mutation : 0.00 0 0
1800.03/1800.51 c crossover : 0.00 0 0
1800.03/1800.51 c dins : 0.00 0 0
1800.03/1800.51 c LP : Time Calls Iterations Iter/call Iter/sec
1800.03/1800.51 c primal LP : 0.03 0 0 0.00 0.00
1800.03/1800.51 c dual LP : 1214.26 66678 2811610 42.17 2315.49
1800.03/1800.51 c barrier LP : 0.00 0 0 0.00 -
1800.03/1800.51 c diving/probing LP: 0.00 0 0 0.00 -
1800.03/1800.51 c strong branching : 289.56 13644 722489 52.95 2495.13
1800.03/1800.51 c (at root node) : - 17 1844 108.47 -
1800.03/1800.51 c conflict analysis: 0.00 0 0 0.00 -
1800.03/1800.51 c B&B Tree :
1800.03/1800.51 c number of runs : 1
1800.03/1800.51 c nodes : 67722
1800.03/1800.51 c nodes (total) : 67722
1800.03/1800.51 c nodes left : 47042
1800.03/1800.51 c max depth : 93
1800.03/1800.51 c max depth (total): 93
1800.03/1800.51 c backtracks : 8408 (12.4%)
1800.03/1800.51 c delayed cutoffs : 11653
1800.03/1800.51 c repropagations : 14080 (29101 domain reductions, 363 cutoffs)
1800.03/1800.51 c avg switch length: 7.22
1800.03/1800.51 c switching time : 23.11
1800.03/1800.51 c Solution :
1800.03/1800.51 c Solutions found : 0 (0 improvements)
1800.03/1800.51 c Primal Bound : -
1800.03/1800.51 c Dual Bound : +7.11714444565704e+02
1800.03/1800.51 c Gap : infinite
1800.03/1800.51 c Root Dual Bound : +6.45715524033993e+02
1800.23/1800.79 c Time complete: 1800.32.