| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed | UNSAT | 0.768882 | 0.772255 |
| 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.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3690588-1338022666.opb>
0.08/0.10 c original problem has 12376 variables (12376 bin, 0 int, 0 impl, 0 cont) and 38600 constraints
0.08/0.10 c problem read in 0.10
0.08/0.10 c No objective function, only one solution is needed.
0.08/0.10 c presolving settings loaded
0.19/0.23 c presolving:
0.58/0.69 c presolving (1 rounds):
0.58/0.69 c 1037 deleted vars, 4362 deleted constraints, 0 added constraints, 1037 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.58/0.69 c 1351808 implications, 0 cliques
0.69/0.70 c presolving detected infeasibility
0.69/0.70 c Presolving Time: 0.55
0.69/0.70 c - non default parameters ----------------------------------------------------------------------
0.69/0.70 c # SCIP version 2.1.1.4
0.69/0.70 c
0.69/0.70 c # maximal time in seconds to run
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/time = 1797
0.69/0.70 c
0.69/0.70 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.70 c limits/memory = 13950
0.69/0.70 c
0.69/0.70 c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c limits/solutions = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.70 c separating/maxrounds = 1
0.69/0.70 c
0.69/0.70 c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/maxroundsroot = 5
0.69/0.70 c
0.69/0.70 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.69/0.70 c # [type: int, range: [1,2], default: 1]
0.69/0.70 c timing/clocktype = 2
0.69/0.70 c
0.69/0.70 c # belongs reading time to solving time?
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.70 c timing/reading = TRUE
0.69/0.70 c
0.69/0.70 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.70 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.70 c constraints/knapsack/disaggregation = FALSE
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/coefdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.70 c heuristics/crossover/freq = -1
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/crossover/nodesofs = 750
0.69/0.70 c
0.69/0.70 c # number of nodes without incumbent change that heuristic should wait
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.70 c heuristics/crossover/nwaitingnodes = 100
0.69/0.70 c
0.69/0.70 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.70 c # [type: real, range: [0,1], default: 0.1]
0.69/0.70 c heuristics/crossover/nodesquot = 0.15
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixed
0.69/0.70 c # [type: real, range: [0,1], default: 0.666]
0.69/0.70 c heuristics/crossover/minfixingrate = 0.5
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/feaspump/freq = -1
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/fracdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/guideddiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/intshifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/linesearchdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/objpscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.70 c # [type: real, range: [0,1], default: 0.01]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/oneopt/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/pscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/rens/freq = -1
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixable
0.69/0.70 c # [type: real, range: [0,1], default: 0.5]
0.69/0.70 c heuristics/rens/minfixingrate = 0.3
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/rens/nodesofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/rootsoldiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/rounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/shiftandpropagate/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/shifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/simplerounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/subnlp/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/trivial/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/trysol/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/undercover/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/veclendiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/zirounding/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c propagating/probing/maxprerounds = 0
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/cmir/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/flowcover/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/rapidlearning/freq = 0
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/indoneopt/freq = -1
0.69/0.70 c
0.69/0.70 c -----------------------------------------------------------------------------------------------
0.69/0.70 c start solving
0.69/0.70 s UNSATISFIABLE
0.69/0.70 c SCIP Status : problem is solved [infeasible]
0.69/0.70 c Total Time : 0.69
0.69/0.70 c solving : 0.69
0.69/0.70 c presolving : 0.55 (included in solving)
0.69/0.70 c reading : 0.10 (included in solving)
0.69/0.70 c copying : 0.00 (0 times copied the problem)
0.69/0.70 c Original Problem :
0.69/0.70 c Problem name : HOME/instance-3690588-1338022666.opb
0.69/0.70 c Variables : 12376 (12376 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 38600 initial, 38600 maximal
0.69/0.70 c Objective sense : minimize
0.69/0.70 c Presolved Problem :
0.69/0.70 c Problem name : t_HOME/instance-3690588-1338022666.opb
0.69/0.70 c Variables : 11339 (11339 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 34238 initial, 34238 maximal
0.69/0.70 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.69/0.70 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c linear : 0.45 0.01 1037 0 0 1037 0 4362 0 0 0
0.69/0.70 c root node : - - 0 - - 0 - - - - -
0.69/0.70 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.69/0.70 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.69/0.70 c linear : 34238 34238 0 0 0 0 0 0 0 0 0 0 0
0.69/0.70 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.69/0.70 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.69/0.70 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c linear : 0.01 0.01 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.69/0.70 c pseudoobj : 0 0 0 0
0.69/0.70 c redcost : 0 0 0 0
0.69/0.70 c rootredcost : 0 0 0 0
0.69/0.70 c vbounds : 0 0 0 0
0.69/0.70 c probing : 0 0 0 0
0.69/0.70 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.69/0.70 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c redcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c probing : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.70 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.70 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.70 c applied globally : - - - 0 0.0 - - -
0.69/0.70 c applied locally : - - - 0 0.0 - - -
0.69/0.70 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.69/0.70 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.70 c clique : 0.00 0.00 0 0 0 0 0
0.69/0.70 c closecuts : 0.00 0.00 0 0 0 0 0
0.69/0.70 c cgmip : 0.00 0.00 0 0 0 0 0
0.69/0.70 c cmir : 0.00 0.00 0 0 0 0 0
0.69/0.70 c flowcover : 0.00 0.00 0 0 0 0 0
0.69/0.70 c gomory : 0.00 0.00 0 0 0 0 0
0.69/0.70 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.69/0.70 c intobj : 0.00 0.00 0 0 0 0 0
0.69/0.70 c mcf : 0.00 0.00 0 0 0 0 0
0.69/0.70 c oddcycle : 0.00 0.00 0 0 0 0 0
0.69/0.70 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.69/0.70 c strongcg : 0.00 0.00 0 0 0 0 0
0.69/0.70 c zerohalf : 0.00 0.00 0 0 0 0 0
0.69/0.70 c Pricers : ExecTime SetupTime Calls Vars
0.69/0.70 c problem variables: 0.00 - 0 0
0.69/0.70 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.69/0.70 c pscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c inference : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c random : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c Primal Heuristics : ExecTime SetupTime Calls Found
0.69/0.70 c LP solutions : 0.00 - - 0
0.69/0.70 c pseudo solutions : 0.00 - - 0
0.69/0.70 c smallcard : 0.00 0.00 0 0
0.69/0.70 c trivial : 0.01 0.00 1 0
0.69/0.70 c shiftandpropagate: 0.00 0.00 0 0
0.69/0.70 c simplerounding : 0.00 0.00 0 0
0.69/0.70 c zirounding : 0.00 0.00 0 0
0.69/0.70 c rounding : 0.00 0.00 0 0
0.69/0.70 c shifting : 0.00 0.00 0 0
0.69/0.70 c intshifting : 0.00 0.00 0 0
0.69/0.70 c oneopt : 0.00 0.00 0 0
0.69/0.70 c twoopt : 0.00 0.00 0 0
0.69/0.70 c indtwoopt : 0.00 0.00 0 0
0.69/0.70 c indoneopt : 0.00 0.00 0 0
0.69/0.70 c fixandinfer : 0.00 0.00 0 0
0.69/0.70 c feaspump : 0.00 0.00 0 0
0.69/0.70 c clique : 0.00 0.00 0 0
0.69/0.70 c indrounding : 0.00 0.00 0 0
0.69/0.70 c indcoefdiving : 0.00 0.00 0 0
0.69/0.70 c coefdiving : 0.00 0.00 0 0
0.69/0.70 c pscostdiving : 0.00 0.00 0 0
0.69/0.70 c nlpdiving : 0.00 0.00 0 0
0.69/0.70 c fracdiving : 0.00 0.00 0 0
0.69/0.70 c veclendiving : 0.00 0.00 0 0
0.69/0.70 c intdiving : 0.00 0.00 0 0
0.69/0.70 c actconsdiving : 0.00 0.00 0 0
0.69/0.70 c objpscostdiving : 0.00 0.00 0 0
0.69/0.70 c rootsoldiving : 0.00 0.00 0 0
0.69/0.70 c linesearchdiving : 0.00 0.00 0 0
0.69/0.70 c guideddiving : 0.00 0.00 0 0
0.69/0.70 c octane : 0.00 0.00 0 0
0.69/0.70 c rens : 0.00 0.00 0 0
0.69/0.70 c rins : 0.00 0.00 0 0
0.69/0.70 c localbranching : 0.00 0.00 0 0
0.69/0.70 c mutation : 0.00 0.00 0 0
0.69/0.70 c crossover : 0.00 0.00 0 0
0.69/0.70 c dins : 0.00 0.00 0 0
0.69/0.70 c vbounds : 0.00 0.00 0 0
0.69/0.70 c undercover : 0.00 0.00 0 0
0.69/0.70 c subnlp : 0.00 0.00 0 0
0.69/0.70 c trysol : 0.00 0.00 0 0
0.69/0.70 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.69/0.70 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.70 c dual LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.70 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.70 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.70 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.70 c strong branching : 0.00 0 0 0.00 -
0.69/0.70 c (at root node) : - 0 0 0.00 -
0.69/0.70 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.70 c B&B Tree :
0.69/0.70 c number of runs : 1
0.69/0.70 c nodes : 0
0.69/0.70 c nodes (total) : 0
0.69/0.70 c nodes left : 1
0.69/0.70 c max depth : -1
0.69/0.70 c max depth (total): -1
0.69/0.70 c backtracks : 0 (0.0%)
0.69/0.70 c delayed cutoffs : 0
0.69/0.70 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.70 c avg switch length: 0.00
0.69/0.70 c switching time : 0.00
0.69/0.70 c Solution :
0.69/0.70 c Solutions found : 0 (0 improvements)
0.69/0.70 c Primal Bound : infeasible
0.69/0.70 c Dual Bound : -
0.69/0.70 c Gap : infinite
0.69/0.70 c Root Dual Bound : -
0.69/0.70 c Root Iterations : 0
0.69/0.77 c Time complete: 0.75.
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-3690588-1338022666/watcher-3690588-1338022666 -o /tmp/evaluation-result-3690588-1338022666/solver-3690588-1338022666 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3690588-1338022666.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 1.94 3/176 31663 /proc/meminfo: memFree=28560544/32873648 swapFree=7372/7372 [pid=31663] ppid=31661 vsize=9164 CPUtime=0 cores=1,3,5,7 /proc/31663/stat : 31663 (scip-2.1.1.4fix) R 31661 31663 31092 0 -1 4202496 894 0 0 0 0 0 0 0 20 0 1 0 268392624 9383936 848 33554432000 4194304 10173063 140736493053024 140733733989256 8846909 0 0 4096 0 0 0 0 17 1 0 0 0 0 0 /proc/31663/statm: 2291 858 392 1460 0 822 0 [startup+0.0880881 s] /proc/loadavg: 2.07 2.02 1.94 3/176 31663 /proc/meminfo: memFree=28560544/32873648 swapFree=7372/7372 [pid=31663] ppid=31661 vsize=29720 CPUtime=0.07 cores=1,3,5,7 /proc/31663/stat : 31663 (scip-2.1.1.4fix) R 31661 31663 31092 0 -1 4202496 6189 0 0 0 7 0 0 0 20 0 1 0 268392624 30433280 6143 33554432000 4194304 10173063 140736493053024 140733733989256 8985008 0 0 4096 0 0 0 0 17 1 0 0 0 0 0 /proc/31663/statm: 7430 6143 413 1460 0 5961 0 Current children cumulated CPU time (s) 0.07 Current children cumulated vsize (KiB) 29720 [startup+0.100279 s] /proc/loadavg: 2.07 2.02 1.94 3/176 31663 /proc/meminfo: memFree=28560544/32873648 swapFree=7372/7372 [pid=31663] ppid=31661 vsize=32036 CPUtime=0.08 cores=1,3,5,7 /proc/31663/stat : 31663 (scip-2.1.1.4fix) R 31661 31663 31092 0 -1 4202496 6761 0 0 0 8 0 0 0 20 0 1 0 268392624 32804864 6715 33554432000 4194304 10173063 140736493053024 140733733989256 5283998 0 0 4096 0 0 0 0 17 1 0 0 0 0 0 /proc/31663/statm: 8009 6715 413 1460 0 6540 0 Current children cumulated CPU time (s) 0.08 Current children cumulated vsize (KiB) 32036 [startup+0.300238 s] /proc/loadavg: 2.07 2.02 1.94 3/176 31663 /proc/meminfo: memFree=28560544/32873648 swapFree=7372/7372 [pid=31663] ppid=31661 vsize=95844 CPUtime=0.28 cores=1,3,5,7 /proc/31663/stat : 31663 (scip-2.1.1.4fix) R 31661 31663 31092 0 -1 4202496 23018 0 0 0 26 2 0 0 20 0 1 0 268392624 98144256 22171 33554432000 4194304 10173063 140736493053024 140733733989256 8963895 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0 /proc/31663/statm: 23961 22171 559 1460 0 22492 0 Current children cumulated CPU time (s) 0.28 Current children cumulated vsize (KiB) 95844 [startup+0.700262 s] /proc/loadavg: 2.07 2.02 1.94 3/176 31663 /proc/meminfo: memFree=28560544/32873648 swapFree=7372/7372 [pid=31663] ppid=31661 vsize=138344 CPUtime=0.69 cores=1,3,5,7 /proc/31663/stat : 31663 (scip-2.1.1.4fix) R 31661 31663 31092 0 -1 4202496 33474 0 0 0 64 5 0 0 20 0 1 0 268392624 141664256 32627 33554432000 4194304 10173063 140736493053024 140736493050024 5894939 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0 /proc/31663/statm: 34586 32627 574 1460 0 33117 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 138344 Solver just ended. Dumping a history of the last processes samples Child status: 0 Real time (s): 0.772255 CPU time (s): 0.768882 CPU user time (s): 0.708892 CPU system time (s): 0.05999 CPU usage (%): 99.5632 Max. virtual memory (cumulated for all children) (KiB): 138344 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.708892 system time used= 0.05999 maximum resident set size= 131960 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 33861 page faults= 0 swaps= 0 block input operations= 0 block output operations= 0 messages sent= 0 messages received= 0 signals received= 0 voluntary context switches= 3 involuntary context switches= 4 runsolver used 0.004999 second user time and 0.007998 second system time The end
Begin job on node122 at 2012-05-26 10:57:46 IDJOB=3690588 IDBENCH=74809 IDSOLVER=2270 FILE ID=node122/3690588-1338022666 RUNJOBID= node122-1338016935-31109 PBS_JOBID= 14624349 Free space on /tmp= 71312 MiB SOLVER NAME= SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j90/normalized-j908_8-unsat.opb COMMAND LINE= HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3690588-1338022666/watcher-3690588-1338022666 -o /tmp/evaluation-result-3690588-1338022666/solver-3690588-1338022666 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3690588-1338022666.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= d78b76fea1950503bb859b4dec250d3a RANDOM SEED=2041278388 node122.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.533 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.06 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.533 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.533 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 : 5332.04 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.533 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.533 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.533 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 : 5438.54 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.533 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.533 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: 32873648 kB MemFree: 28561072 kB Buffers: 218976 kB Cached: 3163656 kB SwapCached: 0 kB Active: 1480880 kB Inactive: 2056412 kB Active(anon): 146252 kB Inactive(anon): 11052 kB Active(file): 1334628 kB Inactive(file): 2045360 kB Unevictable: 7372 kB Mlocked: 7372 kB SwapTotal: 67108856 kB SwapFree: 67108856 kB Dirty: 14884 kB Writeback: 0 kB AnonPages: 161644 kB Mapped: 17140 kB Shmem: 200 kB Slab: 637864 kB SReclaimable: 82164 kB SUnreclaim: 555700 kB KernelStack: 1472 kB PageTables: 4180 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545680 kB Committed_AS: 270660 kB VmallocTotal: 34359738367 kB VmallocUsed: 346400 kB VmallocChunk: 34341988052 kB HardwareCorrupted: 0 kB AnonHugePages: 30720 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7680 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 71300 MiB End job on node122 at 2012-05-26 10:57:47