| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB11: SCIP spx E_2 2011-06-10 (fixed) | UNSAT | 1.76973 | 1.77056 |
| Name | /DEC-SMALLINT-LIN/oliveras/j90/ normalized-j9040_1-unsat.opb |
| MD5SUM | 574b82c1c7e1d1d86d799d6cfb5ed5a6 |
| 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.018996 |
| 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 | 17290 |
| Total number of constraints | 59721 |
| Number of constraints which are clauses | 59345 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 376 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 47 |
| 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 | 51 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 308 |
| 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-3739907-1338738020.opb>
0.29/0.33 c original problem has 17290 variables (17290 bin, 0 int, 0 impl, 0 cont) and 59721 constraints
0.29/0.33 c problem read
0.29/0.33 c No objective function, only one solution is needed.
0.29/0.33 c presolving settings loaded
0.39/0.47 c presolving:
1.59/1.63 c presolving (1 rounds):
1.59/1.63 c 2252 deleted vars, 8001 deleted constraints, 0 added constraints, 2252 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.59/1.63 c 2548456 implications, 0 cliques
1.59/1.64 c presolving detected infeasibility
1.59/1.64 c Presolving Time: 1.20
1.59/1.64 c - non default parameters ----------------------------------------------------------------------
1.59/1.64 c # SCIP version 2.0.1.5
1.59/1.64 c
1.59/1.64 c # frequency for displaying node information lines
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 100]
1.59/1.64 c display/freq = 10000
1.59/1.64 c
1.59/1.64 c # maximal time in seconds to run
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.59/1.64 c limits/time = 1797
1.59/1.64 c
1.59/1.64 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.59/1.64 c limits/memory = 13950
1.59/1.64 c
1.59/1.64 c # solving stops, if the given number of solutions were found (-1: no limit)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.64 c limits/solutions = 1
1.59/1.64 c
1.59/1.64 c # maximal number of separation rounds per node (-1: unlimited)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 5]
1.59/1.64 c separating/maxrounds = 1
1.59/1.64 c
1.59/1.64 c # maximal number of separation rounds in the root node (-1: unlimited)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.64 c separating/maxroundsroot = 5
1.59/1.64 c
1.59/1.64 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.59/1.64 c # [type: int, range: [1,2], default: 1]
1.59/1.64 c timing/clocktype = 2
1.59/1.64 c
1.59/1.64 c # belongs reading time to solving time?
1.59/1.64 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.64 c timing/reading = TRUE
1.59/1.64 c
1.59/1.64 c # should presolving try to simplify inequalities
1.59/1.64 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.64 c constraints/linear/simplifyinequalities = TRUE
1.59/1.64 c
1.59/1.64 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
1.59/1.64 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.64 c constraints/indicator/addCouplingCons = TRUE
1.59/1.64 c
1.59/1.64 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.59/1.64 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.59/1.64 c constraints/knapsack/disaggregation = FALSE
1.59/1.64 c
1.59/1.64 c # should presolving try to simplify knapsacks
1.59/1.64 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.64 c constraints/knapsack/simplifyinequalities = TRUE
1.59/1.64 c
1.59/1.64 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.64 c presolving/probing/maxrounds = 0
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/coefdiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.64 c heuristics/coefdiving/maxlpiterquot = 0.075
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/coefdiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 30]
1.59/1.64 c heuristics/crossover/freq = -1
1.59/1.64 c
1.59/1.64 c # number of nodes added to the contingent of the total nodes
1.59/1.64 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.59/1.64 c heuristics/crossover/nodesofs = 750
1.59/1.64 c
1.59/1.64 c # number of nodes without incumbent change that heuristic should wait
1.59/1.64 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.59/1.64 c heuristics/crossover/nwaitingnodes = 100
1.59/1.64 c
1.59/1.64 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.59/1.64 c # [type: real, range: [0,1], default: 0.1]
1.59/1.64 c heuristics/crossover/nodesquot = 0.15
1.59/1.64 c
1.59/1.64 c # minimum percentage of integer variables that have to be fixed
1.59/1.64 c # [type: real, range: [0,1], default: 0.666]
1.59/1.64 c heuristics/crossover/minfixingrate = 0.5
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 20]
1.59/1.64 c heuristics/feaspump/freq = -1
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/feaspump/maxlpiterofs = 2000
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/fracdiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.64 c heuristics/fracdiving/maxlpiterquot = 0.075
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/fracdiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/guideddiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.64 c heuristics/guideddiving/maxlpiterquot = 0.075
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/guideddiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.64 c heuristics/intdiving/maxlpiterquot = 0.075
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/intshifting/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/linesearchdiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.64 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 20]
1.59/1.64 c heuristics/objpscostdiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to total iteration number
1.59/1.64 c # [type: real, range: [0,1], default: 0.01]
1.59/1.64 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.64 c heuristics/oneopt/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/pscostdiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.64 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/pscostdiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.64 c heuristics/rens/freq = -1
1.59/1.64 c
1.59/1.64 c # minimum percentage of integer variables that have to be fixable
1.59/1.64 c # [type: real, range: [0,1], default: 0.5]
1.59/1.64 c heuristics/rens/minfixingrate = 0.3
1.59/1.64 c
1.59/1.64 c # number of nodes added to the contingent of the total nodes
1.59/1.64 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.59/1.64 c heuristics/rens/nodesofs = 2000
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 20]
1.59/1.64 c heuristics/rootsoldiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.59/1.64 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.64 c heuristics/rounding/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.64 c heuristics/shiftandpropagate/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/shifting/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.64 c heuristics/simplerounding/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.64 c heuristics/subnlp/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.64 c heuristics/trivial/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.64 c heuristics/trysol/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.64 c heuristics/undercover/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 10]
1.59/1.64 c heuristics/veclendiving/freq = -1
1.59/1.64 c
1.59/1.64 c # maximal fraction of diving LP iterations compared to node LP iterations
1.59/1.64 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.59/1.64 c heuristics/veclendiving/maxlpiterquot = 0.075
1.59/1.64 c
1.59/1.64 c # additional number of allowed LP iterations
1.59/1.64 c # [type: int, range: [0,2147483647], default: 1000]
1.59/1.64 c heuristics/veclendiving/maxlpiterofs = 1500
1.59/1.64 c
1.59/1.64 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 1]
1.59/1.64 c heuristics/zirounding/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.64 c separating/cmir/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: 0]
1.59/1.64 c separating/flowcover/freq = -1
1.59/1.64 c
1.59/1.64 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.59/1.64 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.64 c separating/rapidlearning/freq = 0
1.59/1.64 c
1.59/1.64 c -----------------------------------------------------------------------------------------------
1.59/1.64 c start solving
1.59/1.64 c
1.59/1.64 c SCIP Status : problem is solved [infeasible]
1.59/1.64 c Solving Time (sec) : 1.64
1.59/1.64 c Solving Nodes : 0
1.59/1.64 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.59/1.64 c Dual Bound : -1.00000000000000e+20
1.59/1.64 c Gap : infinite
1.59/1.64 s UNSATISFIABLE
1.59/1.64 c SCIP Status : problem is solved [infeasible]
1.59/1.64 c Total Time : 1.64
1.59/1.64 c solving : 1.64
1.59/1.64 c presolving : 1.20 (included in solving)
1.59/1.64 c reading : 0.33 (included in solving)
1.59/1.64 c Original Problem :
1.59/1.64 c Problem name : HOME/instance-3739907-1338738020.opb
1.59/1.64 c Variables : 17290 (17290 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.64 c Constraints : 59721 initial, 59721 maximal
1.59/1.64 c Presolved Problem :
1.59/1.64 c Problem name : t_HOME/instance-3739907-1338738020.opb
1.59/1.64 c Variables : 15038 (15038 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.64 c Constraints : 51720 initial, 51720 maximal
1.59/1.64 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.59/1.64 c trivial : 0.00 0 0 0 0 0 0 0 0 0
1.59/1.64 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
1.59/1.64 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
1.59/1.64 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
1.59/1.64 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
1.59/1.64 c implics : 0.00 0 0 0 0 0 0 0 0 0
1.59/1.64 c probing : 0.00 0 0 0 0 0 0 0 0 0
1.59/1.64 c linear : 1.14 2252 0 0 2252 0 8001 0 0 0
1.59/1.64 c root node : - 0 - - 0 - - - - -
1.59/1.64 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
1.59/1.64 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
1.59/1.64 c linear : 51720 0 0 0 0 0 0 0 0 0 0 0
1.59/1.64 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
1.59/1.64 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
1.59/1.64 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.59/1.64 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.59/1.64 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.59/1.64 c Propagators : #Propagate #Resprop Cutoffs DomReds
1.59/1.64 c pseudoobj : 0 0 0 0
1.59/1.64 c rootredcost : 0 0 0 0
1.59/1.64 c vbounds : 0 0 0 0
1.59/1.64 c Propagator Timings : TotalTime Propagate Resprop
1.59/1.64 c pseudoobj : 0.00 0.00 0.00
1.59/1.64 c rootredcost : 0.00 0.00 0.00
1.59/1.64 c vbounds : 0.00 0.00 0.00
1.59/1.64 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.64 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.64 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.64 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.64 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.64 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.64 c applied globally : - - - 0 0.0 - - -
1.59/1.64 c applied locally : - - - 0 0.0 - - -
1.59/1.64 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.64 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.59/1.64 c redcost : 0.00 0 0 0 0 0
1.59/1.64 c impliedbounds : 0.00 0 0 0 0 0
1.59/1.64 c intobj : 0.00 0 0 0 0 0
1.59/1.64 c gomory : 0.00 0 0 0 0 0
1.59/1.64 c cgmip : 0.00 0 0 0 0 0
1.59/1.64 c closecuts : 0.00 0 0 0 0 0
1.59/1.64 c strongcg : 0.00 0 0 0 0 0
1.59/1.64 c cmir : 0.00 0 0 0 0 0
1.59/1.64 c flowcover : 0.00 0 0 0 0 0
1.59/1.64 c clique : 0.00 0 0 0 0 0
1.59/1.64 c zerohalf : 0.00 0 0 0 0 0
1.59/1.64 c mcf : 0.00 0 0 0 0 0
1.59/1.64 c oddcycle : 0.00 0 0 0 0 0
1.59/1.64 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.64 c Pricers : Time Calls Vars
1.59/1.64 c problem variables: 0.00 0 0
1.59/1.64 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.64 c pscost : 0.00 0 0 0 0 0 0
1.59/1.64 c inference : 0.00 0 0 0 0 0 0
1.59/1.64 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.64 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.64 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.64 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.64 c random : 0.00 0 0 0 0 0 0
1.59/1.64 c relpscost : 0.00 0 0 0 0 0 0
1.59/1.64 c Primal Heuristics : Time Calls Found
1.59/1.64 c LP solutions : 0.00 - 0
1.59/1.64 c pseudo solutions : 0.00 - 0
1.59/1.64 c trivial : 0.01 1 0
1.59/1.64 c shiftandpropagate: 0.00 0 0
1.59/1.64 c simplerounding : 0.00 0 0
1.59/1.64 c zirounding : 0.00 0 0
1.59/1.64 c rounding : 0.00 0 0
1.59/1.64 c shifting : 0.00 0 0
1.59/1.64 c intshifting : 0.00 0 0
1.59/1.64 c oneopt : 0.00 0 0
1.59/1.64 c twoopt : 0.00 0 0
1.59/1.64 c fixandinfer : 0.00 0 0
1.59/1.64 c feaspump : 0.00 0 0
1.59/1.64 c clique : 0.00 0 0
1.59/1.64 c coefdiving : 0.00 0 0
1.59/1.64 c pscostdiving : 0.00 0 0
1.59/1.64 c fracdiving : 0.00 0 0
1.59/1.64 c veclendiving : 0.00 0 0
1.59/1.64 c intdiving : 0.00 0 0
1.59/1.64 c actconsdiving : 0.00 0 0
1.59/1.64 c objpscostdiving : 0.00 0 0
1.59/1.64 c rootsoldiving : 0.00 0 0
1.59/1.64 c linesearchdiving : 0.00 0 0
1.59/1.64 c guideddiving : 0.00 0 0
1.59/1.64 c octane : 0.00 0 0
1.59/1.64 c rens : 0.00 0 0
1.59/1.64 c rins : 0.00 0 0
1.59/1.64 c localbranching : 0.00 0 0
1.59/1.64 c mutation : 0.00 0 0
1.59/1.64 c crossover : 0.00 0 0
1.59/1.64 c dins : 0.00 0 0
1.59/1.64 c vbounds : 0.00 0 0
1.59/1.64 c undercover : 0.00 0 0
1.59/1.64 c subnlp : 0.00 0 0
1.59/1.64 c trysol : 0.00 0 0
1.59/1.64 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.64 c primal LP : 0.00 0 0 0.00 -
1.59/1.64 c dual LP : 0.00 0 0 0.00 -
1.59/1.64 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.64 c barrier LP : 0.00 0 0 0.00 -
1.59/1.64 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.64 c strong branching : 0.00 0 0 0.00 -
1.59/1.64 c (at root node) : - 0 0 0.00 -
1.59/1.64 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.64 c B&B Tree :
1.59/1.64 c number of runs : 1
1.59/1.64 c nodes : 0
1.59/1.64 c nodes (total) : 0
1.59/1.64 c nodes left : 1
1.59/1.64 c max depth : -1
1.59/1.64 c max depth (total): -1
1.59/1.64 c backtracks : 0 (0.0%)
1.59/1.64 c delayed cutoffs : 0
1.59/1.64 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.59/1.64 c avg switch length: 0.00
1.59/1.64 c switching time : 0.00
1.59/1.64 c Solution :
1.59/1.64 c Solutions found : 0 (0 improvements)
1.59/1.64 c Primal Bound : infeasible
1.59/1.64 c Dual Bound : -
1.59/1.64 c Gap : infinite
1.59/1.64 c Root Dual Bound : -
1.59/1.64 c Root Iterations : 0
1.69/1.77 c Time complete: 1.76.
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-3739907-1338738020/watcher-3739907-1338738020 -o /tmp/evaluation-result-3739907-1338738020/solver-3739907-1338738020 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739907-1338738020.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.06 2.06 2.01 3/175 1114 /proc/meminfo: memFree=27908048/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=9040 CPUtime=0 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 1270 0 0 0 0 0 0 0 20 0 1 0 339927491 9256960 1225 33554432000 4194304 9016284 140734970485184 140734970484152 4447263 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 2260 1230 193 1178 0 1078 0 [startup+0.105744 s] /proc/loadavg: 2.06 2.06 2.01 3/175 1114 /proc/meminfo: memFree=27908048/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=27784 CPUtime=0.1 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 5942 0 0 0 9 1 0 0 20 0 1 0 339927491 28450816 5897 33554432000 4194304 9016284 140734970485184 140734970484152 4536490 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 6946 5897 357 1178 0 5764 0 Current children cumulated CPU time (s) 0.1 Current children cumulated vsize (KiB) 27784 [startup+0.20036 s] /proc/loadavg: 2.06 2.06 2.01 3/175 1114 /proc/meminfo: memFree=27908048/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=34904 CPUtime=0.19 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 7721 0 0 0 18 1 0 0 20 0 1 0 339927491 35741696 7676 33554432000 4194304 9016284 140734970485184 140734970484152 7842364 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 8726 7676 357 1178 0 7544 0 Current children cumulated CPU time (s) 0.19 Current children cumulated vsize (KiB) 34904 [startup+0.300405 s] /proc/loadavg: 2.06 2.06 2.01 3/175 1114 /proc/meminfo: memFree=27908048/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=46516 CPUtime=0.29 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 10600 0 0 0 27 2 0 0 20 0 1 0 339927491 47632384 10555 33554432000 4194304 9016284 140734970485184 140734970484152 4447120 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 11629 10555 357 1178 0 10447 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 46516 [startup+0.700323 s] /proc/loadavg: 2.06 2.06 2.01 3/175 1114 /proc/meminfo: memFree=27908048/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=132916 CPUtime=0.69 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 31844 0 0 0 65 4 0 0 20 0 1 0 339927491 136105984 31726 33554432000 4194304 9016284 140734970485184 140734970484152 6813403 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 33229 31726 484 1178 0 32047 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 132916 [startup+1.50032 s] /proc/loadavg: 2.06 2.06 2.01 3/176 1115 /proc/meminfo: memFree=27744484/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=185456 CPUtime=1.49 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 44774 0 0 0 143 6 0 0 20 0 1 0 339927491 189906944 44656 33554432000 4194304 9016284 140734970485184 140734970480488 4875353 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 46364 44656 484 1178 0 45182 0 Current children cumulated CPU time (s) 1.49 Current children cumulated vsize (KiB) 185456 Solver just ended. Dumping a history of the last processes samples [startup+1.60039 s] /proc/loadavg: 2.06 2.06 2.01 3/176 1115 /proc/meminfo: memFree=27744484/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=188464 CPUtime=1.59 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 45458 0 0 0 153 6 0 0 20 0 1 0 339927491 192987136 45340 33554432000 4194304 9016284 140734970485184 140734970480488 4875334 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 47116 45340 484 1178 0 45934 0 Current children cumulated CPU time (s) 1.59 Current children cumulated vsize (KiB) 188464 [startup+1.70033 s] /proc/loadavg: 2.06 2.06 2.01 3/176 1115 /proc/meminfo: memFree=27744484/32873852 swapFree=7624/7624 [pid=1114] ppid=1112 vsize=178044 CPUtime=1.69 cores=1,3,5,7 /proc/1114/stat : 1114 (scip-2.0.1.4b_2) R 1112 1114 29314 0 -1 4202496 46338 0 0 0 163 6 0 0 20 0 1 0 339927491 182317056 42746 33554432000 4194304 9016284 140734970485184 140734970480488 4446686 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/1114/statm: 44511 42746 520 1178 0 43329 0 Current children cumulated CPU time (s) 1.69 Current children cumulated vsize (KiB) 178044 Child status: 0 Real time (s): 1.77056 CPU time (s): 1.76973 CPU user time (s): 1.68474 CPU system time (s): 0.084987 CPU usage (%): 99.9533 Max. virtual memory (cumulated for all children) (KiB): 188464 getrusage(RUSAGE_CHILDREN,...) data: user time used= 1.68474 system time used= 0.084987 maximum resident set size= 183576 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 46350 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= 3 runsolver used 0.003999 second user time and 0.016997 second system time The end
Begin job on node131 at 2012-06-03 17:40:20 IDJOB=3739907 IDBENCH=75529 IDSOLVER=2329 FILE ID=node131/3739907-1338738020 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-j9040_1-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-3739907-1338738020/watcher-3739907-1338738020 -o /tmp/evaluation-result-3739907-1338738020/solver-3739907-1338738020 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739907-1338738020.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= 574b82c1c7e1d1d86d799d6cfb5ed5a6 RANDOM SEED=572490268 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: 27908312 kB Buffers: 561736 kB Cached: 3102796 kB SwapCached: 2348 kB Active: 1890932 kB Inactive: 2205908 kB Active(anon): 427812 kB Inactive(anon): 3844 kB Active(file): 1463120 kB Inactive(file): 2202064 kB Unevictable: 7624 kB Mlocked: 7624 kB SwapTotal: 67108856 kB SwapFree: 67099088 kB Dirty: 18424 kB Writeback: 8 kB AnonPages: 438056 kB Mapped: 16904 kB Shmem: 0 kB Slab: 728856 kB SReclaimable: 171088 kB SUnreclaim: 557768 kB KernelStack: 1456 kB PageTables: 5048 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545780 kB Committed_AS: 559360 kB VmallocTotal: 34359738367 kB VmallocUsed: 346360 kB VmallocChunk: 34341988004 kB HardwareCorrupted: 0 kB AnonHugePages: 337920 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:40:22