| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| SCIP spx SCIP 2.1.1.4. with SoPlex 1.6.0.3 fixed | UNSAT | 1.21681 | 1.21838 |
| Name | /DEC-SMALLINT-LIN/oliveras/j120/ normalized-j1205_3-unsat.opb |
| MD5SUM | d939386e9c2885a66e75196bb3e7e3bf |
| 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.015997 |
| 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 | 17424 |
| Total number of constraints | 54466 |
| Number of constraints which are clauses | 54182 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 284 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 39 |
| 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 | 28 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 237 |
| Number of bits of the biggest sum of numbers | 8 |
| 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-3690601-1338022646.opb>
0.09/0.14 c original problem has 17424 variables (17424 bin, 0 int, 0 impl, 0 cont) and 54466 constraints
0.09/0.14 c problem read in 0.14
0.09/0.15 c No objective function, only one solution is needed.
0.09/0.15 c presolving settings loaded
0.29/0.35 c presolving:
1.10/1.11 c presolving (1 rounds):
1.10/1.11 c 1631 deleted vars, 6548 deleted constraints, 0 added constraints, 1631 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.10/1.11 c 1936524 implications, 0 cliques
1.10/1.11 c presolving detected infeasibility
1.10/1.11 c Presolving Time: 0.90
1.10/1.11 c - non default parameters ----------------------------------------------------------------------
1.10/1.11 c # SCIP version 2.1.1.4
1.10/1.11 c
1.10/1.11 c # maximal time in seconds to run
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.11 c limits/time = 1797
1.10/1.11 c
1.10/1.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.11 c limits/memory = 13950
1.10/1.11 c
1.10/1.11 c # solving stops, if the given number of solutions were found (-1: no limit)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.11 c limits/solutions = 1
1.10/1.11 c
1.10/1.11 c # maximal number of separation rounds per node (-1: unlimited)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 5]
1.10/1.11 c separating/maxrounds = 1
1.10/1.11 c
1.10/1.11 c # maximal number of separation rounds in the root node (-1: unlimited)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.11 c separating/maxroundsroot = 5
1.10/1.11 c
1.10/1.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.10/1.11 c # [type: int, range: [1,2], default: 1]
1.10/1.11 c timing/clocktype = 2
1.10/1.11 c
1.10/1.11 c # belongs reading time to solving time?
1.10/1.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.11 c timing/reading = TRUE
1.10/1.11 c
1.10/1.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.10/1.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.10/1.11 c constraints/knapsack/disaggregation = FALSE
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/coefdiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.11 c heuristics/coefdiving/maxlpiterquot = 0.075
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/coefdiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 30]
1.10/1.11 c heuristics/crossover/freq = -1
1.10/1.11 c
1.10/1.11 c # number of nodes added to the contingent of the total nodes
1.10/1.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.10/1.11 c heuristics/crossover/nodesofs = 750
1.10/1.11 c
1.10/1.11 c # number of nodes without incumbent change that heuristic should wait
1.10/1.11 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.10/1.11 c heuristics/crossover/nwaitingnodes = 100
1.10/1.11 c
1.10/1.11 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.10/1.11 c # [type: real, range: [0,1], default: 0.1]
1.10/1.11 c heuristics/crossover/nodesquot = 0.15
1.10/1.11 c
1.10/1.11 c # minimum percentage of integer variables that have to be fixed
1.10/1.11 c # [type: real, range: [0,1], default: 0.666]
1.10/1.11 c heuristics/crossover/minfixingrate = 0.5
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.11 c heuristics/feaspump/freq = -1
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/feaspump/maxlpiterofs = 2000
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/fracdiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.11 c heuristics/fracdiving/maxlpiterquot = 0.075
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/fracdiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/guideddiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.11 c heuristics/guideddiving/maxlpiterquot = 0.075
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/guideddiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.11 c heuristics/intdiving/maxlpiterquot = 0.075
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/intshifting/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/linesearchdiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.11 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.11 c heuristics/objpscostdiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to total iteration number
1.10/1.11 c # [type: real, range: [0,1], default: 0.01]
1.10/1.11 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.11 c heuristics/oneopt/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/pscostdiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.11 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/pscostdiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.11 c heuristics/rens/freq = -1
1.10/1.11 c
1.10/1.11 c # minimum percentage of integer variables that have to be fixable
1.10/1.11 c # [type: real, range: [0,1], default: 0.5]
1.10/1.11 c heuristics/rens/minfixingrate = 0.3
1.10/1.11 c
1.10/1.11 c # number of nodes added to the contingent of the total nodes
1.10/1.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.10/1.11 c heuristics/rens/nodesofs = 2000
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.11 c heuristics/rootsoldiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.10/1.11 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.11 c heuristics/rounding/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.11 c heuristics/shiftandpropagate/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/shifting/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.11 c heuristics/simplerounding/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.11 c heuristics/subnlp/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.11 c heuristics/trivial/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.11 c heuristics/trysol/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.11 c heuristics/undercover/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.11 c heuristics/veclendiving/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.11 c heuristics/veclendiving/maxlpiterquot = 0.075
1.10/1.11 c
1.10/1.11 c # additional number of allowed LP iterations
1.10/1.11 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.11 c heuristics/veclendiving/maxlpiterofs = 1500
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.11 c heuristics/zirounding/freq = -1
1.10/1.11 c
1.10/1.11 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.11 c propagating/probing/maxprerounds = 0
1.10/1.11 c
1.10/1.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.11 c separating/cmir/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.11 c separating/flowcover/freq = -1
1.10/1.11 c
1.10/1.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.11 c separating/rapidlearning/freq = 0
1.10/1.11 c
1.10/1.11 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
1.10/1.11 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.11 c heuristics/indoneopt/freq = -1
1.10/1.11 c
1.10/1.11 c -----------------------------------------------------------------------------------------------
1.10/1.11 c start solving
1.10/1.11 s UNSATISFIABLE
1.10/1.11 c SCIP Status : problem is solved [infeasible]
1.10/1.11 c Total Time : 1.11
1.10/1.11 c solving : 1.11
1.10/1.11 c presolving : 0.90 (included in solving)
1.10/1.11 c reading : 0.14 (included in solving)
1.10/1.11 c copying : 0.00 (0 times copied the problem)
1.10/1.11 c Original Problem :
1.10/1.11 c Problem name : HOME/instance-3690601-1338022646.opb
1.10/1.11 c Variables : 17424 (17424 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.11 c Constraints : 54466 initial, 54466 maximal
1.10/1.11 c Objective sense : minimize
1.10/1.11 c Presolved Problem :
1.10/1.11 c Problem name : t_HOME/instance-3690601-1338022646.opb
1.10/1.11 c Variables : 15793 (15793 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.11 c Constraints : 47918 initial, 47918 maximal
1.10/1.11 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.10/1.11 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.10/1.11 c linear : 0.74 0.01 1631 0 0 1631 0 6548 0 0 0
1.10/1.11 c root node : - - 0 - - 0 - - - - -
1.10/1.11 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
1.10/1.11 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.10/1.11 c linear : 47918 47918 0 0 0 0 0 0 0 0 0 0 0
1.10/1.11 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.10/1.11 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
1.10/1.11 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c linear : 0.01 0.01 0.00 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.10/1.11 c pseudoobj : 0 0 0 0
1.10/1.11 c redcost : 0 0 0 0
1.10/1.11 c rootredcost : 0 0 0 0
1.10/1.11 c vbounds : 0 0 0 0
1.10/1.11 c probing : 0 0 0 0
1.10/1.11 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
1.10/1.11 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c redcost : 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c rootredcost : 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c vbounds : 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c probing : 0.00 0.00 0.00 0.00 0.00
1.10/1.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.10/1.11 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.11 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.11 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.11 c applied globally : - - - 0 0.0 - - -
1.10/1.11 c applied locally : - - - 0 0.0 - - -
1.10/1.11 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
1.10/1.11 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.10/1.11 c clique : 0.00 0.00 0 0 0 0 0
1.10/1.11 c closecuts : 0.00 0.00 0 0 0 0 0
1.10/1.11 c cgmip : 0.00 0.00 0 0 0 0 0
1.10/1.11 c cmir : 0.00 0.00 0 0 0 0 0
1.10/1.11 c flowcover : 0.00 0.00 0 0 0 0 0
1.10/1.11 c gomory : 0.00 0.00 0 0 0 0 0
1.10/1.11 c impliedbounds : 0.00 0.00 0 0 0 0 0
1.10/1.11 c intobj : 0.00 0.00 0 0 0 0 0
1.10/1.11 c mcf : 0.00 0.00 0 0 0 0 0
1.10/1.11 c oddcycle : 0.00 0.00 0 0 0 0 0
1.10/1.11 c rapidlearning : 0.00 0.00 0 0 0 0 0
1.10/1.11 c strongcg : 0.00 0.00 0 0 0 0 0
1.10/1.11 c zerohalf : 0.00 0.00 0 0 0 0 0
1.10/1.11 c Pricers : ExecTime SetupTime Calls Vars
1.10/1.11 c problem variables: 0.00 - 0 0
1.10/1.11 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
1.10/1.11 c pscost : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c inference : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c mostinf : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c leastinf : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c fullstrong : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c random : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c relpscost : 0.00 0.00 0 0 0 0 0 0
1.10/1.11 c Primal Heuristics : ExecTime SetupTime Calls Found
1.10/1.11 c LP solutions : 0.00 - - 0
1.10/1.11 c pseudo solutions : 0.00 - - 0
1.10/1.11 c smallcard : 0.00 0.00 0 0
1.10/1.11 c trivial : 0.01 0.00 1 0
1.10/1.11 c shiftandpropagate: 0.00 0.00 0 0
1.10/1.11 c simplerounding : 0.00 0.00 0 0
1.10/1.11 c zirounding : 0.00 0.00 0 0
1.10/1.11 c rounding : 0.00 0.00 0 0
1.10/1.11 c shifting : 0.00 0.00 0 0
1.10/1.11 c intshifting : 0.00 0.00 0 0
1.10/1.11 c oneopt : 0.00 0.00 0 0
1.10/1.11 c twoopt : 0.00 0.00 0 0
1.10/1.11 c indtwoopt : 0.00 0.00 0 0
1.10/1.11 c indoneopt : 0.00 0.00 0 0
1.10/1.11 c fixandinfer : 0.00 0.00 0 0
1.10/1.11 c feaspump : 0.00 0.00 0 0
1.10/1.11 c clique : 0.00 0.00 0 0
1.10/1.11 c indrounding : 0.00 0.00 0 0
1.10/1.11 c indcoefdiving : 0.00 0.00 0 0
1.10/1.11 c coefdiving : 0.00 0.00 0 0
1.10/1.11 c pscostdiving : 0.00 0.00 0 0
1.10/1.11 c nlpdiving : 0.00 0.00 0 0
1.10/1.11 c fracdiving : 0.00 0.00 0 0
1.10/1.11 c veclendiving : 0.00 0.00 0 0
1.10/1.11 c intdiving : 0.00 0.00 0 0
1.10/1.11 c actconsdiving : 0.00 0.00 0 0
1.10/1.11 c objpscostdiving : 0.00 0.00 0 0
1.10/1.11 c rootsoldiving : 0.00 0.00 0 0
1.10/1.11 c linesearchdiving : 0.00 0.00 0 0
1.10/1.11 c guideddiving : 0.00 0.00 0 0
1.10/1.11 c octane : 0.00 0.00 0 0
1.10/1.11 c rens : 0.00 0.00 0 0
1.10/1.11 c rins : 0.00 0.00 0 0
1.10/1.11 c localbranching : 0.00 0.00 0 0
1.10/1.11 c mutation : 0.00 0.00 0 0
1.10/1.11 c crossover : 0.00 0.00 0 0
1.10/1.11 c dins : 0.00 0.00 0 0
1.10/1.11 c vbounds : 0.00 0.00 0 0
1.10/1.11 c undercover : 0.00 0.00 0 0
1.10/1.11 c subnlp : 0.00 0.00 0 0
1.10/1.11 c trysol : 0.00 0.00 0 0
1.10/1.11 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
1.10/1.11 c primal LP : 0.00 0 0 0.00 - 0.00 0
1.10/1.11 c dual LP : 0.00 0 0 0.00 - 0.00 0
1.10/1.11 c lex dual LP : 0.00 0 0 0.00 -
1.10/1.11 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.10/1.11 c diving/probing LP: 0.00 0 0 0.00 -
1.10/1.11 c strong branching : 0.00 0 0 0.00 -
1.10/1.11 c (at root node) : - 0 0 0.00 -
1.10/1.11 c conflict analysis: 0.00 0 0 0.00 -
1.10/1.11 c B&B Tree :
1.10/1.11 c number of runs : 1
1.10/1.11 c nodes : 0
1.10/1.11 c nodes (total) : 0
1.10/1.11 c nodes left : 1
1.10/1.11 c max depth : -1
1.10/1.11 c max depth (total): -1
1.10/1.11 c backtracks : 0 (0.0%)
1.10/1.11 c delayed cutoffs : 0
1.10/1.11 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.10/1.11 c avg switch length: 0.00
1.10/1.11 c switching time : 0.00
1.10/1.11 c Solution :
1.10/1.11 c Solutions found : 0 (0 improvements)
1.10/1.11 c Primal Bound : infeasible
1.10/1.11 c Dual Bound : -
1.10/1.11 c Gap : infinite
1.10/1.11 c Root Dual Bound : -
1.10/1.11 c Root Iterations : 0
1.19/1.21 c Time complete: 1.21.
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-3690601-1338022646/watcher-3690601-1338022646 -o /tmp/evaluation-result-3690601-1338022646/solver-3690601-1338022646 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3690601-1338022646.opb -t 1800 -m 15500 running on 4 cores: 0,2,4,6 Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB Current StackSize limit: 10240 KiB [startup+0 s] /proc/loadavg: 2.00 2.00 1.98 2/176 6453 /proc/meminfo: memFree=28897700/32873844 swapFree=7612/7612 [pid=6453] ppid=6451 vsize=10216 CPUtime=0 cores=0,2,4,6 /proc/6453/stat : 6453 (scip-2.1.1.4fix) R 6451 6453 5919 0 -1 4202496 1288 0 0 0 0 0 0 0 20 0 1 0 268388962 10461184 1242 33554432000 4194304 10173063 140735165782976 140734803798200 7545739 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/6453/statm: 2554 1242 413 1460 0 1085 0 [startup+0.00765501 s] /proc/loadavg: 2.00 2.00 1.98 2/176 6453 /proc/meminfo: memFree=28897700/32873844 swapFree=7612/7612 [pid=6453] ppid=6451 vsize=10792 CPUtime=0 cores=0,2,4,6 /proc/6453/stat : 6453 (scip-2.1.1.4fix) R 6451 6453 5919 0 -1 4202496 1434 0 0 0 0 0 0 0 20 0 1 0 268388962 11051008 1388 33554432000 4194304 10173063 140735165782976 140734803798200 7172306 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/6453/statm: 2698 1388 413 1460 0 1229 0 Current children cumulated CPU time (s) 0 Current children cumulated vsize (KiB) 10792 [startup+0.100253 s] /proc/loadavg: 2.00 2.00 1.98 2/176 6453 /proc/meminfo: memFree=28897700/32873844 swapFree=7612/7612 [pid=6453] ppid=6451 vsize=31560 CPUtime=0.09 cores=0,2,4,6 /proc/6453/stat : 6453 (scip-2.1.1.4fix) R 6451 6453 5919 0 -1 4202496 6674 0 0 0 8 1 0 0 20 0 1 0 268388962 32317440 6609 33554432000 4194304 10173063 140735165782976 140735165647480 7142627 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/6453/statm: 7890 6609 413 1460 0 6421 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 31560 [startup+0.300266 s] /proc/loadavg: 2.00 2.00 1.98 2/176 6453 /proc/meminfo: memFree=28897700/32873844 swapFree=7612/7612 [pid=6453] ppid=6451 vsize=103700 CPUtime=0.29 cores=0,2,4,6 /proc/6453/stat : 6453 (scip-2.1.1.4fix) R 6451 6453 5919 0 -1 4202496 24226 0 0 0 26 3 0 0 20 0 1 0 268388962 106188800 24152 33554432000 4194304 10173063 140735165782976 140735165647480 7549298 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0 /proc/6453/statm: 25925 24152 509 1460 0 24456 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 103700 [startup+0.700268 s] /proc/loadavg: 2.00 2.00 1.98 2/176 6453 /proc/meminfo: memFree=28897700/32873844 swapFree=7612/7612 [pid=6453] ppid=6451 vsize=155156 CPUtime=0.69 cores=0,2,4,6 /proc/6453/stat : 6453 (scip-2.1.1.4fix) R 6451 6453 5919 0 -1 4202496 37709 0 0 0 60 9 0 0 20 0 1 0 268388962 158879744 36667 33554432000 4194304 10173063 140735165782976 140735165647480 8963895 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0 /proc/6453/statm: 38789 36667 558 1460 0 37320 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 155156 Solver just ended. Dumping a history of the last processes samples [startup+1.10631 s] /proc/loadavg: 2.00 2.00 1.98 3/177 6454 /proc/meminfo: memFree=28731648/32873844 swapFree=7612/7612 [pid=6453] ppid=6451 vsize=174492 CPUtime=1.1 cores=0,2,4,6 /proc/6453/stat : 6453 (scip-2.1.1.4fix) R 6451 6453 5919 0 -1 4202496 43400 0 0 0 97 13 0 0 20 0 1 0 268388962 178679808 41313 33554432000 4194304 10173063 140735165782976 140735165779976 4453134 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0 /proc/6453/statm: 43623 41313 562 1460 0 42154 0 Current children cumulated CPU time (s) 1.1 Current children cumulated vsize (KiB) 174492 [startup+1.20031 s] /proc/loadavg: 2.00 2.00 1.98 3/177 6454 /proc/meminfo: memFree=28731648/32873844 swapFree=7612/7612 [pid=6453] ppid=6451 vsize=129388 CPUtime=1.19 cores=0,2,4,6 /proc/6453/stat : 6453 (scip-2.1.1.4fix) R 6451 6453 5919 0 -1 4202496 44039 0 0 0 106 13 0 0 20 0 1 0 268388962 132493312 30449 33554432000 4194304 10173063 140735165782976 140735165779976 5285008 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/6453/statm: 32347 30449 617 1460 0 30878 0 Current children cumulated CPU time (s) 1.19 Current children cumulated vsize (KiB) 129388 Child status: 0 Real time (s): 1.21838 CPU time (s): 1.21681 CPU user time (s): 1.07184 CPU system time (s): 0.144977 CPU usage (%): 99.8714 Max. virtual memory (cumulated for all children) (KiB): 176340 getrusage(RUSAGE_CHILDREN,...) data: user time used= 1.07184 system time used= 0.144977 maximum resident set size= 169416 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 44055 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.008998 second user time and 0.014997 second system time The end
Begin job on node143 at 2012-05-26 10:57:26 IDJOB=3690601 IDBENCH=74016 IDSOLVER=2270 FILE ID=node143/3690601-1338022646 RUNJOBID= node143-1338016920-5935 PBS_JOBID= 14624332 Free space on /tmp= 71456 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/j120/normalized-j1205_3-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-3690601-1338022646/watcher-3690601-1338022646 -o /tmp/evaluation-result-3690601-1338022646/solver-3690601-1338022646 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3690601-1338022646.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= d939386e9c2885a66e75196bb3e7e3bf RANDOM SEED=310270172 node143.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.787 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.57 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.787 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.787 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.787 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.787 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.90 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.787 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 : 5298.57 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.787 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.787 cache size : 8192 KB physical id : 1 siblings : 4 core id : 3 cpu cores : 4 apicid : 22 initial apicid : 22 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 32873844 kB MemFree: 28897700 kB Buffers: 256556 kB Cached: 2814620 kB SwapCached: 0 kB Active: 819624 kB Inactive: 2375836 kB Active(anon): 126876 kB Inactive(anon): 0 kB Active(file): 692748 kB Inactive(file): 2375836 kB Unevictable: 7612 kB Mlocked: 7612 kB SwapTotal: 67108856 kB SwapFree: 67108856 kB Dirty: 15184 kB Writeback: 0 kB AnonPages: 131560 kB Mapped: 18084 kB Shmem: 200 kB Slab: 641148 kB SReclaimable: 83884 kB SUnreclaim: 557264 kB KernelStack: 1472 kB PageTables: 4300 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545776 kB Committed_AS: 240572 kB VmallocTotal: 34359738367 kB VmallocUsed: 346368 kB VmallocChunk: 34341987984 kB HardwareCorrupted: 0 kB AnonHugePages: 0 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7872 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 71440 MiB End job on node143 at 2012-05-26 10:57:27