| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| SCIP spx E SCIP 2.1.1.4. Exp with SoPlex 1.6.0.3 fixed | UNSAT | 1.19682 | 1.19795 |
| Name | /DEC-SMALLINT-LIN/oliveras/j90/ normalized-j9014_1-unsat.opb |
| MD5SUM | 55b8067ae8df952812934475200b69c4 |
| 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.016997 |
| 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 | 16198 |
| Total number of constraints | 50975 |
| Number of constraints which are clauses | 50623 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 352 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 90 |
| 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 | 588 |
| Number of bits of the biggest sum of numbers | 10 |
| 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: 947bdb7-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-3691742-1338039381.opb>
0.08/0.16 c original problem has 16198 variables (16198 bin, 0 int, 0 impl, 0 cont) and 50975 constraints
0.08/0.16 c problem read in 0.16
0.08/0.16 c No objective function, only one solution is needed.
0.08/0.16 c presolving settings loaded
0.19/0.28 c presolving:
1.00/1.09 c presolving (1 rounds):
1.00/1.09 c 1185 deleted vars, 4773 deleted constraints, 0 added constraints, 1185 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.00/1.09 c 2139622 implications, 0 cliques
1.00/1.09 c presolving detected infeasibility
1.00/1.09 c Presolving Time: 0.84
1.00/1.09 c - non default parameters ----------------------------------------------------------------------
1.00/1.09 c # SCIP version 2.1.1.4
1.00/1.09 c
1.00/1.09 c # maximal time in seconds to run
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.09 c limits/time = 1797
1.00/1.09 c
1.00/1.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.09 c limits/memory = 13950
1.00/1.09 c
1.00/1.09 c # solving stops, if the given number of solutions were found (-1: no limit)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.09 c limits/solutions = 1
1.00/1.09 c
1.00/1.09 c # maximal number of separation rounds per node (-1: unlimited)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 5]
1.00/1.09 c separating/maxrounds = 1
1.00/1.09 c
1.00/1.09 c # maximal number of separation rounds in the root node (-1: unlimited)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.09 c separating/maxroundsroot = 5
1.00/1.09 c
1.00/1.09 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.00/1.09 c # [type: int, range: [1,2], default: 1]
1.00/1.09 c timing/clocktype = 2
1.00/1.09 c
1.00/1.09 c # belongs reading time to solving time?
1.00/1.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.09 c timing/reading = TRUE
1.00/1.09 c
1.00/1.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.00/1.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.00/1.09 c constraints/knapsack/disaggregation = FALSE
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/coefdiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.09 c heuristics/coefdiving/maxlpiterquot = 0.075
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/coefdiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 30]
1.00/1.09 c heuristics/crossover/freq = -1
1.00/1.09 c
1.00/1.09 c # number of nodes added to the contingent of the total nodes
1.00/1.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.09 c heuristics/crossover/nodesofs = 750
1.00/1.09 c
1.00/1.09 c # number of nodes without incumbent change that heuristic should wait
1.00/1.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.00/1.09 c heuristics/crossover/nwaitingnodes = 100
1.00/1.09 c
1.00/1.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.00/1.09 c # [type: real, range: [0,1], default: 0.1]
1.00/1.09 c heuristics/crossover/nodesquot = 0.15
1.00/1.09 c
1.00/1.09 c # minimum percentage of integer variables that have to be fixed
1.00/1.09 c # [type: real, range: [0,1], default: 0.666]
1.00/1.09 c heuristics/crossover/minfixingrate = 0.5
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.09 c heuristics/feaspump/freq = -1
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/feaspump/maxlpiterofs = 2000
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/fracdiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.09 c heuristics/fracdiving/maxlpiterquot = 0.075
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/fracdiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/guideddiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.09 c heuristics/guideddiving/maxlpiterquot = 0.075
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/guideddiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.09 c heuristics/intdiving/maxlpiterquot = 0.075
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/intshifting/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/linesearchdiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.09 c heuristics/objpscostdiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to total iteration number
1.00/1.09 c # [type: real, range: [0,1], default: 0.01]
1.00/1.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.09 c heuristics/oneopt/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/pscostdiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/pscostdiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.09 c heuristics/rens/freq = -1
1.00/1.09 c
1.00/1.09 c # minimum percentage of integer variables that have to be fixable
1.00/1.09 c # [type: real, range: [0,1], default: 0.5]
1.00/1.09 c heuristics/rens/minfixingrate = 0.3
1.00/1.09 c
1.00/1.09 c # number of nodes added to the contingent of the total nodes
1.00/1.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.09 c heuristics/rens/nodesofs = 2000
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.09 c heuristics/rootsoldiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.00/1.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.09 c heuristics/rounding/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.09 c heuristics/shiftandpropagate/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/shifting/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.09 c heuristics/simplerounding/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.09 c heuristics/subnlp/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.09 c heuristics/trivial/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.09 c heuristics/trysol/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.09 c heuristics/undercover/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.09 c heuristics/veclendiving/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.09 c heuristics/veclendiving/maxlpiterquot = 0.075
1.00/1.09 c
1.00/1.09 c # additional number of allowed LP iterations
1.00/1.09 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.09 c heuristics/veclendiving/maxlpiterofs = 1500
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.09 c heuristics/zirounding/freq = -1
1.00/1.09 c
1.00/1.09 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.09 c propagating/probing/maxprerounds = 0
1.00/1.09 c
1.00/1.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.09 c separating/cmir/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.09 c separating/flowcover/freq = -1
1.00/1.09 c
1.00/1.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.09 c separating/rapidlearning/freq = 0
1.00/1.09 c
1.00/1.09 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
1.00/1.09 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.09 c heuristics/indoneopt/freq = -1
1.00/1.09 c
1.00/1.09 c -----------------------------------------------------------------------------------------------
1.00/1.09 c start solving
1.00/1.09 s UNSATISFIABLE
1.00/1.09 c SCIP Status : problem is solved [infeasible]
1.00/1.09 c Total Time : 1.09
1.00/1.09 c solving : 1.09
1.00/1.09 c presolving : 0.84 (included in solving)
1.00/1.09 c reading : 0.16 (included in solving)
1.00/1.09 c copying : 0.00 (0 times copied the problem)
1.00/1.09 c Original Problem :
1.00/1.09 c Problem name : HOME/instance-3691742-1338039381.opb
1.00/1.09 c Variables : 16198 (16198 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.09 c Constraints : 50975 initial, 50975 maximal
1.00/1.09 c Objective sense : minimize
1.00/1.09 c Presolved Problem :
1.00/1.09 c Problem name : t_HOME/instance-3691742-1338039381.opb
1.00/1.09 c Variables : 15013 (15013 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.09 c Constraints : 46202 initial, 46202 maximal
1.00/1.09 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
1.00/1.09 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
1.00/1.09 c linear : 0.80 0.03 1185 0 0 1185 0 4773 0 0 0
1.00/1.09 c root node : - - 0 - - 0 - - - - -
1.00/1.09 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
1.00/1.09 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.00/1.09 c linear : 46202 46202 0 0 0 0 0 0 0 0 0 0 0
1.00/1.09 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
1.00/1.09 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
1.00/1.09 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c linear : 0.03 0.03 0.00 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c Propagators : #Propagate #ResProp Cutoffs DomReds
1.00/1.09 c pseudoobj : 0 0 0 0
1.00/1.09 c redcost : 0 0 0 0
1.00/1.09 c rootredcost : 0 0 0 0
1.00/1.09 c vbounds : 0 0 0 0
1.00/1.09 c probing : 0 0 0 0
1.00/1.09 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
1.00/1.09 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c redcost : 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c rootredcost : 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c vbounds : 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c probing : 0.00 0.00 0.00 0.00 0.00
1.00/1.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.00/1.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.09 c applied globally : - - - 0 0.0 - - -
1.00/1.09 c applied locally : - - - 0 0.0 - - -
1.00/1.09 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
1.00/1.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.00/1.09 c clique : 0.00 0.00 0 0 0 0 0
1.00/1.09 c closecuts : 0.00 0.00 0 0 0 0 0
1.00/1.09 c cgmip : 0.00 0.00 0 0 0 0 0
1.00/1.09 c cmir : 0.00 0.00 0 0 0 0 0
1.00/1.09 c flowcover : 0.00 0.00 0 0 0 0 0
1.00/1.09 c gomory : 0.00 0.00 0 0 0 0 0
1.00/1.09 c impliedbounds : 0.00 0.00 0 0 0 0 0
1.00/1.09 c intobj : 0.00 0.00 0 0 0 0 0
1.00/1.09 c mcf : 0.00 0.00 0 0 0 0 0
1.00/1.09 c oddcycle : 0.00 0.00 0 0 0 0 0
1.00/1.09 c rapidlearning : 0.00 0.00 0 0 0 0 0
1.00/1.09 c strongcg : 0.00 0.00 0 0 0 0 0
1.00/1.09 c zerohalf : 0.00 0.00 0 0 0 0 0
1.00/1.09 c Pricers : ExecTime SetupTime Calls Vars
1.00/1.09 c problem variables: 0.00 - 0 0
1.00/1.09 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
1.00/1.09 c pscost : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c inference : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c mostinf : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c leastinf : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c fullstrong : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c random : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c relpscost : 0.00 0.00 0 0 0 0 0 0
1.00/1.09 c Primal Heuristics : ExecTime SetupTime Calls Found
1.00/1.09 c LP solutions : 0.00 - - 0
1.00/1.09 c pseudo solutions : 0.00 - - 0
1.00/1.09 c smallcard : 0.00 0.00 0 0
1.00/1.09 c trivial : 0.01 0.00 1 0
1.00/1.09 c shiftandpropagate: 0.00 0.00 0 0
1.00/1.09 c simplerounding : 0.00 0.00 0 0
1.00/1.09 c zirounding : 0.00 0.00 0 0
1.00/1.09 c rounding : 0.00 0.00 0 0
1.00/1.09 c shifting : 0.00 0.00 0 0
1.00/1.09 c intshifting : 0.00 0.00 0 0
1.00/1.09 c oneopt : 0.00 0.00 0 0
1.00/1.09 c twoopt : 0.00 0.00 0 0
1.00/1.09 c indtwoopt : 0.00 0.00 0 0
1.00/1.09 c indoneopt : 0.00 0.00 0 0
1.00/1.09 c fixandinfer : 0.00 0.00 0 0
1.00/1.09 c feaspump : 0.00 0.00 0 0
1.00/1.09 c clique : 0.00 0.00 0 0
1.00/1.09 c indrounding : 0.00 0.00 0 0
1.00/1.09 c indcoefdiving : 0.00 0.00 0 0
1.00/1.09 c coefdiving : 0.00 0.00 0 0
1.00/1.09 c pscostdiving : 0.00 0.00 0 0
1.00/1.09 c nlpdiving : 0.00 0.00 0 0
1.00/1.09 c fracdiving : 0.00 0.00 0 0
1.00/1.09 c veclendiving : 0.00 0.00 0 0
1.00/1.09 c intdiving : 0.00 0.00 0 0
1.00/1.09 c actconsdiving : 0.00 0.00 0 0
1.00/1.09 c objpscostdiving : 0.00 0.00 0 0
1.00/1.09 c rootsoldiving : 0.00 0.00 0 0
1.00/1.09 c linesearchdiving : 0.00 0.00 0 0
1.00/1.09 c guideddiving : 0.00 0.00 0 0
1.00/1.09 c octane : 0.00 0.00 0 0
1.00/1.09 c rens : 0.00 0.00 0 0
1.00/1.09 c rins : 0.00 0.00 0 0
1.00/1.09 c localbranching : 0.00 0.00 0 0
1.00/1.09 c mutation : 0.00 0.00 0 0
1.00/1.09 c crossover : 0.00 0.00 0 0
1.00/1.09 c dins : 0.00 0.00 0 0
1.00/1.09 c vbounds : 0.00 0.00 0 0
1.00/1.09 c undercover : 0.00 0.00 0 0
1.00/1.09 c subnlp : 0.00 0.00 0 0
1.00/1.09 c trysol : 0.00 0.00 0 0
1.00/1.09 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
1.00/1.09 c primal LP : 0.00 0 0 0.00 - 0.00 0
1.00/1.09 c dual LP : 0.00 0 0 0.00 - 0.00 0
1.00/1.09 c lex dual LP : 0.00 0 0 0.00 -
1.00/1.09 c barrier LP : 0.00 0 0 0.00 - 0.00 0
1.00/1.09 c diving/probing LP: 0.00 0 0 0.00 -
1.00/1.09 c strong branching : 0.00 0 0 0.00 -
1.00/1.09 c (at root node) : - 0 0 0.00 -
1.00/1.09 c conflict analysis: 0.00 0 0 0.00 -
1.00/1.09 c B&B Tree :
1.00/1.09 c number of runs : 1
1.00/1.09 c nodes : 0
1.00/1.09 c nodes (total) : 0
1.00/1.09 c nodes left : 1
1.00/1.09 c max depth : -1
1.00/1.09 c max depth (total): -1
1.00/1.09 c backtracks : 0 (0.0%)
1.00/1.09 c delayed cutoffs : 0
1.00/1.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.00/1.09 c avg switch length: 0.00
1.00/1.09 c switching time : 0.00
1.00/1.09 c Solution :
1.00/1.09 c Solutions found : 0 (0 improvements)
1.00/1.09 c Primal Bound : infeasible
1.00/1.09 c Dual Bound : -
1.00/1.09 c Gap : infinite
1.00/1.09 c Root Dual Bound : -
1.00/1.09 c Root Iterations : 0
1.10/1.19 c Time complete: 1.18.
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-3691742-1338039381/watcher-3691742-1338039381 -o /tmp/evaluation-result-3691742-1338039381/solver-3691742-1338039381 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3691742-1338039381.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.12 2.03 2.01 3/174 31247 /proc/meminfo: memFree=29231620/32873844 swapFree=7104/7104 [pid=31247] ppid=31245 vsize=12024 CPUtime=0 cores=0,2,4,6 /proc/31247/stat : 31247 (scip-2.1.1.4exp) R 31245 31247 28130 0 -1 4202496 1793 0 0 0 0 0 0 0 20 0 1 0 270066718 12312576 1747 33554432000 4194304 10219143 140734074519856 140737136187656 8891101 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/31247/statm: 3006 1757 398 1471 0 1526 0 [startup+0.0246611 s] /proc/loadavg: 2.12 2.03 2.01 3/174 31247 /proc/meminfo: memFree=29231620/32873844 swapFree=7104/7104 [pid=31247] ppid=31245 vsize=20928 CPUtime=0.01 cores=0,2,4,6 /proc/31247/stat : 31247 (scip-2.1.1.4exp) R 31245 31247 28130 0 -1 4202496 3972 0 0 0 1 0 0 0 20 0 1 0 270066718 21430272 3926 33554432000 4194304 10219143 140734074519856 140737136187656 7394845 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/31247/statm: 5232 3926 419 1471 0 3752 0 Current children cumulated CPU time (s) 0.01 Current children cumulated vsize (KiB) 20928 [startup+0.100272 s] /proc/loadavg: 2.12 2.03 2.01 3/174 31247 /proc/meminfo: memFree=29231620/32873844 swapFree=7104/7104 [pid=31247] ppid=31245 vsize=37108 CPUtime=0.08 cores=0,2,4,6 /proc/31247/stat : 31247 (scip-2.1.1.4exp) R 31245 31247 28130 0 -1 4202496 8033 0 0 0 8 0 0 0 20 0 1 0 270066718 37998592 7987 33554432000 4194304 10219143 140734074519856 140737136187656 5493085 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/31247/statm: 9277 7987 419 1471 0 7797 0 Current children cumulated CPU time (s) 0.08 Current children cumulated vsize (KiB) 37108 [startup+0.300229 s] /proc/loadavg: 2.12 2.03 2.01 3/174 31247 /proc/meminfo: memFree=29231620/32873844 swapFree=7104/7104 [pid=31247] ppid=31245 vsize=105960 CPUtime=0.29 cores=0,2,4,6 /proc/31247/stat : 31247 (scip-2.1.1.4exp) R 31245 31247 28130 0 -1 4202496 24861 0 0 0 26 3 0 0 20 0 1 0 270066718 108503040 24789 33554432000 4194304 10219143 140734074519856 140737136187656 7589947 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0 /proc/31247/statm: 26490 24794 559 1471 0 25010 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 105960 [startup+0.70024 s] /proc/loadavg: 2.12 2.03 2.01 3/174 31247 /proc/meminfo: memFree=29231620/32873844 swapFree=7104/7104 [pid=31247] ppid=31245 vsize=156216 CPUtime=0.69 cores=0,2,4,6 /proc/31247/stat : 31247 (scip-2.1.1.4exp) R 31245 31247 28130 0 -1 4202496 37420 0 0 0 62 7 0 0 20 0 1 0 270066718 159965184 37347 33554432000 4194304 10219143 140734074519856 140734074516856 9008087 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0 /proc/31247/statm: 39054 37347 559 1471 0 37574 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 156216 Solver just ended. Dumping a history of the last processes samples [startup+1.1063 s] /proc/loadavg: 2.12 2.03 2.01 3/175 31248 /proc/meminfo: memFree=29064360/32873844 swapFree=7104/7104 [pid=31247] ppid=31245 vsize=180332 CPUtime=1.1 cores=0,2,4,6 /proc/31247/stat : 31247 (scip-2.1.1.4exp) R 31245 31247 28130 0 -1 4202496 43768 0 0 0 99 11 0 0 20 0 1 0 270066718 184659968 43110 33554432000 4194304 10219143 140734074519856 140734074516856 5717615 0 0 4096 0 0 0 0 17 0 0 0 0 0 0 /proc/31247/statm: 45083 43110 602 1471 0 43603 0 Current children cumulated CPU time (s) 1.1 Current children cumulated vsize (KiB) 180332 Child status: 0 Real time (s): 1.19795 CPU time (s): 1.19682 CPU user time (s): 1.06784 CPU system time (s): 0.12898 CPU usage (%): 99.905 Max. virtual memory (cumulated for all children) (KiB): 180332 getrusage(RUSAGE_CHILDREN,...) data: user time used= 1.06784 system time used= 0.12898 maximum resident set size= 174120 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 43790 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.002999 second user time and 0.010998 second system time The end
Begin job on node104 at 2012-05-26 15:36:22 IDJOB=3691742 IDBENCH=75100 IDSOLVER=2271 FILE ID=node104/3691742-1338039381 RUNJOBID= node104-1338029632-29128 PBS_JOBID= 14624367 Free space on /tmp= 71372 MiB SOLVER NAME= SCIP spx E SCIP 2.1.1.4. Exp with SoPlex 1.6.0.3 fixed BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j90/normalized-j9014_1-unsat.opb COMMAND LINE= HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3691742-1338039381/watcher-3691742-1338039381 -o /tmp/evaluation-result-3691742-1338039381/solver-3691742-1338039381 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3691742-1338039381.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= 55b8067ae8df952812934475200b69c4 RANDOM SEED=1948015435 node104.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.266 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 : 5332.53 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.266 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.266 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.266 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.92 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.266 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.266 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.266 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.266 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: 32873844 kB MemFree: 29232156 kB Buffers: 248192 kB Cached: 2344572 kB SwapCached: 0 kB Active: 994088 kB Inactive: 1871276 kB Active(anon): 275304 kB Inactive(anon): 0 kB Active(file): 718784 kB Inactive(file): 1871276 kB Unevictable: 7104 kB Mlocked: 7104 kB SwapTotal: 67108856 kB SwapFree: 67108856 kB Dirty: 15260 kB Writeback: 4 kB AnonPages: 281696 kB Mapped: 16636 kB Shmem: 200 kB Slab: 636580 kB SReclaimable: 78712 kB SUnreclaim: 557868 kB KernelStack: 1432 kB PageTables: 4396 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545776 kB Committed_AS: 387144 kB VmallocTotal: 34359738367 kB VmallocUsed: 346368 kB VmallocChunk: 34341987984 kB HardwareCorrupted: 0 kB AnonHugePages: 219136 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= 71360 MiB End job on node104 at 2012-05-26 15:36:23