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-3488793-1307759414.opb>
1.19/1.26 c original problem has 77106 variables (77106 bin, 0 int, 0 impl, 0 cont) and 218779 constraints
1.19/1.26 c problem read
1.19/1.26 c No objective function, only one solution is needed.
1.19/1.26 c presolving settings loaded
1.69/1.70 c presolving:
3.39/3.42 c (round 1) 3223 del vars, 4042 del conss, 0 add conss, 1432 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4306962 impls, 0 clqs
3.49/3.51 c (round 2) 3528 del vars, 8830 del conss, 0 add conss, 1625 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307384 impls, 0 clqs
3.49/3.55 c (round 3) 3532 del vars, 9068 del conss, 0 add conss, 1629 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307384 impls, 0 clqs
3.59/3.61 c (round 4) 3686 del vars, 9228 del conss, 0 add conss, 1635 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307694 impls, 0 clqs
3.59/3.67 c (round 5) 3842 del vars, 9689 del conss, 0 add conss, 1644 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4307994 impls, 0 clqs
3.69/3.72 c (round 6) 4000 del vars, 10155 del conss, 0 add conss, 1656 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4308326 impls, 0 clqs
3.69/3.77 c (round 7) 4160 del vars, 10625 del conss, 0 add conss, 1669 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4309184 impls, 0 clqs
3.79/3.82 c (round 8) 4187 del vars, 10965 del conss, 0 add conss, 1684 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4310077 impls, 0 clqs
3.79/3.86 c (round 9) 4234 del vars, 11062 del conss, 0 add conss, 1701 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4311931 impls, 0 clqs
3.89/3.90 c (round 10) 4264 del vars, 11176 del conss, 0 add conss, 1724 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4312518 impls, 0 clqs
3.89/3.94 c (round 11) 4318 del vars, 11278 del conss, 0 add conss, 1752 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4313044 impls, 0 clqs
3.89/3.98 c (round 12) 4429 del vars, 11480 del conss, 0 add conss, 1788 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4314522 impls, 0 clqs
3.99/4.03 c (round 13) 4533 del vars, 11796 del conss, 0 add conss, 1823 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4317962 impls, 0 clqs
3.99/4.07 c (round 14) 4575 del vars, 12039 del conss, 0 add conss, 1857 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4318428 impls, 0 clqs
4.09/4.12 c (round 15) 4632 del vars, 12158 del conss, 0 add conss, 1887 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4321218 impls, 0 clqs
4.09/4.16 c (round 16) 4661 del vars, 12286 del conss, 0 add conss, 1913 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4321458 impls, 0 clqs
4.09/4.20 c (round 17) 4712 del vars, 12384 del conss, 0 add conss, 1939 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4321954 impls, 0 clqs
4.19/4.24 c (round 18) 4775 del vars, 12546 del conss, 0 add conss, 1970 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4323036 impls, 0 clqs
4.19/4.28 c (round 19) 4843 del vars, 12728 del conss, 0 add conss, 2001 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325306 impls, 0 clqs
4.29/4.32 c (round 20) 4872 del vars, 12873 del conss, 0 add conss, 2026 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325454 impls, 0 clqs
4.29/4.36 c (round 21) 4914 del vars, 12961 del conss, 0 add conss, 2052 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325596 impls, 0 clqs
4.29/4.40 c (round 22) 4978 del vars, 13101 del conss, 0 add conss, 2083 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4325879 impls, 0 clqs
4.40/4.44 c (round 23) 5036 del vars, 13274 del conss, 0 add conss, 2109 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4326795 impls, 0 clqs
4.40/4.48 c (round 24) 5071 del vars, 13411 del conss, 0 add conss, 2135 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4327427 impls, 0 clqs
4.49/4.52 c (round 25) 5142 del vars, 13554 del conss, 0 add conss, 2169 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4328126 impls, 0 clqs
4.49/4.56 c (round 26) 5201 del vars, 13737 del conss, 0 add conss, 2201 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4328702 impls, 0 clqs
4.59/4.60 c (round 27) 5264 del vars, 13935 del conss, 0 add conss, 2242 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4329446 impls, 0 clqs
4.59/4.64 c (round 28) 5283 del vars, 14033 del conss, 0 add conss, 2253 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4329650 impls, 0 clqs
4.59/4.67 c (round 29) 5295 del vars, 14079 del conss, 0 add conss, 2260 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4329990 impls, 0 clqs
4.69/4.71 c (round 30) 5307 del vars, 14115 del conss, 0 add conss, 2265 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4330402 impls, 0 clqs
4.69/4.75 c (round 31) 5312 del vars, 14146 del conss, 0 add conss, 2270 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4330404 impls, 0 clqs
4.79/4.81 c (round 32) 5322 del vars, 14194 del conss, 0 add conss, 2280 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4330470 impls, 0 clqs
4.79/4.85 c (round 33) 5384 del vars, 14238 del conss, 0 add conss, 2287 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4331344 impls, 0 clqs
4.79/4.88 c (round 34) 5395 del vars, 14370 del conss, 0 add conss, 2297 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4331626 impls, 0 clqs
4.89/4.92 c (round 35) 5445 del vars, 14434 del conss, 0 add conss, 2311 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4332625 impls, 0 clqs
4.89/4.96 c (round 36) 5489 del vars, 14572 del conss, 0 add conss, 2327 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4333101 impls, 0 clqs
4.99/5.00 c (round 37) 5544 del vars, 14744 del conss, 0 add conss, 2360 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4333819 impls, 0 clqs
4.99/5.04 c (round 38) 5561 del vars, 14833 del conss, 0 add conss, 2369 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4333983 impls, 0 clqs
4.99/5.08 c (round 39) 5573 del vars, 14875 del conss, 0 add conss, 2376 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334123 impls, 0 clqs
5.09/5.11 c (round 40) 5585 del vars, 14911 del conss, 0 add conss, 2381 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334535 impls, 0 clqs
5.09/5.15 c (round 41) 5590 del vars, 14942 del conss, 0 add conss, 2386 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334537 impls, 0 clqs
5.19/5.21 c (round 42) 5600 del vars, 14990 del conss, 0 add conss, 2396 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4334603 impls, 0 clqs
5.19/5.25 c (round 43) 5662 del vars, 15034 del conss, 0 add conss, 2403 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4335481 impls, 0 clqs
5.19/5.29 c (round 44) 5673 del vars, 15166 del conss, 0 add conss, 2413 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4335763 impls, 0 clqs
5.29/5.33 c (round 45) 5722 del vars, 15229 del conss, 0 add conss, 2427 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4337348 impls, 0 clqs
5.29/5.36 c (round 46) 5767 del vars, 15366 del conss, 0 add conss, 2443 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4338388 impls, 0 clqs
5.39/5.40 c (round 47) 5822 del vars, 15540 del conss, 0 add conss, 2476 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4339314 impls, 0 clqs
5.39/5.44 c (round 48) 5839 del vars, 15629 del conss, 0 add conss, 2485 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4339570 impls, 0 clqs
5.39/5.48 c (round 49) 5851 del vars, 15671 del conss, 0 add conss, 2492 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4339716 impls, 0 clqs
5.50/5.52 c (round 50) 5863 del vars, 15707 del conss, 0 add conss, 2497 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4340128 impls, 0 clqs
5.50/5.55 c (round 51) 5868 del vars, 15738 del conss, 0 add conss, 2502 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4340130 impls, 0 clqs
5.59/5.61 c (round 52) 5878 del vars, 15786 del conss, 0 add conss, 2512 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4340196 impls, 0 clqs
5.59/5.65 c (round 53) 5940 del vars, 15830 del conss, 0 add conss, 2519 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4341070 impls, 0 clqs
5.59/5.69 c (round 54) 5951 del vars, 15962 del conss, 0 add conss, 2529 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4341352 impls, 0 clqs
5.69/5.73 c (round 55) 5974 del vars, 15999 del conss, 0 add conss, 2542 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4341396 impls, 0 clqs
5.69/5.77 c (round 56) 6043 del vars, 16107 del conss, 0 add conss, 2558 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4344558 impls, 0 clqs
5.79/5.81 c (round 57) 6098 del vars, 16331 del conss, 0 add conss, 2591 chg bounds, 6610 chg sides, 13854 chg coeffs, 0 upgd conss, 4345150 impls, 0 clqs
5.79/5.84 c (round 58) 6116 del vars, 16420 del conss, 0 add conss, 2600 chg bounds, 6611 chg sides, 13855 chg coeffs, 0 upgd conss, 4345342 impls, 0 clqs
5.79/5.88 c (round 59) 6131 del vars, 16466 del conss, 0 add conss, 2609 chg bounds, 6612 chg sides, 13856 chg coeffs, 0 upgd conss, 4345496 impls, 0 clqs
5.89/5.92 c (round 60) 6140 del vars, 16516 del conss, 0 add conss, 2618 chg bounds, 6612 chg sides, 13856 chg coeffs, 0 upgd conss, 4345572 impls, 0 clqs
5.89/6.00 c (round 61) 6148 del vars, 16541 del conss, 0 add conss, 2626 chg bounds, 6612 chg sides, 13856 chg coeffs, 0 upgd conss, 4345582 impls, 0 clqs
6.69/6.79 c (round 62) 6154 del vars, 16620 del conss, 0 add conss, 2632 chg bounds, 6612 chg sides, 13856 chg coeffs, 202159 upgd conss, 4345666 impls, 0 clqs
7.09/7.12 c presolving (63 rounds):
7.09/7.12 c 6154 deleted vars, 16620 deleted constraints, 0 added constraints, 2632 tightened bounds, 0 added holes, 6612 changed sides, 13856 changed coefficients
7.09/7.12 c 4345666 implications, 0 cliques
7.09/7.12 c presolved problem has 70952 variables (70952 bin, 0 int, 0 impl, 0 cont) and 202159 constraints
7.09/7.12 c 13220 constraints of type <knapsack>
7.09/7.12 c 126180 constraints of type <setppc>
7.09/7.12 c 62759 constraints of type <logicor>
7.09/7.12 c transformed objective value is always integral (scale: 1)
7.09/7.12 c Presolving Time: 5.55
7.09/7.12 c - non default parameters ----------------------------------------------------------------------
7.09/7.12 c # SCIP version 2.0.1.5
7.09/7.12 c
7.09/7.12 c # frequency for displaying node information lines
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 100]
7.09/7.12 c display/freq = 10000
7.09/7.12 c
7.09/7.12 c # maximal time in seconds to run
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
7.09/7.12 c limits/time = 1797
7.09/7.12 c
7.09/7.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
7.09/7.12 c limits/memory = 13950
7.09/7.12 c
7.09/7.12 c # solving stops, if the given number of solutions were found (-1: no limit)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: -1]
7.09/7.12 c limits/solutions = 1
7.09/7.12 c
7.09/7.12 c # maximal number of separation rounds per node (-1: unlimited)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 5]
7.09/7.12 c separating/maxrounds = 1
7.09/7.12 c
7.09/7.12 c # maximal number of separation rounds in the root node (-1: unlimited)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: -1]
7.09/7.12 c separating/maxroundsroot = 5
7.09/7.12 c
7.09/7.12 c # default clock type (1: CPU user seconds, 2: wall clock time)
7.09/7.12 c # [type: int, range: [1,2], default: 1]
7.09/7.12 c timing/clocktype = 2
7.09/7.12 c
7.09/7.12 c # belongs reading time to solving time?
7.09/7.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
7.09/7.12 c timing/reading = TRUE
7.09/7.12 c
7.09/7.12 c # should presolving try to simplify inequalities
7.09/7.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
7.09/7.12 c constraints/linear/simplifyinequalities = TRUE
7.09/7.12 c
7.09/7.12 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
7.09/7.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
7.09/7.12 c constraints/indicator/addCouplingCons = TRUE
7.09/7.12 c
7.09/7.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
7.09/7.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
7.09/7.12 c constraints/knapsack/disaggregation = FALSE
7.09/7.12 c
7.09/7.12 c # should presolving try to simplify knapsacks
7.09/7.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
7.09/7.12 c constraints/knapsack/simplifyinequalities = TRUE
7.09/7.12 c
7.09/7.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: -1]
7.09/7.12 c presolving/probing/maxrounds = 0
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/coefdiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
7.09/7.12 c heuristics/coefdiving/maxlpiterquot = 0.075
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/coefdiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 30]
7.09/7.12 c heuristics/crossover/freq = -1
7.09/7.12 c
7.09/7.12 c # number of nodes added to the contingent of the total nodes
7.09/7.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
7.09/7.12 c heuristics/crossover/nodesofs = 750
7.09/7.12 c
7.09/7.12 c # number of nodes without incumbent change that heuristic should wait
7.09/7.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
7.09/7.12 c heuristics/crossover/nwaitingnodes = 100
7.09/7.12 c
7.09/7.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
7.09/7.12 c # [type: real, range: [0,1], default: 0.1]
7.09/7.12 c heuristics/crossover/nodesquot = 0.15
7.09/7.12 c
7.09/7.12 c # minimum percentage of integer variables that have to be fixed
7.09/7.12 c # [type: real, range: [0,1], default: 0.666]
7.09/7.12 c heuristics/crossover/minfixingrate = 0.5
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 20]
7.09/7.12 c heuristics/feaspump/freq = -1
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/feaspump/maxlpiterofs = 2000
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/fracdiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
7.09/7.12 c heuristics/fracdiving/maxlpiterquot = 0.075
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/fracdiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/guideddiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
7.09/7.12 c heuristics/guideddiving/maxlpiterquot = 0.075
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/guideddiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
7.09/7.12 c heuristics/intdiving/maxlpiterquot = 0.075
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/intshifting/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/linesearchdiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
7.09/7.12 c heuristics/linesearchdiving/maxlpiterquot = 0.075
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/linesearchdiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 20]
7.09/7.12 c heuristics/objpscostdiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to total iteration number
7.09/7.12 c # [type: real, range: [0,1], default: 0.01]
7.09/7.12 c heuristics/objpscostdiving/maxlpiterquot = 0.015
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/objpscostdiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 1]
7.09/7.12 c heuristics/oneopt/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/pscostdiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
7.09/7.12 c heuristics/pscostdiving/maxlpiterquot = 0.075
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/pscostdiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 0]
7.09/7.12 c heuristics/rens/freq = -1
7.09/7.12 c
7.09/7.12 c # minimum percentage of integer variables that have to be fixable
7.09/7.12 c # [type: real, range: [0,1], default: 0.5]
7.09/7.12 c heuristics/rens/minfixingrate = 0.3
7.09/7.12 c
7.09/7.12 c # number of nodes added to the contingent of the total nodes
7.09/7.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
7.09/7.12 c heuristics/rens/nodesofs = 2000
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 20]
7.09/7.12 c heuristics/rootsoldiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
7.09/7.12 c heuristics/rootsoldiving/maxlpiterquot = 0.015
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/rootsoldiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 1]
7.09/7.12 c heuristics/rounding/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 0]
7.09/7.12 c heuristics/shiftandpropagate/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/shifting/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 1]
7.09/7.12 c heuristics/simplerounding/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 1]
7.09/7.12 c heuristics/subnlp/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 0]
7.09/7.12 c heuristics/trivial/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 1]
7.09/7.12 c heuristics/trysol/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 0]
7.09/7.12 c heuristics/undercover/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 10]
7.09/7.12 c heuristics/veclendiving/freq = -1
7.09/7.12 c
7.09/7.12 c # maximal fraction of diving LP iterations compared to node LP iterations
7.09/7.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
7.09/7.12 c heuristics/veclendiving/maxlpiterquot = 0.075
7.09/7.12 c
7.09/7.12 c # additional number of allowed LP iterations
7.09/7.12 c # [type: int, range: [0,2147483647], default: 1000]
7.09/7.12 c heuristics/veclendiving/maxlpiterofs = 1500
7.09/7.12 c
7.09/7.12 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 1]
7.09/7.12 c heuristics/zirounding/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 0]
7.09/7.12 c separating/cmir/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: 0]
7.09/7.12 c separating/flowcover/freq = -1
7.09/7.12 c
7.09/7.12 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
7.09/7.12 c # [type: int, range: [-1,2147483647], default: -1]
7.09/7.12 c separating/rapidlearning/freq = 0
7.09/7.12 c
7.09/7.12 c -----------------------------------------------------------------------------------------------
7.09/7.12 c start solving
7.09/7.14 c
18.19/18.28 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
18.19/18.28 c 18.3s| 1 | 0 | 11109 | - | 557M| 0 |7819 | 70k| 202k| 70k| 202k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
42.09/42.18 c 42.2s| 1 | 0 | 15100 | - | 557M| 0 |9541 | 70k| 202k| 70k| 202k| 221 | 0 | 0 | 0.000000e+00 | -- | Inf
73.89/73.95 c 73.9s| 1 | 0 | 22814 | - | 558M| 0 | 11k| 70k| 202k| 70k| 202k| 419 | 0 | 0 | 0.000000e+00 | -- | Inf
111.29/111.37 c 111s| 1 | 0 | 31937 | - | 558M| 0 | 12k| 70k| 202k| 70k| 202k| 635 | 0 | 0 | 0.000000e+00 | -- | Inf
187.89/187.95 c 188s| 1 | 0 | 46099 | - | 559M| 0 | 13k| 70k| 202k| 70k| 202k| 818 | 0 | 0 | 0.000000e+00 | -- | Inf
409.90/409.95 c 410s| 1 | 0 | 76055 | - | 559M| 0 | 16k| 70k| 202k| 70k| 203k|1008 | 0 | 0 | 0.000000e+00 | -- | Inf
541.60/541.60 c 542s| 1 | 2 | 76055 | - | 559M| 0 | 16k| 70k| 202k| 70k| 203k|1008 | 0 | 33 | 0.000000e+00 | -- | Inf
1801.54/1801.58 c
1801.54/1801.58 c SCIP Status : solving was interrupted [user interrupt]
1801.54/1801.58 c Solving Time (sec) : 1801.57
1801.54/1801.58 c Solving Nodes : 12
1801.54/1801.58 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1801.54/1801.58 c Dual Bound : +0.00000000000000e+00
1801.54/1801.58 c Gap : infinite
1801.54/1801.58 s UNKNOWN
1801.54/1801.58 c SCIP Status : solving was interrupted [user interrupt]
1801.54/1801.58 c Total Time : 1801.57
1801.54/1801.58 c solving : 1801.57
1801.54/1801.58 c presolving : 5.55 (included in solving)
1801.54/1801.58 c reading : 1.26 (included in solving)
1801.54/1801.58 c Original Problem :
1801.54/1801.58 c Problem name : HOME/instance-3488793-1307759414.opb
1801.54/1801.58 c Variables : 77106 (77106 binary, 0 integer, 0 implicit integer, 0 continuous)
1801.54/1801.58 c Constraints : 218779 initial, 218779 maximal
1801.54/1801.58 c Presolved Problem :
1801.54/1801.58 c Problem name : t_HOME/instance-3488793-1307759414.opb
1801.54/1801.58 c Variables : 70952 (70952 binary, 0 integer, 0 implicit integer, 0 continuous)
1801.54/1801.58 c Constraints : 202159 initial, 202159 maximal
1801.54/1801.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1801.54/1801.58 c trivial : 0.23 36 0 0 0 0 0 0 0 0
1801.54/1801.58 c dualfix : 0.21 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c implics : 0.82 0 3477 0 0 0 0 0 0 0
1801.54/1801.58 c probing : 0.00 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c knapsack : 0.09 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c setppc : 0.16 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c linear : 3.65 2624 17 0 2632 0 16620 0 6612 13856
1801.54/1801.58 c logicor : 0.06 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c root node : - 0 - - 0 - - - - -
1801.54/1801.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1801.54/1801.58 c integral : 0 0 0 12 0 1 0 0 0 0 0 24
1801.54/1801.58 c knapsack : 13220 5 66 0 0 0 0 0 0 1004 0 0
1801.54/1801.58 c setppc : 126180 5 66 0 0 0 0 0 10150 0 0 0
1801.54/1801.58 c logicor : 62759 5 60 0 0 0 0 0 4128 0 0 0
1801.54/1801.58 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
1801.54/1801.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1801.54/1801.58 c integral : 951.18 0.00 0.00 951.18 0.00 0.00 0.00
1801.54/1801.58 c knapsack : 0.04 0.01 0.03 0.00 0.00 0.00 0.00
1801.54/1801.58 c setppc : 0.25 0.03 0.22 0.00 0.00 0.00 0.00
1801.54/1801.58 c logicor : 0.06 0.02 0.05 0.00 0.00 0.00 0.00
1801.54/1801.58 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1801.54/1801.58 c Propagators : #Propagate #Resprop Cutoffs DomReds
1801.54/1801.58 c vbounds : 0 0 0 0
1801.54/1801.58 c rootredcost : 0 0 0 0
1801.54/1801.58 c pseudoobj : 0 0 0 0
1801.54/1801.58 c Propagator Timings : TotalTime Propagate Resprop
1801.54/1801.58 c vbounds : 0.00 0.00 0.00
1801.54/1801.58 c rootredcost : 0.00 0.00 0.00
1801.54/1801.58 c pseudoobj : 0.00 0.00 0.00
1801.54/1801.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1801.54/1801.58 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1801.54/1801.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1801.54/1801.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1801.54/1801.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1801.54/1801.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1801.54/1801.58 c applied globally : - - - 0 0.0 - - -
1801.54/1801.58 c applied locally : - - - 0 0.0 - - -
1801.54/1801.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1801.54/1801.58 c cut pool : 0.00 4 - - 350 - (maximal pool size: 2112)
1801.54/1801.58 c redcost : 0.04 16 0 0 0 0
1801.54/1801.58 c impliedbounds : 0.08 5 0 0 0 0
1801.54/1801.58 c intobj : 0.00 0 0 0 0 0
1801.54/1801.58 c gomory : 62.91 5 0 0 2500 0
1801.54/1801.58 c cgmip : 0.00 0 0 0 0 0
1801.54/1801.58 c closecuts : 0.00 0 0 0 0 0
1801.54/1801.58 c strongcg : 67.90 5 0 0 2500 0
1801.54/1801.58 c cmir : 0.00 0 0 0 0 0
1801.54/1801.58 c flowcover : 0.00 0 0 0 0 0
1801.54/1801.58 c clique : 6.02 5 0 0 37 0
1801.54/1801.58 c zerohalf : 0.00 0 0 0 0 0
1801.54/1801.58 c mcf : 3.99 1 0 0 0 0
1801.54/1801.58 c oddcycle : 0.00 0 0 0 0 0
1801.54/1801.58 c rapidlearning : 0.00 0 0 0 0 0
1801.54/1801.58 c Pricers : Time Calls Vars
1801.54/1801.58 c problem variables: 0.00 0 0
1801.54/1801.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1801.54/1801.58 c relpscost : 951.18 12 0 0 0 0 24
1801.54/1801.58 c pscost : 0.00 0 0 0 0 0 0
1801.54/1801.58 c inference : 0.00 0 0 0 0 0 0
1801.54/1801.58 c mostinf : 0.00 0 0 0 0 0 0
1801.54/1801.58 c leastinf : 0.00 0 0 0 0 0 0
1801.54/1801.58 c fullstrong : 0.00 0 0 0 0 0 0
1801.54/1801.58 c allfullstrong : 0.00 0 0 0 0 0 0
1801.54/1801.58 c random : 0.00 0 0 0 0 0 0
1801.54/1801.58 c Primal Heuristics : Time Calls Found
1801.54/1801.58 c LP solutions : 0.00 - 0
1801.54/1801.58 c pseudo solutions : 0.00 - 0
1801.54/1801.58 c trivial : 0.05 1 0
1801.54/1801.58 c shiftandpropagate: 0.00 0 0
1801.54/1801.58 c simplerounding : 0.00 0 0
1801.54/1801.58 c zirounding : 0.00 0 0
1801.54/1801.58 c rounding : 0.00 0 0
1801.54/1801.58 c shifting : 0.00 0 0
1801.54/1801.58 c intshifting : 0.00 0 0
1801.54/1801.58 c oneopt : 0.00 0 0
1801.54/1801.58 c twoopt : 0.00 0 0
1801.54/1801.58 c fixandinfer : 0.00 0 0
1801.54/1801.58 c feaspump : 0.00 0 0
1801.54/1801.58 c clique : 0.00 0 0
1801.54/1801.58 c coefdiving : 0.00 0 0
1801.54/1801.58 c pscostdiving : 0.00 0 0
1801.54/1801.58 c fracdiving : 0.00 0 0
1801.54/1801.58 c veclendiving : 0.00 0 0
1801.54/1801.58 c intdiving : 0.00 0 0
1801.54/1801.58 c actconsdiving : 0.00 0 0
1801.54/1801.58 c objpscostdiving : 0.00 0 0
1801.54/1801.58 c rootsoldiving : 0.00 0 0
1801.54/1801.58 c linesearchdiving : 0.00 0 0
1801.54/1801.58 c guideddiving : 0.00 0 0
1801.54/1801.58 c octane : 0.00 0 0
1801.54/1801.58 c rens : 0.00 0 0
1801.54/1801.58 c rins : 0.00 0 0
1801.54/1801.58 c localbranching : 0.00 0 0
1801.54/1801.58 c mutation : 0.00 0 0
1801.54/1801.58 c crossover : 0.00 0 0
1801.54/1801.58 c dins : 0.00 0 0
1801.54/1801.58 c vbounds : 0.00 0 0
1801.54/1801.58 c undercover : 0.00 0 0
1801.54/1801.58 c subnlp : 0.00 0 0
1801.54/1801.58 c trysol : 0.00 0 0
1801.54/1801.58 c LP : Time Calls Iterations Iter/call Iter/sec
1801.54/1801.58 c primal LP : 0.07 0 0 0.00 0.00
1801.54/1801.58 c dual LP : 700.75 17 153530 9031.18 219.09
1801.54/1801.58 c lex dual LP : 0.00 0 0 0.00 -
1801.54/1801.58 c barrier LP : 0.00 0 0 0.00 -
1801.54/1801.58 c diving/probing LP: 0.00 0 0 0.00 -
1801.54/1801.58 c strong branching : 951.02 222 199549 898.87 209.83
1801.54/1801.58 c (at root node) : - 33 32993 999.79 -
1801.54/1801.58 c conflict analysis: 0.00 0 0 0.00 -
1801.54/1801.58 c B&B Tree :
1801.54/1801.58 c number of runs : 1
1801.54/1801.58 c nodes : 12
1801.54/1801.58 c nodes (total) : 12
1801.54/1801.58 c nodes left : 13
1801.54/1801.58 c max depth : 9
1801.54/1801.58 c max depth (total): 9
1801.54/1801.58 c backtracks : 0 (0.0%)
1801.54/1801.58 c delayed cutoffs : 0
1801.54/1801.58 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1801.54/1801.58 c avg switch length: 1.17
1801.54/1801.58 c switching time : 0.12
1801.54/1801.58 c Solution :
1801.54/1801.58 c Solutions found : 0 (0 improvements)
1801.54/1801.58 c Primal Bound : -
1801.54/1801.58 c Dual Bound : +0.00000000000000e+00
1801.54/1801.58 c Gap : infinite
1801.54/1801.58 c Root Dual Bound : +0.00000000000000e+00
1801.54/1801.58 c Root Iterations : 76055