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: 947bdb7-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-3691766-1338039349.opb>
0.19/0.27 c original problem has 26136 variables (26136 bin, 0 int, 0 impl, 0 cont) and 90585 constraints
0.19/0.27 c problem read in 0.27
0.19/0.27 c No objective function, only one solution is needed.
0.19/0.27 c presolving settings loaded
0.39/0.47 c presolving:
1.99/2.10 c presolving (1 rounds):
1.99/2.10 c 3335 deleted vars, 11366 deleted constraints, 0 added constraints, 3335 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.99/2.10 c 4038656 implications, 0 cliques
2.09/2.11 c presolving detected infeasibility
2.09/2.11 c Presolving Time: 1.68
2.09/2.11 c - non default parameters ----------------------------------------------------------------------
2.09/2.11 c # SCIP version 2.1.1.4
2.09/2.11 c
2.09/2.11 c # maximal time in seconds to run
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.09/2.11 c limits/time = 1797
2.09/2.11 c
2.09/2.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.09/2.11 c limits/memory = 13950
2.09/2.11 c
2.09/2.11 c # solving stops, if the given number of solutions were found (-1: no limit)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c limits/solutions = 1
2.09/2.11 c
2.09/2.11 c # maximal number of separation rounds per node (-1: unlimited)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 5]
2.09/2.11 c separating/maxrounds = 1
2.09/2.11 c
2.09/2.11 c # maximal number of separation rounds in the root node (-1: unlimited)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c separating/maxroundsroot = 5
2.09/2.11 c
2.09/2.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.09/2.11 c # [type: int, range: [1,2], default: 1]
2.09/2.11 c timing/clocktype = 2
2.09/2.11 c
2.09/2.11 c # belongs reading time to solving time?
2.09/2.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.09/2.11 c timing/reading = TRUE
2.09/2.11 c
2.09/2.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.09/2.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.09/2.11 c constraints/knapsack/disaggregation = FALSE
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/coefdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/coefdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/coefdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 30]
2.09/2.11 c heuristics/crossover/freq = -1
2.09/2.11 c
2.09/2.11 c # number of nodes added to the contingent of the total nodes
2.09/2.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.09/2.11 c heuristics/crossover/nodesofs = 750
2.09/2.11 c
2.09/2.11 c # number of nodes without incumbent change that heuristic should wait
2.09/2.11 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.09/2.11 c heuristics/crossover/nwaitingnodes = 100
2.09/2.11 c
2.09/2.11 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.09/2.11 c # [type: real, range: [0,1], default: 0.1]
2.09/2.11 c heuristics/crossover/nodesquot = 0.15
2.09/2.11 c
2.09/2.11 c # minimum percentage of integer variables that have to be fixed
2.09/2.11 c # [type: real, range: [0,1], default: 0.666]
2.09/2.11 c heuristics/crossover/minfixingrate = 0.5
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 20]
2.09/2.11 c heuristics/feaspump/freq = -1
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/feaspump/maxlpiterofs = 2000
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/fracdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/fracdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/fracdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/guideddiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/guideddiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/guideddiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/intdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/intshifting/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/linesearchdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 20]
2.09/2.11 c heuristics/objpscostdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to total iteration number
2.09/2.11 c # [type: real, range: [0,1], default: 0.01]
2.09/2.11 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/oneopt/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/pscostdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/pscostdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/rens/freq = -1
2.09/2.11 c
2.09/2.11 c # minimum percentage of integer variables that have to be fixable
2.09/2.11 c # [type: real, range: [0,1], default: 0.5]
2.09/2.11 c heuristics/rens/minfixingrate = 0.3
2.09/2.11 c
2.09/2.11 c # number of nodes added to the contingent of the total nodes
2.09/2.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.09/2.11 c heuristics/rens/nodesofs = 2000
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 20]
2.09/2.11 c heuristics/rootsoldiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.09/2.11 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/rounding/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/shiftandpropagate/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/shifting/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/simplerounding/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/subnlp/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/trivial/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/trysol/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/undercover/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/veclendiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/veclendiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/veclendiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/zirounding/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c propagating/probing/maxprerounds = 0
2.09/2.11 c
2.09/2.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c separating/cmir/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c separating/flowcover/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c separating/rapidlearning/freq = 0
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/indoneopt/freq = -1
2.09/2.11 c
2.09/2.11 c -----------------------------------------------------------------------------------------------
2.09/2.11 c start solving
2.09/2.11 s UNSATISFIABLE
2.09/2.11 c SCIP Status : problem is solved [infeasible]
2.09/2.11 c Total Time : 2.11
2.09/2.11 c solving : 2.11
2.09/2.11 c presolving : 1.68 (included in solving)
2.09/2.11 c reading : 0.27 (included in solving)
2.09/2.11 c copying : 0.00 (0 times copied the problem)
2.09/2.11 c Original Problem :
2.09/2.11 c Problem name : HOME/instance-3691766-1338039349.opb
2.09/2.11 c Variables : 26136 (26136 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.11 c Constraints : 90585 initial, 90585 maximal
2.09/2.11 c Objective sense : minimize
2.09/2.11 c Presolved Problem :
2.09/2.11 c Problem name : t_HOME/instance-3691766-1338039349.opb
2.09/2.11 c Variables : 22801 (22801 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.11 c Constraints : 79219 initial, 79219 maximal
2.09/2.11 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.09/2.11 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
2.09/2.11 c linear : 1.60 0.06 3335 0 0 3335 0 11366 0 0 0
2.09/2.11 c root node : - - 0 - - 0 - - - - -
2.09/2.11 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
2.09/2.11 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
2.09/2.11 c linear : 79219 79219 0 0 0 0 0 0 0 0 0 0 0
2.09/2.11 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
2.09/2.11 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
2.09/2.11 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c linear : 0.06 0.06 0.00 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c Propagators : #Propagate #ResProp Cutoffs DomReds
2.09/2.11 c pseudoobj : 0 0 0 0
2.09/2.11 c redcost : 0 0 0 0
2.09/2.11 c rootredcost : 0 0 0 0
2.09/2.11 c vbounds : 0 0 0 0
2.09/2.11 c probing : 0 0 0 0
2.09/2.11 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
2.09/2.11 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c redcost : 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c rootredcost : 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c vbounds : 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c probing : 0.00 0.00 0.00 0.00 0.00
2.09/2.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.09/2.11 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.09/2.11 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.09/2.11 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.09/2.11 c applied globally : - - - 0 0.0 - - -
2.09/2.11 c applied locally : - - - 0 0.0 - - -
2.09/2.11 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
2.09/2.11 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.09/2.11 c clique : 0.00 0.00 0 0 0 0 0
2.09/2.11 c closecuts : 0.00 0.00 0 0 0 0 0
2.09/2.11 c cgmip : 0.00 0.00 0 0 0 0 0
2.09/2.11 c cmir : 0.00 0.00 0 0 0 0 0
2.09/2.11 c flowcover : 0.00 0.00 0 0 0 0 0
2.09/2.11 c gomory : 0.00 0.00 0 0 0 0 0
2.09/2.11 c impliedbounds : 0.00 0.00 0 0 0 0 0
2.09/2.11 c intobj : 0.00 0.00 0 0 0 0 0
2.09/2.11 c mcf : 0.00 0.00 0 0 0 0 0
2.09/2.11 c oddcycle : 0.00 0.00 0 0 0 0 0
2.09/2.11 c rapidlearning : 0.00 0.00 0 0 0 0 0
2.09/2.11 c strongcg : 0.00 0.00 0 0 0 0 0
2.09/2.11 c zerohalf : 0.00 0.00 0 0 0 0 0
2.09/2.11 c Pricers : ExecTime SetupTime Calls Vars
2.09/2.11 c problem variables: 0.00 - 0 0
2.09/2.11 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
2.09/2.11 c pscost : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c inference : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c mostinf : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c leastinf : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c fullstrong : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c random : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c relpscost : 0.00 0.00 0 0 0 0 0 0
2.09/2.11 c Primal Heuristics : ExecTime SetupTime Calls Found
2.09/2.11 c LP solutions : 0.00 - - 0
2.09/2.11 c pseudo solutions : 0.00 - - 0
2.09/2.11 c smallcard : 0.00 0.00 0 0
2.09/2.11 c trivial : 0.02 0.00 1 0
2.09/2.11 c shiftandpropagate: 0.00 0.00 0 0
2.09/2.11 c simplerounding : 0.00 0.00 0 0
2.09/2.11 c zirounding : 0.00 0.00 0 0
2.09/2.11 c rounding : 0.00 0.00 0 0
2.09/2.11 c shifting : 0.00 0.00 0 0
2.09/2.11 c intshifting : 0.00 0.00 0 0
2.09/2.11 c oneopt : 0.00 0.00 0 0
2.09/2.11 c twoopt : 0.00 0.00 0 0
2.09/2.11 c indtwoopt : 0.00 0.00 0 0
2.09/2.11 c indoneopt : 0.00 0.00 0 0
2.09/2.11 c fixandinfer : 0.00 0.00 0 0
2.09/2.11 c feaspump : 0.00 0.00 0 0
2.09/2.11 c clique : 0.00 0.00 0 0
2.09/2.11 c indrounding : 0.00 0.00 0 0
2.09/2.11 c indcoefdiving : 0.00 0.00 0 0
2.09/2.11 c coefdiving : 0.00 0.00 0 0
2.09/2.11 c pscostdiving : 0.00 0.00 0 0
2.09/2.11 c nlpdiving : 0.00 0.00 0 0
2.09/2.11 c fracdiving : 0.00 0.00 0 0
2.09/2.11 c veclendiving : 0.00 0.00 0 0
2.09/2.11 c intdiving : 0.00 0.00 0 0
2.09/2.11 c actconsdiving : 0.00 0.00 0 0
2.09/2.11 c objpscostdiving : 0.00 0.00 0 0
2.09/2.11 c rootsoldiving : 0.00 0.00 0 0
2.09/2.11 c linesearchdiving : 0.00 0.00 0 0
2.09/2.11 c guideddiving : 0.00 0.00 0 0
2.09/2.11 c octane : 0.00 0.00 0 0
2.09/2.11 c rens : 0.00 0.00 0 0
2.09/2.11 c rins : 0.00 0.00 0 0
2.09/2.11 c localbranching : 0.00 0.00 0 0
2.09/2.11 c mutation : 0.00 0.00 0 0
2.09/2.11 c crossover : 0.00 0.00 0 0
2.09/2.11 c dins : 0.00 0.00 0 0
2.09/2.11 c vbounds : 0.00 0.00 0 0
2.09/2.11 c undercover : 0.00 0.00 0 0
2.09/2.11 c subnlp : 0.00 0.00 0 0
2.09/2.11 c trysol : 0.00 0.00 0 0
2.09/2.11 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
2.09/2.11 c primal LP : 0.00 0 0 0.00 - 0.00 0
2.09/2.11 c dual LP : 0.00 0 0 0.00 - 0.00 0
2.09/2.11 c lex dual LP : 0.00 0 0 0.00 -
2.09/2.11 c barrier LP : 0.00 0 0 0.00 - 0.00 0
2.09/2.11 c diving/probing LP: 0.00 0 0 0.00 -
2.09/2.11 c strong branching : 0.00 0 0 0.00 -
2.09/2.11 c (at root node) : - 0 0 0.00 -
2.09/2.11 c conflict analysis: 0.00 0 0 0.00 -
2.09/2.11 c B&B Tree :
2.09/2.11 c number of runs : 1
2.09/2.11 c nodes : 0
2.09/2.11 c nodes (total) : 0
2.09/2.11 c nodes left : 1
2.09/2.11 c max depth : -1
2.09/2.11 c max depth (total): -1
2.09/2.11 c backtracks : 0 (0.0%)
2.09/2.11 c delayed cutoffs : 0
2.09/2.11 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.09/2.11 c avg switch length: 0.00
2.09/2.11 c switching time : 0.00
2.09/2.11 c Solution :
2.09/2.11 c Solutions found : 0 (0 improvements)
2.09/2.11 c Primal Bound : infeasible
2.09/2.11 c Dual Bound : -
2.09/2.11 c Gap : infinite
2.09/2.11 c Root Dual Bound : -
2.09/2.11 c Root Iterations : 0
2.19/2.29 c Time complete: 2.28.
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-3691766-1338039349/watcher-3691766-1338039349 -o /tmp/evaluation-result-3691766-1338039349/solver-3691766-1338039349 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3691766-1338039349.opb -t 1800 -m 15500
running on 4 cores: 0,2,4,6
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 2.00 3/174 31018
/proc/meminfo: memFree=29232800/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=12028 CPUtime=0 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 1634 0 0 0 0 0 0 0 20 0 1 0 270063495 12316672 1589 33554432000 4194304 10219143 140734171432064 140737435564648 8891101 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 3007 1599 398 1471 0 1527 0
[startup+0.0903961 s]
/proc/loadavg: 2.00 2.00 2.00 3/174 31018
/proc/meminfo: memFree=29232800/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=36908 CPUtime=0.08 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 7984 0 0 0 7 1 0 0 20 0 1 0 270063495 37793792 7938 33554432000 4194304 10219143 140734171432064 140737435564648 5347033 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 9227 7938 419 1471 0 7747 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 36908
[startup+0.100274 s]
/proc/loadavg: 2.00 2.00 2.00 3/174 31018
/proc/meminfo: memFree=29232800/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=39084 CPUtime=0.09 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 8524 0 0 0 8 1 0 0 20 0 1 0 270063495 40022016 8478 33554432000 4194304 10219143 140734171432064 140737435564648 5424202 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 9771 8478 419 1471 0 8291 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 39084
[startup+0.300225 s]
/proc/loadavg: 2.00 2.00 2.00 3/174 31018
/proc/meminfo: memFree=29232800/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=96092 CPUtime=0.28 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 22640 0 0 0 25 3 0 0 20 0 1 0 270063495 98398208 22595 33554432000 4194304 10219143 140734171432064 140734171296776 7589947 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 24023 22626 465 1471 0 22543 0
Current children cumulated CPU time (s) 0.28
Current children cumulated vsize (KiB) 96092
[startup+0.700232 s]
/proc/loadavg: 2.00 2.00 2.00 3/174 31018
/proc/meminfo: memFree=29232800/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=192096 CPUtime=0.69 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 46126 0 0 0 61 8 0 0 20 0 1 0 270063495 196706304 46063 33554432000 4194304 10219143 140734171432064 140734171296776 9008087 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 48024 46063 559 1471 0 46544 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 192096
[startup+1.50023 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 31019
/proc/meminfo: memFree=29016900/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=262724 CPUtime=1.49 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 63571 0 0 0 136 13 0 0 20 0 1 0 270063495 269029376 63508 33554432000 4194304 10219143 140734171432064 140734171429064 9008087 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 65681 63508 559 1471 0 64201 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 262724
Solver just ended. Dumping a history of the last processes samples
[startup+1.90023 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 31019
/proc/meminfo: memFree=29016900/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=282624 CPUtime=1.89 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 68254 0 0 0 172 17 0 0 20 0 1 0 270063495 289406976 68191 33554432000 4194304 10219143 140734171432064 140734171429064 9008087 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 70656 68195 559 1471 0 69176 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 282624
[startup+2.10023 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 31019
/proc/meminfo: memFree=28958496/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=287692 CPUtime=2.09 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 69202 0 0 0 190 19 0 0 20 0 1 0 270063495 294596608 69035 33554432000 4194304 10219143 140734171432064 140734171429064 8891101 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 71923 69045 569 1471 0 70443 0
Current children cumulated CPU time (s) 2.09
Current children cumulated vsize (KiB) 287692
[startup+2.20611 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 31019
/proc/meminfo: memFree=28958496/32873844 swapFree=7104/7104
[pid=31018] ppid=31016 vsize=255928 CPUtime=2.19 cores=0,2,4,6
/proc/31018/stat : 31018 (scip-2.1.1.4exp) R 31016 31018 28130 0 -1 4202496 70393 0 0 0 199 20 0 0 20 0 1 0 270063495 262070272 61230 33554432000 4194304 10219143 140734171432064 140734171431240 7589177 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/31018/statm: 63982 61230 607 1471 0 62502 0
Current children cumulated CPU time (s) 2.19
Current children cumulated vsize (KiB) 255928
Child status: 0
Real time (s): 2.29092
CPU time (s): 2.28965
CPU user time (s): 2.06669
CPU system time (s): 0.222966
CPU usage (%): 99.9448
Max. virtual memory (cumulated for all children) (KiB): 287692
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.06669
system time used= 0.222966
maximum resident set size= 279468
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 70410
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= 7
runsolver used 0.004999 second user time and 0.014997 second system time
The end