0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3690600-1338022664.opb>
0.18/0.24 c original problem has 26136 variables (26136 bin, 0 int, 0 impl, 0 cont) and 90585 constraints
0.18/0.24 c problem read in 0.24
0.18/0.24 c No objective function, only one solution is needed.
0.18/0.24 c presolving settings loaded
0.59/0.62 c presolving:
2.20/2.21 c presolving (1 rounds):
2.20/2.21 c 3335 deleted vars, 11366 deleted constraints, 0 added constraints, 3335 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.20/2.21 c 4038656 implications, 0 cliques
2.20/2.22 c presolving detected infeasibility
2.20/2.22 c Presolving Time: 1.86
2.20/2.22 c - non default parameters ----------------------------------------------------------------------
2.20/2.22 c # SCIP version 2.1.1.4
2.20/2.22 c
2.20/2.22 c # maximal time in seconds to run
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.20/2.22 c limits/time = 1797
2.20/2.22 c
2.20/2.22 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.20/2.22 c limits/memory = 13950
2.20/2.22 c
2.20/2.22 c # solving stops, if the given number of solutions were found (-1: no limit)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.22 c limits/solutions = 1
2.20/2.22 c
2.20/2.22 c # maximal number of separation rounds per node (-1: unlimited)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 5]
2.20/2.22 c separating/maxrounds = 1
2.20/2.22 c
2.20/2.22 c # maximal number of separation rounds in the root node (-1: unlimited)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.22 c separating/maxroundsroot = 5
2.20/2.22 c
2.20/2.22 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.20/2.22 c # [type: int, range: [1,2], default: 1]
2.20/2.22 c timing/clocktype = 2
2.20/2.22 c
2.20/2.22 c # belongs reading time to solving time?
2.20/2.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.20/2.22 c timing/reading = TRUE
2.20/2.22 c
2.20/2.22 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.20/2.22 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.20/2.22 c constraints/knapsack/disaggregation = FALSE
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/coefdiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.22 c heuristics/coefdiving/maxlpiterquot = 0.075
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/coefdiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 30]
2.20/2.22 c heuristics/crossover/freq = -1
2.20/2.22 c
2.20/2.22 c # number of nodes added to the contingent of the total nodes
2.20/2.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.20/2.22 c heuristics/crossover/nodesofs = 750
2.20/2.22 c
2.20/2.22 c # number of nodes without incumbent change that heuristic should wait
2.20/2.22 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.20/2.22 c heuristics/crossover/nwaitingnodes = 100
2.20/2.22 c
2.20/2.22 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.20/2.22 c # [type: real, range: [0,1], default: 0.1]
2.20/2.22 c heuristics/crossover/nodesquot = 0.15
2.20/2.22 c
2.20/2.22 c # minimum percentage of integer variables that have to be fixed
2.20/2.22 c # [type: real, range: [0,1], default: 0.666]
2.20/2.22 c heuristics/crossover/minfixingrate = 0.5
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 20]
2.20/2.22 c heuristics/feaspump/freq = -1
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/feaspump/maxlpiterofs = 2000
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/fracdiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.22 c heuristics/fracdiving/maxlpiterquot = 0.075
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/fracdiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/guideddiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.22 c heuristics/guideddiving/maxlpiterquot = 0.075
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/guideddiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.22 c heuristics/intdiving/maxlpiterquot = 0.075
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/intshifting/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/linesearchdiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.22 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 20]
2.20/2.22 c heuristics/objpscostdiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to total iteration number
2.20/2.22 c # [type: real, range: [0,1], default: 0.01]
2.20/2.22 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.22 c heuristics/oneopt/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/pscostdiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.22 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/pscostdiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.22 c heuristics/rens/freq = -1
2.20/2.22 c
2.20/2.22 c # minimum percentage of integer variables that have to be fixable
2.20/2.22 c # [type: real, range: [0,1], default: 0.5]
2.20/2.22 c heuristics/rens/minfixingrate = 0.3
2.20/2.22 c
2.20/2.22 c # number of nodes added to the contingent of the total nodes
2.20/2.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.20/2.22 c heuristics/rens/nodesofs = 2000
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 20]
2.20/2.22 c heuristics/rootsoldiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.20/2.22 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.22 c heuristics/rounding/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.22 c heuristics/shiftandpropagate/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/shifting/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.22 c heuristics/simplerounding/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.22 c heuristics/subnlp/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.22 c heuristics/trivial/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.22 c heuristics/trysol/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.22 c heuristics/undercover/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.20/2.22 c heuristics/veclendiving/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.20/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.20/2.22 c heuristics/veclendiving/maxlpiterquot = 0.075
2.20/2.22 c
2.20/2.22 c # additional number of allowed LP iterations
2.20/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.20/2.22 c heuristics/veclendiving/maxlpiterofs = 1500
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.22 c heuristics/zirounding/freq = -1
2.20/2.22 c
2.20/2.22 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.22 c propagating/probing/maxprerounds = 0
2.20/2.22 c
2.20/2.22 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.22 c separating/cmir/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.20/2.22 c separating/flowcover/freq = -1
2.20/2.22 c
2.20/2.22 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.20/2.22 c separating/rapidlearning/freq = 0
2.20/2.22 c
2.20/2.22 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
2.20/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.20/2.22 c heuristics/indoneopt/freq = -1
2.20/2.22 c
2.20/2.22 c -----------------------------------------------------------------------------------------------
2.20/2.22 c start solving
2.20/2.22 s UNSATISFIABLE
2.20/2.22 c SCIP Status : problem is solved [infeasible]
2.20/2.22 c Total Time : 2.21
2.20/2.22 c solving : 2.21
2.20/2.22 c presolving : 1.86 (included in solving)
2.20/2.22 c reading : 0.24 (included in solving)
2.20/2.22 c copying : 0.00 (0 times copied the problem)
2.20/2.22 c Original Problem :
2.20/2.22 c Problem name : HOME/instance-3690600-1338022664.opb
2.20/2.22 c Variables : 26136 (26136 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.22 c Constraints : 90585 initial, 90585 maximal
2.20/2.22 c Objective sense : minimize
2.20/2.22 c Presolved Problem :
2.20/2.22 c Problem name : t_HOME/instance-3690600-1338022664.opb
2.20/2.22 c Variables : 22801 (22801 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.22 c Constraints : 79219 initial, 79219 maximal
2.20/2.22 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.20/2.22 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.20/2.22 c linear : 1.55 0.02 3335 0 0 3335 0 11366 0 0 0
2.20/2.22 c root node : - - 0 - - 0 - - - - -
2.20/2.22 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
2.20/2.22 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
2.20/2.22 c linear : 79219 79219 0 0 0 0 0 0 0 0 0 0 0
2.20/2.22 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
2.20/2.22 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
2.20/2.22 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c linear : 0.02 0.02 0.00 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c Propagators : #Propagate #ResProp Cutoffs DomReds
2.20/2.22 c pseudoobj : 0 0 0 0
2.20/2.22 c redcost : 0 0 0 0
2.20/2.22 c rootredcost : 0 0 0 0
2.20/2.22 c vbounds : 0 0 0 0
2.20/2.22 c probing : 0 0 0 0
2.20/2.22 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
2.20/2.22 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c redcost : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c rootredcost : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c vbounds : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c probing : 0.00 0.00 0.00 0.00 0.00
2.20/2.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.20/2.22 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.22 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.22 c applied globally : - - - 0 0.0 - - -
2.20/2.22 c applied locally : - - - 0 0.0 - - -
2.20/2.22 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
2.20/2.22 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.20/2.22 c clique : 0.00 0.00 0 0 0 0 0
2.20/2.22 c closecuts : 0.00 0.00 0 0 0 0 0
2.20/2.22 c cgmip : 0.00 0.00 0 0 0 0 0
2.20/2.22 c cmir : 0.00 0.00 0 0 0 0 0
2.20/2.22 c flowcover : 0.00 0.00 0 0 0 0 0
2.20/2.22 c gomory : 0.00 0.00 0 0 0 0 0
2.20/2.22 c impliedbounds : 0.00 0.00 0 0 0 0 0
2.20/2.22 c intobj : 0.00 0.00 0 0 0 0 0
2.20/2.22 c mcf : 0.00 0.00 0 0 0 0 0
2.20/2.22 c oddcycle : 0.00 0.00 0 0 0 0 0
2.20/2.22 c rapidlearning : 0.00 0.00 0 0 0 0 0
2.20/2.22 c strongcg : 0.00 0.00 0 0 0 0 0
2.20/2.22 c zerohalf : 0.00 0.00 0 0 0 0 0
2.20/2.22 c Pricers : ExecTime SetupTime Calls Vars
2.20/2.22 c problem variables: 0.00 - 0 0
2.20/2.22 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
2.20/2.22 c pscost : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c inference : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c mostinf : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c leastinf : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c fullstrong : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c random : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c relpscost : 0.00 0.00 0 0 0 0 0 0
2.20/2.22 c Primal Heuristics : ExecTime SetupTime Calls Found
2.20/2.22 c LP solutions : 0.00 - - 0
2.20/2.22 c pseudo solutions : 0.00 - - 0
2.20/2.22 c smallcard : 0.00 0.00 0 0
2.20/2.22 c trivial : 0.02 0.00 1 0
2.20/2.22 c shiftandpropagate: 0.00 0.00 0 0
2.20/2.22 c simplerounding : 0.00 0.00 0 0
2.20/2.22 c zirounding : 0.00 0.00 0 0
2.20/2.22 c rounding : 0.00 0.00 0 0
2.20/2.22 c shifting : 0.00 0.00 0 0
2.20/2.22 c intshifting : 0.00 0.00 0 0
2.20/2.22 c oneopt : 0.00 0.00 0 0
2.20/2.22 c twoopt : 0.00 0.00 0 0
2.20/2.22 c indtwoopt : 0.00 0.00 0 0
2.20/2.22 c indoneopt : 0.00 0.00 0 0
2.20/2.22 c fixandinfer : 0.00 0.00 0 0
2.20/2.22 c feaspump : 0.00 0.00 0 0
2.20/2.22 c clique : 0.00 0.00 0 0
2.20/2.22 c indrounding : 0.00 0.00 0 0
2.20/2.22 c indcoefdiving : 0.00 0.00 0 0
2.20/2.22 c coefdiving : 0.00 0.00 0 0
2.20/2.22 c pscostdiving : 0.00 0.00 0 0
2.20/2.22 c nlpdiving : 0.00 0.00 0 0
2.20/2.22 c fracdiving : 0.00 0.00 0 0
2.20/2.22 c veclendiving : 0.00 0.00 0 0
2.20/2.22 c intdiving : 0.00 0.00 0 0
2.20/2.22 c actconsdiving : 0.00 0.00 0 0
2.20/2.22 c objpscostdiving : 0.00 0.00 0 0
2.20/2.22 c rootsoldiving : 0.00 0.00 0 0
2.20/2.22 c linesearchdiving : 0.00 0.00 0 0
2.20/2.22 c guideddiving : 0.00 0.00 0 0
2.20/2.22 c octane : 0.00 0.00 0 0
2.20/2.22 c rens : 0.00 0.00 0 0
2.20/2.22 c rins : 0.00 0.00 0 0
2.20/2.22 c localbranching : 0.00 0.00 0 0
2.20/2.22 c mutation : 0.00 0.00 0 0
2.20/2.22 c crossover : 0.00 0.00 0 0
2.20/2.22 c dins : 0.00 0.00 0 0
2.20/2.22 c vbounds : 0.00 0.00 0 0
2.20/2.22 c undercover : 0.00 0.00 0 0
2.20/2.22 c subnlp : 0.00 0.00 0 0
2.20/2.22 c trysol : 0.00 0.00 0 0
2.20/2.22 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
2.20/2.22 c primal LP : 0.00 0 0 0.00 - 0.00 0
2.20/2.22 c dual LP : 0.00 0 0 0.00 - 0.00 0
2.20/2.22 c lex dual LP : 0.00 0 0 0.00 -
2.20/2.22 c barrier LP : 0.00 0 0 0.00 - 0.00 0
2.20/2.22 c diving/probing LP: 0.00 0 0 0.00 -
2.20/2.22 c strong branching : 0.00 0 0 0.00 -
2.20/2.22 c (at root node) : - 0 0 0.00 -
2.20/2.22 c conflict analysis: 0.00 0 0 0.00 -
2.20/2.22 c B&B Tree :
2.20/2.22 c number of runs : 1
2.20/2.22 c nodes : 0
2.20/2.22 c nodes (total) : 0
2.20/2.22 c nodes left : 1
2.20/2.22 c max depth : -1
2.20/2.22 c max depth (total): -1
2.20/2.22 c backtracks : 0 (0.0%)
2.20/2.22 c delayed cutoffs : 0
2.20/2.22 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.20/2.22 c avg switch length: 0.00
2.20/2.22 c switching time : 0.00
2.20/2.22 c Solution :
2.20/2.22 c Solutions found : 0 (0 improvements)
2.20/2.22 c Primal Bound : infeasible
2.20/2.22 c Dual Bound : -
2.20/2.22 c Gap : infinite
2.20/2.22 c Root Dual Bound : -
2.20/2.22 c Root Iterations : 0
2.39/2.42 c Time complete: 2.41.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3690600-1338022664/watcher-3690600-1338022664 -o /tmp/evaluation-result-3690600-1338022664/solver-3690600-1338022664 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3690600-1338022664.opb -t 1800 -m 15500
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.00 2.00 1.99 3/176 29669
/proc/meminfo: memFree=29444784/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=10220 CPUtime=0 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 1274 0 0 0 0 0 0 0 20 0 1 0 268394921 10465280 1228 33554432000 4194304 10173063 140734752929376 140735423720216 7545739 0 0 4096 0 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 2555 1240 413 1460 0 1086 0
[startup+0.0502831 s]
/proc/loadavg: 2.00 2.00 1.99 3/176 29669
/proc/meminfo: memFree=29444784/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=25288 CPUtime=0.04 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 5081 0 0 0 4 0 0 0 20 0 1 0 268394921 25894912 5035 33554432000 4194304 10173063 140734752929376 140735423720216 5479875 0 0 4096 0 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 6322 5035 413 1460 0 4853 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 25288
[startup+0.100365 s]
/proc/loadavg: 2.00 2.00 1.99 3/176 29669
/proc/meminfo: memFree=29444784/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=32100 CPUtime=0.09 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 6777 0 0 0 8 1 0 0 20 0 1 0 268394921 32870400 6731 33554432000 4194304 10173063 140734752929376 140735423720216 7545739 0 0 4096 0 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 8025 6731 413 1460 0 6556 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 32100
[startup+0.300289 s]
/proc/loadavg: 2.00 2.00 1.99 3/176 29669
/proc/meminfo: memFree=29444784/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=91588 CPUtime=0.29 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 21635 0 0 0 26 3 0 0 20 0 1 0 268394921 93786112 21558 33554432000 4194304 10173063 140734752929376 140735423720216 4900240 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 22897 21558 465 1460 0 21428 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 91588
[startup+0.700303 s]
/proc/loadavg: 2.00 2.00 1.99 3/176 29669
/proc/meminfo: memFree=29444784/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=177836 CPUtime=0.68 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 45517 0 0 0 61 7 0 0 20 0 1 0 268394921 182104064 42438 33554432000 4194304 10173063 140734752929376 140734752925112 8963895 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 44459 42438 558 1460 0 42990 0
Current children cumulated CPU time (s) 0.68
Current children cumulated vsize (KiB) 177836
[startup+1.50029 s]
/proc/loadavg: 2.00 2.00 1.99 3/177 29670
/proc/meminfo: memFree=29237564/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=258484 CPUtime=1.49 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 65475 0 0 0 137 12 0 0 20 0 1 0 268394921 264687616 62396 33554432000 4194304 10173063 140734752929376 140734752926376 8963895 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 64621 62396 558 1460 0 63152 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 258484
Solver just ended. Dumping a history of the last processes samples
[startup+1.90031 s]
/proc/loadavg: 2.00 2.00 1.99 3/177 29670
/proc/meminfo: memFree=29237564/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=279648 CPUtime=1.89 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 70677 0 0 0 176 13 0 0 20 0 1 0 268394921 286359552 67598 33554432000 4194304 10173063 140734752929376 140734752926376 8963895 0 0 4096 16384 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 69912 67598 558 1460 0 68443 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 279648
[startup+2.30031 s]
/proc/loadavg: 2.00 2.00 1.99 3/177 29670
/proc/meminfo: memFree=29168248/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=269076 CPUtime=2.29 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 74130 0 0 0 215 14 0 0 20 0 1 0 268394921 275533824 64499 33554432000 4194304 10173063 140734752929376 140734752926376 4903640 0 0 4096 0 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 67269 64499 612 1460 0 65800 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 269076
[startup+2.40031 s]
/proc/loadavg: 2.00 2.00 1.99 3/177 29670
/proc/meminfo: memFree=29168248/32873844 swapFree=7100/7100
[pid=29669] ppid=29667 vsize=199520 CPUtime=2.39 cores=1,3,5,7
/proc/29669/stat : 29669 (scip-2.1.1.4fix) R 29667 29669 29021 0 -1 4202496 74135 0 0 0 224 15 0 0 20 0 1 0 268394921 204308480 47459 33554432000 4194304 10173063 140734752929376 140734752926376 8992599 0 0 4096 0 0 0 0 17 3 0 0 0 0 0
/proc/29669/statm: 49847 47426 617 1460 0 48378 0
Current children cumulated CPU time (s) 2.39
Current children cumulated vsize (KiB) 199520
Child status: 0
Real time (s): 2.42787
CPU time (s): 2.42563
CPU user time (s): 2.25966
CPU system time (s): 0.165974
CPU usage (%): 99.9079
Max. virtual memory (cumulated for all children) (KiB): 289928
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.25966
system time used= 0.165974
maximum resident set size= 281604
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 74151
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 4
runsolver used 0.005999 second user time and 0.012998 second system time
The end