0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
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-2664571-1276338589.opb>
0.19/0.26 c original problem has 5072 variables (5072 bin, 0 int, 0 impl, 0 cont) and 12829 constraints
0.19/0.26 c problem read
0.19/0.26 c No objective function, only one solution is needed.
0.19/0.26 c presolving settings loaded
0.19/0.26 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.29/0.34 c presolving:
0.49/0.59 c (round 1) 443 del vars, 273 del conss, 109 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250891 impls, 0 clqs
0.59/0.61 c (round 2) 445 del vars, 992 del conss, 111 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250891 impls, 0 clqs
0.59/0.63 c (round 3) 447 del vars, 997 del conss, 113 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250897 impls, 0 clqs
0.59/0.64 c (round 4) 451 del vars, 1003 del conss, 117 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250897 impls, 0 clqs
0.59/0.66 c (round 5) 458 del vars, 1013 del conss, 121 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250923 impls, 0 clqs
0.59/0.67 c (round 6) 465 del vars, 1030 del conss, 125 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250955 impls, 0 clqs
0.59/0.69 c (round 7) 472 del vars, 1047 del conss, 129 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250973 impls, 0 clqs
0.69/0.71 c (round 8) 479 del vars, 1064 del conss, 133 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251029 impls, 0 clqs
0.69/0.72 c (round 9) 486 del vars, 1081 del conss, 137 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251085 impls, 0 clqs
0.69/0.74 c (round 10) 496 del vars, 1104 del conss, 141 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251179 impls, 0 clqs
0.69/0.75 c (round 11) 503 del vars, 1127 del conss, 145 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251197 impls, 0 clqs
0.69/0.77 c (round 12) 512 del vars, 1146 del conss, 149 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251417 impls, 0 clqs
0.69/0.79 c (round 13) 523 del vars, 1167 del conss, 153 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 251949 impls, 0 clqs
0.79/0.80 c (round 14) 530 del vars, 1196 del conss, 157 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 252007 impls, 0 clqs
0.79/0.82 c (round 15) 538 del vars, 1218 del conss, 161 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 252151 impls, 0 clqs
0.79/0.83 c (round 16) 547 del vars, 1237 del conss, 165 chg bounds, 560 chg sides, 1248 chg coeffs, 0 upgd conss, 252453 impls, 0 clqs
0.79/0.85 c (round 17) 555 del vars, 1268 del conss, 171 chg bounds, 560 chg sides, 1248 chg coeffs, 0 upgd conss, 252457 impls, 0 clqs
0.79/0.87 c (round 18) 564 del vars, 1285 del conss, 177 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252463 impls, 0 clqs
0.79/0.88 c (round 19) 571 del vars, 1303 del conss, 181 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252475 impls, 0 clqs
0.89/0.90 c (round 20) 578 del vars, 1320 del conss, 185 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252499 impls, 0 clqs
0.89/0.91 c (round 21) 586 del vars, 1337 del conss, 189 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252559 impls, 0 clqs
0.89/0.93 c (round 22) 592 del vars, 1355 del conss, 195 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252561 impls, 0 clqs
0.89/0.94 c (round 23) 613 del vars, 1398 del conss, 209 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252867 impls, 0 clqs
0.89/0.97 c (round 24) 714 del vars, 1630 del conss, 275 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 255842 impls, 0 clqs
0.89/0.99 c (round 25) 730 del vars, 1743 del conss, 286 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256435 impls, 0 clqs
1.00/1.00 c (round 26) 737 del vars, 1763 del conss, 290 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256463 impls, 0 clqs
1.00/1.02 c (round 27) 743 del vars, 1783 del conss, 296 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256465 impls, 0 clqs
1.00/1.03 c (round 28) 751 del vars, 1798 del conss, 300 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256543 impls, 0 clqs
1.00/1.05 c (round 29) 759 del vars, 1820 del conss, 306 chg bounds, 564 chg sides, 1252 chg coeffs, 0 upgd conss, 256549 impls, 0 clqs
1.00/1.07 c (round 30) 767 del vars, 1845 del conss, 312 chg bounds, 564 chg sides, 1252 chg coeffs, 0 upgd conss, 256699 impls, 0 clqs
1.00/1.09 c (round 31) 883 del vars, 2087 del conss, 385 chg bounds, 566 chg sides, 1254 chg coeffs, 0 upgd conss, 259737 impls, 0 clqs
1.10/1.11 c (round 32) 890 del vars, 2203 del conss, 391 chg bounds, 566 chg sides, 1254 chg coeffs, 0 upgd conss, 259813 impls, 0 clqs
1.10/1.12 c (round 33) 898 del vars, 2220 del conss, 397 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 259997 impls, 0 clqs
1.10/1.14 c (round 34) 904 del vars, 2237 del conss, 403 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 259999 impls, 0 clqs
1.10/1.15 c (round 35) 920 del vars, 2270 del conss, 414 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260418 impls, 0 clqs
1.10/1.17 c (round 36) 926 del vars, 2293 del conss, 420 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260420 impls, 0 clqs
1.10/1.18 c (round 37) 932 del vars, 2306 del conss, 426 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260422 impls, 0 clqs
1.19/1.20 c (round 38) 938 del vars, 2319 del conss, 432 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260424 impls, 0 clqs
1.19/1.21 c (round 39) 950 del vars, 2336 del conss, 454 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260878 impls, 0 clqs
1.19/1.23 c (round 40) 1000 del vars, 2448 del conss, 460 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262390 impls, 0 clqs
1.19/1.25 c (round 41) 1008 del vars, 2516 del conss, 465 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262448 impls, 0 clqs
1.19/1.26 c (round 42) 1016 del vars, 2534 del conss, 469 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262586 impls, 0 clqs
1.19/1.28 c (round 43) 1028 del vars, 2570 del conss, 478 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262614 impls, 0 clqs
1.19/1.29 c (round 44) 1041 del vars, 2591 del conss, 484 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263198 impls, 0 clqs
1.29/1.31 c (round 45) 1052 del vars, 2622 del conss, 492 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263274 impls, 0 clqs
1.29/1.32 c (round 46) 1060 del vars, 2647 del conss, 500 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263418 impls, 0 clqs
1.29/1.34 c (round 47) 1076 del vars, 2677 del conss, 514 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263648 impls, 0 clqs
1.29/1.35 c (round 48) 1100 del vars, 2729 del conss, 531 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 264039 impls, 0 clqs
1.29/1.37 c (round 49) 1139 del vars, 2818 del conss, 554 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 265445 impls, 0 clqs
1.29/1.39 c (round 50) 1160 del vars, 2899 del conss, 569 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 266173 impls, 0 clqs
1.39/1.40 c (round 51) 1179 del vars, 2957 del conss, 581 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 266808 impls, 0 clqs
1.39/1.43 c (round 52) 1267 del vars, 3164 del conss, 639 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 267996 impls, 0 clqs
1.39/1.45 c (round 53) 1320 del vars, 3373 del conss, 684 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 268515 impls, 0 clqs
1.39/1.46 c (round 54) 1353 del vars, 3465 del conss, 708 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 269383 impls, 0 clqs
1.39/1.48 c (round 55) 1392 del vars, 3571 del conss, 726 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270698 impls, 0 clqs
1.39/1.50 c (round 56) 1410 del vars, 3649 del conss, 730 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270996 impls, 0 clqs
1.49/1.51 c (round 57) 1415 del vars, 3682 del conss, 734 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270998 impls, 0 clqs
1.49/1.52 c (round 58) 1421 del vars, 3695 del conss, 740 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 271076 impls, 0 clqs
1.49/1.54 c (round 59) 1433 del vars, 3719 del conss, 749 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 271325 impls, 0 clqs
1.49/1.55 c (round 60) 1451 del vars, 3762 del conss, 759 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 272489 impls, 0 clqs
1.49/1.57 c (round 61) 1465 del vars, 3805 del conss, 766 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 273032 impls, 0 clqs
1.49/1.58 c (round 62) 1473 del vars, 3837 del conss, 770 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 273128 impls, 0 clqs
1.59/1.62 c (round 63) 1928 del vars, 4866 del conss, 1099 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 281318 impls, 0 clqs
1.59/1.64 c (round 64) 1969 del vars, 5303 del conss, 1117 chg bounds, 569 chg sides, 1259 chg coeffs, 0 upgd conss, 284940 impls, 0 clqs
1.59/1.66 c (round 65) 1997 del vars, 5411 del conss, 1134 chg bounds, 569 chg sides, 1260 chg coeffs, 0 upgd conss, 287724 impls, 0 clqs
1.59/1.67 c (round 66) 2018 del vars, 5476 del conss, 1142 chg bounds, 569 chg sides, 1260 chg coeffs, 0 upgd conss, 288342 impls, 0 clqs
1.59/1.69 c (round 67) 2031 del vars, 5532 del conss, 1150 chg bounds, 572 chg sides, 1263 chg coeffs, 0 upgd conss, 288579 impls, 0 clqs
1.69/1.70 c (round 68) 2034 del vars, 5551 del conss, 1150 chg bounds, 573 chg sides, 1265 chg coeffs, 0 upgd conss, 288607 impls, 0 clqs
1.69/1.71 c (round 69) 2042 del vars, 5576 del conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 0 upgd conss, 288779 impls, 0 clqs
1.69/1.72 c (round 70) 2042 del vars, 5586 del conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 0 upgd conss, 288779 impls, 0 clqs
1.79/1.84 c (round 71) 2042 del vars, 5611 del conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 7199 upgd conss, 288779 impls, 0 clqs
1.79/1.89 c (round 72) 2175 del vars, 5630 del conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 7199 upgd conss, 288779 impls, 0 clqs
1.89/1.93 c presolving (73 rounds):
1.89/1.93 c 2175 deleted vars, 5630 deleted constraints, 1154 tightened bounds, 0 added holes, 574 changed sides, 1266 changed coefficients
1.89/1.93 c 288779 implications, 0 cliques
1.89/1.93 c presolved problem has 2897 variables (2897 bin, 0 int, 0 impl, 0 cont) and 7199 constraints
1.89/1.93 c 1032 constraints of type <knapsack>
1.89/1.93 c 6167 constraints of type <logicor>
1.89/1.93 c transformed objective value is always integral (scale: 1)
1.89/1.93 c Presolving Time: 1.17
1.89/1.93 c - non default parameters ----------------------------------------------------------------------
1.89/1.93 c # SCIP version 1.2.1.2
1.89/1.93 c
1.89/1.93 c # frequency for displaying node information lines
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 100]
1.89/1.93 c display/freq = 10000
1.89/1.93 c
1.89/1.93 c # maximal time in seconds to run
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.93 c limits/time = 1799.75
1.89/1.93 c
1.89/1.93 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.93 c limits/memory = 1620
1.89/1.93 c
1.89/1.93 c # solving stops, if the given number of solutions were found (-1: no limit)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.93 c limits/solutions = 1
1.89/1.93 c
1.89/1.93 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.93 c lp/solvefreq = -1
1.89/1.93 c
1.89/1.93 c # maximal number of separation rounds per node (-1: unlimited)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 5]
1.89/1.93 c separating/maxrounds = 1
1.89/1.93 c
1.89/1.93 c # maximal number of separation rounds in the root node (-1: unlimited)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.93 c separating/maxroundsroot = 5
1.89/1.93 c
1.89/1.93 c # should presolving try to simplify inequalities
1.89/1.93 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.93 c constraints/linear/simplifyinequalities = TRUE
1.89/1.93 c
1.89/1.93 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.89/1.93 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.89/1.93 c constraints/knapsack/disaggregation = FALSE
1.89/1.93 c
1.89/1.93 c # should presolving try to simplify knapsacks
1.89/1.93 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.93 c constraints/knapsack/simplifyinequalities = TRUE
1.89/1.93 c
1.89/1.93 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.93 c presolving/probing/maxrounds = 0
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/coefdiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.93 c heuristics/coefdiving/maxlpiterquot = 0.075
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/coefdiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 30]
1.89/1.93 c heuristics/crossover/freq = -1
1.89/1.93 c
1.89/1.93 c # number of nodes added to the contingent of the total nodes
1.89/1.93 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.93 c heuristics/crossover/nodesofs = 750
1.89/1.93 c
1.89/1.93 c # number of nodes without incumbent change that heuristic should wait
1.89/1.93 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.89/1.93 c heuristics/crossover/nwaitingnodes = 100
1.89/1.93 c
1.89/1.93 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.89/1.93 c # [type: real, range: [0,1], default: 0.1]
1.89/1.93 c heuristics/crossover/nodesquot = 0.15
1.89/1.93 c
1.89/1.93 c # minimum percentage of integer variables that have to be fixed
1.89/1.93 c # [type: real, range: [0,1], default: 0.666]
1.89/1.93 c heuristics/crossover/minfixingrate = 0.5
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.93 c heuristics/feaspump/freq = -1
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/feaspump/maxlpiterofs = 2000
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/fracdiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.93 c heuristics/fracdiving/maxlpiterquot = 0.075
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/fracdiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/guideddiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.93 c heuristics/guideddiving/maxlpiterquot = 0.075
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/guideddiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.93 c heuristics/intdiving/maxlpiterquot = 0.075
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/intshifting/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/linesearchdiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.93 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.93 c heuristics/nlp/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.93 c heuristics/objpscostdiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to total iteration number
1.89/1.93 c # [type: real, range: [0,1], default: 0.01]
1.89/1.93 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.93 c heuristics/oneopt/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/pscostdiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.93 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/pscostdiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.93 c heuristics/rens/freq = -1
1.89/1.93 c
1.89/1.93 c # minimum percentage of integer variables that have to be fixable
1.89/1.93 c # [type: real, range: [0,1], default: 0.5]
1.89/1.93 c heuristics/rens/minfixingrate = 0.3
1.89/1.93 c
1.89/1.93 c # number of nodes added to the contingent of the total nodes
1.89/1.93 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.93 c heuristics/rens/nodesofs = 2000
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.93 c heuristics/rootsoldiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.89/1.93 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.93 c heuristics/rounding/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/shifting/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.93 c heuristics/simplerounding/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.93 c heuristics/trivial/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.93 c heuristics/trysol/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.93 c heuristics/veclendiving/freq = -1
1.89/1.93 c
1.89/1.93 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.93 c heuristics/veclendiving/maxlpiterquot = 0.075
1.89/1.93 c
1.89/1.93 c # additional number of allowed LP iterations
1.89/1.93 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.93 c heuristics/veclendiving/maxlpiterofs = 1500
1.89/1.93 c
1.89/1.93 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.93 c heuristics/zirounding/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.93 c separating/cmir/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.93 c separating/flowcover/freq = -1
1.89/1.93 c
1.89/1.93 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.89/1.93 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.93 c separating/rapidlearning/freq = 0
1.89/1.93 c
1.89/1.93 c -----------------------------------------------------------------------------------------------
1.89/1.93 c start solving
1.89/1.94 c
1.89/1.95 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.89/1.95 c 1.2s| 1 | 2 | 0 | - | 22M| 0 | - |2897 |7199 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
29.28/29.35 c
29.28/29.35 c SCIP Status : problem is solved [infeasible]
29.28/29.35 c Solving Time (sec) : 28.28
29.28/29.35 c Solving Nodes : 9250
29.28/29.35 c Primal Bound : +1.00000000000000e+20 (0 solutions)
29.28/29.35 c Dual Bound : +1.00000000000000e+20
29.28/29.35 c Gap : 0.00 %
29.28/29.35 s UNSATISFIABLE
29.28/29.35 c SCIP Status : problem is solved [infeasible]
29.28/29.35 c Solving Time : 28.28
29.28/29.35 c Original Problem :
29.28/29.35 c Problem name : HOME/instance-2664571-1276338589.opb
29.28/29.35 c Variables : 5072 (5072 binary, 0 integer, 0 implicit integer, 0 continuous)
29.28/29.35 c Constraints : 12829 initial, 12829 maximal
29.28/29.35 c Presolved Problem :
29.28/29.35 c Problem name : t_HOME/instance-2664571-1276338589.opb
29.28/29.35 c Variables : 2897 (2897 binary, 0 integer, 0 implicit integer, 0 continuous)
29.28/29.35 c Constraints : 7199 initial, 7614 maximal
29.28/29.35 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
29.28/29.35 c trivial : 0.03 28 0 0 0 0 0 0 0
29.28/29.35 c dualfix : 0.01 2 0 0 0 0 0 0 0
29.28/29.35 c boundshift : 0.00 0 0 0 0 0 0 0 0
29.28/29.35 c inttobinary : 0.00 0 0 0 0 0 0 0 0
29.28/29.35 c implics : 0.14 0 870 0 0 0 0 0 0
29.28/29.35 c probing : 0.00 0 0 0 0 0 0 0 0
29.28/29.35 c knapsack : 0.04 0 0 0 0 0 0 0 0
29.28/29.35 c linear : 0.78 1128 147 0 1154 0 5630 574 1266
29.28/29.35 c logicor : 0.06 0 0 0 0 0 0 0 0
29.28/29.35 c root node : - 162 - - 162 - - - -
29.28/29.35 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
29.28/29.35 c integral : 0 0 0 0 0 0 0 0 0 0
29.28/29.35 c knapsack : 1032 0 41005 0 8977 187 26011 0 0 0
29.28/29.35 c logicor : 6167+ 0 35912 0 8977 161 127423 0 0 0
29.28/29.35 c countsols : 0 0 0 0 8977 0 0 0 0 0
29.28/29.35 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
29.28/29.35 c integral : 0.00 0.00 0.00 0.00 0.00
29.28/29.35 c knapsack : 2.80 0.00 2.68 0.00 0.12
29.28/29.35 c logicor : 14.75 0.00 1.03 0.00 13.72
29.28/29.35 c countsols : 0.00 0.00 0.00 0.00 0.00
29.28/29.35 c Propagators : Time Calls Cutoffs DomReds
29.28/29.35 c vbounds : 0.03 1 0 0
29.28/29.35 c rootredcost : 0.01 0 0 0
29.28/29.35 c pseudoobj : 0.02 0 0 0
29.28/29.35 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
29.28/29.35 c propagation : 0.04 348 347 1227 16.4 55 8.7 -
29.28/29.35 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
29.28/29.35 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
29.28/29.35 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
29.28/29.35 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
29.28/29.35 c applied globally : - - - 811 14.6 - - -
29.28/29.35 c applied locally : - - - 0 0.0 - - -
29.28/29.35 c Separators : Time Calls Cutoffs DomReds Cuts Conss
29.28/29.35 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
29.28/29.35 c redcost : 0.00 0 0 0 0 0
29.28/29.35 c impliedbounds : 0.00 0 0 0 0 0
29.28/29.35 c intobj : 0.00 0 0 0 0 0
29.28/29.35 c cgmip : 0.00 0 0 0 0 0
29.28/29.35 c gomory : 0.00 0 0 0 0 0
29.28/29.35 c strongcg : 0.00 0 0 0 0 0
29.28/29.35 c cmir : 0.00 0 0 0 0 0
29.28/29.35 c flowcover : 0.00 0 0 0 0 0
29.28/29.35 c clique : 0.00 0 0 0 0 0
29.28/29.35 c zerohalf : 0.00 0 0 0 0 0
29.28/29.35 c mcf : 0.00 0 0 0 0 0
29.28/29.35 c rapidlearning : 0.00 0 0 0 0 0
29.28/29.35 c Pricers : Time Calls Vars
29.28/29.35 c problem variables: 0.00 0 0
29.28/29.35 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
29.28/29.35 c relpscost : 0.00 0 0 0 0 0 0
29.28/29.35 c pscost : 0.00 0 0 0 0 0 0
29.28/29.35 c inference : 7.41 8977 0 0 0 0 17954
29.28/29.35 c mostinf : 0.00 0 0 0 0 0 0
29.28/29.35 c leastinf : 0.00 0 0 0 0 0 0
29.28/29.35 c fullstrong : 0.00 0 0 0 0 0 0
29.28/29.35 c allfullstrong : 0.00 0 0 0 0 0 0
29.28/29.35 c random : 0.00 0 0 0 0 0 0
29.28/29.35 c Primal Heuristics : Time Calls Found
29.28/29.35 c LP solutions : 0.00 - 0
29.28/29.35 c pseudo solutions : 0.00 - 0
29.28/29.35 c trivial : 0.01 1 0
29.28/29.35 c simplerounding : 0.00 0 0
29.28/29.35 c zirounding : 0.00 0 0
29.28/29.35 c rounding : 0.00 0 0
29.28/29.35 c shifting : 0.00 0 0
29.28/29.35 c intshifting : 0.00 0 0
29.28/29.35 c oneopt : 0.00 0 0
29.28/29.35 c twoopt : 0.00 0 0
29.28/29.35 c fixandinfer : 0.00 0 0
29.28/29.35 c feaspump : 0.00 0 0
29.28/29.35 c coefdiving : 0.00 0 0
29.28/29.35 c pscostdiving : 0.00 0 0
29.28/29.35 c fracdiving : 0.00 0 0
29.28/29.35 c veclendiving : 0.00 0 0
29.28/29.35 c intdiving : 0.00 0 0
29.28/29.35 c actconsdiving : 0.00 0 0
29.28/29.35 c objpscostdiving : 0.00 0 0
29.28/29.35 c rootsoldiving : 0.00 0 0
29.28/29.35 c linesearchdiving : 0.00 0 0
29.28/29.35 c guideddiving : 0.00 0 0
29.28/29.35 c octane : 0.00 0 0
29.28/29.35 c rens : 0.00 0 0
29.28/29.35 c rins : 0.00 0 0
29.28/29.35 c localbranching : 0.00 0 0
29.28/29.35 c mutation : 0.00 0 0
29.28/29.35 c crossover : 0.00 0 0
29.28/29.35 c dins : 0.00 0 0
29.28/29.35 c undercover : 0.00 0 0
29.28/29.35 c nlp : 0.00 0 0
29.28/29.35 c trysol : 0.00 0 0
29.28/29.35 c LP : Time Calls Iterations Iter/call Iter/sec
29.28/29.35 c primal LP : 0.00 0 0 0.00 -
29.28/29.35 c dual LP : 0.00 0 0 0.00 -
29.28/29.35 c lex dual LP : 0.00 0 0 0.00 -
29.28/29.35 c barrier LP : 0.00 0 0 0.00 -
29.28/29.35 c diving/probing LP: 0.00 0 0 0.00 -
29.28/29.35 c strong branching : 0.00 0 0 0.00 -
29.28/29.35 c (at root node) : - 0 0 0.00 -
29.28/29.35 c conflict analysis: 0.00 0 0 0.00 -
29.28/29.35 c B&B Tree :
29.28/29.35 c number of runs : 1
29.28/29.35 c nodes : 9250
29.28/29.35 c nodes (total) : 9250
29.28/29.35 c nodes left : 0
29.28/29.35 c max depth : 166
29.28/29.35 c max depth (total): 166
29.28/29.35 c backtracks : 180 (1.9%)
29.28/29.35 c delayed cutoffs : 8705
29.28/29.35 c repropagations : 2681 (9749 domain reductions, 75 cutoffs)
29.28/29.35 c avg switch length: 2.70
29.28/29.35 c switching time : 1.29
29.28/29.35 c Solution :
29.28/29.35 c Solutions found : 0 (0 improvements)
29.28/29.35 c Primal Bound : infeasible
29.28/29.35 c Dual Bound : -
29.28/29.35 c Gap : 0.00 %
29.28/29.35 c Root Dual Bound : +0.00000000000000e+00
29.28/29.35 c Root Iterations : 0
29.38/29.41 c Time complete: 29.4.