24.49/24.55 c SCIP version 1.1.0.7
24.49/24.55 c LP-Solver Clp 1.8.2
24.49/24.55 c user parameter file <scip.set> not found - using default parameters
24.49/24.55 c read problem <HOME/instance-1885208-1245264326.opb>
24.49/24.55 c original problem has 270963 variables (270963 bin, 0 int, 0 impl, 0 cont) and 1601376 constraints
29.75/29.88 c No objective function, only one solution is needed.
29.75/29.88 c start presolving problem
29.75/29.88 c presolving:
29.75/29.88 c presolving (0 rounds):
29.75/29.88 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
29.75/29.88 c 0 implications, 0 cliques
29.75/29.88 c presolving was interrupted.
29.75/29.88 c Presolving Time: 0.92
29.75/29.88 c SATUNSAT-LIN
29.75/29.88 c -----------------------------------------------------------------------------------------------
29.75/29.88 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 0]
29.75/29.88 c separating/flowcover/freq = c -1
29.75/29.88 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 0]
29.75/29.88 c separating/cmir/freq = c -1
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/veclendiving/maxlpiterofs = c 1500
29.75/29.88 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.75/29.88 c heuristics/veclendiving/maxlpiterquot = c 0.075
29.75/29.88 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.88 c heuristics/veclendiving/freq = c -1
29.75/29.88 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 1]
29.75/29.88 c heuristics/simplerounding/freq = c -1
29.75/29.88 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.88 c heuristics/shifting/freq = c -1
29.75/29.88 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 1]
29.75/29.88 c heuristics/rounding/freq = c -1
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/rootsoldiving/maxlpiterofs = c 1500
29.75/29.88 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
29.75/29.88 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
29.75/29.88 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 20]
29.75/29.88 c heuristics/rootsoldiving/freq = c -1
29.75/29.88 c # number of nodes added to the contingent of the total nodes
29.75/29.88 c # [type: longint, range: [0,9223372036854775807], default: 500]
29.75/29.88 c heuristics/rens/nodesofs = c 2000
29.75/29.88 c # minimum percentage of integer variables that have to be fixable
29.75/29.88 c # [type: real, range: [0,1], default: 0.5]
29.75/29.88 c heuristics/rens/minfixingrate = c 0.3
29.75/29.88 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 0]
29.75/29.88 c heuristics/rens/freq = c -1
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/pscostdiving/maxlpiterofs = c 1500
29.75/29.88 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.75/29.88 c heuristics/pscostdiving/maxlpiterquot = c 0.075
29.75/29.88 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.88 c heuristics/pscostdiving/freq = c -1
29.75/29.88 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 1]
29.75/29.88 c heuristics/oneopt/freq = c -1
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/objpscostdiving/maxlpiterofs = c 1500
29.75/29.88 c # maximal fraction of diving LP iterations compared to total iteration number
29.75/29.88 c # [type: real, range: [0,1], default: 0.01]
29.75/29.88 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
29.75/29.88 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 20]
29.75/29.88 c heuristics/objpscostdiving/freq = c -1
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/linesearchdiving/maxlpiterofs = c 1500
29.75/29.88 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.75/29.88 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
29.75/29.88 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.88 c heuristics/linesearchdiving/freq = c -1
29.75/29.88 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.88 c heuristics/intshifting/freq = c -1
29.75/29.88 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.75/29.88 c heuristics/intdiving/maxlpiterquot = c 0.075
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/guideddiving/maxlpiterofs = c 1500
29.75/29.88 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.75/29.88 c heuristics/guideddiving/maxlpiterquot = c 0.075
29.75/29.88 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.88 c heuristics/guideddiving/freq = c -1
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/fracdiving/maxlpiterofs = c 1500
29.75/29.88 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.75/29.88 c heuristics/fracdiving/maxlpiterquot = c 0.075
29.75/29.88 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.88 c heuristics/fracdiving/freq = c -1
29.75/29.88 c # additional number of allowed LP iterations
29.75/29.88 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.88 c heuristics/feaspump/maxlpiterofs = c 2000
29.75/29.88 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
29.75/29.88 c # [type: int, range: [-1,2147483647], default: 20]
29.75/29.88 c heuristics/feaspump/freq = c -1
29.75/29.88 c # minimum percentage of integer variables that have to be fixed
29.75/29.88 c # [type: real, range: [0,1], default: 0.666]
29.75/29.89 c heuristics/crossover/minfixingrate = c 0.5
29.75/29.89 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
29.75/29.89 c # [type: real, range: [0,1], default: 0.1]
29.75/29.89 c heuristics/crossover/nodesquot = c 0.15
29.75/29.89 c # number of nodes without incumbent change that heuristic should wait
29.75/29.89 c # [type: longint, range: [0,9223372036854775807], default: 200]
29.75/29.89 c heuristics/crossover/nwaitingnodes = c 100
29.75/29.89 c # number of nodes added to the contingent of the total nodes
29.75/29.89 c # [type: longint, range: [0,9223372036854775807], default: 500]
29.75/29.89 c heuristics/crossover/nodesofs = c 750
29.75/29.89 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
29.75/29.89 c # [type: int, range: [-1,2147483647], default: 30]
29.75/29.89 c heuristics/crossover/freq = c -1
29.75/29.89 c # additional number of allowed LP iterations
29.75/29.89 c # [type: int, range: [0,2147483647], default: 1000]
29.75/29.89 c heuristics/coefdiving/maxlpiterofs = c 1500
29.75/29.89 c # maximal fraction of diving LP iterations compared to node LP iterations
29.75/29.89 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
29.75/29.89 c heuristics/coefdiving/maxlpiterquot = c 0.075
29.75/29.89 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
29.75/29.89 c # [type: int, range: [-1,2147483647], default: 10]
29.75/29.89 c heuristics/coefdiving/freq = c -1
29.75/29.89 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
29.75/29.89 c # [type: int, range: [-1,2147483647], default: -1]
29.75/29.89 c presolving/probing/maxrounds = c 0
29.75/29.89 c # should presolving try to simplify knapsacks
29.75/29.89 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
29.75/29.89 c constraints/knapsack/simplifyinequalities = c TRUE
29.75/29.89 c # should disaggregation of knapsack constraints be allowed in preprocessing?
29.75/29.89 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
29.75/29.89 c constraints/knapsack/disaggregation = c FALSE
29.75/29.89 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
29.75/29.89 c # [type: int, range: [-1,2147483647], default: -1]
29.75/29.89 c constraints/knapsack/maxnumcardlift = c 0
29.75/29.89 c # should presolving try to simplify inequalities
29.75/29.89 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
29.75/29.89 c constraints/linear/simplifyinequalities = c TRUE
29.75/29.89 c # maximal number of separation rounds in the root node (-1: unlimited)
29.75/29.89 c # [type: int, range: [-1,2147483647], default: -1]
29.75/29.89 c separating/maxroundsroot = c 5
29.75/29.89 c # maximal number of separation rounds per node (-1: unlimited)
29.75/29.89 c # [type: int, range: [-1,2147483647], default: 5]
29.75/29.89 c separating/maxrounds = c 1
29.75/29.89 c # solving stops, if the given number of solutions were found (-1: no limit)
29.75/29.89 c # [type: int, range: [-1,2147483647], default: -1]
29.75/29.89 c limits/solutions = c 1
29.75/29.89 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
29.75/29.89 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
29.75/29.89 c limits/memory = c 1620
29.75/29.89 c # maximal time in seconds to run
29.75/29.89 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
29.75/29.89 c limits/time = c 1791
29.75/29.89 c # frequency for displaying node information lines
29.75/29.89 c # [type: int, range: [-1,2147483647], default: 100]
29.75/29.89 c display/freq = c 10000
29.75/29.89 c -----------------------------------------------------------------------------------------------
29.75/29.89 c start solving problem
29.75/29.89 c presolving:
29.75/29.89 c presolving (0 rounds):
29.75/29.89 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
29.75/29.89 c 0 implications, 0 cliques
29.75/29.89 c presolving was interrupted.
29.75/29.89 c Presolving Time: 0.92
29.75/29.89 c
29.75/29.89 c SCIP Status : solving was interrupted [memory limit reached]
29.75/29.89 c Solving Time (sec) : 4.17
29.75/29.89 c Solving Nodes : 0
29.75/29.89 c Primal Bound : +1.00000000000000e+20 (0 solutions)
29.75/29.89 c NODE 0
29.75/29.89 c DUAL BOUND -1e+20
29.75/29.89 c PRIMAL BOUND 1e+20
29.75/29.89 c GAP 1e+20
29.75/29.89 s UNKNOWN
29.75/29.89 c SCIP Status : solving was interrupted [memory limit reached]
29.75/29.89 c Solving Time : 4.17
29.75/29.89 c Original Problem :
29.75/29.89 c Problem name : HOME/instance-1885208-1245264326.opb
29.75/29.89 c Variables : 270963 (270963 binary, 0 integer, 0 implicit integer, 0 continuous)
29.75/29.89 c Constraints : 1601376 initial, 1601376 maximal
29.75/29.89 c Presolved Problem :
29.75/29.89 c Problem name : t_HOME/instance-1885208-1245264326.opb
29.75/29.89 c Variables : 270963 (270963 binary, 0 integer, 0 implicit integer, 0 continuous)
29.75/29.89 c Constraints : 1601376 initial, 1601376 maximal
29.75/29.89 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
29.75/29.89 c trivial : 0.00 0 0 0 0 0 0 0 0
29.75/29.89 c dualfix : 0.00 0 0 0 0 0 0 0 0
29.75/29.89 c boundshift : 0.00 0 0 0 0 0 0 0 0
29.75/29.89 c inttobinary : 0.00 0 0 0 0 0 0 0 0
29.75/29.89 c implics : 0.00 0 0 0 0 0 0 0 0
29.75/29.89 c probing : 0.00 0 0 0 0 0 0 0 0
29.75/29.89 c linear : 0.00 0 0 0 0 0 0 0 0
29.75/29.89 c root node : - 0 - - 0 - - - -
29.75/29.89 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
29.75/29.89 c integral : 0 0 0 0 0 0 0 0 0 0
29.75/29.89 c linear : 0+ 0 0 0 0 0 0 0 0 0
29.75/29.89 c countsols : 0 0 0 0 0 0 0 0 0 0
29.75/29.89 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
29.75/29.89 c integral : 0.00 0.00 0.00 0.00 0.00
29.75/29.89 c linear : 0.00 0.00 0.00 0.00 0.00
29.75/29.89 c countsols : 0.00 0.00 0.00 0.00 0.00
29.75/29.89 c Propagators : Time Calls Cutoffs DomReds
29.75/29.89 c pseudoobj : 0.00 0 0 0
29.75/29.89 c rootredcost : 0.00 0 0 0
29.75/29.89 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
29.75/29.89 c propagation : 0.00 0 0 0 0.0 0 0.0 -
29.75/29.89 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
29.75/29.89 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
29.75/29.89 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
29.75/29.89 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
29.75/29.89 c applied globally : - - - 0 0.0 - - -
29.75/29.89 c applied locally : - - - 0 0.0 - - -
35.15/35.20 c Time complete: 35.16.