9.58/9.62 c SCIP version 1.1.0.7
9.58/9.62 c LP-Solver SoPlex 1.4.1
9.58/9.62 c user parameter file <scip.set> not found - using default parameters
9.58/9.62 c read problem <HOME/instance-1884307-1245256719.opb>
9.58/9.62 c original problem has 113583 variables (113583 bin, 0 int, 0 impl, 0 cont) and 649270 constraints
11.88/11.95 c No objective function, only one solution is needed.
11.88/11.95 c start presolving problem
11.88/11.95 c presolving:
22.07/22.12 c (round 1) 1019 del vars, 496 del conss, 34 chg bounds, 44 chg sides, 44 chg coeffs, 0 upgd conss, 3493772 impls, 0 clqs
22.77/22.87 c (round 2) 1506 del vars, 4755 del conss, 297 chg bounds, 44 chg sides, 44 chg coeffs, 0 upgd conss, 3496018 impls, 0 clqs
23.38/23.40 c (round 3) 1748 del vars, 5544 del conss, 318 chg bounds, 44 chg sides, 44 chg coeffs, 0 upgd conss, 3502506 impls, 0 clqs
23.87/23.91 c (round 4) 1769 del vars, 6028 del conss, 318 chg bounds, 44 chg sides, 44 chg coeffs, 0 upgd conss, 3503062 impls, 0 clqs
28.58/28.66 c (round 5) 1769 del vars, 6082 del conss, 318 chg bounds, 44 chg sides, 44 chg coeffs, 643188 upgd conss, 3503062 impls, 0 clqs
30.47/30.56 c presolving (6 rounds):
30.47/30.56 c 1769 deleted vars, 6082 deleted constraints, 318 tightened bounds, 0 added holes, 44 changed sides, 44 changed coefficients
30.47/30.56 c 3503062 implications, 0 cliques
30.47/30.56 c presolved problem has 111814 variables (111814 bin, 0 int, 0 impl, 0 cont) and 643188 constraints
30.47/30.56 c 643188 constraints of type <logicor>
30.47/30.56 c transformed objective value is always integral (scale: 1)
30.47/30.56 c Presolving Time: 16.18
30.47/30.56 c PURESAT
30.47/30.56 c -----------------------------------------------------------------------------------------------
30.47/30.56 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 0]
30.47/30.56 c separating/flowcover/freq = c -1
30.47/30.56 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 0]
30.47/30.56 c separating/cmir/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/veclendiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.56 c heuristics/veclendiving/maxlpiterquot = c 0.075
30.47/30.56 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/veclendiving/freq = c -1
30.47/30.56 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 1]
30.47/30.56 c heuristics/simplerounding/freq = c -1
30.47/30.56 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/shifting/freq = c -1
30.47/30.56 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 1]
30.47/30.56 c heuristics/rounding/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/rootsoldiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
30.47/30.56 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
30.47/30.56 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 20]
30.47/30.56 c heuristics/rootsoldiving/freq = c -1
30.47/30.56 c # number of nodes added to the contingent of the total nodes
30.47/30.56 c # [type: longint, range: [0,9223372036854775807], default: 500]
30.47/30.56 c heuristics/rens/nodesofs = c 2000
30.47/30.56 c # minimum percentage of integer variables that have to be fixable
30.47/30.56 c # [type: real, range: [0,1], default: 0.5]
30.47/30.56 c heuristics/rens/minfixingrate = c 0.3
30.47/30.56 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 0]
30.47/30.56 c heuristics/rens/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/pscostdiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.56 c heuristics/pscostdiving/maxlpiterquot = c 0.075
30.47/30.56 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/pscostdiving/freq = c -1
30.47/30.56 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 1]
30.47/30.56 c heuristics/oneopt/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/objpscostdiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to total iteration number
30.47/30.56 c # [type: real, range: [0,1], default: 0.01]
30.47/30.56 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
30.47/30.56 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 20]
30.47/30.56 c heuristics/objpscostdiving/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/linesearchdiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.56 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
30.47/30.56 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/linesearchdiving/freq = c -1
30.47/30.56 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/intshifting/freq = c -1
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.56 c heuristics/intdiving/maxlpiterquot = c 0.075
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/guideddiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.56 c heuristics/guideddiving/maxlpiterquot = c 0.075
30.47/30.56 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/guideddiving/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/fracdiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.56 c heuristics/fracdiving/maxlpiterquot = c 0.075
30.47/30.56 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/fracdiving/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/feaspump/maxlpiterofs = c 2000
30.47/30.56 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 20]
30.47/30.56 c heuristics/feaspump/freq = c -1
30.47/30.56 c # minimum percentage of integer variables that have to be fixed
30.47/30.56 c # [type: real, range: [0,1], default: 0.666]
30.47/30.56 c heuristics/crossover/minfixingrate = c 0.5
30.47/30.56 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
30.47/30.56 c # [type: real, range: [0,1], default: 0.1]
30.47/30.56 c heuristics/crossover/nodesquot = c 0.15
30.47/30.56 c # number of nodes without incumbent change that heuristic should wait
30.47/30.56 c # [type: longint, range: [0,9223372036854775807], default: 200]
30.47/30.56 c heuristics/crossover/nwaitingnodes = c 100
30.47/30.56 c # number of nodes added to the contingent of the total nodes
30.47/30.56 c # [type: longint, range: [0,9223372036854775807], default: 500]
30.47/30.56 c heuristics/crossover/nodesofs = c 750
30.47/30.56 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 30]
30.47/30.56 c heuristics/crossover/freq = c -1
30.47/30.56 c # additional number of allowed LP iterations
30.47/30.56 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.56 c heuristics/coefdiving/maxlpiterofs = c 1500
30.47/30.56 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.56 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.56 c heuristics/coefdiving/maxlpiterquot = c 0.075
30.47/30.56 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.56 c heuristics/coefdiving/freq = c -1
30.47/30.56 c # priority of node selection rule <dfs> in standard mode
30.47/30.56 c # [type: int, range: [-536870912,536870911], default: 0]
30.47/30.56 c nodeselection/dfs/stdpriority = c 1000000
30.47/30.56 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
30.47/30.56 c # [type: int, range: [-1,2147483647], default: -1]
30.47/30.56 c presolving/probing/maxrounds = c 0
30.47/30.56 c # should presolving try to simplify knapsacks
30.47/30.56 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.47/30.56 c constraints/knapsack/simplifyinequalities = c TRUE
30.47/30.56 c # should disaggregation of knapsack constraints be allowed in preprocessing?
30.47/30.56 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
30.47/30.56 c constraints/knapsack/disaggregation = c FALSE
30.47/30.56 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
30.57/30.68 c # [type: int, range: [-1,2147483647], default: -1]
30.57/30.68 c constraints/knapsack/maxnumcardlift = c 0
30.57/30.68 c # should presolving try to simplify inequalities
30.57/30.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.57/30.68 c constraints/linear/simplifyinequalities = c TRUE
30.57/30.68 c # maximal number of separation rounds in the root node (-1: unlimited)
30.57/30.68 c # [type: int, range: [-1,2147483647], default: -1]
30.57/30.68 c separating/maxroundsroot = c 5
30.57/30.68 c # maximal number of separation rounds per node (-1: unlimited)
30.57/30.68 c # [type: int, range: [-1,2147483647], default: 5]
30.57/30.68 c separating/maxrounds = c 1
30.57/30.68 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
30.57/30.68 c # [type: char, range: {lafpsqd}, default: l]
30.57/30.68 c lp/pricing = c a
30.57/30.68 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
30.57/30.68 c # [type: int, range: [-1,2147483647], default: 1]
30.57/30.68 c lp/solvefreq = c 0
30.57/30.68 c # solving stops, if the given number of solutions were found (-1: no limit)
30.57/30.68 c # [type: int, range: [-1,2147483647], default: -1]
30.57/30.68 c limits/solutions = c 1
30.57/30.68 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
30.57/30.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
30.57/30.68 c limits/memory = c 1620
30.57/30.68 c # maximal time in seconds to run
30.57/30.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
30.57/30.68 c limits/time = c 1791
30.57/30.68 c # frequency for displaying node information lines
30.57/30.68 c # [type: int, range: [-1,2147483647], default: 100]
30.57/30.68 c display/freq = c 10000
30.57/30.68 c # should enforcement of pseudo solution be disabled?
30.57/30.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.57/30.68 c constraints/disableenfops = c TRUE
30.57/30.68 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
30.57/30.68 c # [type: int, range: [-1,2147483647], default: 0]
30.57/30.68 c constraints/agelimit = c 1
30.57/30.68 c # should binary conflicts be preferred?
30.57/30.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.57/30.68 c conflict/preferbinary = c TRUE
30.57/30.68 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
30.57/30.68 c # [type: int, range: [-1,2147483647], default: -1]
30.57/30.68 c conflict/interconss = c 0
30.57/30.68 c -----------------------------------------------------------------------------------------------
30.57/30.68 c start solving problem
30.57/30.68 c
94.65/94.76 EMALLC01 malloc: Out of memory - cannot allocate 20582048 bytes
94.65/94.77 c [src/scip/lpi_spx.cpp:265] Warning: SoPlex threw an exception: XMALLC01 malloc: Could not allocate enough memory