| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB10: SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver | UNSAT | 0.834872 | 0.834663 |
| Name | /DEC-SMALLINT-LIN/oliveras/j90/ normalized-j908_8-unsat.opb |
| MD5SUM | d78b76fea1950503bb859b4dec250d3a |
| Bench Category | DEC-SMALLINT-LIN (no optimisation, small integers, linear constraints) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.011997 |
| Has Objective Function | NO |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 12376 |
| Total number of constraints | 38600 |
| Number of constraints which are clauses | 38332 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 268 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 48 |
| Number of terms in the objective function | 0 |
| Biggest coefficient in the objective function | 0 |
| Number of bits for the biggest coefficient in the objective function | 0 |
| Sum of the numbers in the objective function | 0 |
| Number of bits of the sum of numbers in the objective function | 0 |
| Biggest number in a constraint | 79 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 363 |
| Number of bits of the biggest sum of numbers | 9 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
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-3739761-1338732175.opb>
0.19/0.24 c original problem has 12376 variables (12376 bin, 0 int, 0 impl, 0 cont) and 38600 constraints
0.19/0.24 c problem read
0.19/0.24 c No objective function, only one solution is needed.
0.19/0.25 c presolving settings loaded
0.29/0.32 c presolving:
0.69/0.77 c presolving (1 rounds):
0.69/0.77 c 1037 deleted vars, 4362 deleted constraints, 1037 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.77 c 1351808 implications, 0 cliques
0.69/0.77 c presolving detected infeasibility
0.69/0.77 c Presolving Time: 0.47
0.69/0.77 c - non default parameters ----------------------------------------------------------------------
0.69/0.77 c # SCIP version 1.2.1.3
0.69/0.77 c
0.69/0.77 c # frequency for displaying node information lines
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.77 c display/freq = 10000
0.69/0.77 c
0.69/0.77 c # maximal time in seconds to run
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.77 c limits/time = 1789.76
0.69/0.77 c
0.69/0.77 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.77 c limits/memory = 13950
0.69/0.77 c
0.69/0.77 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.77 c limits/solutions = 1
0.69/0.77 c
0.69/0.77 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.77 c separating/maxrounds = 1
0.69/0.77 c
0.69/0.77 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.77 c separating/maxroundsroot = 5
0.69/0.77 c
0.69/0.77 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.69/0.77 c # [type: int, range: [1,2], default: 1]
0.69/0.77 c timing/clocktype = 2
0.69/0.77 c
0.69/0.77 c # should presolving try to simplify inequalities
0.69/0.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.77 c constraints/linear/simplifyinequalities = TRUE
0.69/0.77 c
0.69/0.77 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.69/0.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.77 c constraints/indicator/addCouplingCons = TRUE
0.69/0.77 c
0.69/0.77 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.77 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.77 c constraints/knapsack/disaggregation = FALSE
0.69/0.77 c
0.69/0.77 c # should presolving try to simplify knapsacks
0.69/0.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.77 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.77 c
0.69/0.77 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.77 c presolving/probing/maxrounds = 0
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/coefdiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.77 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.77 c heuristics/crossover/freq = -1
0.69/0.77 c
0.69/0.77 c # number of nodes added to the contingent of the total nodes
0.69/0.77 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.77 c heuristics/crossover/nodesofs = 750
0.69/0.77 c
0.69/0.77 c # number of nodes without incumbent change that heuristic should wait
0.69/0.77 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.77 c heuristics/crossover/nwaitingnodes = 100
0.69/0.77 c
0.69/0.77 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.77 c # [type: real, range: [0,1], default: 0.1]
0.69/0.77 c heuristics/crossover/nodesquot = 0.15
0.69/0.77 c
0.69/0.77 c # minimum percentage of integer variables that have to be fixed
0.69/0.77 c # [type: real, range: [0,1], default: 0.666]
0.69/0.77 c heuristics/crossover/minfixingrate = 0.5
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.77 c heuristics/feaspump/freq = -1
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/fracdiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.77 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/guideddiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.77 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.77 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/intshifting/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/linesearchdiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.77 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.77 c heuristics/nlp/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.77 c heuristics/objpscostdiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.77 c # [type: real, range: [0,1], default: 0.01]
0.69/0.77 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.77 c heuristics/oneopt/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/pscostdiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.77 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.77 c heuristics/rens/freq = -1
0.69/0.77 c
0.69/0.77 c # minimum percentage of integer variables that have to be fixable
0.69/0.77 c # [type: real, range: [0,1], default: 0.5]
0.69/0.77 c heuristics/rens/minfixingrate = 0.3
0.69/0.77 c
0.69/0.77 c # number of nodes added to the contingent of the total nodes
0.69/0.77 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.77 c heuristics/rens/nodesofs = 2000
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.77 c heuristics/rootsoldiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.77 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.77 c heuristics/rounding/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/shifting/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.77 c heuristics/simplerounding/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.77 c heuristics/trivial/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.77 c heuristics/trysol/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.77 c heuristics/veclendiving/freq = -1
0.69/0.77 c
0.69/0.77 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.77 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.77 c
0.69/0.77 c # additional number of allowed LP iterations
0.69/0.77 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.77 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.77 c
0.69/0.77 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.77 c heuristics/zirounding/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.77 c separating/cmir/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.77 c separating/flowcover/freq = -1
0.69/0.77 c
0.69/0.77 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.77 c separating/rapidlearning/freq = 0
0.69/0.77 c
0.69/0.77 c -----------------------------------------------------------------------------------------------
0.69/0.77 c start solving
0.69/0.77 c
0.69/0.77 c SCIP Status : problem is solved [infeasible]
0.69/0.77 c Solving Time (sec) : 0.53
0.69/0.77 c Solving Nodes : 0
0.69/0.77 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.69/0.77 c Dual Bound : -1.00000000000000e+20
0.69/0.77 c Gap : infinite
0.69/0.77 s UNSATISFIABLE
0.69/0.77 c SCIP Status : problem is solved [infeasible]
0.69/0.77 c Solving Time : 0.53
0.69/0.77 c Original Problem :
0.69/0.77 c Problem name : HOME/instance-3739761-1338732175.opb
0.69/0.77 c Variables : 12376 (12376 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.77 c Constraints : 38600 initial, 38600 maximal
0.69/0.77 c Presolved Problem :
0.69/0.77 c Problem name : t_HOME/instance-3739761-1338732175.opb
0.69/0.77 c Variables : 11339 (11339 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.77 c Constraints : 34238 initial, 34238 maximal
0.69/0.77 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.77 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c probing : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c linear : 0.44 1037 0 0 1037 0 4362 0 0
0.69/0.77 c root node : - 0 - - 0 - - - -
0.69/0.77 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.77 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.77 c linear : 34238 0 0 0 0 0 0 0 0 0
0.69/0.77 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.77 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.77 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.77 c linear : 0.00 0.00 0.00 0.00 0.00
0.69/0.77 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.77 c Propagators : Time Calls Cutoffs DomReds
0.69/0.77 c pseudoobj : 0.00 0 0 0
0.69/0.77 c rootredcost : 0.00 0 0 0
0.69/0.77 c vbounds : 0.00 0 0 0
0.69/0.77 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.77 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.77 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.77 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.77 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.77 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.77 c applied globally : - - - 0 0.0 - - -
0.69/0.77 c applied locally : - - - 0 0.0 - - -
0.69/0.77 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.77 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.77 c redcost : 0.00 0 0 0 0 0
0.69/0.77 c impliedbounds : 0.00 0 0 0 0 0
0.69/0.77 c intobj : 0.00 0 0 0 0 0
0.69/0.77 c cgmip : 0.00 0 0 0 0 0
0.69/0.77 c gomory : 0.00 0 0 0 0 0
0.69/0.77 c strongcg : 0.00 0 0 0 0 0
0.69/0.77 c cmir : 0.00 0 0 0 0 0
0.69/0.77 c flowcover : 0.00 0 0 0 0 0
0.69/0.77 c clique : 0.00 0 0 0 0 0
0.69/0.77 c zerohalf : 0.00 0 0 0 0 0
0.69/0.77 c mcf : 0.00 0 0 0 0 0
0.69/0.77 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.77 c Pricers : Time Calls Vars
0.69/0.77 c problem variables: 0.00 0 0
0.69/0.77 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.77 c pscost : 0.00 0 0 0 0 0 0
0.69/0.77 c inference : 0.00 0 0 0 0 0 0
0.69/0.77 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.77 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.77 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.77 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.77 c random : 0.00 0 0 0 0 0 0
0.69/0.77 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.77 c Primal Heuristics : Time Calls Found
0.69/0.77 c LP solutions : 0.00 - 0
0.69/0.77 c pseudo solutions : 0.00 - 0
0.69/0.77 c trivial : 0.01 1 0
0.69/0.77 c simplerounding : 0.00 0 0
0.69/0.77 c zirounding : 0.00 0 0
0.69/0.77 c rounding : 0.00 0 0
0.69/0.77 c shifting : 0.00 0 0
0.69/0.77 c intshifting : 0.00 0 0
0.69/0.77 c oneopt : 0.00 0 0
0.69/0.77 c twoopt : 0.00 0 0
0.69/0.77 c fixandinfer : 0.00 0 0
0.69/0.77 c feaspump : 0.00 0 0
0.69/0.77 c coefdiving : 0.00 0 0
0.69/0.77 c pscostdiving : 0.00 0 0
0.69/0.77 c fracdiving : 0.00 0 0
0.69/0.77 c veclendiving : 0.00 0 0
0.69/0.77 c intdiving : 0.00 0 0
0.69/0.77 c actconsdiving : 0.00 0 0
0.69/0.77 c objpscostdiving : 0.00 0 0
0.69/0.77 c rootsoldiving : 0.00 0 0
0.69/0.77 c linesearchdiving : 0.00 0 0
0.69/0.77 c guideddiving : 0.00 0 0
0.69/0.77 c octane : 0.00 0 0
0.69/0.77 c rens : 0.00 0 0
0.69/0.77 c rins : 0.00 0 0
0.69/0.77 c localbranching : 0.00 0 0
0.69/0.77 c mutation : 0.00 0 0
0.69/0.77 c crossover : 0.00 0 0
0.69/0.77 c dins : 0.00 0 0
0.69/0.77 c undercover : 0.00 0 0
0.69/0.77 c nlp : 0.00 0 0
0.69/0.77 c trysol : 0.00 0 0
0.69/0.77 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.77 c primal LP : 0.00 0 0 0.00 -
0.69/0.77 c dual LP : 0.00 0 0 0.00 -
0.69/0.77 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.77 c barrier LP : 0.00 0 0 0.00 -
0.69/0.77 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.77 c strong branching : 0.00 0 0 0.00 -
0.69/0.77 c (at root node) : - 0 0 0.00 -
0.69/0.77 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.77 c B&B Tree :
0.69/0.77 c number of runs : 1
0.69/0.77 c nodes : 0
0.69/0.77 c nodes (total) : 0
0.69/0.77 c nodes left : 1
0.69/0.77 c max depth : -1
0.69/0.77 c max depth (total): -1
0.69/0.77 c backtracks : 0 (0.0%)
0.69/0.77 c delayed cutoffs : 0
0.69/0.77 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.77 c avg switch length: 0.00
0.69/0.77 c switching time : 0.00
0.69/0.77 c Solution :
0.69/0.77 c Solutions found : 0 (0 improvements)
0.69/0.77 c Primal Bound : infeasible
0.69/0.77 c Dual Bound : -
0.69/0.77 c Gap : infinite
0.69/0.77 c Root Dual Bound : -
0.69/0.77 c Root Iterations : 0
0.79/0.83 c Time complete: 0.83.
ERROR: no interpretation found !
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-3739761-1338732175/watcher-3739761-1338732175 -o /tmp/evaluation-result-3739761-1338732175/solver-3739761-1338732175 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3739761-1338732175.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.04 2.01 2.00 3/176 25708 /proc/meminfo: memFree=27859492/32873844 swapFree=7108/7108 [pid=25708] ppid=25706 vsize=9972 CPUtime=0 cores=0,2,4,6 /proc/25708/stat : 25708 (pbscip.linux.x8) R 25706 25708 21683 0 -1 4202496 1770 0 0 0 0 0 0 0 20 0 1 0 339342088 10211328 1717 33554432000 4194304 8395647 140736392566144 140734626644776 7382157 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/25708/statm: 2507 1721 375 1026 0 1477 0 [startup+0.067589 s] /proc/loadavg: 2.04 2.01 2.00 3/176 25708 /proc/meminfo: memFree=27859492/32873844 swapFree=7108/7108 [pid=25708] ppid=25706 vsize=19440 CPUtime=0.06 cores=0,2,4,6 /proc/25708/stat : 25708 (pbscip.linux.x8) R 25706 25708 21683 0 -1 4202496 4111 0 0 0 6 0 0 0 20 0 1 0 339342088 19906560 4058 33554432000 4194304 8395647 140736392566144 140734626644776 4572704 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/25708/statm: 4860 4058 390 1026 0 3830 0 Current children cumulated CPU time (s) 0.06 Current children cumulated vsize (KiB) 19440 [startup+0.100348 s] /proc/loadavg: 2.04 2.01 2.00 3/176 25708 /proc/meminfo: memFree=27859492/32873844 swapFree=7108/7108 [pid=25708] ppid=25706 vsize=21948 CPUtime=0.09 cores=0,2,4,6 /proc/25708/stat : 25708 (pbscip.linux.x8) R 25706 25708 21683 0 -1 4202496 4719 0 0 0 9 0 0 0 20 0 1 0 339342088 22474752 4666 33554432000 4194304 8395647 140736392566144 140734626644776 6767029 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/25708/statm: 5487 4666 390 1026 0 4457 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 21948 [startup+0.300315 s] /proc/loadavg: 2.04 2.01 2.00 3/176 25708 /proc/meminfo: memFree=27859492/32873844 swapFree=7108/7108 [pid=25708] ppid=25706 vsize=69108 CPUtime=0.29 cores=0,2,4,6 /proc/25708/stat : 25708 (pbscip.linux.x8) R 25706 25708 21683 0 -1 4202496 16775 0 0 0 28 1 0 0 20 0 1 0 339342088 70766592 16368 33554432000 4194304 8395647 140736392566144 140734626644776 6347101 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/25708/statm: 17277 16368 419 1026 0 16247 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 69108 [startup+0.700316 s] /proc/loadavg: 2.04 2.01 2.00 3/176 25708 /proc/meminfo: memFree=27859492/32873844 swapFree=7108/7108 [pid=25708] ppid=25706 vsize=123424 CPUtime=0.69 cores=0,2,4,6 /proc/25708/stat : 25708 (pbscip.linux.x8) R 25706 25708 21683 0 -1 4202496 29944 0 0 0 66 3 0 0 20 0 1 0 339342088 126386176 29537 33554432000 4194304 8395647 140736392566144 140734626644776 6080353 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/25708/statm: 30856 29537 469 1026 0 29826 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 123424 Solver just ended. Dumping a history of the last processes samples [startup+0.800356 s] /proc/loadavg: 2.04 2.01 2.00 3/176 25708 /proc/meminfo: memFree=27859492/32873844 swapFree=7108/7108 [pid=25708] ppid=25706 vsize=126712 CPUtime=0.79 cores=0,2,4,6 /proc/25708/stat : 25708 (pbscip.linux.x8) R 25706 25708 21683 0 -1 4202496 30666 0 0 0 76 3 0 0 20 0 1 0 339342088 129753088 30259 33554432000 4194304 8395647 140736392566144 140734626644776 6345887 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/25708/statm: 31678 30259 501 1026 0 30648 0 Current children cumulated CPU time (s) 0.79 Current children cumulated vsize (KiB) 126712 Child status: 0 Real time (s): 0.834663 CPU time (s): 0.834872 CPU user time (s): 0.790879 CPU system time (s): 0.043993 CPU usage (%): 100.025 Max. virtual memory (cumulated for all children) (KiB): 126712 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.790879 system time used= 0.043993 maximum resident set size= 121036 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 30674 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= 2 runsolver used 0.000999 second user time and 0.005999 second system time The end
Begin job on node139 at 2012-06-03 16:02:55 IDJOB=3739761 IDBENCH=74809 IDSOLVER=2326 FILE ID=node139/3739761-1338732175 RUNJOBID= node139-1338713558-21699 PBS_JOBID= 14636736 Free space on /tmp= 71084 MiB SOLVER NAME= PB10: SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j90/normalized-j908_8-unsat.opb COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3739761-1338732175/watcher-3739761-1338732175 -o /tmp/evaluation-result-3739761-1338732175/solver-3739761-1338732175 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3739761-1338732175.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= d78b76fea1950503bb859b4dec250d3a RANDOM SEED=1943054722 node139.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011 /proc/cpuinfo: processor : 0 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 0 cpu cores : 4 apicid : 0 initial apicid : 0 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5333.50 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 1 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 0 cpu cores : 4 apicid : 16 initial apicid : 16 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 2 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 1 cpu cores : 4 apicid : 2 initial apicid : 2 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.90 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 3 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 1 cpu cores : 4 apicid : 18 initial apicid : 18 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 4 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 2 cpu cores : 4 apicid : 4 initial apicid : 4 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.92 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 5 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 2 cpu cores : 4 apicid : 20 initial apicid : 20 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 6 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 0 siblings : 4 core id : 3 cpu cores : 4 apicid : 6 initial apicid : 6 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 7 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.750 cache size : 8192 KB physical id : 1 siblings : 4 core id : 3 cpu cores : 4 apicid : 22 initial apicid : 22 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 32873844 kB MemFree: 27859756 kB Buffers: 507384 kB Cached: 3336908 kB SwapCached: 828 kB Active: 2016852 kB Inactive: 2121756 kB Active(anon): 288004 kB Inactive(anon): 7952 kB Active(file): 1728848 kB Inactive(file): 2113804 kB Unevictable: 7108 kB Mlocked: 7108 kB SwapTotal: 67108856 kB SwapFree: 67104688 kB Dirty: 11412 kB Writeback: 0 kB AnonPages: 299520 kB Mapped: 13988 kB Shmem: 8 kB Slab: 734428 kB SReclaimable: 176368 kB SUnreclaim: 558060 kB KernelStack: 1464 kB PageTables: 4632 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545776 kB Committed_AS: 415956 kB VmallocTotal: 34359738367 kB VmallocUsed: 346368 kB VmallocChunk: 34341987984 kB HardwareCorrupted: 0 kB AnonHugePages: 0 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7872 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 71076 MiB End job on node139 at 2012-06-03 16:02:56