12.59/12.66 c SCIP version 1.1.0.7
12.59/12.66 c LP-Solver Clp 1.8.2
12.59/12.66 c user parameter file <scip.set> not found - using default parameters
12.59/12.66 c read problem <HOME/instance-1885668-1245268469.opb>
12.59/12.66 c original problem has 187517 variables (187517 bin, 0 int, 0 impl, 0 cont) and 863483 constraints
15.69/15.74 c No objective function, only one solution is needed.
15.69/15.74 c start presolving problem
15.69/15.74 c presolving:
21.99/22.07 c (round 1) 40065 del vars, 61265 del conss, 29360 chg bounds, 9 chg sides, 24 chg coeffs, 0 upgd conss, 1395548 impls, 0 clqs
26.29/26.37 c (round 2) 69576 del vars, 219345 del conss, 36067 chg bounds, 14 chg sides, 33 chg coeffs, 0 upgd conss, 1468718 impls, 0 clqs
30.58/30.60 c (round 3) 81859 del vars, 335713 del conss, 36709 chg bounds, 450 chg sides, 651 chg coeffs, 0 upgd conss, 3442841 impls, 0 clqs
33.48/33.51 c (round 4) 85436 del vars, 397436 del conss, 37338 chg bounds, 450 chg sides, 651 chg coeffs, 0 upgd conss, 3948911 impls, 0 clqs
34.38/34.41 c (round 5) 85811 del vars, 404329 del conss, 37483 chg bounds, 450 chg sides, 651 chg coeffs, 0 upgd conss, 3996777 impls, 0 clqs
34.78/34.85 c (round 6) 85875 del vars, 405141 del conss, 37547 chg bounds, 450 chg sides, 651 chg coeffs, 0 upgd conss, 3996777 impls, 0 clqs
35.18/35.24 c (round 7) 85875 del vars, 405205 del conss, 37547 chg bounds, 450 chg sides, 651 chg coeffs, 0 upgd conss, 3996777 impls, 0 clqs
39.98/40.04 c (round 8) 85875 del vars, 405688 del conss, 37547 chg bounds, 450 chg sides, 651 chg coeffs, 457795 upgd conss, 3996777 impls, 0 clqs
40.98/41.06 c presolving (9 rounds):
40.98/41.06 c 85875 deleted vars, 405688 deleted constraints, 37547 tightened bounds, 0 added holes, 450 changed sides, 651 changed coefficients
40.98/41.06 c 3996777 implications, 0 cliques
40.98/41.06 c presolved problem has 101642 variables (101642 bin, 0 int, 0 impl, 0 cont) and 457795 constraints
40.98/41.06 c 457795 constraints of type <logicor>
40.98/41.07 c transformed objective value is always integral (scale: 1)
40.98/41.07 c Presolving Time: 22.66
40.98/41.07 c PURESAT
40.98/41.07 c -----------------------------------------------------------------------------------------------
40.98/41.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 0]
40.98/41.07 c separating/flowcover/freq = c -1
40.98/41.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 0]
40.98/41.07 c separating/cmir/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/veclendiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
40.98/41.07 c heuristics/veclendiving/maxlpiterquot = c 0.075
40.98/41.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/veclendiving/freq = c -1
40.98/41.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 1]
40.98/41.07 c heuristics/simplerounding/freq = c -1
40.98/41.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/shifting/freq = c -1
40.98/41.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 1]
40.98/41.07 c heuristics/rounding/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/rootsoldiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
40.98/41.07 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
40.98/41.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 20]
40.98/41.07 c heuristics/rootsoldiving/freq = c -1
40.98/41.07 c # number of nodes added to the contingent of the total nodes
40.98/41.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
40.98/41.07 c heuristics/rens/nodesofs = c 2000
40.98/41.07 c # minimum percentage of integer variables that have to be fixable
40.98/41.07 c # [type: real, range: [0,1], default: 0.5]
40.98/41.07 c heuristics/rens/minfixingrate = c 0.3
40.98/41.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 0]
40.98/41.07 c heuristics/rens/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/pscostdiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
40.98/41.07 c heuristics/pscostdiving/maxlpiterquot = c 0.075
40.98/41.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/pscostdiving/freq = c -1
40.98/41.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 1]
40.98/41.07 c heuristics/oneopt/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/objpscostdiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to total iteration number
40.98/41.07 c # [type: real, range: [0,1], default: 0.01]
40.98/41.07 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
40.98/41.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 20]
40.98/41.07 c heuristics/objpscostdiving/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/linesearchdiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
40.98/41.07 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
40.98/41.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/linesearchdiving/freq = c -1
40.98/41.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/intshifting/freq = c -1
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
40.98/41.07 c heuristics/intdiving/maxlpiterquot = c 0.075
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/guideddiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
40.98/41.07 c heuristics/guideddiving/maxlpiterquot = c 0.075
40.98/41.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/guideddiving/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/fracdiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
40.98/41.07 c heuristics/fracdiving/maxlpiterquot = c 0.075
40.98/41.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/fracdiving/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/feaspump/maxlpiterofs = c 2000
40.98/41.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 20]
40.98/41.07 c heuristics/feaspump/freq = c -1
40.98/41.07 c # minimum percentage of integer variables that have to be fixed
40.98/41.07 c # [type: real, range: [0,1], default: 0.666]
40.98/41.07 c heuristics/crossover/minfixingrate = c 0.5
40.98/41.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
40.98/41.07 c # [type: real, range: [0,1], default: 0.1]
40.98/41.07 c heuristics/crossover/nodesquot = c 0.15
40.98/41.07 c # number of nodes without incumbent change that heuristic should wait
40.98/41.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
40.98/41.07 c heuristics/crossover/nwaitingnodes = c 100
40.98/41.07 c # number of nodes added to the contingent of the total nodes
40.98/41.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
40.98/41.07 c heuristics/crossover/nodesofs = c 750
40.98/41.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 30]
40.98/41.07 c heuristics/crossover/freq = c -1
40.98/41.07 c # additional number of allowed LP iterations
40.98/41.07 c # [type: int, range: [0,2147483647], default: 1000]
40.98/41.07 c heuristics/coefdiving/maxlpiterofs = c 1500
40.98/41.07 c # maximal fraction of diving LP iterations compared to node LP iterations
40.98/41.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
40.98/41.07 c heuristics/coefdiving/maxlpiterquot = c 0.075
40.98/41.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: 10]
40.98/41.07 c heuristics/coefdiving/freq = c -1
40.98/41.07 c # priority of node selection rule <dfs> in standard mode
40.98/41.07 c # [type: int, range: [-536870912,536870911], default: 0]
40.98/41.07 c nodeselection/dfs/stdpriority = c 1000000
40.98/41.07 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
40.98/41.07 c # [type: int, range: [-1,2147483647], default: -1]
40.98/41.07 c presolving/probing/maxrounds = c 0
40.98/41.07 c # should presolving try to simplify knapsacks
40.98/41.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
40.98/41.07 c constraints/knapsack/simplifyinequalities = c TRUE
40.98/41.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
40.98/41.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
40.98/41.07 c constraints/knapsack/disaggregation = c FALSE
40.98/41.07 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
41.17/41.20 c # [type: int, range: [-1,2147483647], default: -1]
41.17/41.20 c constraints/knapsack/maxnumcardlift = c 0
41.17/41.20 c # should presolving try to simplify inequalities
41.17/41.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
41.17/41.20 c constraints/linear/simplifyinequalities = c TRUE
41.17/41.20 c # maximal number of separation rounds in the root node (-1: unlimited)
41.17/41.20 c # [type: int, range: [-1,2147483647], default: -1]
41.17/41.20 c separating/maxroundsroot = c 5
41.17/41.20 c # maximal number of separation rounds per node (-1: unlimited)
41.17/41.20 c # [type: int, range: [-1,2147483647], default: 5]
41.17/41.20 c separating/maxrounds = c 1
41.17/41.20 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)
41.17/41.20 c # [type: char, range: {lafpsqd}, default: l]
41.17/41.20 c lp/pricing = c a
41.17/41.20 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
41.17/41.20 c # [type: int, range: [-1,2147483647], default: 1]
41.17/41.20 c lp/solvefreq = c 0
41.17/41.20 c # solving stops, if the given number of solutions were found (-1: no limit)
41.17/41.20 c # [type: int, range: [-1,2147483647], default: -1]
41.17/41.20 c limits/solutions = c 1
41.17/41.20 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
41.17/41.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
41.17/41.20 c limits/memory = c 1620
41.17/41.20 c # maximal time in seconds to run
41.17/41.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
41.17/41.20 c limits/time = c 1791
41.17/41.20 c # frequency for displaying node information lines
41.17/41.20 c # [type: int, range: [-1,2147483647], default: 100]
41.17/41.20 c display/freq = c 10000
41.17/41.20 c # should enforcement of pseudo solution be disabled?
41.17/41.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
41.17/41.20 c constraints/disableenfops = c TRUE
41.17/41.20 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
41.17/41.20 c # [type: int, range: [-1,2147483647], default: 0]
41.17/41.20 c constraints/agelimit = c 1
41.17/41.20 c # should binary conflicts be preferred?
41.17/41.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
41.17/41.20 c conflict/preferbinary = c TRUE
41.17/41.20 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
41.17/41.20 c # [type: int, range: [-1,2147483647], default: -1]
41.17/41.20 c conflict/interconss = c 0
41.17/41.20 c -----------------------------------------------------------------------------------------------
41.17/41.20 c start solving problem
41.17/41.20 c