0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703580-1278550324.opb>
3.79/3.85 c original problem has 81558 variables (81558 bin, 0 int, 0 impl, 0 cont) and 240469 constraints
3.79/3.85 c problem read
3.79/3.86 c No objective function, only one solution is needed.
3.79/3.86 c presolving settings loaded
5.09/5.13 c presolving:
10.39/10.48 c (round 1) 913 del vars, 298 del conss, 113 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6001050 impls, 0 clqs
10.59/10.70 c (round 2) 945 del vars, 2004 del conss, 117 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6001702 impls, 0 clqs
10.90/10.92 c (round 3) 955 del vars, 2039 del conss, 127 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6001718 impls, 0 clqs
11.00/11.06 c (round 4) 963 del vars, 2056 del conss, 134 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6001784 impls, 0 clqs
11.19/11.20 c (round 5) 971 del vars, 2077 del conss, 142 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6001812 impls, 0 clqs
11.29/11.35 c (round 6) 984 del vars, 2102 del conss, 154 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6001952 impls, 0 clqs
11.39/11.49 c (round 7) 995 del vars, 2136 del conss, 165 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6002240 impls, 0 clqs
11.59/11.64 c (round 8) 1007 del vars, 2164 del conss, 177 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6002348 impls, 0 clqs
11.69/11.78 c (round 9) 1023 del vars, 2199 del conss, 192 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6002494 impls, 0 clqs
11.89/11.93 c (round 10) 1036 del vars, 2240 del conss, 205 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6002948 impls, 0 clqs
12.00/12.07 c (round 11) 1050 del vars, 2273 del conss, 219 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6003244 impls, 0 clqs
12.19/12.22 c (round 12) 1070 del vars, 2315 del conss, 236 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6003774 impls, 0 clqs
12.29/12.36 c (round 13) 1089 del vars, 2366 del conss, 253 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6004334 impls, 0 clqs
12.49/12.51 c (round 14) 1105 del vars, 2413 del conss, 268 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6004692 impls, 0 clqs
12.59/12.65 c (round 15) 1123 del vars, 2459 del conss, 284 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6005144 impls, 0 clqs
12.79/12.80 c (round 16) 1142 del vars, 2504 del conss, 302 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6005594 impls, 0 clqs
12.89/12.94 c (round 17) 1158 del vars, 2551 del conss, 317 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6005998 impls, 0 clqs
12.99/13.09 c (round 18) 1179 del vars, 2600 del conss, 337 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6006206 impls, 0 clqs
13.19/13.24 c (round 19) 1198 del vars, 2651 del conss, 355 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6006857 impls, 0 clqs
13.29/13.38 c (round 20) 1211 del vars, 2695 del conss, 368 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6007269 impls, 0 clqs
13.49/13.52 c (round 21) 1232 del vars, 2734 del conss, 388 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6007351 impls, 0 clqs
13.59/13.67 c (round 22) 1253 del vars, 2791 del conss, 408 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6007830 impls, 0 clqs
13.79/13.81 c (round 23) 1271 del vars, 2840 del conss, 426 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6007980 impls, 0 clqs
13.89/13.96 c (round 24) 1296 del vars, 2894 del conss, 450 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6008485 impls, 0 clqs
14.09/14.11 c (round 25) 1314 del vars, 2953 del conss, 467 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6009213 impls, 0 clqs
14.19/14.25 c (round 26) 1332 del vars, 2998 del conss, 485 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6009375 impls, 0 clqs
14.39/14.40 c (round 27) 1355 del vars, 3051 del conss, 507 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6009944 impls, 0 clqs
14.49/14.54 c (round 28) 1372 del vars, 3106 del conss, 524 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6010396 impls, 0 clqs
14.59/14.69 c (round 29) 1389 del vars, 3148 del conss, 540 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6010706 impls, 0 clqs
14.79/14.83 c (round 30) 1409 del vars, 3195 del conss, 559 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6010848 impls, 0 clqs
14.89/14.98 c (round 31) 1428 del vars, 3247 del conss, 578 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6011422 impls, 0 clqs
15.09/15.12 c (round 32) 1447 del vars, 3294 del conss, 596 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6011628 impls, 0 clqs
15.19/15.27 c (round 33) 1469 del vars, 3346 del conss, 617 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6011920 impls, 0 clqs
15.39/15.41 c (round 34) 1491 del vars, 3406 del conss, 639 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6012341 impls, 0 clqs
15.49/15.56 c (round 35) 1510 del vars, 3457 del conss, 657 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6012553 impls, 0 clqs
15.69/15.70 c (round 36) 1531 del vars, 3509 del conss, 678 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6012695 impls, 0 clqs
15.79/15.85 c (round 37) 1552 del vars, 3566 del conss, 699 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6013152 impls, 0 clqs
15.89/15.99 c (round 38) 1569 del vars, 3614 del conss, 715 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6013352 impls, 0 clqs
16.09/16.14 c (round 39) 1586 del vars, 3658 del conss, 732 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6013488 impls, 0 clqs
16.19/16.28 c (round 40) 1603 del vars, 3704 del conss, 749 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6013939 impls, 0 clqs
16.39/16.42 c (round 41) 1616 del vars, 3741 del conss, 761 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6014113 impls, 0 clqs
16.49/16.57 c (round 42) 1627 del vars, 3773 del conss, 772 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6014227 impls, 0 clqs
16.69/16.71 c (round 43) 1637 del vars, 3800 del conss, 782 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6014389 impls, 0 clqs
16.89/16.93 c (round 44) 1650 del vars, 3840 del conss, 794 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6014581 impls, 0 clqs
16.99/17.08 c (round 45) 1658 del vars, 3856 del conss, 802 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6014649 impls, 0 clqs
17.19/17.30 c (round 46) 1667 del vars, 3886 del conss, 810 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6014775 impls, 0 clqs
17.49/17.59 c (round 47) 1676 del vars, 3913 del conss, 819 chg bounds, 2302 chg sides, 4716 chg coeffs, 0 upgd conss, 6014878 impls, 0 clqs
19.38/19.42 c (round 48) 1679 del vars, 3942 del conss, 822 chg bounds, 2302 chg sides, 4716 chg coeffs, 236527 upgd conss, 6015033 impls, 0 clqs
20.08/20.11 c presolving (49 rounds):
20.08/20.11 c 1679 deleted vars, 3942 deleted constraints, 822 tightened bounds, 0 added holes, 2302 changed sides, 4716 changed coefficients
20.08/20.11 c 6015033 implications, 0 cliques
20.08/20.11 c presolved problem has 79879 variables (79879 bin, 0 int, 0 impl, 0 cont) and 236527 constraints
20.08/20.11 c 4596 constraints of type <knapsack>
20.08/20.11 c 154731 constraints of type <setppc>
20.08/20.11 c 77200 constraints of type <logicor>
20.08/20.11 c transformed objective value is always integral (scale: 1)
20.08/20.11 c Presolving Time: 15.48
20.08/20.11 c - non default parameters ----------------------------------------------------------------------
20.08/20.11 c # SCIP version 1.2.1.3
20.08/20.11 c
20.08/20.11 c # frequency for displaying node information lines
20.08/20.11 c # [type: int, range: [-1,2147483647], default: 100]
20.08/20.11 c display/freq = 10000
20.08/20.11 c
20.08/20.11 c # maximal time in seconds to run
20.08/20.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
20.08/20.11 c limits/time = 1786.14
20.08/20.11 c
20.08/20.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
20.08/20.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
20.08/20.11 c limits/memory = 1620
20.08/20.11 c
20.08/20.11 c # solving stops, if the given number of solutions were found (-1: no limit)
20.08/20.11 c # [type: int, range: [-1,2147483647], default: -1]
20.08/20.11 c limits/solutions = 1
20.08/20.11 c
20.08/20.11 c # maximal number of separation rounds per node (-1: unlimited)
20.08/20.11 c # [type: int, range: [-1,2147483647], default: 5]
20.08/20.11 c separating/maxrounds = 1
20.08/20.11 c
20.08/20.11 c # maximal number of separation rounds in the root node (-1: unlimited)
20.08/20.11 c # [type: int, range: [-1,2147483647], default: -1]
20.08/20.11 c separating/maxroundsroot = 5
20.08/20.11 c
20.08/20.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
20.08/20.11 c # [type: int, range: [1,2], default: 1]
20.08/20.11 c timing/clocktype = 2
20.08/20.11 c
20.08/20.11 c # should presolving try to simplify inequalities
20.08/20.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
20.08/20.11 c constraints/linear/simplifyinequalities = TRUE
20.08/20.11 c
20.08/20.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
20.08/20.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
20.08/20.11 c constraints/indicator/addCouplingCons = TRUE
20.08/20.11 c
20.08/20.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
20.08/20.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
20.08/20.11 c constraints/knapsack/disaggregation = FALSE
20.08/20.11 c
20.08/20.11 c # should presolving try to simplify knapsacks
20.08/20.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
20.08/20.12 c constraints/knapsack/simplifyinequalities = TRUE
20.08/20.12 c
20.08/20.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: -1]
20.08/20.12 c presolving/probing/maxrounds = 0
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/coefdiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
20.08/20.12 c heuristics/coefdiving/maxlpiterquot = 0.075
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/coefdiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 30]
20.08/20.12 c heuristics/crossover/freq = -1
20.08/20.12 c
20.08/20.12 c # number of nodes added to the contingent of the total nodes
20.08/20.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
20.08/20.12 c heuristics/crossover/nodesofs = 750
20.08/20.12 c
20.08/20.12 c # number of nodes without incumbent change that heuristic should wait
20.08/20.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
20.08/20.12 c heuristics/crossover/nwaitingnodes = 100
20.08/20.12 c
20.08/20.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
20.08/20.12 c # [type: real, range: [0,1], default: 0.1]
20.08/20.12 c heuristics/crossover/nodesquot = 0.15
20.08/20.12 c
20.08/20.12 c # minimum percentage of integer variables that have to be fixed
20.08/20.12 c # [type: real, range: [0,1], default: 0.666]
20.08/20.12 c heuristics/crossover/minfixingrate = 0.5
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 20]
20.08/20.12 c heuristics/feaspump/freq = -1
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/feaspump/maxlpiterofs = 2000
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/fracdiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
20.08/20.12 c heuristics/fracdiving/maxlpiterquot = 0.075
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/fracdiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/guideddiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
20.08/20.12 c heuristics/guideddiving/maxlpiterquot = 0.075
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/guideddiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
20.08/20.12 c heuristics/intdiving/maxlpiterquot = 0.075
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/intshifting/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/linesearchdiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
20.08/20.12 c heuristics/linesearchdiving/maxlpiterquot = 0.075
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/linesearchdiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 1]
20.08/20.12 c heuristics/nlp/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 20]
20.08/20.12 c heuristics/objpscostdiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to total iteration number
20.08/20.12 c # [type: real, range: [0,1], default: 0.01]
20.08/20.12 c heuristics/objpscostdiving/maxlpiterquot = 0.015
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/objpscostdiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 1]
20.08/20.12 c heuristics/oneopt/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/pscostdiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
20.08/20.12 c heuristics/pscostdiving/maxlpiterquot = 0.075
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/pscostdiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 0]
20.08/20.12 c heuristics/rens/freq = -1
20.08/20.12 c
20.08/20.12 c # minimum percentage of integer variables that have to be fixable
20.08/20.12 c # [type: real, range: [0,1], default: 0.5]
20.08/20.12 c heuristics/rens/minfixingrate = 0.3
20.08/20.12 c
20.08/20.12 c # number of nodes added to the contingent of the total nodes
20.08/20.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
20.08/20.12 c heuristics/rens/nodesofs = 2000
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 20]
20.08/20.12 c heuristics/rootsoldiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
20.08/20.12 c heuristics/rootsoldiving/maxlpiterquot = 0.015
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/rootsoldiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 1]
20.08/20.12 c heuristics/rounding/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/shifting/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 1]
20.08/20.12 c heuristics/simplerounding/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 0]
20.08/20.12 c heuristics/trivial/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 1]
20.08/20.12 c heuristics/trysol/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 10]
20.08/20.12 c heuristics/veclendiving/freq = -1
20.08/20.12 c
20.08/20.12 c # maximal fraction of diving LP iterations compared to node LP iterations
20.08/20.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
20.08/20.12 c heuristics/veclendiving/maxlpiterquot = 0.075
20.08/20.12 c
20.08/20.12 c # additional number of allowed LP iterations
20.08/20.12 c # [type: int, range: [0,2147483647], default: 1000]
20.08/20.12 c heuristics/veclendiving/maxlpiterofs = 1500
20.08/20.12 c
20.08/20.12 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 1]
20.08/20.12 c heuristics/zirounding/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 0]
20.08/20.12 c separating/cmir/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: 0]
20.08/20.12 c separating/flowcover/freq = -1
20.08/20.12 c
20.08/20.12 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
20.08/20.12 c # [type: int, range: [-1,2147483647], default: -1]
20.08/20.12 c separating/rapidlearning/freq = 0
20.08/20.12 c
20.08/20.12 c -----------------------------------------------------------------------------------------------
20.08/20.12 c start solving
20.08/20.19 c
284.97/285.11 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
284.97/285.11 c 281s| 1 | 0 | 17083 | - | 608M| 0 | 11k| 79k| 236k| 79k| 236k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1789.55/1790.20 c 1786s| 1 | 0 | 22248 | - | 608M| 0 | - | 79k| 236k| 79k| 236k| 84 | 0 | 0 | 0.000000e+00 | -- | Inf
1789.65/1790.31 c 1786s| 1 | 2 | 22248 | - | 608M| 0 | - | 79k| 236k| 79k| 236k| 84 | 0 | 0 | 0.000000e+00 | -- | Inf
1789.65/1790.31 c
1789.65/1790.31 c SCIP Status : solving was interrupted [time limit reached]
1789.65/1790.31 c Solving Time (sec) : 1786.45
1789.65/1790.31 c Solving Nodes : 1
1789.65/1790.31 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1789.65/1790.31 c Dual Bound : +0.00000000000000e+00
1789.65/1790.31 c Gap : infinite
1789.65/1790.31 s UNKNOWN
1789.65/1790.31 c SCIP Status : solving was interrupted [time limit reached]
1789.65/1790.31 c Solving Time : 1786.45
1789.65/1790.31 c Original Problem :
1789.65/1790.31 c Problem name : HOME/instance-2703580-1278550324.opb
1789.65/1790.31 c Variables : 81558 (81558 binary, 0 integer, 0 implicit integer, 0 continuous)
1789.65/1790.31 c Constraints : 240469 initial, 240469 maximal
1789.65/1790.31 c Presolved Problem :
1789.65/1790.31 c Problem name : t_HOME/instance-2703580-1278550324.opb
1789.65/1790.31 c Variables : 79879 (79879 binary, 0 integer, 0 implicit integer, 0 continuous)
1789.65/1790.31 c Constraints : 236527 initial, 236527 maximal
1789.65/1790.31 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1789.65/1790.31 c trivial : 0.73 20 0 0 0 0 0 0 0
1789.65/1790.31 c dualfix : 0.73 0 0 0 0 0 0 0 0
1789.65/1790.31 c boundshift : 0.00 0 0 0 0 0 0 0 0
1789.65/1790.31 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1789.65/1790.31 c implics : 2.20 0 828 0 0 0 0 0 0
1789.65/1790.31 c probing : 0.00 0 0 0 0 0 0 0 0
1789.65/1790.31 c knapsack : 0.07 0 0 0 0 0 0 0 0
1789.65/1790.31 c setppc : 0.41 0 0 0 0 0 0 0 0
1789.65/1790.31 c linear : 10.34 822 9 0 822 0 3942 2302 4716
1789.65/1790.31 c logicor : 0.14 0 0 0 0 0 0 0 0
1789.65/1790.31 c root node : - 0 - - 0 - - - -
1789.65/1790.31 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1789.65/1790.31 c integral : 0 0 0 0 0 0 0 0 0 0
1789.65/1790.31 c knapsack : 4596 1 1 0 1 0 0 200 0 0
1789.65/1790.31 c setppc : 154731 1 1 0 1 0 0 0 0 0
1789.65/1790.31 c logicor : 77200 1 1 0 1 0 0 0 0 0
1789.65/1790.31 c countsols : 0 0 0 0 1 0 0 0 0 0
1789.65/1790.31 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1789.65/1790.31 c integral : 0.00 0.00 0.00 0.00 0.00
1789.65/1790.31 c knapsack : 0.01 0.01 0.00 0.00 0.00
1789.65/1790.31 c setppc : 0.08 0.02 0.01 0.00 0.05
1789.65/1790.31 c logicor : 0.13 0.02 0.09 0.00 0.03
1789.65/1790.31 c countsols : 0.00 0.00 0.00 0.00 0.00
1789.65/1790.31 c Propagators : Time Calls Cutoffs DomReds
1789.65/1790.31 c vbounds : 0.00 1 0 0
1789.65/1790.31 c rootredcost : 0.00 0 0 0
1789.65/1790.31 c pseudoobj : 0.00 0 0 0
1789.65/1790.31 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1789.65/1790.31 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1789.65/1790.31 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1789.65/1790.31 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1789.65/1790.31 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1789.65/1790.31 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1789.65/1790.31 c applied globally : - - - 0 0.0 - - -
1789.65/1790.31 c applied locally : - - - 0 0.0 - - -
1789.65/1790.31 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1789.65/1790.31 c cut pool : 0.00 0 - - 0 - (maximal pool size: 284)
1789.65/1790.31 c redcost : 0.01 1 0 0 0 0
1789.65/1790.31 c impliedbounds : 0.14 1 0 0 0 0
1789.65/1790.31 c intobj : 0.00 0 0 0 0 0
1789.65/1790.31 c cgmip : 0.00 0 0 0 0 0
1789.65/1790.31 c gomory : 537.88 1 0 0 500 0
1789.65/1790.31 c strongcg : 810.36 1 0 0 407 0
1789.65/1790.31 c cmir : 0.00 0 0 0 0 0
1789.65/1790.31 c flowcover : 0.00 0 0 0 0 0
1789.65/1790.31 c clique : 8.42 1 0 0 7 0
1789.65/1790.31 c zerohalf : 0.00 0 0 0 0 0
1789.65/1790.31 c mcf : 19.73 1 0 0 0 0
1789.65/1790.31 c rapidlearning : 0.00 0 0 0 0 0
1789.65/1790.31 c Pricers : Time Calls Vars
1789.65/1790.31 c problem variables: 0.00 0 0
1789.65/1790.31 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1789.65/1790.31 c relpscost : 0.00 0 0 0 0 0 0
1789.65/1790.31 c pscost : 0.00 0 0 0 0 0 0
1789.65/1790.31 c inference : 0.02 1 0 0 0 0 2
1789.65/1790.31 c mostinf : 0.00 0 0 0 0 0 0
1789.65/1790.31 c leastinf : 0.00 0 0 0 0 0 0
1789.65/1790.31 c fullstrong : 0.00 0 0 0 0 0 0
1789.65/1790.31 c allfullstrong : 0.00 0 0 0 0 0 0
1789.65/1790.31 c random : 0.00 0 0 0 0 0 0
1789.65/1790.31 c Primal Heuristics : Time Calls Found
1789.65/1790.31 c LP solutions : 0.00 - 0
1789.65/1790.31 c pseudo solutions : 0.00 - 0
1789.65/1790.31 c trivial : 0.16 1 0
1789.65/1790.31 c simplerounding : 0.00 0 0
1789.65/1790.31 c zirounding : 0.00 0 0
1789.65/1790.31 c rounding : 0.00 0 0
1789.65/1790.31 c shifting : 0.00 0 0
1789.65/1790.31 c intshifting : 0.00 0 0
1789.65/1790.31 c oneopt : 0.00 0 0
1789.65/1790.31 c twoopt : 0.00 0 0
1789.65/1790.31 c fixandinfer : 0.00 0 0
1789.65/1790.31 c feaspump : 0.00 0 0
1789.65/1790.31 c coefdiving : 0.00 0 0
1789.65/1790.31 c pscostdiving : 0.00 0 0
1789.65/1790.31 c fracdiving : 0.00 0 0
1789.65/1790.31 c veclendiving : 0.00 0 0
1789.65/1790.31 c intdiving : 0.00 0 0
1789.65/1790.31 c actconsdiving : 0.00 0 0
1789.65/1790.31 c objpscostdiving : 0.00 0 0
1789.65/1790.31 c rootsoldiving : 0.00 0 0
1789.65/1790.31 c linesearchdiving : 0.00 0 0
1789.65/1790.31 c guideddiving : 0.00 0 0
1789.65/1790.31 c octane : 0.00 0 0
1789.65/1790.31 c rens : 0.00 0 0
1789.65/1790.31 c rins : 0.00 0 0
1789.65/1790.31 c localbranching : 0.00 0 0
1789.65/1790.31 c mutation : 0.00 0 0
1789.65/1790.31 c crossover : 0.00 0 0
1789.65/1790.31 c dins : 0.00 0 0
1789.65/1790.31 c undercover : 0.00 0 0
1789.65/1790.31 c nlp : 0.00 0 0
1789.65/1790.31 c trysol : 0.00 0 0
1789.65/1790.31 c LP : Time Calls Iterations Iter/call Iter/sec
1789.65/1790.31 c primal LP : 0.00 0 0 0.00 -
1789.65/1790.31 c dual LP : 392.04 2 22248 11124.00 56.75
1789.65/1790.31 c lex dual LP : 0.00 0 0 0.00 -
1789.65/1790.31 c barrier LP : 0.00 0 0 0.00 -
1789.65/1790.31 c diving/probing LP: 0.00 0 0 0.00 -
1789.65/1790.32 c strong branching : 0.00 0 0 0.00 -
1789.65/1790.32 c (at root node) : - 0 0 0.00 -
1789.65/1790.32 c conflict analysis: 0.00 0 0 0.00 -
1789.65/1790.32 c B&B Tree :
1789.65/1790.32 c number of runs : 1
1789.65/1790.32 c nodes : 1
1789.65/1790.32 c nodes (total) : 1
1789.65/1790.32 c nodes left : 2
1789.65/1790.32 c max depth : 0
1789.65/1790.32 c max depth (total): 0
1789.65/1790.32 c backtracks : 0 (0.0%)
1789.65/1790.32 c delayed cutoffs : 0
1789.65/1790.32 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1789.65/1790.32 c avg switch length: 1.00
1789.65/1790.32 c switching time : 0.00
1789.65/1790.32 c Solution :
1789.65/1790.32 c Solutions found : 0 (0 improvements)
1789.65/1790.32 c Primal Bound : -
1789.65/1790.32 c Dual Bound : +0.00000000000000e+00
1789.65/1790.32 c Gap : infinite
1789.65/1790.32 c Root Dual Bound : +0.00000000000000e+00
1789.65/1790.32 c Root Iterations : 22248
1791.05/1791.79 c Time complete: 1791.15.