0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2704265-1278550414.opb>
0.19/0.25 c original problem has 5985 variables (5985 bin, 0 int, 0 impl, 0 cont) and 15365 constraints
0.19/0.25 c problem read
0.19/0.25 c No objective function, only one solution is needed.
0.19/0.25 c presolving settings loaded
0.29/0.34 c presolving:
0.59/0.60 c (round 1) 478 del vars, 306 del conss, 117 chg bounds, 686 chg sides, 1488 chg coeffs, 0 upgd conss, 290791 impls, 0 clqs
0.59/0.62 c (round 2) 480 del vars, 1082 del conss, 119 chg bounds, 686 chg sides, 1488 chg coeffs, 0 upgd conss, 290791 impls, 0 clqs
0.59/0.63 c (round 3) 482 del vars, 1088 del conss, 122 chg bounds, 687 chg sides, 1490 chg coeffs, 0 upgd conss, 290792 impls, 0 clqs
0.59/0.64 c (round 4) 487 del vars, 1097 del conss, 127 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290793 impls, 0 clqs
0.59/0.65 c (round 5) 495 del vars, 1109 del conss, 131 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290821 impls, 0 clqs
0.59/0.66 c (round 6) 502 del vars, 1126 del conss, 135 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290853 impls, 0 clqs
0.59/0.67 c (round 7) 512 del vars, 1147 del conss, 140 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 290913 impls, 0 clqs
0.59/0.68 c (round 8) 522 del vars, 1177 del conss, 144 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 291015 impls, 0 clqs
0.59/0.69 c (round 9) 529 del vars, 1200 del conss, 148 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 291071 impls, 0 clqs
0.59/0.70 c (round 10) 538 del vars, 1219 del conss, 152 chg bounds, 688 chg sides, 1492 chg coeffs, 0 upgd conss, 291329 impls, 0 clqs
0.69/0.71 c (round 11) 549 del vars, 1240 del conss, 156 chg bounds, 692 chg sides, 1496 chg coeffs, 0 upgd conss, 291873 impls, 0 clqs
0.69/0.71 c (round 12) 556 del vars, 1269 del conss, 160 chg bounds, 692 chg sides, 1496 chg coeffs, 0 upgd conss, 291889 impls, 0 clqs
0.69/0.72 c (round 13) 574 del vars, 1307 del conss, 169 chg bounds, 692 chg sides, 1496 chg coeffs, 0 upgd conss, 292150 impls, 0 clqs
0.69/0.73 c (round 14) 583 del vars, 1336 del conss, 173 chg bounds, 694 chg sides, 1498 chg coeffs, 0 upgd conss, 292472 impls, 0 clqs
0.69/0.74 c (round 15) 591 del vars, 1365 del conss, 177 chg bounds, 694 chg sides, 1498 chg coeffs, 0 upgd conss, 292494 impls, 0 clqs
0.69/0.75 c (round 16) 600 del vars, 1384 del conss, 181 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 292518 impls, 0 clqs
0.69/0.76 c (round 17) 607 del vars, 1410 del conss, 187 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 292520 impls, 0 clqs
0.69/0.77 c (round 18) 614 del vars, 1425 del conss, 193 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 292522 impls, 0 clqs
0.69/0.78 c (round 19) 631 del vars, 1457 del conss, 202 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293157 impls, 0 clqs
0.69/0.79 c (round 20) 638 del vars, 1484 del conss, 206 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293181 impls, 0 clqs
0.79/0.80 c (round 21) 646 del vars, 1501 del conss, 210 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293241 impls, 0 clqs
0.79/0.81 c (round 22) 653 del vars, 1525 del conss, 216 chg bounds, 696 chg sides, 1500 chg coeffs, 0 upgd conss, 293245 impls, 0 clqs
0.79/0.82 c (round 23) 661 del vars, 1540 del conss, 222 chg bounds, 698 chg sides, 1502 chg coeffs, 0 upgd conss, 293251 impls, 0 clqs
0.79/0.83 c (round 24) 668 del vars, 1565 del conss, 228 chg bounds, 698 chg sides, 1502 chg coeffs, 0 upgd conss, 293359 impls, 0 clqs
0.79/0.84 c (round 25) 708 del vars, 1641 del conss, 250 chg bounds, 700 chg sides, 1504 chg coeffs, 0 upgd conss, 295093 impls, 0 clqs
0.79/0.85 c (round 26) 716 del vars, 1696 del conss, 254 chg bounds, 700 chg sides, 1504 chg coeffs, 0 upgd conss, 295199 impls, 0 clqs
0.79/0.86 c (round 27) 728 del vars, 1721 del conss, 261 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 295571 impls, 0 clqs
0.79/0.87 c (round 28) 737 del vars, 1747 del conss, 265 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 295819 impls, 0 clqs
0.79/0.88 c (round 29) 756 del vars, 1795 del conss, 277 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296025 impls, 0 clqs
0.79/0.89 c (round 30) 763 del vars, 1824 del conss, 283 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296027 impls, 0 clqs
0.89/0.90 c (round 31) 769 del vars, 1837 del conss, 289 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296029 impls, 0 clqs
0.89/0.91 c (round 32) 775 del vars, 1850 del conss, 295 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296031 impls, 0 clqs
0.89/0.92 c (round 33) 783 del vars, 1865 del conss, 301 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296039 impls, 0 clqs
0.89/0.92 c (round 34) 789 del vars, 1882 del conss, 307 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296041 impls, 0 clqs
0.89/0.94 c (round 35) 801 del vars, 1900 del conss, 341 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 296273 impls, 0 clqs
0.89/0.95 c (round 36) 874 del vars, 2056 del conss, 350 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298040 impls, 0 clqs
0.89/0.96 c (round 37) 888 del vars, 2158 del conss, 360 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298498 impls, 0 clqs
0.89/0.97 c (round 38) 895 del vars, 2178 del conss, 364 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298514 impls, 0 clqs
0.89/0.98 c (round 39) 914 del vars, 2221 del conss, 376 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 298742 impls, 0 clqs
0.89/0.99 c (round 40) 934 del vars, 2278 del conss, 387 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299787 impls, 0 clqs
1.00/1.00 c (round 41) 937 del vars, 2302 del conss, 389 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299805 impls, 0 clqs
1.00/1.01 c (round 42) 941 del vars, 2310 del conss, 393 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299805 impls, 0 clqs
1.00/1.02 c (round 43) 947 del vars, 2321 del conss, 399 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 299861 impls, 0 clqs
1.00/1.03 c (round 44) 955 del vars, 2337 del conss, 407 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 300041 impls, 0 clqs
1.00/1.04 c (round 45) 973 del vars, 2370 del conss, 421 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 300303 impls, 0 clqs
1.00/1.05 c (round 46) 999 del vars, 2427 del conss, 439 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 300995 impls, 0 clqs
1.00/1.06 c (round 47) 1036 del vars, 2515 del conss, 462 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 302021 impls, 0 clqs
1.00/1.07 c (round 48) 1059 del vars, 2597 del conss, 477 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 302863 impls, 0 clqs
1.00/1.08 c (round 49) 1076 del vars, 2654 del conss, 489 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 303492 impls, 0 clqs
1.10/1.10 c (round 50) 1219 del vars, 2985 del conss, 591 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 305384 impls, 0 clqs
1.10/1.12 c (round 51) 1248 del vars, 3170 del conss, 610 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 306168 impls, 0 clqs
1.10/1.13 c (round 52) 1277 del vars, 3237 del conss, 627 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 307210 impls, 0 clqs
1.10/1.14 c (round 53) 1284 del vars, 3289 del conss, 632 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 307564 impls, 0 clqs
1.10/1.15 c (round 54) 1310 del vars, 3350 del conss, 649 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 307784 impls, 0 clqs
1.10/1.16 c (round 55) 1329 del vars, 3406 del conss, 655 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308127 impls, 0 clqs
1.10/1.17 c (round 56) 1335 del vars, 3439 del conss, 661 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308243 impls, 0 clqs
1.10/1.18 c (round 57) 1344 del vars, 3461 del conss, 669 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308563 impls, 0 clqs
1.10/1.19 c (round 58) 1356 del vars, 3489 del conss, 678 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308774 impls, 0 clqs
1.10/1.20 c (round 59) 1367 del vars, 3518 del conss, 686 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 308973 impls, 0 clqs
1.19/1.21 c (round 60) 1382 del vars, 3556 del conss, 694 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 309335 impls, 0 clqs
1.19/1.21 c (round 61) 1386 del vars, 3576 del conss, 698 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 309335 impls, 0 clqs
1.19/1.22 c (round 62) 1399 del vars, 3597 del conss, 706 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 309801 impls, 0 clqs
1.19/1.23 c (round 63) 1416 del vars, 3648 del conss, 714 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 310085 impls, 0 clqs
1.19/1.24 c (round 64) 1419 del vars, 3677 del conss, 717 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 310087 impls, 0 clqs
1.19/1.25 c (round 65) 1424 del vars, 3687 del conss, 720 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 310095 impls, 0 clqs
1.19/1.26 c (round 66) 1453 del vars, 3743 del conss, 737 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 311039 impls, 0 clqs
1.19/1.27 c (round 67) 1456 del vars, 3784 del conss, 739 chg bounds, 702 chg sides, 1506 chg coeffs, 0 upgd conss, 311043 impls, 0 clqs
1.19/1.27 c (round 68) 1463 del vars, 3796 del conss, 744 chg bounds, 703 chg sides, 1507 chg coeffs, 0 upgd conss, 311069 impls, 0 clqs
1.19/1.29 c (round 69) 1538 del vars, 3966 del conss, 785 chg bounds, 704 chg sides, 1508 chg coeffs, 0 upgd conss, 312559 impls, 0 clqs
1.29/1.30 c (round 70) 1553 del vars, 4064 del conss, 791 chg bounds, 704 chg sides, 1510 chg coeffs, 0 upgd conss, 312841 impls, 0 clqs
1.29/1.31 c (round 71) 1574 del vars, 4116 del conss, 798 chg bounds, 704 chg sides, 1511 chg coeffs, 0 upgd conss, 313543 impls, 0 clqs
1.29/1.32 c (round 72) 1591 del vars, 4177 del conss, 805 chg bounds, 707 chg sides, 1515 chg coeffs, 0 upgd conss, 313780 impls, 0 clqs
1.29/1.33 c (round 73) 1598 del vars, 4213 del conss, 807 chg bounds, 709 chg sides, 1519 chg coeffs, 0 upgd conss, 313816 impls, 0 clqs
1.29/1.34 c (round 74) 1613 del vars, 4261 del conss, 812 chg bounds, 711 chg sides, 1522 chg coeffs, 0 upgd conss, 314026 impls, 0 clqs
1.29/1.34 c (round 75) 1613 del vars, 4277 del conss, 812 chg bounds, 711 chg sides, 1522 chg coeffs, 0 upgd conss, 314026 impls, 0 clqs
1.39/1.46 c (round 76) 1613 del vars, 4309 del conss, 812 chg bounds, 711 chg sides, 1522 chg coeffs, 11038 upgd conss, 314026 impls, 0 clqs
1.49/1.52 c (round 77) 1739 del vars, 4327 del conss, 812 chg bounds, 711 chg sides, 1522 chg coeffs, 11038 upgd conss, 314026 impls, 0 clqs
1.49/1.57 c presolving (78 rounds):
1.49/1.57 c 1739 deleted vars, 4327 deleted constraints, 812 tightened bounds, 0 added holes, 711 changed sides, 1522 changed coefficients
1.49/1.57 c 314026 implications, 0 cliques
1.49/1.57 c presolved problem has 4246 variables (4246 bin, 0 int, 0 impl, 0 cont) and 11038 constraints
1.49/1.57 c 1280 constraints of type <knapsack>
1.49/1.57 c 6553 constraints of type <setppc>
1.49/1.57 c 3205 constraints of type <logicor>
1.49/1.57 c transformed objective value is always integral (scale: 1)
1.49/1.57 c Presolving Time: 1.26
1.49/1.57 c - non default parameters ----------------------------------------------------------------------
1.49/1.57 c # SCIP version 1.2.1.3
1.49/1.57 c
1.49/1.57 c # frequency for displaying node information lines
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 100]
1.49/1.57 c display/freq = 10000
1.49/1.57 c
1.49/1.57 c # maximal time in seconds to run
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.49/1.57 c limits/time = 1789.76
1.49/1.57 c
1.49/1.57 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.49/1.57 c limits/memory = 1620
1.49/1.57 c
1.49/1.57 c # solving stops, if the given number of solutions were found (-1: no limit)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.57 c limits/solutions = 1
1.49/1.57 c
1.49/1.57 c # maximal number of separation rounds per node (-1: unlimited)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 5]
1.49/1.57 c separating/maxrounds = 1
1.49/1.57 c
1.49/1.57 c # maximal number of separation rounds in the root node (-1: unlimited)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.57 c separating/maxroundsroot = 5
1.49/1.57 c
1.49/1.57 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.49/1.57 c # [type: int, range: [1,2], default: 1]
1.49/1.57 c timing/clocktype = 2
1.49/1.57 c
1.49/1.57 c # should presolving try to simplify inequalities
1.49/1.57 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.49/1.57 c constraints/linear/simplifyinequalities = TRUE
1.49/1.57 c
1.49/1.57 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
1.49/1.57 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.49/1.57 c constraints/indicator/addCouplingCons = TRUE
1.49/1.57 c
1.49/1.57 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.49/1.57 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.49/1.57 c constraints/knapsack/disaggregation = FALSE
1.49/1.57 c
1.49/1.57 c # should presolving try to simplify knapsacks
1.49/1.57 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.49/1.57 c constraints/knapsack/simplifyinequalities = TRUE
1.49/1.57 c
1.49/1.57 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.57 c presolving/probing/maxrounds = 0
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/coefdiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/coefdiving/maxlpiterquot = 0.075
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/coefdiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 30]
1.49/1.57 c heuristics/crossover/freq = -1
1.49/1.57 c
1.49/1.57 c # number of nodes added to the contingent of the total nodes
1.49/1.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.49/1.57 c heuristics/crossover/nodesofs = 750
1.49/1.57 c
1.49/1.57 c # number of nodes without incumbent change that heuristic should wait
1.49/1.57 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.49/1.57 c heuristics/crossover/nwaitingnodes = 100
1.49/1.57 c
1.49/1.57 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.49/1.57 c # [type: real, range: [0,1], default: 0.1]
1.49/1.57 c heuristics/crossover/nodesquot = 0.15
1.49/1.57 c
1.49/1.57 c # minimum percentage of integer variables that have to be fixed
1.49/1.57 c # [type: real, range: [0,1], default: 0.666]
1.49/1.57 c heuristics/crossover/minfixingrate = 0.5
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.57 c heuristics/feaspump/freq = -1
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/feaspump/maxlpiterofs = 2000
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/fracdiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/fracdiving/maxlpiterquot = 0.075
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/fracdiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/guideddiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/guideddiving/maxlpiterquot = 0.075
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/guideddiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/intdiving/maxlpiterquot = 0.075
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/intshifting/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/linesearchdiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/nlp/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.57 c heuristics/objpscostdiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to total iteration number
1.49/1.57 c # [type: real, range: [0,1], default: 0.01]
1.49/1.57 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/oneopt/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/pscostdiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/pscostdiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.57 c heuristics/rens/freq = -1
1.49/1.57 c
1.49/1.57 c # minimum percentage of integer variables that have to be fixable
1.49/1.57 c # [type: real, range: [0,1], default: 0.5]
1.49/1.57 c heuristics/rens/minfixingrate = 0.3
1.49/1.57 c
1.49/1.57 c # number of nodes added to the contingent of the total nodes
1.49/1.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.49/1.57 c heuristics/rens/nodesofs = 2000
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 20]
1.49/1.57 c heuristics/rootsoldiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.49/1.57 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/rounding/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/shifting/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/simplerounding/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.57 c heuristics/trivial/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/trysol/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 10]
1.49/1.57 c heuristics/veclendiving/freq = -1
1.49/1.57 c
1.49/1.57 c # maximal fraction of diving LP iterations compared to node LP iterations
1.49/1.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.49/1.57 c heuristics/veclendiving/maxlpiterquot = 0.075
1.49/1.57 c
1.49/1.57 c # additional number of allowed LP iterations
1.49/1.57 c # [type: int, range: [0,2147483647], default: 1000]
1.49/1.57 c heuristics/veclendiving/maxlpiterofs = 1500
1.49/1.57 c
1.49/1.57 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 1]
1.49/1.57 c heuristics/zirounding/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.57 c separating/cmir/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: 0]
1.49/1.57 c separating/flowcover/freq = -1
1.49/1.57 c
1.49/1.57 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.49/1.57 c # [type: int, range: [-1,2147483647], default: -1]
1.49/1.57 c separating/rapidlearning/freq = 0
1.49/1.57 c
1.49/1.57 c -----------------------------------------------------------------------------------------------
1.49/1.57 c start solving
1.49/1.57 c
2.99/3.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.99/3.01 c 2.8s| 1 | 0 | 2593 | - | 34M| 0 |1836 |4246 | 11k|4246 | 11k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
8.09/8.13 c 7.9s| 1 | 0 | 4593 | - | 35M| 0 |1781 |4246 | 11k|4246 | 11k| 61 | 0 | 0 | 0.000000e+00 | -- | Inf
15.99/16.00 c 15.7s| 1 | 0 | 8098 | - | 35M| 0 |1498 |4246 | 10k|4246 | 11k| 416 | 0 | 0 | 0.000000e+00 | -- | Inf
21.39/21.44 c 21.2s| 1 | 0 | 10985 | - | 35M| 0 |1132 |4246 | 10k|4246 | 11k| 497 | 0 | 0 | 0.000000e+00 | -- | Inf
27.58/27.68 c 27.4s| 1 | 0 | 13763 | - | 35M| 0 |1464 |4246 | 10k|4246 | 11k| 600 | 0 | 0 | 0.000000e+00 | -- | Inf
35.69/35.79 c 35.5s| 1 | 0 | 16823 | - | 36M| 0 |1744 |4246 | 10k|4246 | 11k| 669 | 0 | 0 | 0.000000e+00 | -- | Inf
145.36/145.45 c 145s| 1 | 0 | 18671 | - | 36M| 0 |1549 |4246 | 10k|4246 | 11k| 669 | 0 | 50 | 0.000000e+00 | -- | Inf
213.35/213.48 c 213s| 1 | 2 | 18671 | - | 36M| 0 |1549 |4246 | 10k|4246 | 11k| 669 | 0 | 85 | 0.000000e+00 | -- | Inf
1231.08/1231.49 c
1231.08/1231.49 c SCIP Status : problem is solved [infeasible]
1231.08/1231.49 c Solving Time (sec) : 1231.24
1231.08/1231.49 c Solving Nodes : 313
1231.08/1231.49 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1231.08/1231.49 c Dual Bound : +1.00000000000000e+20
1231.08/1231.49 c Gap : 0.00 %
1231.08/1231.49 s UNSATISFIABLE
1231.08/1231.49 c SCIP Status : problem is solved [infeasible]
1231.08/1231.49 c Solving Time : 1231.24
1231.08/1231.49 c Original Problem :
1231.08/1231.49 c Problem name : HOME/instance-2704265-1278550414.opb
1231.08/1231.49 c Variables : 5985 (5985 binary, 0 integer, 0 implicit integer, 0 continuous)
1231.08/1231.49 c Constraints : 15365 initial, 15365 maximal
1231.08/1231.49 c Presolved Problem :
1231.08/1231.49 c Problem name : t_HOME/instance-2704265-1278550414.opb
1231.08/1231.49 c Variables : 4246 (4246 binary, 0 integer, 0 implicit integer, 0 continuous)
1231.08/1231.49 c Constraints : 11038 initial, 11038 maximal
1231.08/1231.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1231.08/1231.49 c trivial : 0.08 36 0 0 0 0 0 0 0
1231.08/1231.49 c dualfix : 0.05 1 0 0 0 0 0 0 0
1231.08/1231.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
1231.08/1231.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1231.08/1231.49 c implics : 0.19 0 773 0 0 0 0 0 0
1231.08/1231.49 c probing : 0.00 0 0 0 0 0 0 0 0
1231.08/1231.49 c knapsack : 0.03 0 0 0 0 0 0 0 0
1231.08/1231.49 c setppc : 0.03 0 0 0 0 0 0 0 0
1231.08/1231.49 c linear : 0.72 781 148 0 812 0 4327 711 1522
1231.08/1231.49 c logicor : 0.05 0 0 0 0 0 0 0 0
1231.08/1231.49 c root node : - 325 - - 325 - - - -
1231.08/1231.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1231.08/1231.49 c integral : 0 0 0 259 0 4 43 0 0 480
1231.08/1231.49 c knapsack : 1280 5 2577 0 0 0 22 1003 0 0
1231.08/1231.49 c setppc : 6553 5 2577 0 0 40 24986 0 0 0
1231.08/1231.49 c logicor : 3205+ 5 2138 0 0 56 7408 0 0 0
1231.08/1231.49 c countsols : 0 0 0 0 0 0 0 0 0 0
1231.08/1231.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1231.08/1231.49 c integral : 702.77 0.00 0.00 702.77 0.00
1231.08/1231.49 c knapsack : 0.22 0.03 0.19 0.00 0.00
1231.08/1231.49 c setppc : 0.96 0.01 0.96 0.00 0.00
1231.08/1231.49 c logicor : 0.11 0.00 0.10 0.00 0.00
1231.08/1231.49 c countsols : 0.00 0.00 0.00 0.00 0.00
1231.08/1231.49 c Propagators : Time Calls Cutoffs DomReds
1231.08/1231.49 c vbounds : 0.00 1 0 0
1231.08/1231.49 c rootredcost : 0.00 0 0 0
1231.08/1231.49 c pseudoobj : 0.00 0 0 0
1231.08/1231.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1231.08/1231.49 c propagation : 0.01 96 95 181 5.8 24 4.1 -
1231.08/1231.49 c infeasible LP : 0.00 2 2 8 5.8 2 2.5 0
1231.08/1231.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1231.08/1231.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1231.08/1231.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1231.08/1231.49 c applied globally : - - - 179 5.0 - - -
1231.08/1231.49 c applied locally : - - - 0 0.0 - - -
1231.08/1231.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1231.08/1231.49 c cut pool : 0.00 4 - - 78 - (maximal pool size: 448)
1231.08/1231.49 c redcost : 0.10 251 0 0 0 0
1231.08/1231.49 c impliedbounds : 0.02 5 0 0 0 0
1231.08/1231.49 c intobj : 0.00 0 0 0 0 0
1231.08/1231.49 c cgmip : 0.00 0 0 0 0 0
1231.08/1231.49 c gomory : 5.02 5 0 0 2464 0
1231.08/1231.49 c strongcg : 6.03 5 0 0 1424 0
1231.08/1231.49 c cmir : 0.00 0 0 0 0 0
1231.08/1231.49 c flowcover : 0.00 0 0 0 0 0
1231.08/1231.49 c clique : 0.20 5 0 0 36 0
1231.08/1231.49 c zerohalf : 0.00 0 0 0 0 0
1231.08/1231.49 c mcf : 0.06 1 0 0 0 0
1231.08/1231.49 c rapidlearning : 0.00 0 0 0 0 0
1231.08/1231.49 c Pricers : Time Calls Vars
1231.08/1231.49 c problem variables: 0.00 0 0
1231.08/1231.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1231.08/1231.49 c relpscost : 702.77 259 4 43 0 0 480
1231.08/1231.49 c pscost : 0.00 0 0 0 0 0 0
1231.08/1231.49 c inference : 0.00 0 0 0 0 0 0
1231.08/1231.49 c mostinf : 0.00 0 0 0 0 0 0
1231.08/1231.49 c leastinf : 0.00 0 0 0 0 0 0
1231.08/1231.49 c fullstrong : 0.00 0 0 0 0 0 0
1231.08/1231.49 c allfullstrong : 0.00 0 0 0 0 0 0
1231.08/1231.49 c random : 0.00 0 0 0 0 0 0
1231.08/1231.49 c Primal Heuristics : Time Calls Found
1231.08/1231.49 c LP solutions : 0.00 - 0
1231.08/1231.49 c pseudo solutions : 0.00 - 0
1231.08/1231.49 c trivial : 0.01 1 0
1231.08/1231.49 c simplerounding : 0.00 0 0
1231.08/1231.49 c zirounding : 0.00 0 0
1231.08/1231.49 c rounding : 0.00 0 0
1231.08/1231.49 c shifting : 0.00 0 0
1231.08/1231.49 c intshifting : 0.00 0 0
1231.08/1231.49 c oneopt : 0.00 0 0
1231.08/1231.49 c twoopt : 0.00 0 0
1231.08/1231.49 c fixandinfer : 0.00 0 0
1231.08/1231.49 c feaspump : 0.00 0 0
1231.08/1231.49 c coefdiving : 0.00 0 0
1231.08/1231.49 c pscostdiving : 0.00 0 0
1231.08/1231.49 c fracdiving : 0.00 0 0
1231.08/1231.49 c veclendiving : 0.00 0 0
1231.08/1231.49 c intdiving : 0.00 0 0
1231.08/1231.49 c actconsdiving : 0.00 0 0
1231.08/1231.49 c objpscostdiving : 0.00 0 0
1231.08/1231.49 c rootsoldiving : 0.00 0 0
1231.08/1231.49 c linesearchdiving : 0.00 0 0
1231.08/1231.49 c guideddiving : 0.00 0 0
1231.08/1231.49 c octane : 0.00 0 0
1231.08/1231.49 c rens : 0.00 0 0
1231.08/1231.49 c rins : 0.00 0 0
1231.08/1231.49 c localbranching : 0.00 0 0
1231.08/1231.49 c mutation : 0.00 0 0
1231.08/1231.49 c crossover : 0.00 0 0
1231.08/1231.49 c dins : 0.00 0 0
1231.08/1231.49 c undercover : 0.00 0 0
1231.08/1231.49 c nlp : 0.00 0 0
1231.08/1231.49 c trysol : 0.00 0 0
1231.08/1231.49 c LP : Time Calls Iterations Iter/call Iter/sec
1231.08/1231.49 c primal LP : 0.01 0 0 0.00 0.00
1231.08/1231.49 c dual LP : 512.17 265 343294 1295.45 670.27
1231.08/1231.49 c lex dual LP : 0.00 0 0 0.00 -
1231.08/1231.49 c barrier LP : 0.00 0 0 0.00 -
1231.08/1231.49 c diving/probing LP: 0.00 0 0 0.00 -
1231.08/1231.49 c strong branching : 702.50 418 367195 878.46 522.70
1231.08/1231.49 c (at root node) : - 85 83963 987.80 -
1231.08/1231.49 c conflict analysis: 0.00 0 0 0.00 -
1231.08/1231.49 c B&B Tree :
1231.08/1231.49 c number of runs : 1
1231.08/1231.49 c nodes : 313
1231.08/1231.49 c nodes (total) : 313
1231.08/1231.49 c nodes left : 0
1231.08/1231.49 c max depth : 28
1231.08/1231.49 c max depth (total): 28
1231.08/1231.49 c backtracks : 68 (21.7%)
1231.08/1231.49 c delayed cutoffs : 168
1231.08/1231.49 c repropagations : 352 (4622 domain reductions, 29 cutoffs)
1231.08/1231.49 c avg switch length: 4.02
1231.08/1231.49 c switching time : 0.37
1231.08/1231.49 c Solution :
1231.08/1231.49 c Solutions found : 0 (0 improvements)
1231.08/1231.49 c Primal Bound : infeasible
1231.08/1231.49 c Dual Bound : -
1231.08/1231.49 c Gap : 0.00 %
1231.08/1231.49 c Root Dual Bound : +0.00000000000000e+00
1231.08/1231.49 c Root Iterations : 18671
1231.17/1231.59 c Time complete: 1231.26.