0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667418-1276335373.opb>
0.10/0.18 c original problem has 3655 variables (3655 bin, 0 int, 0 impl, 0 cont) and 8686 constraints
0.10/0.18 c problem read
0.10/0.18 c No objective function, only one solution is needed.
0.10/0.18 c presolving settings loaded
0.19/0.24 c presolving:
0.29/0.39 c (round 1) 404 del vars, 246 del conss, 81 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150967 impls, 0 clqs
0.39/0.41 c (round 2) 406 del vars, 908 del conss, 83 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150967 impls, 0 clqs
0.39/0.42 c (round 3) 408 del vars, 913 del conss, 85 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150973 impls, 0 clqs
0.39/0.43 c (round 4) 412 del vars, 919 del conss, 89 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 150973 impls, 0 clqs
0.39/0.44 c (round 5) 419 del vars, 929 del conss, 93 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151045 impls, 0 clqs
0.39/0.45 c (round 6) 426 del vars, 946 del conss, 97 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151147 impls, 0 clqs
0.39/0.46 c (round 7) 444 del vars, 983 del conss, 105 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151617 impls, 0 clqs
0.39/0.48 c (round 8) 451 del vars, 1014 del conss, 109 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151657 impls, 0 clqs
0.39/0.49 c (round 9) 460 del vars, 1033 del conss, 113 chg bounds, 352 chg sides, 754 chg coeffs, 0 upgd conss, 151861 impls, 0 clqs
0.49/0.50 c (round 10) 471 del vars, 1054 del conss, 117 chg bounds, 356 chg sides, 758 chg coeffs, 0 upgd conss, 152197 impls, 0 clqs
0.49/0.51 c (round 11) 481 del vars, 1089 del conss, 122 chg bounds, 356 chg sides, 758 chg coeffs, 0 upgd conss, 152454 impls, 0 clqs
0.49/0.52 c (round 12) 490 del vars, 1110 del conss, 126 chg bounds, 358 chg sides, 760 chg coeffs, 0 upgd conss, 152724 impls, 0 clqs
0.49/0.53 c (round 13) 501 del vars, 1142 del conss, 132 chg bounds, 358 chg sides, 760 chg coeffs, 0 upgd conss, 152981 impls, 0 clqs
0.49/0.55 c (round 14) 511 del vars, 1164 del conss, 136 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153259 impls, 0 clqs
0.49/0.56 c (round 15) 518 del vars, 1189 del conss, 140 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153283 impls, 0 clqs
0.49/0.57 c (round 16) 524 del vars, 1207 del conss, 146 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153285 impls, 0 clqs
0.49/0.58 c (round 17) 530 del vars, 1220 del conss, 152 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153287 impls, 0 clqs
0.49/0.59 c (round 18) 536 del vars, 1233 del conss, 158 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153289 impls, 0 clqs
0.59/0.60 c (round 19) 543 del vars, 1249 del conss, 164 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153341 impls, 0 clqs
0.59/0.61 c (round 20) 550 del vars, 1261 del conss, 168 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153381 impls, 0 clqs
0.59/0.62 c (round 21) 564 del vars, 1295 del conss, 177 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153483 impls, 0 clqs
0.59/0.63 c (round 22) 570 del vars, 1316 del conss, 183 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153485 impls, 0 clqs
0.59/0.64 c (round 23) 579 del vars, 1335 del conss, 190 chg bounds, 360 chg sides, 762 chg coeffs, 0 upgd conss, 153736 impls, 0 clqs
0.59/0.65 c (round 24) 588 del vars, 1354 del conss, 196 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 154030 impls, 0 clqs
0.59/0.67 c (round 25) 604 del vars, 1394 del conss, 207 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 154252 impls, 0 clqs
0.59/0.68 c (round 26) 629 del vars, 1445 del conss, 231 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 154284 impls, 0 clqs
0.59/0.69 c (round 27) 682 del vars, 1522 del conss, 259 chg bounds, 362 chg sides, 764 chg coeffs, 0 upgd conss, 155583 impls, 0 clqs
0.69/0.70 c (round 28) 730 del vars, 1671 del conss, 284 chg bounds, 364 chg sides, 766 chg coeffs, 0 upgd conss, 156493 impls, 0 clqs
0.69/0.72 c (round 29) 737 del vars, 1730 del conss, 286 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 156677 impls, 0 clqs
0.69/0.73 c (round 30) 758 del vars, 1784 del conss, 305 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 156748 impls, 0 clqs
0.69/0.74 c (round 31) 781 del vars, 1831 del conss, 316 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 156985 impls, 0 clqs
0.69/0.75 c (round 32) 787 del vars, 1864 del conss, 321 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157006 impls, 0 clqs
0.69/0.76 c (round 33) 795 del vars, 1884 del conss, 327 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157114 impls, 0 clqs
0.69/0.77 c (round 34) 803 del vars, 1904 del conss, 333 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157236 impls, 0 clqs
0.69/0.78 c (round 35) 807 del vars, 1918 del conss, 337 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 157340 impls, 0 clqs
0.69/0.79 c (round 36) 819 del vars, 1940 del conss, 345 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 158170 impls, 0 clqs
0.79/0.81 c (round 37) 904 del vars, 2109 del conss, 392 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 159539 impls, 0 clqs
0.79/0.83 c (round 38) 965 del vars, 2325 del conss, 428 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 163901 impls, 0 clqs
0.79/0.84 c (round 39) 970 del vars, 2386 del conss, 433 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 163901 impls, 0 clqs
0.79/0.85 c (round 40) 997 del vars, 2439 del conss, 448 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 165552 impls, 0 clqs
0.79/0.86 c (round 41) 1016 del vars, 2504 del conss, 458 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 165750 impls, 0 clqs
0.79/0.87 c (round 42) 1026 del vars, 2548 del conss, 467 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 165786 impls, 0 clqs
0.79/0.88 c (round 43) 1040 del vars, 2586 del conss, 476 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166002 impls, 0 clqs
0.79/0.89 c (round 44) 1048 del vars, 2612 del conss, 481 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166036 impls, 0 clqs
0.89/0.90 c (round 45) 1061 del vars, 2640 del conss, 488 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166196 impls, 0 clqs
0.89/0.91 c (round 46) 1074 del vars, 2678 del conss, 495 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166210 impls, 0 clqs
0.89/0.92 c (round 47) 1078 del vars, 2708 del conss, 498 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166214 impls, 0 clqs
0.89/0.93 c (round 48) 1081 del vars, 2716 del conss, 500 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166220 impls, 0 clqs
0.89/0.94 c (round 49) 1089 del vars, 2733 del conss, 506 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166364 impls, 0 clqs
0.89/0.95 c (round 50) 1102 del vars, 2768 del conss, 513 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166552 impls, 0 clqs
0.89/0.96 c (round 51) 1108 del vars, 2793 del conss, 515 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166692 impls, 0 clqs
0.89/0.97 c (round 52) 1117 del vars, 2820 del conss, 520 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166835 impls, 0 clqs
0.89/0.98 c (round 53) 1121 del vars, 2839 del conss, 523 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166845 impls, 0 clqs
0.89/0.99 c (round 54) 1127 del vars, 2850 del conss, 527 chg bounds, 366 chg sides, 768 chg coeffs, 0 upgd conss, 166855 impls, 0 clqs
0.89/0.99 c (round 55) 1135 del vars, 2873 del conss, 531 chg bounds, 367 chg sides, 769 chg coeffs, 0 upgd conss, 167017 impls, 0 clqs
0.99/1.00 c (round 56) 1139 del vars, 2891 del conss, 533 chg bounds, 368 chg sides, 771 chg coeffs, 0 upgd conss, 167029 impls, 0 clqs
0.99/1.01 c (round 57) 1155 del vars, 2922 del conss, 540 chg bounds, 369 chg sides, 773 chg coeffs, 0 upgd conss, 167296 impls, 0 clqs
0.99/1.02 c (round 58) 1166 del vars, 2959 del conss, 543 chg bounds, 369 chg sides, 773 chg coeffs, 0 upgd conss, 167473 impls, 0 clqs
0.99/1.03 c (round 59) 1174 del vars, 2986 del conss, 545 chg bounds, 372 chg sides, 776 chg coeffs, 0 upgd conss, 167589 impls, 0 clqs
0.99/1.04 c (round 60) 1178 del vars, 3002 del conss, 545 chg bounds, 374 chg sides, 780 chg coeffs, 0 upgd conss, 167613 impls, 0 clqs
0.99/1.05 c (round 61) 1179 del vars, 3014 del conss, 545 chg bounds, 375 chg sides, 781 chg coeffs, 0 upgd conss, 167623 impls, 0 clqs
0.99/1.06 c (round 62) 1180 del vars, 3017 del conss, 545 chg bounds, 376 chg sides, 782 chg coeffs, 0 upgd conss, 167633 impls, 0 clqs
0.99/1.07 c (round 63) 1180 del vars, 3020 del conss, 545 chg bounds, 376 chg sides, 782 chg coeffs, 0 upgd conss, 167633 impls, 0 clqs
1.09/1.16 c (round 64) 1180 del vars, 3047 del conss, 545 chg bounds, 376 chg sides, 782 chg coeffs, 5620 upgd conss, 167633 impls, 0 clqs
1.09/1.20 c (round 65) 1313 del vars, 3066 del conss, 545 chg bounds, 376 chg sides, 782 chg coeffs, 5620 upgd conss, 167633 impls, 0 clqs
1.20/1.22 c (round 66) 1316 del vars, 3073 del conss, 545 chg bounds, 376 chg sides, 782 chg coeffs, 5620 upgd conss, 167633 impls, 0 clqs
1.20/1.24 c presolving (67 rounds):
1.20/1.24 c 1316 deleted vars, 3073 deleted constraints, 545 tightened bounds, 0 added holes, 376 changed sides, 782 changed coefficients
1.20/1.24 c 167633 implications, 0 cliques
1.20/1.24 c presolved problem has 2338 variables (2338 bin, 0 int, 0 impl, 0 cont) and 5613 constraints
1.20/1.24 c 624 constraints of type <knapsack>
1.20/1.24 c 4989 constraints of type <logicor>
1.20/1.24 c transformed objective value is always integral (scale: 1)
1.20/1.24 c Presolving Time: 0.74
1.20/1.24 c - non default parameters ----------------------------------------------------------------------
1.20/1.24 c # SCIP version 1.2.1.2
1.20/1.24 c
1.20/1.24 c # frequency for displaying node information lines
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 100]
1.20/1.24 c display/freq = 10000
1.20/1.24 c
1.20/1.24 c # maximal time in seconds to run
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.20/1.24 c limits/time = 1799.82
1.20/1.24 c
1.20/1.24 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.20/1.24 c limits/memory = 1620
1.20/1.24 c
1.20/1.24 c # solving stops, if the given number of solutions were found (-1: no limit)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.24 c limits/solutions = 1
1.20/1.24 c
1.20/1.24 c # maximal number of separation rounds per node (-1: unlimited)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 5]
1.20/1.24 c separating/maxrounds = 1
1.20/1.24 c
1.20/1.24 c # maximal number of separation rounds in the root node (-1: unlimited)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.24 c separating/maxroundsroot = 5
1.20/1.24 c
1.20/1.24 c # should presolving try to simplify inequalities
1.20/1.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.20/1.24 c constraints/linear/simplifyinequalities = TRUE
1.20/1.24 c
1.20/1.24 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.20/1.24 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.20/1.24 c constraints/knapsack/disaggregation = FALSE
1.20/1.24 c
1.20/1.24 c # should presolving try to simplify knapsacks
1.20/1.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.20/1.24 c constraints/knapsack/simplifyinequalities = TRUE
1.20/1.24 c
1.20/1.24 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.24 c presolving/probing/maxrounds = 0
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/coefdiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/coefdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/coefdiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 30]
1.20/1.24 c heuristics/crossover/freq = -1
1.20/1.24 c
1.20/1.24 c # number of nodes added to the contingent of the total nodes
1.20/1.24 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.20/1.24 c heuristics/crossover/nodesofs = 750
1.20/1.24 c
1.20/1.24 c # number of nodes without incumbent change that heuristic should wait
1.20/1.24 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.20/1.24 c heuristics/crossover/nwaitingnodes = 100
1.20/1.24 c
1.20/1.24 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.20/1.24 c # [type: real, range: [0,1], default: 0.1]
1.20/1.24 c heuristics/crossover/nodesquot = 0.15
1.20/1.24 c
1.20/1.24 c # minimum percentage of integer variables that have to be fixed
1.20/1.24 c # [type: real, range: [0,1], default: 0.666]
1.20/1.24 c heuristics/crossover/minfixingrate = 0.5
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 20]
1.20/1.24 c heuristics/feaspump/freq = -1
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/feaspump/maxlpiterofs = 2000
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/fracdiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/fracdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/fracdiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/guideddiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/guideddiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/guideddiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/intdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.25 c heuristics/intshifting/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.25 c heuristics/linesearchdiving/freq = -1
1.20/1.25 c
1.20/1.25 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.25 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.20/1.25 c
1.20/1.25 c # additional number of allowed LP iterations
1.20/1.25 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.25 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/nlp/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 20]
1.20/1.25 c heuristics/objpscostdiving/freq = -1
1.20/1.25 c
1.20/1.25 c # maximal fraction of diving LP iterations compared to total iteration number
1.20/1.25 c # [type: real, range: [0,1], default: 0.01]
1.20/1.25 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.20/1.25 c
1.20/1.25 c # additional number of allowed LP iterations
1.20/1.25 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.25 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/oneopt/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.25 c heuristics/pscostdiving/freq = -1
1.20/1.25 c
1.20/1.25 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.25 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.20/1.25 c
1.20/1.25 c # additional number of allowed LP iterations
1.20/1.25 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.25 c heuristics/pscostdiving/maxlpiterofs = 1500
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.25 c heuristics/rens/freq = -1
1.20/1.25 c
1.20/1.25 c # minimum percentage of integer variables that have to be fixable
1.20/1.25 c # [type: real, range: [0,1], default: 0.5]
1.20/1.25 c heuristics/rens/minfixingrate = 0.3
1.20/1.25 c
1.20/1.25 c # number of nodes added to the contingent of the total nodes
1.20/1.25 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.20/1.25 c heuristics/rens/nodesofs = 2000
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 20]
1.20/1.25 c heuristics/rootsoldiving/freq = -1
1.20/1.25 c
1.20/1.25 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.20/1.25 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.20/1.25 c
1.20/1.25 c # additional number of allowed LP iterations
1.20/1.25 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.25 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/rounding/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.25 c heuristics/shifting/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/simplerounding/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.25 c heuristics/trivial/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/trysol/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.25 c heuristics/veclendiving/freq = -1
1.20/1.25 c
1.20/1.25 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.25 c heuristics/veclendiving/maxlpiterquot = 0.075
1.20/1.25 c
1.20/1.25 c # additional number of allowed LP iterations
1.20/1.25 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.25 c heuristics/veclendiving/maxlpiterofs = 1500
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/zirounding/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.25 c separating/cmir/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.25 c separating/flowcover/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.25 c separating/rapidlearning/freq = 0
1.20/1.25 c
1.20/1.25 c -----------------------------------------------------------------------------------------------
1.20/1.25 c start solving
1.20/1.25 c
1.29/1.37 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.37 c 0.9s| 1 | 0 | 930 | - | 19M| 0 | 629 |2338 |5613 |2338 |5613 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.67 c 2.1s| 1 | 0 | 1174 | - | 19M| 0 | 537 |2338 |5694 |2338 |5520 | 51 | 0 | 0 | 0.000000e+00 | -- | Inf
3.29/3.38 c 2.8s| 1 | 0 | 1918 | - | 19M| 0 | 735 |2338 |5694 |2338 |5609 | 140 | 0 | 0 | 0.000000e+00 | -- | Inf
4.79/4.86 c 4.2s| 1 | 0 | 2918 | - | 19M| 0 | 838 |2338 |5694 |2338 |5698 | 229 | 0 | 0 | 0.000000e+00 | -- | Inf
6.19/6.26 c 5.6s| 1 | 0 | 3904 | - | 20M| 0 | 729 |2338 |5694 |2338 |5807 | 338 | 0 | 0 | 0.000000e+00 | -- | Inf
7.59/7.61 c 7.0s| 1 | 0 | 4528 | - | 20M| 0 | 768 |2338 |5694 |2338 |5885 | 416 | 0 | 0 | 0.000000e+00 | -- | Inf
13.58/13.63 c 12.9s| 1 | 2 | 4528 | - | 20M| 0 | 768 |2338 |5694 |2338 |5885 | 416 | 0 | 18 | 0.000000e+00 | -- | Inf
146.94/147.08 c
146.94/147.08 c SCIP Status : problem is solved [infeasible]
146.94/147.08 c Solving Time (sec) : 145.58
146.94/147.08 c Solving Nodes : 1105
146.94/147.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
146.94/147.08 c Dual Bound : +1.00000000000000e+20
146.94/147.08 c Gap : 0.00 %
146.94/147.08 s UNSATISFIABLE
146.94/147.08 c SCIP Status : problem is solved [infeasible]
146.94/147.08 c Solving Time : 145.58
146.94/147.08 c Original Problem :
146.94/147.08 c Problem name : HOME/instance-2667418-1276335373.opb
146.94/147.08 c Variables : 3655 (3655 binary, 0 integer, 0 implicit integer, 0 continuous)
146.94/147.08 c Constraints : 8686 initial, 8686 maximal
146.94/147.08 c Presolved Problem :
146.94/147.08 c Problem name : t_HOME/instance-2667418-1276335373.opb
146.94/147.08 c Variables : 2338 (2338 binary, 0 integer, 0 implicit integer, 0 continuous)
146.94/147.08 c Constraints : 5613 initial, 6232 maximal
146.94/147.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
146.94/147.08 c trivial : 0.02 7 0 0 0 0 0 0 0
146.94/147.08 c dualfix : 0.02 1 0 0 0 0 0 0 0
146.94/147.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
146.94/147.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
146.94/147.08 c implics : 0.08 0 613 0 0 0 0 0 0
146.94/147.08 c probing : 0.00 0 0 0 0 0 0 0 0
146.94/147.08 c knapsack : 0.02 2 0 0 0 0 4 0 0
146.94/147.08 c linear : 0.48 540 152 0 545 0 3066 376 782
146.94/147.08 c logicor : 0.06 1 0 0 0 0 3 0 0
146.94/147.08 c root node : - 785 - - 785 - - - -
146.94/147.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
146.94/147.08 c integral : 0 0 0 953 0 1 10 0 0 1894
146.94/147.08 c knapsack : 624 6 8201 0 0 32 1626 1203 0 0
146.94/147.08 c linear : 0+ 5 8168 0 0 0 11 58 0 0
146.94/147.08 c logicor : 4989+ 6 7045 0 0 231 49100 0 0 0
146.94/147.08 c countsols : 0 0 0 0 0 0 0 0 0 0
146.94/147.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
146.94/147.08 c integral : 103.59 0.00 0.00 103.59 0.00
146.94/147.08 c knapsack : 0.44 0.05 0.39 0.00 0.00
146.94/147.08 c linear : 0.01 0.00 0.01 0.00 0.00
146.94/147.08 c logicor : 0.32 0.00 0.32 0.00 0.00
146.94/147.08 c countsols : 0.00 0.00 0.00 0.00 0.00
146.94/147.08 c Propagators : Time Calls Cutoffs DomReds
146.94/147.08 c vbounds : 0.00 1 0 0
146.94/147.08 c rootredcost : 0.02 0 0 0
146.94/147.08 c pseudoobj : 0.01 0 0 0
146.94/147.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
146.94/147.08 c propagation : 0.03 263 261 775 9.8 89 5.0 -
146.94/147.08 c infeasible LP : 0.05 14 14 25 2.8 7 4.4 0
146.94/147.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
146.94/147.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
146.94/147.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
146.94/147.08 c applied globally : - - - 600 8.3 - - -
146.94/147.08 c applied locally : - - - 0 0.0 - - -
146.94/147.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
146.94/147.08 c cut pool : 0.00 4 - - 28 - (maximal pool size: 449)
146.94/147.08 c redcost : 0.08 953 0 0 0 0
146.94/147.08 c impliedbounds : 0.00 5 0 0 0 0
146.94/147.08 c intobj : 0.00 0 0 0 0 0
146.94/147.08 c cgmip : 0.00 0 0 0 0 0
146.94/147.08 c gomory : 1.42 5 0 0 2050 0
146.94/147.08 c strongcg : 1.25 5 0 0 1992 0
146.94/147.08 c cmir : 0.00 0 0 0 0 0
146.94/147.08 c flowcover : 0.00 0 0 0 0 0
146.94/147.08 c clique : 0.13 5 0 0 33 0
146.94/147.08 c zerohalf : 0.00 0 0 0 0 0
146.94/147.08 c mcf : 0.01 1 0 0 0 0
146.94/147.08 c rapidlearning : 0.76 1 0 48 0 163
146.94/147.08 c Pricers : Time Calls Vars
146.94/147.08 c problem variables: 0.00 0 0
146.94/147.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
146.94/147.08 c relpscost : 103.59 953 1 10 0 0 1894
146.94/147.08 c pscost : 0.00 0 0 0 0 0 0
146.94/147.08 c inference : 0.00 0 0 0 0 0 0
146.94/147.08 c mostinf : 0.00 0 0 0 0 0 0
146.94/147.08 c leastinf : 0.00 0 0 0 0 0 0
146.94/147.08 c fullstrong : 0.00 0 0 0 0 0 0
146.94/147.08 c allfullstrong : 0.00 0 0 0 0 0 0
146.94/147.08 c random : 0.00 0 0 0 0 0 0
146.94/147.08 c Primal Heuristics : Time Calls Found
146.94/147.08 c LP solutions : 0.00 - 0
146.94/147.08 c pseudo solutions : 0.00 - 0
146.94/147.08 c trivial : 0.01 1 0
146.94/147.08 c simplerounding : 0.00 0 0
146.94/147.08 c zirounding : 0.00 0 0
146.94/147.08 c rounding : 0.00 0 0
146.94/147.08 c shifting : 0.00 0 0
146.94/147.08 c intshifting : 0.00 0 0
146.94/147.08 c oneopt : 0.00 0 0
146.94/147.08 c twoopt : 0.00 0 0
146.94/147.08 c fixandinfer : 0.00 0 0
146.94/147.08 c feaspump : 0.00 0 0
146.94/147.08 c coefdiving : 0.00 0 0
146.94/147.08 c pscostdiving : 0.00 0 0
146.94/147.08 c fracdiving : 0.00 0 0
146.94/147.08 c veclendiving : 0.00 0 0
146.94/147.08 c intdiving : 0.00 0 0
146.94/147.08 c actconsdiving : 0.00 0 0
146.94/147.08 c objpscostdiving : 0.00 0 0
146.94/147.08 c rootsoldiving : 0.00 0 0
146.94/147.08 c linesearchdiving : 0.00 0 0
146.94/147.08 c guideddiving : 0.00 0 0
146.94/147.08 c octane : 0.00 0 0
146.94/147.08 c rens : 0.00 0 0
146.94/147.08 c rins : 0.00 0 0
146.94/147.08 c localbranching : 0.00 0 0
146.94/147.08 c mutation : 0.00 0 0
146.94/147.08 c crossover : 0.00 0 0
146.94/147.08 c dins : 0.00 0 0
146.94/147.08 c undercover : 0.00 0 0
146.94/147.08 c nlp : 0.00 0 0
146.94/147.08 c trysol : 0.00 0 0
146.94/147.08 c LP : Time Calls Iterations Iter/call Iter/sec
146.94/147.08 c primal LP : 0.01 0 0 0.00 0.00
146.94/147.08 c dual LP : 33.15 967 51775 53.54 1561.84
146.94/147.08 c lex dual LP : 0.00 0 0 0.00 -
146.94/147.08 c barrier LP : 0.00 0 0 0.00 -
146.94/147.08 c diving/probing LP: 0.00 0 0 0.00 -
146.94/147.08 c strong branching : 103.31 781 133703 171.19 1294.19
146.94/147.08 c (at root node) : - 18 6394 355.22 -
146.94/147.08 c conflict analysis: 0.00 0 0 0.00 -
146.94/147.08 c B&B Tree :
146.94/147.08 c number of runs : 1
146.94/147.08 c nodes : 1105
146.94/147.08 c nodes (total) : 1105
146.94/147.08 c nodes left : 0
146.94/147.08 c max depth : 150
146.94/147.08 c max depth (total): 150
146.94/147.08 c backtracks : 147 (13.3%)
146.94/147.08 c delayed cutoffs : 790
146.94/147.08 c repropagations : 987 (13803 domain reductions, 120 cutoffs)
146.94/147.08 c avg switch length: 3.77
146.94/147.08 c switching time : 0.47
146.94/147.08 c Solution :
146.94/147.08 c Solutions found : 0 (0 improvements)
146.94/147.08 c Primal Bound : infeasible
146.94/147.08 c Dual Bound : -
146.94/147.08 c Gap : 0.00 %
146.94/147.08 c Root Dual Bound : +0.00000000000000e+00
146.94/147.08 c Root Iterations : 4528
147.04/147.14 c Time complete: 147.09.