0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3730847-1338691808.opb>
0.06/0.09 c original problem has 5072 variables (5072 bin, 0 int, 0 impl, 0 cont) and 12829 constraints
0.06/0.09 c problem read
0.06/0.09 c No objective function, only one solution is needed.
0.06/0.09 c presolving settings loaded
0.08/0.12 c presolving:
0.19/0.23 c (round 1) 443 del vars, 273 del conss, 0 add conss, 109 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250891 impls, 0 clqs
0.19/0.23 c (round 2) 445 del vars, 992 del conss, 0 add conss, 111 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250891 impls, 0 clqs
0.19/0.24 c (round 3) 447 del vars, 997 del conss, 0 add conss, 113 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250897 impls, 0 clqs
0.19/0.24 c (round 4) 451 del vars, 1003 del conss, 0 add conss, 117 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250897 impls, 0 clqs
0.19/0.24 c (round 5) 458 del vars, 1013 del conss, 0 add conss, 121 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250923 impls, 0 clqs
0.19/0.24 c (round 6) 465 del vars, 1030 del conss, 0 add conss, 125 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250955 impls, 0 clqs
0.19/0.25 c (round 7) 472 del vars, 1047 del conss, 0 add conss, 129 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 250973 impls, 0 clqs
0.19/0.25 c (round 8) 479 del vars, 1064 del conss, 0 add conss, 133 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251029 impls, 0 clqs
0.19/0.25 c (round 9) 486 del vars, 1081 del conss, 0 add conss, 137 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251085 impls, 0 clqs
0.19/0.25 c (round 10) 496 del vars, 1104 del conss, 0 add conss, 141 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251179 impls, 0 clqs
0.19/0.25 c (round 11) 503 del vars, 1127 del conss, 0 add conss, 145 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251197 impls, 0 clqs
0.19/0.26 c (round 12) 512 del vars, 1146 del conss, 0 add conss, 149 chg bounds, 554 chg sides, 1242 chg coeffs, 0 upgd conss, 251417 impls, 0 clqs
0.19/0.26 c (round 13) 523 del vars, 1167 del conss, 0 add conss, 153 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 251949 impls, 0 clqs
0.19/0.26 c (round 14) 530 del vars, 1196 del conss, 0 add conss, 157 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 252007 impls, 0 clqs
0.19/0.26 c (round 15) 538 del vars, 1218 del conss, 0 add conss, 161 chg bounds, 558 chg sides, 1246 chg coeffs, 0 upgd conss, 252151 impls, 0 clqs
0.19/0.27 c (round 16) 547 del vars, 1237 del conss, 0 add conss, 165 chg bounds, 560 chg sides, 1248 chg coeffs, 0 upgd conss, 252453 impls, 0 clqs
0.19/0.27 c (round 17) 555 del vars, 1268 del conss, 0 add conss, 171 chg bounds, 560 chg sides, 1248 chg coeffs, 0 upgd conss, 252457 impls, 0 clqs
0.19/0.27 c (round 18) 564 del vars, 1285 del conss, 0 add conss, 177 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252463 impls, 0 clqs
0.19/0.27 c (round 19) 571 del vars, 1303 del conss, 0 add conss, 181 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252475 impls, 0 clqs
0.19/0.27 c (round 20) 578 del vars, 1320 del conss, 0 add conss, 185 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252499 impls, 0 clqs
0.19/0.28 c (round 21) 586 del vars, 1337 del conss, 0 add conss, 189 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252559 impls, 0 clqs
0.19/0.28 c (round 22) 592 del vars, 1355 del conss, 0 add conss, 195 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252561 impls, 0 clqs
0.19/0.28 c (round 23) 613 del vars, 1398 del conss, 0 add conss, 209 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 252867 impls, 0 clqs
0.19/0.29 c (round 24) 714 del vars, 1630 del conss, 0 add conss, 275 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 255842 impls, 0 clqs
0.19/0.29 c (round 25) 730 del vars, 1743 del conss, 0 add conss, 286 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256435 impls, 0 clqs
0.29/0.30 c (round 26) 737 del vars, 1763 del conss, 0 add conss, 290 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256463 impls, 0 clqs
0.29/0.30 c (round 27) 743 del vars, 1783 del conss, 0 add conss, 296 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256465 impls, 0 clqs
0.29/0.30 c (round 28) 751 del vars, 1798 del conss, 0 add conss, 300 chg bounds, 562 chg sides, 1250 chg coeffs, 0 upgd conss, 256543 impls, 0 clqs
0.29/0.30 c (round 29) 759 del vars, 1820 del conss, 0 add conss, 306 chg bounds, 564 chg sides, 1252 chg coeffs, 0 upgd conss, 256549 impls, 0 clqs
0.29/0.31 c (round 30) 767 del vars, 1845 del conss, 0 add conss, 312 chg bounds, 564 chg sides, 1252 chg coeffs, 0 upgd conss, 256699 impls, 0 clqs
0.29/0.32 c (round 31) 883 del vars, 2087 del conss, 0 add conss, 385 chg bounds, 566 chg sides, 1254 chg coeffs, 0 upgd conss, 259737 impls, 0 clqs
0.29/0.32 c (round 32) 890 del vars, 2203 del conss, 0 add conss, 391 chg bounds, 566 chg sides, 1254 chg coeffs, 0 upgd conss, 259813 impls, 0 clqs
0.29/0.32 c (round 33) 898 del vars, 2220 del conss, 0 add conss, 397 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 259997 impls, 0 clqs
0.29/0.32 c (round 34) 904 del vars, 2237 del conss, 0 add conss, 403 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 259999 impls, 0 clqs
0.29/0.33 c (round 35) 920 del vars, 2270 del conss, 0 add conss, 414 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260418 impls, 0 clqs
0.29/0.33 c (round 36) 926 del vars, 2293 del conss, 0 add conss, 420 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260420 impls, 0 clqs
0.29/0.33 c (round 37) 932 del vars, 2306 del conss, 0 add conss, 426 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260422 impls, 0 clqs
0.29/0.33 c (round 38) 938 del vars, 2319 del conss, 0 add conss, 432 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260424 impls, 0 clqs
0.29/0.33 c (round 39) 950 del vars, 2336 del conss, 0 add conss, 454 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 260878 impls, 0 clqs
0.29/0.34 c (round 40) 1000 del vars, 2448 del conss, 0 add conss, 460 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262390 impls, 0 clqs
0.29/0.34 c (round 41) 1008 del vars, 2516 del conss, 0 add conss, 465 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262448 impls, 0 clqs
0.29/0.34 c (round 42) 1016 del vars, 2534 del conss, 0 add conss, 469 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262586 impls, 0 clqs
0.29/0.34 c (round 43) 1028 del vars, 2570 del conss, 0 add conss, 478 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 262614 impls, 0 clqs
0.29/0.35 c (round 44) 1041 del vars, 2591 del conss, 0 add conss, 484 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263198 impls, 0 clqs
0.29/0.35 c (round 45) 1052 del vars, 2622 del conss, 0 add conss, 492 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263274 impls, 0 clqs
0.29/0.35 c (round 46) 1060 del vars, 2647 del conss, 0 add conss, 500 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263418 impls, 0 clqs
0.29/0.35 c (round 47) 1076 del vars, 2677 del conss, 0 add conss, 514 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 263648 impls, 0 clqs
0.29/0.36 c (round 48) 1100 del vars, 2729 del conss, 0 add conss, 531 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 264039 impls, 0 clqs
0.29/0.36 c (round 49) 1139 del vars, 2818 del conss, 0 add conss, 554 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 265445 impls, 0 clqs
0.29/0.37 c (round 50) 1160 del vars, 2899 del conss, 0 add conss, 569 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 266173 impls, 0 clqs
0.29/0.37 c (round 51) 1179 del vars, 2957 del conss, 0 add conss, 581 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 266808 impls, 0 clqs
0.29/0.38 c (round 52) 1267 del vars, 3164 del conss, 0 add conss, 639 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 267996 impls, 0 clqs
0.29/0.38 c (round 53) 1320 del vars, 3373 del conss, 0 add conss, 684 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 268515 impls, 0 clqs
0.29/0.38 c (round 54) 1353 del vars, 3465 del conss, 0 add conss, 708 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 269383 impls, 0 clqs
0.29/0.39 c (round 55) 1392 del vars, 3571 del conss, 0 add conss, 726 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270698 impls, 0 clqs
0.29/0.39 c (round 56) 1410 del vars, 3649 del conss, 0 add conss, 730 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270996 impls, 0 clqs
0.29/0.39 c (round 57) 1415 del vars, 3682 del conss, 0 add conss, 734 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 270998 impls, 0 clqs
0.29/0.39 c (round 58) 1421 del vars, 3695 del conss, 0 add conss, 740 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 271076 impls, 0 clqs
0.39/0.40 c (round 59) 1433 del vars, 3719 del conss, 0 add conss, 749 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 271325 impls, 0 clqs
0.39/0.40 c (round 60) 1451 del vars, 3762 del conss, 0 add conss, 759 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 272489 impls, 0 clqs
0.39/0.40 c (round 61) 1465 del vars, 3805 del conss, 0 add conss, 766 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 273032 impls, 0 clqs
0.39/0.40 c (round 62) 1473 del vars, 3837 del conss, 0 add conss, 770 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 273128 impls, 0 clqs
0.39/0.42 c (round 63) 1928 del vars, 4866 del conss, 0 add conss, 1099 chg bounds, 568 chg sides, 1256 chg coeffs, 0 upgd conss, 281318 impls, 0 clqs
0.39/0.43 c (round 64) 1969 del vars, 5303 del conss, 0 add conss, 1117 chg bounds, 569 chg sides, 1259 chg coeffs, 0 upgd conss, 284940 impls, 0 clqs
0.39/0.43 c (round 65) 1997 del vars, 5411 del conss, 0 add conss, 1134 chg bounds, 569 chg sides, 1260 chg coeffs, 0 upgd conss, 287724 impls, 0 clqs
0.39/0.43 c (round 66) 2018 del vars, 5476 del conss, 0 add conss, 1142 chg bounds, 569 chg sides, 1260 chg coeffs, 0 upgd conss, 288342 impls, 0 clqs
0.39/0.44 c (round 67) 2031 del vars, 5532 del conss, 0 add conss, 1150 chg bounds, 572 chg sides, 1263 chg coeffs, 0 upgd conss, 288579 impls, 0 clqs
0.39/0.44 c (round 68) 2034 del vars, 5551 del conss, 0 add conss, 1150 chg bounds, 573 chg sides, 1265 chg coeffs, 0 upgd conss, 288607 impls, 0 clqs
0.39/0.44 c (round 69) 2042 del vars, 5576 del conss, 0 add conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 0 upgd conss, 288779 impls, 0 clqs
0.39/0.44 c (round 70) 2042 del vars, 5586 del conss, 0 add conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 0 upgd conss, 288779 impls, 0 clqs
0.39/0.48 c (round 71) 2042 del vars, 5611 del conss, 0 add conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 7199 upgd conss, 288779 impls, 0 clqs
0.48/0.51 c (round 72) 2175 del vars, 5630 del conss, 0 add conss, 1154 chg bounds, 574 chg sides, 1266 chg coeffs, 7199 upgd conss, 288779 impls, 0 clqs
0.48/0.53 c presolving (73 rounds):
0.48/0.53 c 2175 deleted vars, 5630 deleted constraints, 0 added constraints, 1154 tightened bounds, 0 added holes, 574 changed sides, 1266 changed coefficients
0.48/0.53 c 288779 implications, 0 cliques
0.48/0.53 c presolved problem has 2897 variables (2897 bin, 0 int, 0 impl, 0 cont) and 7199 constraints
0.48/0.53 c 1032 constraints of type <knapsack>
0.48/0.53 c 4155 constraints of type <setppc>
0.48/0.53 c 2012 constraints of type <logicor>
0.48/0.53 c transformed objective value is always integral (scale: 1)
0.48/0.53 c Presolving Time: 0.42
0.48/0.53 c - non default parameters ----------------------------------------------------------------------
0.48/0.53 c # SCIP version 2.0.1.5
0.48/0.53 c
0.48/0.53 c # frequency for displaying node information lines
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 100]
0.48/0.53 c display/freq = 10000
0.48/0.53 c
0.48/0.53 c # maximal time in seconds to run
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.48/0.53 c limits/time = 1797
0.48/0.53 c
0.48/0.53 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.48/0.53 c limits/memory = 13950
0.48/0.53 c
0.48/0.53 c # solving stops, if the given number of solutions were found (-1: no limit)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: -1]
0.48/0.53 c limits/solutions = 1
0.48/0.53 c
0.48/0.53 c # maximal number of separation rounds per node (-1: unlimited)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 5]
0.48/0.53 c separating/maxrounds = 1
0.48/0.53 c
0.48/0.53 c # maximal number of separation rounds in the root node (-1: unlimited)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: -1]
0.48/0.53 c separating/maxroundsroot = 5
0.48/0.53 c
0.48/0.53 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.48/0.53 c # [type: int, range: [1,2], default: 1]
0.48/0.53 c timing/clocktype = 2
0.48/0.53 c
0.48/0.53 c # belongs reading time to solving time?
0.48/0.53 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.48/0.53 c timing/reading = TRUE
0.48/0.53 c
0.48/0.53 c # should presolving try to simplify inequalities
0.48/0.53 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.48/0.53 c constraints/linear/simplifyinequalities = TRUE
0.48/0.53 c
0.48/0.53 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.48/0.53 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.48/0.53 c constraints/indicator/addCouplingCons = TRUE
0.48/0.53 c
0.48/0.53 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.48/0.53 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.48/0.53 c constraints/knapsack/disaggregation = FALSE
0.48/0.53 c
0.48/0.53 c # should presolving try to simplify knapsacks
0.48/0.53 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.48/0.53 c constraints/knapsack/simplifyinequalities = TRUE
0.48/0.53 c
0.48/0.53 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: -1]
0.48/0.53 c presolving/probing/maxrounds = 0
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/coefdiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.48/0.53 c heuristics/coefdiving/maxlpiterquot = 0.075
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/coefdiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 30]
0.48/0.53 c heuristics/crossover/freq = -1
0.48/0.53 c
0.48/0.53 c # number of nodes added to the contingent of the total nodes
0.48/0.53 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.48/0.53 c heuristics/crossover/nodesofs = 750
0.48/0.53 c
0.48/0.53 c # number of nodes without incumbent change that heuristic should wait
0.48/0.53 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.48/0.53 c heuristics/crossover/nwaitingnodes = 100
0.48/0.53 c
0.48/0.53 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.48/0.53 c # [type: real, range: [0,1], default: 0.1]
0.48/0.53 c heuristics/crossover/nodesquot = 0.15
0.48/0.53 c
0.48/0.53 c # minimum percentage of integer variables that have to be fixed
0.48/0.53 c # [type: real, range: [0,1], default: 0.666]
0.48/0.53 c heuristics/crossover/minfixingrate = 0.5
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 20]
0.48/0.53 c heuristics/feaspump/freq = -1
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/feaspump/maxlpiterofs = 2000
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/fracdiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.48/0.53 c heuristics/fracdiving/maxlpiterquot = 0.075
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/fracdiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/guideddiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.48/0.53 c heuristics/guideddiving/maxlpiterquot = 0.075
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/guideddiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.48/0.53 c heuristics/intdiving/maxlpiterquot = 0.075
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/intshifting/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/linesearchdiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.48/0.53 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 20]
0.48/0.53 c heuristics/objpscostdiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to total iteration number
0.48/0.53 c # [type: real, range: [0,1], default: 0.01]
0.48/0.53 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 1]
0.48/0.53 c heuristics/oneopt/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/pscostdiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.48/0.53 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/pscostdiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 0]
0.48/0.53 c heuristics/rens/freq = -1
0.48/0.53 c
0.48/0.53 c # minimum percentage of integer variables that have to be fixable
0.48/0.53 c # [type: real, range: [0,1], default: 0.5]
0.48/0.53 c heuristics/rens/minfixingrate = 0.3
0.48/0.53 c
0.48/0.53 c # number of nodes added to the contingent of the total nodes
0.48/0.53 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.48/0.53 c heuristics/rens/nodesofs = 2000
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 20]
0.48/0.53 c heuristics/rootsoldiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.48/0.53 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 1]
0.48/0.53 c heuristics/rounding/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 0]
0.48/0.53 c heuristics/shiftandpropagate/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/shifting/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 1]
0.48/0.53 c heuristics/simplerounding/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 1]
0.48/0.53 c heuristics/subnlp/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 0]
0.48/0.53 c heuristics/trivial/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 1]
0.48/0.53 c heuristics/trysol/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 0]
0.48/0.53 c heuristics/undercover/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 10]
0.48/0.53 c heuristics/veclendiving/freq = -1
0.48/0.53 c
0.48/0.53 c # maximal fraction of diving LP iterations compared to node LP iterations
0.48/0.53 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.48/0.53 c heuristics/veclendiving/maxlpiterquot = 0.075
0.48/0.53 c
0.48/0.53 c # additional number of allowed LP iterations
0.48/0.53 c # [type: int, range: [0,2147483647], default: 1000]
0.48/0.53 c heuristics/veclendiving/maxlpiterofs = 1500
0.48/0.53 c
0.48/0.53 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 1]
0.48/0.53 c heuristics/zirounding/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 0]
0.48/0.53 c separating/cmir/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: 0]
0.48/0.53 c separating/flowcover/freq = -1
0.48/0.53 c
0.48/0.53 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.48/0.53 c # [type: int, range: [-1,2147483647], default: -1]
0.48/0.53 c separating/rapidlearning/freq = 0
0.48/0.53 c
0.48/0.53 c -----------------------------------------------------------------------------------------------
0.48/0.53 c start solving
0.48/0.53 c
0.59/0.60 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.60 c 0.6s| 1 | 0 | 970 | - | 27M| 0 | 799 |2897 |7199 |2897 |7199 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 1853 | - | 27M| 0 |1043 |2897 |7132 |2897 |7143 | 50 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.5s| 1 | 0 | 2872 | - | 27M| 0 |1115 |2897 |7132 |2897 |7213 | 120 | 0 | 0 | 0.000000e+00 | -- | Inf
1.98/2.09 c 2.1s| 1 | 0 | 3568 | - | 27M| 0 |1074 |2897 |7132 |2897 |7298 | 205 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.74 c 2.7s| 1 | 0 | 5161 | - | 28M| 0 |1295 |2897 |7132 |2897 |7392 | 299 | 0 | 0 | 0.000000e+00 | -- | Inf
3.58/3.68 c 3.7s| 1 | 0 | 7152 | - | 28M| 0 |1596 |2897 |7132 |2897 |7508 | 415 | 0 | 0 | 0.000000e+00 | -- | Inf
5.88/5.94 c 5.9s| 1 | 2 | 7152 | - | 28M| 0 |1596 |2897 |7132 |2897 |7508 | 415 | 0 | 10 | 0.000000e+00 | -- | Inf
45.98/46.10 c
45.98/46.10 c SCIP Status : problem is solved [infeasible]
45.98/46.10 c Solving Time (sec) : 46.09
45.98/46.10 c Solving Nodes : 193
45.98/46.10 c Primal Bound : +1.00000000000000e+20 (0 solutions)
45.98/46.10 c Dual Bound : +1.00000000000000e+20
45.98/46.10 c Gap : 0.00 %
45.98/46.10 s UNSATISFIABLE
45.98/46.10 c SCIP Status : problem is solved [infeasible]
45.98/46.10 c Total Time : 46.09
45.98/46.10 c solving : 46.09
45.98/46.10 c presolving : 0.42 (included in solving)
45.98/46.10 c reading : 0.09 (included in solving)
45.98/46.10 c Original Problem :
45.98/46.10 c Problem name : HOME/instance-3730847-1338691808.opb
45.98/46.10 c Variables : 5072 (5072 binary, 0 integer, 0 implicit integer, 0 continuous)
45.98/46.10 c Constraints : 12829 initial, 12829 maximal
45.98/46.10 c Presolved Problem :
45.98/46.10 c Problem name : t_HOME/instance-3730847-1338691808.opb
45.98/46.10 c Variables : 2897 (2897 binary, 0 integer, 0 implicit integer, 0 continuous)
45.98/46.10 c Constraints : 7199 initial, 7241 maximal
45.98/46.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
45.98/46.10 c trivial : 0.01 28 0 0 0 0 0 0 0 0
45.98/46.10 c dualfix : 0.01 2 0 0 0 0 0 0 0 0
45.98/46.10 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
45.98/46.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
45.98/46.10 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
45.98/46.10 c implics : 0.06 0 870 0 0 0 0 0 0 0
45.98/46.10 c probing : 0.00 0 0 0 0 0 0 0 0 0
45.98/46.10 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
45.98/46.10 c setppc : 0.01 0 0 0 0 0 0 0 0 0
45.98/46.10 c linear : 0.25 1128 147 0 1154 0 5630 0 574 1266
45.98/46.10 c logicor : 0.02 0 0 0 0 0 0 0 0 0
45.98/46.10 c root node : - 159 - - 159 - - - - -
45.98/46.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
45.98/46.10 c integral : 0 0 0 187 0 1 0 6 3 0 0 360
45.98/46.10 c knapsack : 1032 6 572 0 0 0 20 3 322 1201 0 0
45.98/46.10 c setppc : 4155 6 569 0 0 0 289 6 3152 0 0 0
45.98/46.10 c linear : 0+ 5 348 0 0 0 0 0 1 0 0 0
45.98/46.10 c logicor : 2012+ 6 342 0 0 0 144 4 1087 0 0 0
45.98/46.10 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
45.98/46.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
45.98/46.10 c integral : 36.31 0.00 0.00 36.31 0.00 0.00 0.00
45.98/46.10 c knapsack : 0.03 0.02 0.02 0.00 0.00 0.00 0.00
45.98/46.10 c setppc : 0.03 0.00 0.03 0.00 0.00 0.00 0.00
45.98/46.10 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
45.98/46.10 c logicor : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
45.98/46.10 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
45.98/46.10 c Propagators : #Propagate #Resprop Cutoffs DomReds
45.98/46.10 c vbounds : 0 0 0 0
45.98/46.10 c rootredcost : 0 0 0 0
45.98/46.10 c pseudoobj : 0 0 0 0
45.98/46.10 c Propagator Timings : TotalTime Propagate Resprop
45.98/46.10 c vbounds : 0.00 0.00 0.00
45.98/46.10 c rootredcost : 0.00 0.00 0.00
45.98/46.10 c pseudoobj : 0.00 0.00 0.00
45.98/46.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
45.98/46.10 c propagation : 0.00 13 12 26 6.3 12 3.5 -
45.98/46.10 c infeasible LP : 0.00 2 2 2 3.5 0 0.0 0
45.98/46.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
45.98/46.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
45.98/46.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
45.98/46.10 c applied globally : - - - 34 4.6 - - -
45.98/46.10 c applied locally : - - - 0 0.0 - - -
45.98/46.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
45.98/46.10 c cut pool : 0.00 4 - - 29 - (maximal pool size: 553)
45.98/46.10 c redcost : 0.01 191 0 0 0 0
45.98/46.10 c impliedbounds : 0.00 5 0 0 0 0
45.98/46.10 c intobj : 0.00 0 0 0 0 0
45.98/46.10 c gomory : 0.64 5 0 0 2500 0
45.98/46.10 c cgmip : 0.00 0 0 0 0 0
45.98/46.10 c closecuts : 0.00 0 0 0 0 0
45.98/46.10 c strongcg : 0.83 5 0 0 2500 0
45.98/46.10 c cmir : 0.00 0 0 0 0 0
45.98/46.10 c flowcover : 0.00 0 0 0 0 0
45.98/46.10 c clique : 0.07 5 0 0 38 0
45.98/46.10 c zerohalf : 0.00 0 0 0 0 0
45.98/46.10 c mcf : 0.02 1 0 0 0 0
45.98/46.10 c oddcycle : 0.00 0 0 0 0 0
45.98/46.10 c rapidlearning : 0.21 1 0 29 0 42
45.98/46.10 c Pricers : Time Calls Vars
45.98/46.10 c problem variables: 0.00 0 0
45.98/46.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
45.98/46.10 c relpscost : 36.31 187 6 3 0 0 360
45.98/46.10 c pscost : 0.00 0 0 0 0 0 0
45.98/46.10 c inference : 0.00 0 0 0 0 0 0
45.98/46.10 c mostinf : 0.00 0 0 0 0 0 0
45.98/46.10 c leastinf : 0.00 0 0 0 0 0 0
45.98/46.10 c fullstrong : 0.00 0 0 0 0 0 0
45.98/46.10 c allfullstrong : 0.00 0 0 0 0 0 0
45.98/46.10 c random : 0.00 0 0 0 0 0 0
45.98/46.10 c Primal Heuristics : Time Calls Found
45.98/46.10 c LP solutions : 0.00 - 0
45.98/46.10 c pseudo solutions : 0.00 - 0
45.98/46.10 c trivial : 0.00 1 0
45.98/46.10 c shiftandpropagate: 0.00 0 0
45.98/46.10 c simplerounding : 0.00 0 0
45.98/46.10 c zirounding : 0.00 0 0
45.98/46.10 c rounding : 0.00 0 0
45.98/46.10 c shifting : 0.00 0 0
45.98/46.10 c intshifting : 0.00 0 0
45.98/46.10 c oneopt : 0.00 0 0
45.98/46.10 c twoopt : 0.00 0 0
45.98/46.10 c fixandinfer : 0.00 0 0
45.98/46.10 c feaspump : 0.00 0 0
45.98/46.10 c clique : 0.00 0 0
45.98/46.10 c coefdiving : 0.00 0 0
45.98/46.10 c pscostdiving : 0.00 0 0
45.98/46.10 c fracdiving : 0.00 0 0
45.98/46.10 c veclendiving : 0.00 0 0
45.98/46.10 c intdiving : 0.00 0 0
45.98/46.10 c actconsdiving : 0.00 0 0
45.98/46.10 c objpscostdiving : 0.00 0 0
45.98/46.10 c rootsoldiving : 0.00 0 0
45.98/46.10 c linesearchdiving : 0.00 0 0
45.98/46.10 c guideddiving : 0.00 0 0
45.98/46.10 c octane : 0.00 0 0
45.98/46.10 c rens : 0.00 0 0
45.98/46.10 c rins : 0.00 0 0
45.98/46.10 c localbranching : 0.00 0 0
45.98/46.10 c mutation : 0.00 0 0
45.98/46.10 c crossover : 0.00 0 0
45.98/46.10 c dins : 0.00 0 0
45.98/46.10 c vbounds : 0.00 0 0
45.98/46.10 c undercover : 0.00 0 0
45.98/46.10 c subnlp : 0.00 0 0
45.98/46.10 c trysol : 0.00 0 0
45.98/46.10 c LP : Time Calls Iterations Iter/call Iter/sec
45.98/46.10 c primal LP : 0.00 0 0 0.00 -
45.98/46.10 c dual LP : 7.13 194 32602 168.05 4569.64
45.98/46.10 c lex dual LP : 0.00 0 0 0.00 -
45.98/46.10 c barrier LP : 0.00 0 0 0.00 -
45.98/46.10 c diving/probing LP: 0.00 0 0 0.00 -
45.98/46.10 c strong branching : 36.27 245 124364 507.61 3428.86
45.98/46.10 c (at root node) : - 10 6784 678.40 -
45.98/46.10 c conflict analysis: 0.00 0 0 0.00 -
45.98/46.10 c B&B Tree :
45.98/46.10 c number of runs : 1
45.98/46.10 c nodes : 193
45.98/46.10 c nodes (total) : 193
45.98/46.10 c nodes left : 0
45.98/46.10 c max depth : 155
45.98/46.10 c max depth (total): 155
45.98/46.10 c backtracks : 11 (5.7%)
45.98/46.10 c delayed cutoffs : 168
45.98/46.10 c repropagations : 56 (576 domain reductions, 8 cutoffs)
45.98/46.10 c avg switch length: 2.47
45.98/46.10 c switching time : 0.04
45.98/46.10 c Solution :
45.98/46.10 c Solutions found : 0 (0 improvements)
45.98/46.10 c Primal Bound : infeasible
45.98/46.10 c Dual Bound : -
45.98/46.10 c Gap : 0.00 %
45.98/46.10 c Root Dual Bound : +0.00000000000000e+00
45.98/46.10 c Root Iterations : 7152
46.09/46.14 c Time complete: 46.11.