0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3452536-1307072289.opb>
3.19/3.31 c original problem has 168111 variables (168111 bin, 0 int, 0 impl, 0 cont) and 487525 constraints
3.19/3.31 c problem read
3.19/3.31 c No objective function, only one solution is needed.
3.19/3.31 c presolving settings loaded
4.99/5.04 c presolving:
8.59/8.67 c (round 1) 6008 del vars, 9423 del conss, 0 add conss, 3237 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10333961 impls, 0 clqs
8.80/8.85 c (round 2) 6517 del vars, 17162 del conss, 0 add conss, 3539 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10335953 impls, 0 clqs
8.91/8.94 c (round 3) 6521 del vars, 17479 del conss, 0 add conss, 3543 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10335953 impls, 0 clqs
8.99/9.03 c (round 4) 6591 del vars, 17554 del conss, 0 add conss, 3551 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10336079 impls, 0 clqs
9.09/9.12 c (round 5) 6663 del vars, 17762 del conss, 0 add conss, 3562 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10336239 impls, 0 clqs
9.19/9.21 c (round 6) 6738 del vars, 17975 del conss, 0 add conss, 3576 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10336941 impls, 0 clqs
9.29/9.30 c (round 7) 6815 del vars, 18195 del conss, 0 add conss, 3593 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10337337 impls, 0 clqs
9.29/9.39 c (round 8) 6892 del vars, 18419 del conss, 0 add conss, 3610 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10337602 impls, 0 clqs
9.39/9.48 c (round 9) 6970 del vars, 18648 del conss, 0 add conss, 3629 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10337788 impls, 0 clqs
9.49/9.57 c (round 10) 7048 del vars, 18873 del conss, 0 add conss, 3651 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10338004 impls, 0 clqs
9.59/9.66 c (round 11) 7152 del vars, 19157 del conss, 0 add conss, 3700 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10338312 impls, 0 clqs
9.69/9.75 c (round 12) 7270 del vars, 19495 del conss, 0 add conss, 3764 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10338856 impls, 0 clqs
9.79/9.84 c (round 13) 7372 del vars, 19790 del conss, 0 add conss, 3813 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339234 impls, 0 clqs
9.90/9.93 c (round 14) 7446 del vars, 20016 del conss, 0 add conss, 3835 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339396 impls, 0 clqs
10.01/10.02 c (round 15) 7514 del vars, 20218 del conss, 0 add conss, 3852 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339538 impls, 0 clqs
10.09/10.11 c (round 16) 7580 del vars, 20419 del conss, 0 add conss, 3868 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339694 impls, 0 clqs
10.09/10.19 c (round 17) 7646 del vars, 20616 del conss, 0 add conss, 3885 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10339822 impls, 0 clqs
10.19/10.28 c (round 18) 7712 del vars, 20813 del conss, 0 add conss, 3903 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340020 impls, 0 clqs
10.29/10.37 c (round 19) 7778 del vars, 21010 del conss, 0 add conss, 3922 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340168 impls, 0 clqs
10.39/10.46 c (round 20) 7844 del vars, 21207 del conss, 0 add conss, 3942 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340364 impls, 0 clqs
10.49/10.54 c (round 21) 7910 del vars, 21404 del conss, 0 add conss, 3963 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340492 impls, 0 clqs
10.59/10.63 c (round 22) 7976 del vars, 21601 del conss, 0 add conss, 3985 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340620 impls, 0 clqs
10.69/10.72 c (round 23) 8042 del vars, 21798 del conss, 0 add conss, 4008 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340812 impls, 0 clqs
10.79/10.81 c (round 24) 8108 del vars, 21995 del conss, 0 add conss, 4032 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10340940 impls, 0 clqs
10.79/10.89 c (round 25) 8174 del vars, 22192 del conss, 0 add conss, 4057 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341068 impls, 0 clqs
10.89/10.98 c (round 26) 8240 del vars, 22389 del conss, 0 add conss, 4083 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341196 impls, 0 clqs
11.00/11.07 c (round 27) 8306 del vars, 22586 del conss, 0 add conss, 4110 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341364 impls, 0 clqs
11.11/11.15 c (round 28) 8372 del vars, 22783 del conss, 0 add conss, 4138 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10341536 impls, 0 clqs
11.19/11.24 c (round 29) 8454 del vars, 22996 del conss, 0 add conss, 4167 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10343048 impls, 0 clqs
11.29/11.33 c (round 30) 8536 del vars, 23241 del conss, 0 add conss, 4197 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10345752 impls, 0 clqs
11.39/11.42 c (round 31) 8618 del vars, 23486 del conss, 0 add conss, 4228 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10348328 impls, 0 clqs
11.49/11.51 c (round 32) 8700 del vars, 23731 del conss, 0 add conss, 4260 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10350798 impls, 0 clqs
11.49/11.59 c (round 33) 8766 del vars, 23960 del conss, 0 add conss, 4293 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10352498 impls, 0 clqs
11.59/11.68 c (round 34) 8848 del vars, 24173 del conss, 0 add conss, 4327 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10355926 impls, 0 clqs
11.69/11.77 c (round 35) 8930 del vars, 24418 del conss, 0 add conss, 4362 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10356516 impls, 0 clqs
11.79/11.86 c (round 36) 9012 del vars, 24663 del conss, 0 add conss, 4398 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10359546 impls, 0 clqs
11.89/11.95 c (round 37) 9049 del vars, 24844 del conss, 0 add conss, 4435 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10359606 impls, 0 clqs
11.99/12.04 c (round 38) 9093 del vars, 24959 del conss, 0 add conss, 4475 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10359796 impls, 0 clqs
12.09/12.13 c (round 39) 9148 del vars, 25098 del conss, 0 add conss, 4518 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10360300 impls, 0 clqs
12.09/12.21 c (round 40) 9198 del vars, 25251 del conss, 0 add conss, 4565 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10360493 impls, 0 clqs
12.29/12.30 c (round 41) 9268 del vars, 25415 del conss, 0 add conss, 4617 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10361285 impls, 0 clqs
12.29/12.39 c (round 42) 9350 del vars, 25626 del conss, 0 add conss, 4671 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10362483 impls, 0 clqs
12.39/12.48 c (round 43) 9434 del vars, 25868 del conss, 0 add conss, 4722 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10363443 impls, 0 clqs
12.49/12.57 c (round 44) 9510 del vars, 26094 del conss, 0 add conss, 4771 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10364787 impls, 0 clqs
12.59/12.66 c (round 45) 9576 del vars, 26320 del conss, 0 add conss, 4824 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10368127 impls, 0 clqs
12.69/12.75 c (round 46) 9695 del vars, 26601 del conss, 0 add conss, 4928 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10369066 impls, 0 clqs
12.79/12.85 c (round 47) 9914 del vars, 27048 del conss, 0 add conss, 5038 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10372815 impls, 0 clqs
12.89/12.93 c (round 48) 10047 del vars, 27579 del conss, 0 add conss, 5150 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10374641 impls, 0 clqs
12.99/13.02 c (round 49) 10106 del vars, 27850 del conss, 0 add conss, 5199 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10375769 impls, 0 clqs
13.09/13.11 c (round 50) 10134 del vars, 27980 del conss, 0 add conss, 5227 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10376229 impls, 0 clqs
13.09/13.20 c (round 51) 10155 del vars, 28051 del conss, 0 add conss, 5244 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10376709 impls, 0 clqs
13.19/13.28 c (round 52) 10172 del vars, 28107 del conss, 0 add conss, 5260 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377003 impls, 0 clqs
13.39/13.41 c (round 53) 10192 del vars, 28177 del conss, 0 add conss, 5278 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377377 impls, 0 clqs
13.49/13.54 c (round 54) 10208 del vars, 28217 del conss, 0 add conss, 5294 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377489 impls, 0 clqs
13.69/13.71 c (round 55) 10224 del vars, 28265 del conss, 0 add conss, 5310 chg bounds, 9399 chg sides, 19538 chg coeffs, 0 upgd conss, 10377689 impls, 0 clqs
15.40/15.51 c (round 56) 10224 del vars, 28346 del conss, 0 add conss, 5310 chg bounds, 9399 chg sides, 19538 chg coeffs, 459162 upgd conss, 10377727 impls, 0 clqs
16.20/16.26 c presolving (57 rounds):
16.20/16.26 c 10224 deleted vars, 28346 deleted constraints, 0 added constraints, 5310 tightened bounds, 0 added holes, 9399 changed sides, 19538 changed coefficients
16.20/16.26 c 10377727 implications, 0 cliques
16.20/16.26 c presolved problem has 157887 variables (157887 bin, 0 int, 0 impl, 0 cont) and 459179 constraints
16.20/16.26 c 18798 constraints of type <knapsack>
16.20/16.26 c 293813 constraints of type <setppc>
16.20/16.26 c 146568 constraints of type <logicor>
16.20/16.26 c transformed objective value is always integral (scale: 1)
16.20/16.26 c Presolving Time: 12.49
16.20/16.26 c - non default parameters ----------------------------------------------------------------------
16.20/16.26 c # SCIP version 2.0.1.4
16.20/16.26 c
16.20/16.26 c # frequency for displaying node information lines
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 100]
16.20/16.26 c display/freq = 10000
16.20/16.26 c
16.20/16.26 c # maximal time in seconds to run
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
16.20/16.26 c limits/time = 1800
16.20/16.26 c
16.20/16.26 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
16.20/16.26 c limits/memory = 13950
16.20/16.26 c
16.20/16.26 c # solving stops, if the given number of solutions were found (-1: no limit)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: -1]
16.20/16.26 c limits/solutions = 1
16.20/16.26 c
16.20/16.26 c # maximal number of separation rounds per node (-1: unlimited)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 5]
16.20/16.26 c separating/maxrounds = 1
16.20/16.26 c
16.20/16.26 c # maximal number of separation rounds in the root node (-1: unlimited)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: -1]
16.20/16.26 c separating/maxroundsroot = 5
16.20/16.26 c
16.20/16.26 c # default clock type (1: CPU user seconds, 2: wall clock time)
16.20/16.26 c # [type: int, range: [1,2], default: 1]
16.20/16.26 c timing/clocktype = 2
16.20/16.26 c
16.20/16.26 c # belongs reading time to solving time?
16.20/16.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
16.20/16.26 c timing/reading = TRUE
16.20/16.26 c
16.20/16.26 c # should presolving try to simplify inequalities
16.20/16.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
16.20/16.26 c constraints/linear/simplifyinequalities = TRUE
16.20/16.26 c
16.20/16.26 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
16.20/16.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
16.20/16.26 c constraints/indicator/addCouplingCons = TRUE
16.20/16.26 c
16.20/16.26 c # should disaggregation of knapsack constraints be allowed in preprocessing?
16.20/16.26 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
16.20/16.26 c constraints/knapsack/disaggregation = FALSE
16.20/16.26 c
16.20/16.26 c # should presolving try to simplify knapsacks
16.20/16.26 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
16.20/16.26 c constraints/knapsack/simplifyinequalities = TRUE
16.20/16.26 c
16.20/16.26 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: -1]
16.20/16.26 c presolving/probing/maxrounds = 0
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/coefdiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.20/16.26 c heuristics/coefdiving/maxlpiterquot = 0.075
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/coefdiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 30]
16.20/16.26 c heuristics/crossover/freq = -1
16.20/16.26 c
16.20/16.26 c # number of nodes added to the contingent of the total nodes
16.20/16.26 c # [type: longint, range: [0,9223372036854775807], default: 500]
16.20/16.26 c heuristics/crossover/nodesofs = 750
16.20/16.26 c
16.20/16.26 c # number of nodes without incumbent change that heuristic should wait
16.20/16.26 c # [type: longint, range: [0,9223372036854775807], default: 200]
16.20/16.26 c heuristics/crossover/nwaitingnodes = 100
16.20/16.26 c
16.20/16.26 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
16.20/16.26 c # [type: real, range: [0,1], default: 0.1]
16.20/16.26 c heuristics/crossover/nodesquot = 0.15
16.20/16.26 c
16.20/16.26 c # minimum percentage of integer variables that have to be fixed
16.20/16.26 c # [type: real, range: [0,1], default: 0.666]
16.20/16.26 c heuristics/crossover/minfixingrate = 0.5
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 20]
16.20/16.26 c heuristics/feaspump/freq = -1
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/feaspump/maxlpiterofs = 2000
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/fracdiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.20/16.26 c heuristics/fracdiving/maxlpiterquot = 0.075
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/fracdiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/guideddiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.20/16.26 c heuristics/guideddiving/maxlpiterquot = 0.075
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/guideddiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.20/16.26 c heuristics/intdiving/maxlpiterquot = 0.075
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/intshifting/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/linesearchdiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.20/16.26 c heuristics/linesearchdiving/maxlpiterquot = 0.075
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/linesearchdiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 20]
16.20/16.26 c heuristics/objpscostdiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to total iteration number
16.20/16.26 c # [type: real, range: [0,1], default: 0.01]
16.20/16.26 c heuristics/objpscostdiving/maxlpiterquot = 0.015
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/objpscostdiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 1]
16.20/16.26 c heuristics/oneopt/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/pscostdiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.20/16.26 c heuristics/pscostdiving/maxlpiterquot = 0.075
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/pscostdiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 0]
16.20/16.26 c heuristics/rens/freq = -1
16.20/16.26 c
16.20/16.26 c # minimum percentage of integer variables that have to be fixable
16.20/16.26 c # [type: real, range: [0,1], default: 0.5]
16.20/16.26 c heuristics/rens/minfixingrate = 0.3
16.20/16.26 c
16.20/16.26 c # number of nodes added to the contingent of the total nodes
16.20/16.26 c # [type: longint, range: [0,9223372036854775807], default: 500]
16.20/16.26 c heuristics/rens/nodesofs = 2000
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 20]
16.20/16.26 c heuristics/rootsoldiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
16.20/16.26 c heuristics/rootsoldiving/maxlpiterquot = 0.015
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/rootsoldiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 1]
16.20/16.26 c heuristics/rounding/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 0]
16.20/16.26 c heuristics/shiftandpropagate/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/shifting/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 1]
16.20/16.26 c heuristics/simplerounding/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 1]
16.20/16.26 c heuristics/subnlp/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 0]
16.20/16.26 c heuristics/trivial/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 1]
16.20/16.26 c heuristics/trysol/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 0]
16.20/16.26 c heuristics/undercover/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 10]
16.20/16.26 c heuristics/veclendiving/freq = -1
16.20/16.26 c
16.20/16.26 c # maximal fraction of diving LP iterations compared to node LP iterations
16.20/16.26 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
16.20/16.26 c heuristics/veclendiving/maxlpiterquot = 0.075
16.20/16.26 c
16.20/16.26 c # additional number of allowed LP iterations
16.20/16.26 c # [type: int, range: [0,2147483647], default: 1000]
16.20/16.26 c heuristics/veclendiving/maxlpiterofs = 1500
16.20/16.26 c
16.20/16.26 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 1]
16.20/16.26 c heuristics/zirounding/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 0]
16.20/16.26 c separating/cmir/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: 0]
16.20/16.26 c separating/flowcover/freq = -1
16.20/16.26 c
16.20/16.26 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
16.20/16.26 c # [type: int, range: [-1,2147483647], default: -1]
16.20/16.26 c separating/rapidlearning/freq = 0
16.20/16.26 c
16.20/16.26 c -----------------------------------------------------------------------------------------------
16.20/16.26 c start solving
16.29/16.30 c
90.80/90.89 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
90.80/90.89 c 90.9s| 1 | 0 | 18835 | - |1213M| 0 | 11k| 157k| 459k| 157k| 459k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
175.69/175.72 c 176s| 1 | 0 | 29440 | - |1213M| 0 | 15k| 157k| 459k| 157k| 459k| 194 | 0 | 0 | 0.000000e+00 | -- | Inf
580.21/580.26 c 580s| 1 | 0 | 63670 | - |1214M| 0 | 23k| 157k| 459k| 157k| 459k| 371 | 0 | 0 | 0.000000e+00 | -- | Inf
944.63/944.65 c 945s| 1 | 0 | 88547 | - |1215M| 0 | 25k| 157k| 459k| 157k| 459k| 589 | 0 | 0 | 0.000000e+00 | -- | Inf
1680.75/1680.73 c 1681s| 1 | 0 |135940 | - |1215M| 0 | 30k| 157k| 459k| 157k| 459k| 785 | 0 | 0 | 0.000000e+00 | -- | Inf
1800.07/1800.04 c 1800s| 1 | 0 |135940 | - |1216M| 0 | - | 157k| 459k| 157k| 460k| 971 | 0 | 0 | 0.000000e+00 | -- | Inf
1800.18/1800.13 c 1800s| 1 | 2 |135940 | - |1216M| 0 | - | 157k| 459k| 157k| 460k| 971 | 0 | 0 | 0.000000e+00 | -- | Inf
1800.18/1800.13 c
1800.18/1800.13 c SCIP Status : solving was interrupted [user interrupt]
1800.18/1800.13 c Solving Time (sec) : 1800.12
1800.18/1800.13 c Solving Nodes : 1
1800.18/1800.13 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1800.18/1800.13 c Dual Bound : +0.00000000000000e+00
1800.18/1800.13 c Gap : infinite
1800.18/1800.13 s UNKNOWN
1800.18/1800.13 c SCIP Status : solving was interrupted [user interrupt]
1800.18/1800.13 c Total Time : 1800.12
1800.18/1800.13 c solving : 1800.12
1800.18/1800.13 c presolving : 12.49 (included in solving)
1800.18/1800.13 c reading : 3.31 (included in solving)
1800.18/1800.13 c Original Problem :
1800.18/1800.13 c Problem name : HOME/instance-3452536-1307072289.opb
1800.18/1800.13 c Variables : 168111 (168111 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.18/1800.13 c Constraints : 487525 initial, 487525 maximal
1800.18/1800.13 c Presolved Problem :
1800.18/1800.13 c Problem name : t_HOME/instance-3452536-1307072289.opb
1800.18/1800.13 c Variables : 157887 (157887 binary, 0 integer, 0 implicit integer, 0 continuous)
1800.18/1800.13 c Constraints : 459179 initial, 459179 maximal
1800.18/1800.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1800.18/1800.13 c trivial : 0.46 93 0 0 0 0 0 0 0 0
1800.18/1800.13 c dualfix : 0.58 0 0 0 0 0 0 0 0 0
1800.18/1800.13 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1800.18/1800.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1800.18/1800.13 c implics : 1.61 0 4810 0 0 0 0 0 0 0
1800.18/1800.13 c probing : 0.00 0 0 0 0 0 0 0 0 0
1800.18/1800.13 c knapsack : 0.15 0 0 0 0 0 0 0 0 0
1800.18/1800.13 c setppc : 0.42 0 0 0 0 0 0 0 0 0
1800.18/1800.13 c linear : 7.43 5303 18 0 5310 0 28346 0 9399 19538
1800.18/1800.13 c logicor : 0.14 0 0 0 0 0 0 0 0 0
1800.18/1800.13 c root node : - 0 - - 0 - - - - -
1800.18/1800.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1800.18/1800.13 c integral : 0 0 0 0 0 1 0 0 0 0 0 0
1800.18/1800.13 c knapsack : 18798 5 1 0 1 0 0 0 0 1002 0 0
1800.18/1800.13 c setppc : 293813 5 1 0 1 0 0 0 0 0 0 0
1800.18/1800.13 c logicor : 146568 5 1 0 1 0 0 0 0 0 0 0
1800.18/1800.13 c countsols : 0 0 0 0 1 0 0 0 0 0 0 0
1800.18/1800.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1800.18/1800.13 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1800.18/1800.13 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
1800.18/1800.13 c setppc : 0.12 0.06 0.01 0.00 0.05 0.00 0.00
1800.18/1800.13 c logicor : 0.13 0.04 0.07 0.00 0.02 0.00 0.00
1800.18/1800.13 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1800.18/1800.13 c Propagators : #Propagate #Resprop Cutoffs DomReds
1800.18/1800.13 c vbounds : 0 0 0 0
1800.18/1800.13 c rootredcost : 0 0 0 0
1800.18/1800.13 c pseudoobj : 0 0 0 0
1800.18/1800.13 c Propagator Timings : TotalTime Propagate Resprop
1800.18/1800.13 c vbounds : 0.00 0.00 0.00
1800.18/1800.13 c rootredcost : 0.00 0.00 0.00
1800.18/1800.13 c pseudoobj : 0.00 0.00 0.00
1800.18/1800.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1800.18/1800.13 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1800.18/1800.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1800.18/1800.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1800.18/1800.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1800.18/1800.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1800.18/1800.13 c applied globally : - - - 0 0.0 - - -
1800.18/1800.13 c applied locally : - - - 0 0.0 - - -
1800.18/1800.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1800.18/1800.13 c cut pool : 0.00 4 - - 353 - (maximal pool size: 2051)
1800.18/1800.13 c redcost : 0.03 5 0 0 0 0
1800.18/1800.13 c impliedbounds : 0.24 5 0 0 0 0
1800.18/1800.13 c intobj : 0.00 0 0 0 0 0
1800.18/1800.13 c gomory : 181.96 5 0 0 2500 0
1800.18/1800.13 c cgmip : 0.00 0 0 0 0 0
1800.18/1800.13 c closecuts : 0.00 0 0 0 0 0
1800.18/1800.13 c strongcg : 193.81 5 0 0 2380 0
1800.18/1800.13 c cmir : 0.00 0 0 0 0 0
1800.18/1800.13 c flowcover : 0.00 0 0 0 0 0
1800.18/1800.13 c clique : 13.74 4 0 0 33 0
1800.18/1800.13 c zerohalf : 0.00 0 0 0 0 0
1800.18/1800.13 c mcf : 12.14 1 0 0 0 0
1800.18/1800.13 c oddcycle : 0.00 0 0 0 0 0
1800.18/1800.13 c rapidlearning : 0.00 0 0 0 0 0
1800.18/1800.13 c Pricers : Time Calls Vars
1800.18/1800.13 c problem variables: 0.00 0 0
1800.18/1800.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1800.18/1800.13 c relpscost : 0.00 0 0 0 0 0 0
1800.18/1800.13 c pscost : 0.00 0 0 0 0 0 0
1800.18/1800.13 c inference : 0.01 1 0 0 0 0 2
1800.18/1800.13 c mostinf : 0.00 0 0 0 0 0 0
1800.18/1800.13 c leastinf : 0.00 0 0 0 0 0 0
1800.18/1800.13 c fullstrong : 0.00 0 0 0 0 0 0
1800.18/1800.13 c allfullstrong : 0.00 0 0 0 0 0 0
1800.18/1800.13 c random : 0.00 0 0 0 0 0 0
1800.18/1800.13 c Primal Heuristics : Time Calls Found
1800.18/1800.13 c LP solutions : 0.00 - 0
1800.18/1800.13 c pseudo solutions : 0.00 - 0
1800.18/1800.13 c trivial : 0.13 1 0
1800.18/1800.13 c shiftandpropagate: 0.00 0 0
1800.18/1800.13 c simplerounding : 0.00 0 0
1800.18/1800.13 c zirounding : 0.00 0 0
1800.18/1800.13 c rounding : 0.00 0 0
1800.18/1800.13 c shifting : 0.00 0 0
1800.18/1800.13 c intshifting : 0.00 0 0
1800.18/1800.13 c oneopt : 0.00 0 0
1800.18/1800.13 c twoopt : 0.00 0 0
1800.18/1800.13 c fixandinfer : 0.00 0 0
1800.18/1800.13 c feaspump : 0.00 0 0
1800.18/1800.13 c clique : 0.00 0 0
1800.18/1800.13 c coefdiving : 0.00 0 0
1800.18/1800.13 c pscostdiving : 0.00 0 0
1800.18/1800.13 c fracdiving : 0.00 0 0
1800.18/1800.13 c veclendiving : 0.00 0 0
1800.18/1800.13 c intdiving : 0.00 0 0
1800.18/1800.13 c actconsdiving : 0.00 0 0
1800.18/1800.13 c objpscostdiving : 0.00 0 0
1800.18/1800.13 c rootsoldiving : 0.00 0 0
1800.18/1800.13 c linesearchdiving : 0.00 0 0
1800.18/1800.13 c guideddiving : 0.00 0 0
1800.18/1800.13 c octane : 0.00 0 0
1800.18/1800.13 c rens : 0.00 0 0
1800.18/1800.13 c rins : 0.00 0 0
1800.18/1800.13 c localbranching : 0.00 0 0
1800.18/1800.13 c mutation : 0.00 0 0
1800.18/1800.13 c crossover : 0.00 0 0
1800.18/1800.13 c dins : 0.00 0 0
1800.18/1800.13 c vbounds : 0.00 0 0
1800.18/1800.13 c undercover : 0.00 0 0
1800.18/1800.13 c subnlp : 0.00 0 0
1800.18/1800.13 c trysol : 0.00 0 0
1800.18/1800.13 c LP : Time Calls Iterations Iter/call Iter/sec
1800.18/1800.13 c primal LP : 0.00 0 0 0.00 -
1800.18/1800.13 c dual LP : 1380.12 5 135940 27188.00 98.50
1800.18/1800.13 c lex dual LP : 0.00 0 0 0.00 -
1800.18/1800.13 c barrier LP : 0.00 0 0 0.00 -
1800.18/1800.13 c diving/probing LP: 0.00 0 0 0.00 -
1800.18/1800.13 c strong branching : 0.00 0 0 0.00 -
1800.18/1800.13 c (at root node) : - 0 0 0.00 -
1800.18/1800.13 c conflict analysis: 0.00 0 0 0.00 -
1800.18/1800.13 c B&B Tree :
1800.18/1800.13 c number of runs : 1
1800.18/1800.13 c nodes : 1
1800.18/1800.13 c nodes (total) : 1
1800.18/1800.13 c nodes left : 2
1800.18/1800.13 c max depth : 0
1800.18/1800.13 c max depth (total): 0
1800.18/1800.13 c backtracks : 0 (0.0%)
1800.18/1800.13 c delayed cutoffs : 0
1800.18/1800.13 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1800.18/1800.13 c avg switch length: 1.00
1800.18/1800.13 c switching time : 0.00
1800.18/1800.13 c Solution :
1800.18/1800.13 c Solutions found : 0 (0 improvements)
1800.18/1800.13 c Primal Bound : -
1800.18/1800.13 c Dual Bound : +0.00000000000000e+00
1800.18/1800.13 c Gap : infinite
1800.18/1800.13 c Root Dual Bound : +0.00000000000000e+00
1800.18/1800.13 c Root Iterations : 135940
1801.87/1801.82 c Time complete: 1801.88.