0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-3739579-1338730379.opb>
0.59/0.68 c original problem has 30976 variables (30976 bin, 0 int, 0 impl, 0 cont) and 107613 constraints
0.59/0.68 c problem read
0.59/0.68 c No objective function, only one solution is needed.
0.59/0.68 c presolving settings loaded
0.79/0.89 c presolving:
2.49/2.52 c presolving (1 rounds):
2.49/2.52 c 3605 deleted vars, 13161 deleted constraints, 3605 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.49/2.52 c 4518512 implications, 0 cliques
2.49/2.52 c presolving detected infeasibility
2.49/2.52 c Presolving Time: 1.69
2.49/2.52 c - non default parameters ----------------------------------------------------------------------
2.49/2.52 c # SCIP version 1.2.1.3
2.49/2.52 c
2.49/2.52 c # frequency for displaying node information lines
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 100]
2.49/2.52 c display/freq = 10000
2.49/2.52 c
2.49/2.52 c # maximal time in seconds to run
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.49/2.52 c limits/time = 1789.33
2.49/2.52 c
2.49/2.52 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.49/2.52 c limits/memory = 13950
2.49/2.52 c
2.49/2.52 c # solving stops, if the given number of solutions were found (-1: no limit)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.52 c limits/solutions = 1
2.49/2.52 c
2.49/2.52 c # maximal number of separation rounds per node (-1: unlimited)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 5]
2.49/2.52 c separating/maxrounds = 1
2.49/2.52 c
2.49/2.52 c # maximal number of separation rounds in the root node (-1: unlimited)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.52 c separating/maxroundsroot = 5
2.49/2.52 c
2.49/2.52 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.49/2.52 c # [type: int, range: [1,2], default: 1]
2.49/2.52 c timing/clocktype = 2
2.49/2.52 c
2.49/2.52 c # should presolving try to simplify inequalities
2.49/2.52 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.49/2.52 c constraints/linear/simplifyinequalities = TRUE
2.49/2.52 c
2.49/2.52 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
2.49/2.52 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.49/2.52 c constraints/indicator/addCouplingCons = TRUE
2.49/2.52 c
2.49/2.52 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.49/2.52 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.49/2.52 c constraints/knapsack/disaggregation = FALSE
2.49/2.52 c
2.49/2.52 c # should presolving try to simplify knapsacks
2.49/2.52 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.49/2.52 c constraints/knapsack/simplifyinequalities = TRUE
2.49/2.52 c
2.49/2.52 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.52 c presolving/probing/maxrounds = 0
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/coefdiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.52 c heuristics/coefdiving/maxlpiterquot = 0.075
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/coefdiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 30]
2.49/2.52 c heuristics/crossover/freq = -1
2.49/2.52 c
2.49/2.52 c # number of nodes added to the contingent of the total nodes
2.49/2.52 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.49/2.52 c heuristics/crossover/nodesofs = 750
2.49/2.52 c
2.49/2.52 c # number of nodes without incumbent change that heuristic should wait
2.49/2.52 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.49/2.52 c heuristics/crossover/nwaitingnodes = 100
2.49/2.52 c
2.49/2.52 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.49/2.52 c # [type: real, range: [0,1], default: 0.1]
2.49/2.52 c heuristics/crossover/nodesquot = 0.15
2.49/2.52 c
2.49/2.52 c # minimum percentage of integer variables that have to be fixed
2.49/2.52 c # [type: real, range: [0,1], default: 0.666]
2.49/2.52 c heuristics/crossover/minfixingrate = 0.5
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 20]
2.49/2.52 c heuristics/feaspump/freq = -1
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/feaspump/maxlpiterofs = 2000
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/fracdiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.52 c heuristics/fracdiving/maxlpiterquot = 0.075
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/fracdiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/guideddiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.52 c heuristics/guideddiving/maxlpiterquot = 0.075
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/guideddiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.52 c heuristics/intdiving/maxlpiterquot = 0.075
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/intshifting/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/linesearchdiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.52 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.52 c heuristics/nlp/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 20]
2.49/2.52 c heuristics/objpscostdiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to total iteration number
2.49/2.52 c # [type: real, range: [0,1], default: 0.01]
2.49/2.52 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.52 c heuristics/oneopt/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/pscostdiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.52 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/pscostdiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 0]
2.49/2.52 c heuristics/rens/freq = -1
2.49/2.52 c
2.49/2.52 c # minimum percentage of integer variables that have to be fixable
2.49/2.52 c # [type: real, range: [0,1], default: 0.5]
2.49/2.52 c heuristics/rens/minfixingrate = 0.3
2.49/2.52 c
2.49/2.52 c # number of nodes added to the contingent of the total nodes
2.49/2.52 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.49/2.52 c heuristics/rens/nodesofs = 2000
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 20]
2.49/2.52 c heuristics/rootsoldiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.49/2.52 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.52 c heuristics/rounding/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/shifting/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.52 c heuristics/simplerounding/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 0]
2.49/2.52 c heuristics/trivial/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.52 c heuristics/trysol/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.52 c heuristics/veclendiving/freq = -1
2.49/2.52 c
2.49/2.52 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.52 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.52 c heuristics/veclendiving/maxlpiterquot = 0.075
2.49/2.52 c
2.49/2.52 c # additional number of allowed LP iterations
2.49/2.52 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.52 c heuristics/veclendiving/maxlpiterofs = 1500
2.49/2.52 c
2.49/2.52 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.52 c heuristics/zirounding/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 0]
2.49/2.52 c separating/cmir/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: 0]
2.49/2.52 c separating/flowcover/freq = -1
2.49/2.52 c
2.49/2.52 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.49/2.52 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.52 c separating/rapidlearning/freq = 0
2.49/2.52 c
2.49/2.52 c -----------------------------------------------------------------------------------------------
2.49/2.52 c start solving
2.49/2.52 c
2.49/2.52 c SCIP Status : problem is solved [infeasible]
2.49/2.52 c Solving Time (sec) : 1.84
2.49/2.52 c Solving Nodes : 0
2.49/2.52 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.49/2.52 c Dual Bound : -1.00000000000000e+20
2.49/2.52 c Gap : infinite
2.49/2.52 s UNSATISFIABLE
2.49/2.52 c SCIP Status : problem is solved [infeasible]
2.49/2.52 c Solving Time : 1.84
2.49/2.52 c Original Problem :
2.49/2.52 c Problem name : HOME/instance-3739579-1338730379.opb
2.49/2.52 c Variables : 30976 (30976 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.52 c Constraints : 107613 initial, 107613 maximal
2.49/2.52 c Presolved Problem :
2.49/2.52 c Problem name : t_HOME/instance-3739579-1338730379.opb
2.49/2.52 c Variables : 27371 (27371 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.52 c Constraints : 94452 initial, 94452 maximal
2.49/2.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.49/2.52 c trivial : 0.00 0 0 0 0 0 0 0 0
2.49/2.52 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.49/2.52 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.49/2.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.49/2.52 c implics : 0.00 0 0 0 0 0 0 0 0
2.49/2.52 c probing : 0.00 0 0 0 0 0 0 0 0
2.49/2.52 c linear : 1.60 3605 0 0 3605 0 13161 0 0
2.49/2.52 c root node : - 0 - - 0 - - - -
2.49/2.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.49/2.52 c integral : 0 0 0 0 0 0 0 0 0 0
2.49/2.52 c linear : 94452 0 0 0 0 0 0 0 0 0
2.49/2.52 c countsols : 0 0 0 0 0 0 0 0 0 0
2.49/2.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.49/2.52 c integral : 0.00 0.00 0.00 0.00 0.00
2.49/2.52 c linear : 0.00 0.00 0.00 0.00 0.00
2.49/2.52 c countsols : 0.00 0.00 0.00 0.00 0.00
2.49/2.52 c Propagators : Time Calls Cutoffs DomReds
2.49/2.52 c pseudoobj : 0.00 0 0 0
2.49/2.52 c rootredcost : 0.00 0 0 0
2.49/2.52 c vbounds : 0.00 0 0 0
2.49/2.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.49/2.52 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.52 c applied globally : - - - 0 0.0 - - -
2.49/2.52 c applied locally : - - - 0 0.0 - - -
2.49/2.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.49/2.52 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.49/2.52 c redcost : 0.00 0 0 0 0 0
2.49/2.52 c impliedbounds : 0.00 0 0 0 0 0
2.49/2.52 c intobj : 0.00 0 0 0 0 0
2.49/2.52 c cgmip : 0.00 0 0 0 0 0
2.49/2.52 c gomory : 0.00 0 0 0 0 0
2.49/2.52 c strongcg : 0.00 0 0 0 0 0
2.49/2.52 c cmir : 0.00 0 0 0 0 0
2.49/2.52 c flowcover : 0.00 0 0 0 0 0
2.49/2.52 c clique : 0.00 0 0 0 0 0
2.49/2.52 c zerohalf : 0.00 0 0 0 0 0
2.49/2.52 c mcf : 0.00 0 0 0 0 0
2.49/2.52 c rapidlearning : 0.00 0 0 0 0 0
2.49/2.52 c Pricers : Time Calls Vars
2.49/2.52 c problem variables: 0.00 0 0
2.49/2.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.49/2.52 c pscost : 0.00 0 0 0 0 0 0
2.49/2.52 c inference : 0.00 0 0 0 0 0 0
2.49/2.52 c mostinf : 0.00 0 0 0 0 0 0
2.49/2.52 c leastinf : 0.00 0 0 0 0 0 0
2.49/2.52 c fullstrong : 0.00 0 0 0 0 0 0
2.49/2.52 c allfullstrong : 0.00 0 0 0 0 0 0
2.49/2.52 c random : 0.00 0 0 0 0 0 0
2.49/2.52 c relpscost : 0.00 0 0 0 0 0 0
2.49/2.52 c Primal Heuristics : Time Calls Found
2.49/2.52 c LP solutions : 0.00 - 0
2.49/2.52 c pseudo solutions : 0.00 - 0
2.49/2.52 c trivial : 0.02 1 0
2.49/2.52 c simplerounding : 0.00 0 0
2.49/2.52 c zirounding : 0.00 0 0
2.49/2.52 c rounding : 0.00 0 0
2.49/2.52 c shifting : 0.00 0 0
2.49/2.52 c intshifting : 0.00 0 0
2.49/2.52 c oneopt : 0.00 0 0
2.49/2.52 c twoopt : 0.00 0 0
2.49/2.52 c fixandinfer : 0.00 0 0
2.49/2.52 c feaspump : 0.00 0 0
2.49/2.52 c coefdiving : 0.00 0 0
2.49/2.52 c pscostdiving : 0.00 0 0
2.49/2.52 c fracdiving : 0.00 0 0
2.49/2.52 c veclendiving : 0.00 0 0
2.49/2.52 c intdiving : 0.00 0 0
2.49/2.52 c actconsdiving : 0.00 0 0
2.49/2.52 c objpscostdiving : 0.00 0 0
2.49/2.52 c rootsoldiving : 0.00 0 0
2.49/2.52 c linesearchdiving : 0.00 0 0
2.49/2.52 c guideddiving : 0.00 0 0
2.49/2.52 c octane : 0.00 0 0
2.49/2.52 c rens : 0.00 0 0
2.49/2.52 c rins : 0.00 0 0
2.49/2.52 c localbranching : 0.00 0 0
2.49/2.52 c mutation : 0.00 0 0
2.49/2.52 c crossover : 0.00 0 0
2.49/2.52 c dins : 0.00 0 0
2.49/2.52 c undercover : 0.00 0 0
2.49/2.52 c nlp : 0.00 0 0
2.49/2.52 c trysol : 0.00 0 0
2.49/2.52 c LP : Time Calls Iterations Iter/call Iter/sec
2.49/2.52 c primal LP : 0.00 0 0 0.00 -
2.49/2.52 c dual LP : 0.00 0 0 0.00 -
2.49/2.52 c lex dual LP : 0.00 0 0 0.00 -
2.49/2.52 c barrier LP : 0.00 0 0 0.00 -
2.49/2.52 c diving/probing LP: 0.00 0 0 0.00 -
2.49/2.52 c strong branching : 0.00 0 0 0.00 -
2.49/2.52 c (at root node) : - 0 0 0.00 -
2.49/2.52 c conflict analysis: 0.00 0 0 0.00 -
2.49/2.52 c B&B Tree :
2.49/2.52 c number of runs : 1
2.49/2.52 c nodes : 0
2.49/2.52 c nodes (total) : 0
2.49/2.52 c nodes left : 1
2.49/2.52 c max depth : -1
2.49/2.52 c max depth (total): -1
2.49/2.52 c backtracks : 0 (0.0%)
2.49/2.52 c delayed cutoffs : 0
2.49/2.52 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.49/2.52 c avg switch length: 0.00
2.49/2.52 c switching time : 0.00
2.49/2.52 c Solution :
2.49/2.52 c Solutions found : 0 (0 improvements)
2.49/2.52 c Primal Bound : infeasible
2.49/2.52 c Dual Bound : -
2.49/2.52 c Gap : infinite
2.49/2.52 c Root Dual Bound : -
2.49/2.52 c Root Iterations : 0
2.59/2.68 c Time complete: 2.68.
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-3739579-1338730379/watcher-3739579-1338730379 -o /tmp/evaluation-result-3739579-1338730379/solver-3739579-1338730379 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3739579-1338730379.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/176 25519
/proc/meminfo: memFree=27814736/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=10216 CPUtime=0 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 1795 0 0 0 0 0 0 0 20 0 1 0 339162428 10461184 1741 33554432000 4194304 8395647 140736377855840 140736377852152 7355228 0 0 4096 0 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 2554 1741 390 1026 0 1524 0
[startup+0.0644 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 25519
/proc/meminfo: memFree=27814736/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=20816 CPUtime=0.05 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 4441 0 0 0 5 0 0 0 20 0 1 0 339162428 21315584 4387 33554432000 4194304 8395647 140736377855840 140736377852152 5754976 0 0 4096 0 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 5204 4387 390 1026 0 4174 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 20816
[startup+0.100371 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 25519
/proc/meminfo: memFree=27814736/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=27256 CPUtime=0.09 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 6052 0 0 0 9 0 0 0 20 0 1 0 339162428 27910144 5998 33554432000 4194304 8395647 140736377855840 140736377852152 7382041 0 0 4096 0 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 6814 5998 390 1026 0 5784 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 27256
[startup+0.300298 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 25519
/proc/meminfo: memFree=27814736/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=40396 CPUtime=0.29 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 9340 0 0 0 28 1 0 0 20 0 1 0 339162428 41365504 9286 33554432000 4194304 8395647 140736377855840 140736377852152 7370222 0 0 4096 0 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 10099 9286 390 1026 0 9069 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 40396
[startup+0.700307 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 25519
/proc/meminfo: memFree=27814736/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=86836 CPUtime=0.69 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 21207 0 0 0 66 3 0 0 20 0 1 0 339162428 88920064 20799 33554432000 4194304 8395647 140736377855840 140736377718344 4732889 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 21709 20799 407 1026 0 20679 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 86836
[startup+1.50029 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 25520
/proc/meminfo: memFree=27642136/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=238820 CPUtime=1.49 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 58657 0 0 0 141 8 0 0 20 0 1 0 339162428 244551680 58249 33554432000 4194304 8395647 140736377855840 140736377851592 6347101 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 59705 58249 469 1026 0 58675 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 238820
Solver just ended. Dumping a history of the last processes samples
[startup+2.30032 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 25520
/proc/meminfo: memFree=27543524/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=286092 CPUtime=2.29 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 70247 0 0 0 219 10 0 0 20 0 1 0 339162428 292958208 69839 33554432000 4194304 8395647 140736377855840 140736377851592 4247650 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 71523 69839 469 1026 0 70493 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 286092
[startup+2.50032 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 25520
/proc/meminfo: memFree=27543524/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=293432 CPUtime=2.49 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 71770 0 0 0 239 10 0 0 20 0 1 0 339162428 300474368 71362 33554432000 4194304 8395647 140736377855840 140736377851800 5041292 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 73358 71362 470 1026 0 72328 0
Current children cumulated CPU time (s) 2.49
Current children cumulated vsize (KiB) 293432
[startup+2.60037 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 25520
/proc/meminfo: memFree=27543524/32873844 swapFree=7108/7108
[pid=25519] ppid=25517 vsize=294680 CPUtime=2.59 cores=0,2,4,6
/proc/25519/stat : 25519 (pbscip.linux.x8) R 25517 25519 21683 0 -1 4202496 71957 0 0 0 249 10 0 0 20 0 1 0 339162428 301752320 71549 33554432000 4194304 8395647 140736377855840 140736377851800 6345866 0 0 4096 0 0 0 0 17 4 0 0 0 0 0
/proc/25519/statm: 73670 71549 501 1026 0 72640 0
Current children cumulated CPU time (s) 2.59
Current children cumulated vsize (KiB) 294680
Child status: 0
Real time (s): 2.68942
CPU time (s): 2.68759
CPU user time (s): 2.56661
CPU system time (s): 0.120981
CPU usage (%): 99.9318
Max. virtual memory (cumulated for all children) (KiB): 294680
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.56661
system time used= 0.120981
maximum resident set size= 286196
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 71965
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= 5
runsolver used 0.013997 second user time and 0.028995 second system time
The end