| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB11: SCIP spx E_2 2011-06-10 (fixed) | UNSAT | 0.971851 | 0.972882 |
| 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 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3739764-1338737823.opb>
0.18/0.22 c original problem has 12376 variables (12376 bin, 0 int, 0 impl, 0 cont) and 38600 constraints
0.18/0.22 c problem read
0.18/0.22 c No objective function, only one solution is needed.
0.18/0.22 c presolving settings loaded
0.29/0.31 c presolving:
0.79/0.88 c presolving (1 rounds):
0.79/0.88 c 1037 deleted vars, 4362 deleted constraints, 0 added constraints, 1037 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.79/0.88 c 1351808 implications, 0 cliques
0.79/0.88 c presolving detected infeasibility
0.79/0.88 c Presolving Time: 0.59
0.79/0.88 c - non default parameters ----------------------------------------------------------------------
0.79/0.88 c # SCIP version 2.0.1.5
0.79/0.88 c
0.79/0.88 c # frequency for displaying node information lines
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 100]
0.79/0.88 c display/freq = 10000
0.79/0.88 c
0.79/0.88 c # maximal time in seconds to run
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.88 c limits/time = 1797
0.79/0.88 c
0.79/0.88 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.79/0.88 c limits/memory = 13950
0.79/0.88 c
0.79/0.88 c # solving stops, if the given number of solutions were found (-1: no limit)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.88 c limits/solutions = 1
0.79/0.88 c
0.79/0.88 c # maximal number of separation rounds per node (-1: unlimited)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 5]
0.79/0.88 c separating/maxrounds = 1
0.79/0.88 c
0.79/0.88 c # maximal number of separation rounds in the root node (-1: unlimited)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.88 c separating/maxroundsroot = 5
0.79/0.88 c
0.79/0.88 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.79/0.88 c # [type: int, range: [1,2], default: 1]
0.79/0.88 c timing/clocktype = 2
0.79/0.88 c
0.79/0.88 c # belongs reading time to solving time?
0.79/0.88 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.88 c timing/reading = TRUE
0.79/0.88 c
0.79/0.88 c # should presolving try to simplify inequalities
0.79/0.88 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.88 c constraints/linear/simplifyinequalities = TRUE
0.79/0.88 c
0.79/0.88 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.79/0.88 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.88 c constraints/indicator/addCouplingCons = TRUE
0.79/0.88 c
0.79/0.88 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.79/0.88 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.79/0.88 c constraints/knapsack/disaggregation = FALSE
0.79/0.88 c
0.79/0.88 c # should presolving try to simplify knapsacks
0.79/0.88 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.79/0.88 c constraints/knapsack/simplifyinequalities = TRUE
0.79/0.88 c
0.79/0.88 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.88 c presolving/probing/maxrounds = 0
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/coefdiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.88 c heuristics/coefdiving/maxlpiterquot = 0.075
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/coefdiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 30]
0.79/0.88 c heuristics/crossover/freq = -1
0.79/0.88 c
0.79/0.88 c # number of nodes added to the contingent of the total nodes
0.79/0.88 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.88 c heuristics/crossover/nodesofs = 750
0.79/0.88 c
0.79/0.88 c # number of nodes without incumbent change that heuristic should wait
0.79/0.88 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.79/0.88 c heuristics/crossover/nwaitingnodes = 100
0.79/0.88 c
0.79/0.88 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.79/0.88 c # [type: real, range: [0,1], default: 0.1]
0.79/0.88 c heuristics/crossover/nodesquot = 0.15
0.79/0.88 c
0.79/0.88 c # minimum percentage of integer variables that have to be fixed
0.79/0.88 c # [type: real, range: [0,1], default: 0.666]
0.79/0.88 c heuristics/crossover/minfixingrate = 0.5
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.88 c heuristics/feaspump/freq = -1
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/feaspump/maxlpiterofs = 2000
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/fracdiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.88 c heuristics/fracdiving/maxlpiterquot = 0.075
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/fracdiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/guideddiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.88 c heuristics/guideddiving/maxlpiterquot = 0.075
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/guideddiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.88 c heuristics/intdiving/maxlpiterquot = 0.075
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/intshifting/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/linesearchdiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.88 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.88 c heuristics/objpscostdiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to total iteration number
0.79/0.88 c # [type: real, range: [0,1], default: 0.01]
0.79/0.88 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.88 c heuristics/oneopt/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/pscostdiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.88 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/pscostdiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.88 c heuristics/rens/freq = -1
0.79/0.88 c
0.79/0.88 c # minimum percentage of integer variables that have to be fixable
0.79/0.88 c # [type: real, range: [0,1], default: 0.5]
0.79/0.88 c heuristics/rens/minfixingrate = 0.3
0.79/0.88 c
0.79/0.88 c # number of nodes added to the contingent of the total nodes
0.79/0.88 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.79/0.88 c heuristics/rens/nodesofs = 2000
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 20]
0.79/0.88 c heuristics/rootsoldiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.79/0.88 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.88 c heuristics/rounding/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.88 c heuristics/shiftandpropagate/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/shifting/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.88 c heuristics/simplerounding/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.88 c heuristics/subnlp/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.88 c heuristics/trivial/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.88 c heuristics/trysol/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.88 c heuristics/undercover/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 10]
0.79/0.88 c heuristics/veclendiving/freq = -1
0.79/0.88 c
0.79/0.88 c # maximal fraction of diving LP iterations compared to node LP iterations
0.79/0.88 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.79/0.88 c heuristics/veclendiving/maxlpiterquot = 0.075
0.79/0.88 c
0.79/0.88 c # additional number of allowed LP iterations
0.79/0.88 c # [type: int, range: [0,2147483647], default: 1000]
0.79/0.88 c heuristics/veclendiving/maxlpiterofs = 1500
0.79/0.88 c
0.79/0.88 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 1]
0.79/0.88 c heuristics/zirounding/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.88 c separating/cmir/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: 0]
0.79/0.88 c separating/flowcover/freq = -1
0.79/0.88 c
0.79/0.88 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.79/0.88 c # [type: int, range: [-1,2147483647], default: -1]
0.79/0.88 c separating/rapidlearning/freq = 0
0.79/0.88 c
0.79/0.88 c -----------------------------------------------------------------------------------------------
0.79/0.88 c start solving
0.79/0.88 c
0.79/0.88 c SCIP Status : problem is solved [infeasible]
0.79/0.88 c Solving Time (sec) : 0.88
0.79/0.88 c Solving Nodes : 0
0.79/0.88 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.79/0.88 c Dual Bound : -1.00000000000000e+20
0.79/0.88 c Gap : infinite
0.79/0.88 s UNSATISFIABLE
0.79/0.88 c SCIP Status : problem is solved [infeasible]
0.79/0.88 c Total Time : 0.88
0.79/0.88 c solving : 0.88
0.79/0.88 c presolving : 0.59 (included in solving)
0.79/0.88 c reading : 0.22 (included in solving)
0.79/0.88 c Original Problem :
0.79/0.88 c Problem name : HOME/instance-3739764-1338737823.opb
0.79/0.88 c Variables : 12376 (12376 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.88 c Constraints : 38600 initial, 38600 maximal
0.79/0.88 c Presolved Problem :
0.79/0.88 c Problem name : t_HOME/instance-3739764-1338737823.opb
0.79/0.88 c Variables : 11339 (11339 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.88 c Constraints : 34238 initial, 34238 maximal
0.79/0.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.79/0.88 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.88 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.88 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.88 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.88 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.88 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.79/0.88 c linear : 0.55 1037 0 0 1037 0 4362 0 0 0
0.79/0.88 c root node : - 0 - - 0 - - - - -
0.79/0.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.79/0.88 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
0.79/0.88 c linear : 34238 0 0 0 0 0 0 0 0 0 0 0
0.79/0.88 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
0.79/0.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.79/0.88 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.79/0.88 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.79/0.88 c pseudoobj : 0 0 0 0
0.79/0.88 c rootredcost : 0 0 0 0
0.79/0.88 c vbounds : 0 0 0 0
0.79/0.88 c Propagator Timings : TotalTime Propagate Resprop
0.79/0.88 c pseudoobj : 0.00 0.00 0.00
0.79/0.88 c rootredcost : 0.00 0.00 0.00
0.79/0.88 c vbounds : 0.00 0.00 0.00
0.79/0.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.88 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.88 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.88 c applied globally : - - - 0 0.0 - - -
0.79/0.88 c applied locally : - - - 0 0.0 - - -
0.79/0.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.88 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.79/0.88 c redcost : 0.00 0 0 0 0 0
0.79/0.88 c impliedbounds : 0.00 0 0 0 0 0
0.79/0.88 c intobj : 0.00 0 0 0 0 0
0.79/0.88 c gomory : 0.00 0 0 0 0 0
0.79/0.88 c cgmip : 0.00 0 0 0 0 0
0.79/0.88 c closecuts : 0.00 0 0 0 0 0
0.79/0.88 c strongcg : 0.00 0 0 0 0 0
0.79/0.88 c cmir : 0.00 0 0 0 0 0
0.79/0.88 c flowcover : 0.00 0 0 0 0 0
0.79/0.88 c clique : 0.00 0 0 0 0 0
0.79/0.88 c zerohalf : 0.00 0 0 0 0 0
0.79/0.88 c mcf : 0.00 0 0 0 0 0
0.79/0.88 c oddcycle : 0.00 0 0 0 0 0
0.79/0.88 c rapidlearning : 0.00 0 0 0 0 0
0.79/0.88 c Pricers : Time Calls Vars
0.79/0.88 c problem variables: 0.00 0 0
0.79/0.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.88 c pscost : 0.00 0 0 0 0 0 0
0.79/0.88 c inference : 0.00 0 0 0 0 0 0
0.79/0.88 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.88 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.88 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.88 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.88 c random : 0.00 0 0 0 0 0 0
0.79/0.88 c relpscost : 0.00 0 0 0 0 0 0
0.79/0.88 c Primal Heuristics : Time Calls Found
0.79/0.88 c LP solutions : 0.00 - 0
0.79/0.88 c pseudo solutions : 0.00 - 0
0.79/0.88 c trivial : 0.01 1 0
0.79/0.88 c shiftandpropagate: 0.00 0 0
0.79/0.88 c simplerounding : 0.00 0 0
0.79/0.88 c zirounding : 0.00 0 0
0.79/0.88 c rounding : 0.00 0 0
0.79/0.88 c shifting : 0.00 0 0
0.79/0.88 c intshifting : 0.00 0 0
0.79/0.88 c oneopt : 0.00 0 0
0.79/0.88 c twoopt : 0.00 0 0
0.79/0.88 c fixandinfer : 0.00 0 0
0.79/0.88 c feaspump : 0.00 0 0
0.79/0.88 c clique : 0.00 0 0
0.79/0.88 c coefdiving : 0.00 0 0
0.79/0.88 c pscostdiving : 0.00 0 0
0.79/0.88 c fracdiving : 0.00 0 0
0.79/0.88 c veclendiving : 0.00 0 0
0.79/0.88 c intdiving : 0.00 0 0
0.79/0.88 c actconsdiving : 0.00 0 0
0.79/0.88 c objpscostdiving : 0.00 0 0
0.79/0.88 c rootsoldiving : 0.00 0 0
0.79/0.88 c linesearchdiving : 0.00 0 0
0.79/0.88 c guideddiving : 0.00 0 0
0.79/0.88 c octane : 0.00 0 0
0.79/0.88 c rens : 0.00 0 0
0.79/0.88 c rins : 0.00 0 0
0.79/0.88 c localbranching : 0.00 0 0
0.79/0.88 c mutation : 0.00 0 0
0.79/0.88 c crossover : 0.00 0 0
0.79/0.88 c dins : 0.00 0 0
0.79/0.88 c vbounds : 0.00 0 0
0.79/0.88 c undercover : 0.00 0 0
0.79/0.88 c subnlp : 0.00 0 0
0.79/0.88 c trysol : 0.00 0 0
0.79/0.88 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.88 c primal LP : 0.00 0 0 0.00 -
0.79/0.88 c dual LP : 0.00 0 0 0.00 -
0.79/0.88 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.88 c barrier LP : 0.00 0 0 0.00 -
0.79/0.88 c diving/probing LP: 0.00 0 0 0.00 -
0.79/0.88 c strong branching : 0.00 0 0 0.00 -
0.79/0.88 c (at root node) : - 0 0 0.00 -
0.79/0.88 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.88 c B&B Tree :
0.79/0.88 c number of runs : 1
0.79/0.88 c nodes : 0
0.79/0.88 c nodes (total) : 0
0.79/0.88 c nodes left : 1
0.79/0.88 c max depth : -1
0.79/0.88 c max depth (total): -1
0.79/0.88 c backtracks : 0 (0.0%)
0.79/0.88 c delayed cutoffs : 0
0.79/0.88 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.88 c avg switch length: 0.00
0.79/0.88 c switching time : 0.00
0.79/0.88 c Solution :
0.79/0.88 c Solutions found : 0 (0 improvements)
0.79/0.88 c Primal Bound : infeasible
0.79/0.88 c Dual Bound : -
0.79/0.88 c Gap : infinite
0.79/0.88 c Root Dual Bound : -
0.79/0.88 c Root Iterations : 0
0.89/0.97 c Time complete: 0.96.
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-3739764-1338737823/watcher-3739764-1338737823 -o /tmp/evaluation-result-3739764-1338737823/solver-3739764-1338737823 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739764-1338737823.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.07 2.02 2.00 3/174 688 /proc/meminfo: memFree=27909588/32873852 swapFree=7624/7624 [pid=688] ppid=686 vsize=9040 CPUtime=0 cores=1,3,5,7 /proc/688/stat : 688 (scip-2.0.1.4b_2) R 686 688 29314 0 -1 4202496 1134 0 0 0 0 0 0 0 20 0 1 0 339907764 9256960 1088 33554432000 4194304 9016284 140737409519008 140734024604600 4447263 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/688/statm: 2260 1096 190 1178 0 1078 0 [startup+0.0401511 s] /proc/loadavg: 2.07 2.02 2.00 3/174 688 /proc/meminfo: memFree=27909588/32873852 swapFree=7624/7624 [pid=688] ppid=686 vsize=20860 CPUtime=0.03 cores=1,3,5,7 /proc/688/stat : 688 (scip-2.0.1.4b_2) R 686 688 29314 0 -1 4202496 4191 0 0 0 3 0 0 0 20 0 1 0 339907764 21360640 4145 33554432000 4194304 9016284 140737409519008 140734024604600 7842257 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/688/statm: 5215 4145 357 1178 0 4033 0 Current children cumulated CPU time (s) 0.03 Current children cumulated vsize (KiB) 20860 [startup+0.100359 s] /proc/loadavg: 2.07 2.02 2.00 3/174 688 /proc/meminfo: memFree=27909588/32873852 swapFree=7624/7624 [pid=688] ppid=686 vsize=24828 CPUtime=0.09 cores=1,3,5,7 /proc/688/stat : 688 (scip-2.0.1.4b_2) R 686 688 29314 0 -1 4202496 5199 0 0 0 9 0 0 0 20 0 1 0 339907764 25423872 5153 33554432000 4194304 9016284 140737409519008 140737409382456 7987605 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/688/statm: 6207 5153 357 1178 0 5025 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 24828 [startup+0.300312 s] /proc/loadavg: 2.07 2.02 2.00 3/174 688 /proc/meminfo: memFree=27909588/32873852 swapFree=7624/7624 [pid=688] ppid=686 vsize=72808 CPUtime=0.29 cores=1,3,5,7 /proc/688/stat : 688 (scip-2.0.1.4b_2) R 686 688 29314 0 -1 4202496 17085 0 0 0 27 2 0 0 20 0 1 0 339907764 74555392 17007 33554432000 4194304 9016284 140737409519008 140737409382456 4786469 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/688/statm: 18202 17007 427 1178 0 17020 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 72808 [startup+0.700317 s] /proc/loadavg: 2.07 2.02 2.00 3/174 688 /proc/meminfo: memFree=27909588/32873852 swapFree=7624/7624 [pid=688] ppid=686 vsize=122748 CPUtime=0.69 cores=1,3,5,7 /proc/688/stat : 688 (scip-2.0.1.4b_2) R 686 688 29314 0 -1 4202496 29164 0 0 0 65 4 0 0 20 0 1 0 339907764 125693952 29086 33554432000 4194304 9016284 140737409519008 140737409382456 6476251 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/688/statm: 30687 29086 484 1178 0 29505 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 122748 Solver just ended. Dumping a history of the last processes samples [startup+0.900329 s] /proc/loadavg: 2.07 2.02 2.00 3/174 688 /proc/meminfo: memFree=27909588/32873852 swapFree=7624/7624 [pid=688] ppid=686 vsize=128764 CPUtime=0.89 cores=1,3,5,7 /proc/688/stat : 688 (scip-2.0.1.4b_2) R 686 688 29314 0 -1 4202496 31462 0 0 0 84 5 0 0 20 0 1 0 339907764 131854336 30542 33554432000 4194304 9016284 140737409519008 140737409382456 6469166 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/688/statm: 32191 30542 519 1178 0 31009 0 Current children cumulated CPU time (s) 0.89 Current children cumulated vsize (KiB) 128764 Child status: 0 Real time (s): 0.972882 CPU time (s): 0.971851 CPU user time (s): 0.905862 CPU system time (s): 0.065989 CPU usage (%): 99.894 Max. virtual memory (cumulated for all children) (KiB): 128764 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.905862 system time used= 0.065989 maximum resident set size= 124508 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 31475 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.004999 second user time and 0.008998 second system time The end
Begin job on node131 at 2012-06-03 17:37:03 IDJOB=3739764 IDBENCH=74809 IDSOLVER=2329 FILE ID=node131/3739764-1338737823 RUNJOBID= node131-1338713677-29331 PBS_JOBID= 14636738 Free space on /tmp= 71384 MiB SOLVER NAME= PB11: SCIP spx E_2 2011-06-10 (fixed) BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j90/normalized-j908_8-unsat.opb COMMAND LINE= HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3739764-1338737823/watcher-3739764-1338737823 -o /tmp/evaluation-result-3739764-1338737823/solver-3739764-1338737823 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739764-1338737823.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= d78b76fea1950503bb859b4dec250d3a RANDOM SEED=273995239 node131.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.805 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.61 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.805 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.805 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.91 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.805 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.805 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.91 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.805 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.805 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.92 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.805 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.92 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 32873852 kB MemFree: 27909480 kB Buffers: 561340 kB Cached: 3101232 kB SwapCached: 2348 kB Active: 1888860 kB Inactive: 2206436 kB Active(anon): 428944 kB Inactive(anon): 3664 kB Active(file): 1459916 kB Inactive(file): 2202772 kB Unevictable: 7624 kB Mlocked: 7624 kB SwapTotal: 67108856 kB SwapFree: 67099088 kB Dirty: 17828 kB Writeback: 0 kB AnonPages: 434904 kB Mapped: 16900 kB Shmem: 0 kB Slab: 728968 kB SReclaimable: 171088 kB SUnreclaim: 557880 kB KernelStack: 1456 kB PageTables: 4636 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545780 kB Committed_AS: 558248 kB VmallocTotal: 34359738367 kB VmallocUsed: 346360 kB VmallocChunk: 34341988004 kB HardwareCorrupted: 0 kB AnonHugePages: 335872 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= 71368 MiB End job on node131 at 2012-06-03 17:37:04