Trace number 2685180

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverUNSAT 3.03154 3.0312

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j90/
normalized-j9039_3-unsat.opb
MD5SUMfc45b70f2bffc38ba49073a3c4955a67
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, linear constraints)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.212967
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables15106
Total number of constraints51849
Number of constraints which are clauses51521
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints328
Minimum length of a constraint1
Maximum length of a constraint50
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 42
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 335
Number of bits of the biggest sum of numbers9
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00	c Copyright (c) 2002-2010 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-2685180-1278439917.opb>
0.89/0.90	c original problem has 15106 variables (15106 bin, 0 int, 0 impl, 0 cont) and 51849 constraints
0.89/0.90	c problem read
0.89/0.90	c No objective function, only one solution is needed.
0.89/0.90	c presolving settings loaded
1.10/1.17	c presolving:
2.79/2.82	c presolving (1 rounds):
2.79/2.82	c  2272 deleted vars, 7506 deleted constraints, 2272 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.79/2.82	c  1978862 implications, 0 cliques
2.79/2.84	c presolving detected infeasibility
2.79/2.84	c Presolving Time: 1.64
2.79/2.84	c - non default parameters ----------------------------------------------------------------------
2.79/2.84	c # SCIP version 1.2.1.2
2.79/2.84	c 
2.79/2.84	c # frequency for displaying node information lines
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 100]
2.79/2.84	c display/freq = 10000
2.79/2.84	c 
2.79/2.84	c # maximal time in seconds to run
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.79/2.84	c limits/time = 1799.11
2.79/2.84	c 
2.79/2.84	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.79/2.84	c limits/memory = 1620
2.79/2.84	c 
2.79/2.84	c # solving stops, if the given number of solutions were found (-1: no limit)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: -1]
2.79/2.84	c limits/solutions = 1
2.79/2.84	c 
2.79/2.84	c # maximal number of separation rounds per node (-1: unlimited)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 5]
2.79/2.84	c separating/maxrounds = 1
2.79/2.84	c 
2.79/2.84	c # maximal number of separation rounds in the root node (-1: unlimited)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: -1]
2.79/2.84	c separating/maxroundsroot = 5
2.79/2.84	c 
2.79/2.84	c # should presolving try to simplify inequalities
2.79/2.84	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.79/2.84	c constraints/linear/simplifyinequalities = TRUE
2.79/2.84	c 
2.79/2.84	c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.79/2.84	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.79/2.84	c constraints/knapsack/disaggregation = FALSE
2.79/2.84	c 
2.79/2.84	c # should presolving try to simplify knapsacks
2.79/2.84	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.79/2.84	c constraints/knapsack/simplifyinequalities = TRUE
2.79/2.84	c 
2.79/2.84	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: -1]
2.79/2.84	c presolving/probing/maxrounds = 0
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/coefdiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.79/2.84	c heuristics/coefdiving/maxlpiterquot = 0.075
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/coefdiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 30]
2.79/2.84	c heuristics/crossover/freq = -1
2.79/2.84	c 
2.79/2.84	c # number of nodes added to the contingent of the total nodes
2.79/2.84	c # [type: longint, range: [0,9223372036854775807], default: 500]
2.79/2.84	c heuristics/crossover/nodesofs = 750
2.79/2.84	c 
2.79/2.84	c # number of nodes without incumbent change that heuristic should wait
2.79/2.84	c # [type: longint, range: [0,9223372036854775807], default: 200]
2.79/2.84	c heuristics/crossover/nwaitingnodes = 100
2.79/2.84	c 
2.79/2.84	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.79/2.84	c # [type: real, range: [0,1], default: 0.1]
2.79/2.84	c heuristics/crossover/nodesquot = 0.15
2.79/2.84	c 
2.79/2.84	c # minimum percentage of integer variables that have to be fixed 
2.79/2.84	c # [type: real, range: [0,1], default: 0.666]
2.79/2.84	c heuristics/crossover/minfixingrate = 0.5
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 20]
2.79/2.84	c heuristics/feaspump/freq = -1
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/feaspump/maxlpiterofs = 2000
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/fracdiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.79/2.84	c heuristics/fracdiving/maxlpiterquot = 0.075
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/fracdiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/guideddiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.79/2.84	c heuristics/guideddiving/maxlpiterquot = 0.075
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/guideddiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.79/2.84	c heuristics/intdiving/maxlpiterquot = 0.075
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/intshifting/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/linesearchdiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.79/2.84	c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/linesearchdiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 1]
2.79/2.84	c heuristics/nlp/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 20]
2.79/2.84	c heuristics/objpscostdiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to total iteration number
2.79/2.84	c # [type: real, range: [0,1], default: 0.01]
2.79/2.84	c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/objpscostdiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 1]
2.79/2.84	c heuristics/oneopt/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/pscostdiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.79/2.84	c heuristics/pscostdiving/maxlpiterquot = 0.075
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/pscostdiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 0]
2.79/2.84	c heuristics/rens/freq = -1
2.79/2.84	c 
2.79/2.84	c # minimum percentage of integer variables that have to be fixable 
2.79/2.84	c # [type: real, range: [0,1], default: 0.5]
2.79/2.84	c heuristics/rens/minfixingrate = 0.3
2.79/2.84	c 
2.79/2.84	c # number of nodes added to the contingent of the total nodes
2.79/2.84	c # [type: longint, range: [0,9223372036854775807], default: 500]
2.79/2.84	c heuristics/rens/nodesofs = 2000
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 20]
2.79/2.84	c heuristics/rootsoldiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.79/2.84	c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/rootsoldiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 1]
2.79/2.84	c heuristics/rounding/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/shifting/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 1]
2.79/2.84	c heuristics/simplerounding/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 0]
2.79/2.84	c heuristics/trivial/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 1]
2.79/2.84	c heuristics/trysol/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 10]
2.79/2.84	c heuristics/veclendiving/freq = -1
2.79/2.84	c 
2.79/2.84	c # maximal fraction of diving LP iterations compared to node LP iterations
2.79/2.84	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.79/2.84	c heuristics/veclendiving/maxlpiterquot = 0.075
2.79/2.84	c 
2.79/2.84	c # additional number of allowed LP iterations
2.79/2.84	c # [type: int, range: [0,2147483647], default: 1000]
2.79/2.84	c heuristics/veclendiving/maxlpiterofs = 1500
2.79/2.84	c 
2.79/2.84	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 1]
2.79/2.84	c heuristics/zirounding/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 0]
2.79/2.84	c separating/cmir/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: 0]
2.79/2.84	c separating/flowcover/freq = -1
2.79/2.84	c 
2.79/2.84	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.79/2.84	c # [type: int, range: [-1,2147483647], default: -1]
2.79/2.84	c separating/rapidlearning/freq = 0
2.79/2.84	c 
2.79/2.84	c -----------------------------------------------------------------------------------------------
2.79/2.84	c start solving
2.79/2.84	c 
2.79/2.84	c SCIP Status        : problem is solved [infeasible]
2.79/2.84	c Solving Time (sec) : 1.80
2.79/2.84	c Solving Nodes      : 0
2.79/2.84	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
2.79/2.84	c Dual Bound         : -1.00000000000000e+20
2.79/2.84	c Gap                : infinite
2.79/2.84	s UNSATISFIABLE
2.79/2.84	c SCIP Status        : problem is solved [infeasible]
2.79/2.84	c Solving Time       :       1.80
2.79/2.84	c Original Problem   :
2.79/2.84	c   Problem name     : HOME/instance-2685180-1278439917.opb
2.79/2.84	c   Variables        : 15106 (15106 binary, 0 integer, 0 implicit integer, 0 continuous)
2.79/2.84	c   Constraints      : 51849 initial, 51849 maximal
2.79/2.84	c Presolved Problem  :
2.79/2.84	c   Problem name     : t_HOME/instance-2685180-1278439917.opb
2.79/2.84	c   Variables        : 12834 (12834 binary, 0 integer, 0 implicit integer, 0 continuous)
2.79/2.84	c   Constraints      : 44343 initial, 44343 maximal
2.79/2.84	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.79/2.84	c   trivial          :       0.01          0          0          0          0          0          0          0          0
2.79/2.84	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.79/2.84	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.79/2.84	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.79/2.84	c   implics          :       0.00          0          0          0          0          0          0          0          0
2.79/2.84	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.79/2.84	c   linear           :       1.51       2272          0          0       2272          0       7506          0          0
2.79/2.84	c   root node        :          -          0          -          -          0          -          -          -          -
2.79/2.84	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.79/2.84	c   integral         :          0          0          0          0          0          0          0          0          0          0
2.79/2.84	c   linear           :      44343          0          0          0          0          0          0          0          0          0
2.79/2.84	c   countsols        :          0          0          0          0          0          0          0          0          0          0
2.79/2.84	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.79/2.84	c   integral         :       0.00       0.00       0.00       0.00       0.00
2.79/2.84	c   linear           :       0.00       0.00       0.00       0.00       0.00
2.79/2.84	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.79/2.84	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.79/2.84	c   pseudoobj        :       0.00          0          0          0
2.79/2.84	c   rootredcost      :       0.00          0          0          0
2.79/2.84	c   vbounds          :       0.00          0          0          0
2.79/2.84	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.79/2.84	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
2.79/2.84	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.79/2.84	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.79/2.84	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.79/2.84	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.79/2.84	c   applied globally :          -          -          -          0        0.0          -          -          -
2.79/2.84	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.79/2.84	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.79/2.84	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
2.79/2.84	c   redcost          :       0.00          0          0          0          0          0
2.79/2.84	c   impliedbounds    :       0.00          0          0          0          0          0
2.79/2.84	c   intobj           :       0.00          0          0          0          0          0
2.79/2.84	c   cgmip            :       0.00          0          0          0          0          0
2.79/2.84	c   gomory           :       0.00          0          0          0          0          0
2.79/2.84	c   strongcg         :       0.00          0          0          0          0          0
2.79/2.84	c   cmir             :       0.00          0          0          0          0          0
2.79/2.84	c   flowcover        :       0.00          0          0          0          0          0
2.79/2.84	c   clique           :       0.00          0          0          0          0          0
2.79/2.84	c   zerohalf         :       0.00          0          0          0          0          0
2.79/2.84	c   mcf              :       0.00          0          0          0          0          0
2.79/2.84	c   rapidlearning    :       0.00          0          0          0          0          0
2.79/2.84	c Pricers            :       Time      Calls       Vars
2.79/2.84	c   problem variables:       0.00          0          0
2.79/2.84	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.79/2.84	c   pscost           :       0.00          0          0          0          0          0          0
2.79/2.84	c   inference        :       0.00          0          0          0          0          0          0
2.79/2.84	c   mostinf          :       0.00          0          0          0          0          0          0
2.79/2.84	c   leastinf         :       0.00          0          0          0          0          0          0
2.79/2.84	c   fullstrong       :       0.00          0          0          0          0          0          0
2.79/2.84	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.79/2.84	c   random           :       0.00          0          0          0          0          0          0
2.79/2.84	c   relpscost        :       0.00          0          0          0          0          0          0
2.79/2.84	c Primal Heuristics  :       Time      Calls      Found
2.79/2.84	c   LP solutions     :       0.00          -          0
2.79/2.84	c   pseudo solutions :       0.00          -          0
2.79/2.84	c   trivial          :       0.03          1          0
2.79/2.84	c   simplerounding   :       0.00          0          0
2.79/2.84	c   zirounding       :       0.00          0          0
2.79/2.84	c   rounding         :       0.00          0          0
2.79/2.84	c   shifting         :       0.00          0          0
2.79/2.84	c   intshifting      :       0.00          0          0
2.79/2.84	c   oneopt           :       0.00          0          0
2.79/2.84	c   twoopt           :       0.00          0          0
2.79/2.84	c   fixandinfer      :       0.00          0          0
2.79/2.84	c   feaspump         :       0.00          0          0
2.79/2.84	c   coefdiving       :       0.00          0          0
2.79/2.84	c   pscostdiving     :       0.00          0          0
2.79/2.84	c   fracdiving       :       0.00          0          0
2.79/2.84	c   veclendiving     :       0.00          0          0
2.79/2.84	c   intdiving        :       0.00          0          0
2.79/2.84	c   actconsdiving    :       0.00          0          0
2.79/2.84	c   objpscostdiving  :       0.00          0          0
2.79/2.84	c   rootsoldiving    :       0.00          0          0
2.79/2.84	c   linesearchdiving :       0.00          0          0
2.79/2.84	c   guideddiving     :       0.00          0          0
2.79/2.84	c   octane           :       0.00          0          0
2.79/2.84	c   rens             :       0.00          0          0
2.79/2.84	c   rins             :       0.00          0          0
2.79/2.84	c   localbranching   :       0.00          0          0
2.79/2.84	c   mutation         :       0.00          0          0
2.79/2.84	c   crossover        :       0.00          0          0
2.79/2.84	c   dins             :       0.00          0          0
2.79/2.84	c   undercover       :       0.00          0          0
2.79/2.84	c   nlp              :       0.00          0          0
2.79/2.84	c   trysol           :       0.00          0          0
2.79/2.84	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.79/2.84	c   primal LP        :       0.00          0          0       0.00          -
2.79/2.84	c   dual LP          :       0.00          0          0       0.00          -
2.79/2.84	c   lex dual LP      :       0.00          0          0       0.00          -
2.79/2.84	c   barrier LP       :       0.00          0          0       0.00          -
2.79/2.84	c   diving/probing LP:       0.00          0          0       0.00          -
2.79/2.84	c   strong branching :       0.00          0          0       0.00          -
2.79/2.84	c     (at root node) :          -          0          0       0.00          -
2.79/2.84	c   conflict analysis:       0.00          0          0       0.00          -
2.79/2.84	c B&B Tree           :
2.79/2.84	c   number of runs   :          1
2.79/2.84	c   nodes            :          0
2.79/2.84	c   nodes (total)    :          0
2.79/2.84	c   nodes left       :          1
2.79/2.84	c   max depth        :         -1
2.79/2.84	c   max depth (total):         -1
2.79/2.84	c   backtracks       :          0 (0.0%)
2.79/2.84	c   delayed cutoffs  :          0
2.79/2.84	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
2.79/2.84	c   avg switch length:       0.00
2.79/2.84	c   switching time   :       0.00
2.79/2.84	c Solution           :
2.79/2.84	c   Solutions found  :          0 (0 improvements)
2.79/2.84	c   Primal Bound     : infeasible
2.79/2.84	c   Dual Bound       :          -
2.79/2.84	c   Gap              :   infinite
2.79/2.84	c   Root Dual Bound  :          -
2.79/2.84	c   Root Iterations  :          0
2.99/3.03	c Time complete: 3.02.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2685180-1278439917/watcher-2685180-1278439917 -o /tmp/evaluation-result-2685180-1278439917/solver-2685180-1278439917 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2685180-1278439917.opb -t 1800 -m 1800 

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): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 0.92 0.98 0.93 3/106 21137
/proc/meminfo: memFree=1845840/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=7724 CPUtime=0
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 1014 0 0 0 0 0 0 0 18 0 1 0 12203867 7909376 934 1992294400 4194304 8223781 140734310949936 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21137/statm: 1931 942 348 984 0 944 0

[startup+0.0756519 s]
/proc/loadavg: 0.92 0.98 0.93 3/106 21137
/proc/meminfo: memFree=1845840/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=14400 CPUtime=0.07
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 2908 0 0 0 6 1 0 0 20 0 1 0 12203867 14745600 2827 1992294400 4194304 8223781 140734310949936 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21137/statm: 3600 2827 363 984 0 2613 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 14400

[startup+0.100654 s]
/proc/loadavg: 0.92 0.98 0.93 3/106 21137
/proc/meminfo: memFree=1845840/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=16052 CPUtime=0.09
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 3309 0 0 0 8 1 0 0 20 0 1 0 12203867 16437248 3228 1992294400 4194304 8223781 140734310949936 18446744073709551615 4240589 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21137/statm: 4013 3228 363 984 0 3026 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 16052

[startup+0.300675 s]
/proc/loadavg: 0.92 0.98 0.93 3/106 21137
/proc/meminfo: memFree=1845840/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=23548 CPUtime=0.29
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 5182 0 0 0 27 2 0 0 20 0 1 0 12203867 24113152 5101 1992294400 4194304 8223781 140734310949936 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21137/statm: 5887 5101 363 984 0 4900 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 23548

[startup+0.700718 s]
/proc/loadavg: 0.92 0.98 0.93 3/106 21137
/proc/meminfo: memFree=1845840/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=32700 CPUtime=0.69
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 7485 0 0 0 67 2 0 0 20 0 1 0 12203867 33484800 7404 1992294400 4194304 8223781 140734310949936 18446744073709551615 5655094 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21137/statm: 8175 7404 363 984 0 7188 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 32700

[startup+1.5008 s]
/proc/loadavg: 0.93 0.98 0.93 2/107 21138
/proc/meminfo: memFree=1781972/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=107156 CPUtime=1.49
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 26021 0 0 0 139 10 0 0 23 0 1 0 12203867 109727744 25566 1992294400 4194304 8223781 140734310949936 18446744073709551615 5966578 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/21137/statm: 26789 25566 440 984 0 25802 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 107156

Solver just ended. Dumping a history of the last processes samples

[startup+2.30089 s]
/proc/loadavg: 0.93 0.98 0.93 2/107 21138
/proc/meminfo: memFree=1713152/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=141524 CPUtime=2.29
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 34526 0 0 0 214 15 0 0 25 0 1 0 12203867 144920576 34071 1992294400 4194304 8223781 140734310949936 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/21137/statm: 35381 34071 440 984 0 34394 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 141524

[startup+2.70093 s]
/proc/loadavg: 0.93 0.98 0.93 2/107 21138
/proc/meminfo: memFree=1713152/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=150448 CPUtime=2.69
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 36648 0 0 0 252 17 0 0 25 0 1 0 12203867 154058752 36193 1992294400 4194304 8223781 140734310949936 18446744073709551615 5966370 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/21137/statm: 37612 36193 440 984 0 36625 0
Current children cumulated CPU time (s) 2.69
Current children cumulated vsize (KiB) 150448

[startup+2.90095 s]
/proc/loadavg: 0.93 0.98 0.93 2/107 21138
/proc/meminfo: memFree=1713152/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=147232 CPUtime=2.89
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 37192 0 0 0 271 18 0 0 25 0 1 0 12203867 150765568 35417 1992294400 4194304 8223781 140734310949936 18446744073709551615 6206490 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21137/statm: 36808 35417 464 984 0 35821 0
Current children cumulated CPU time (s) 2.89
Current children cumulated vsize (KiB) 147232

[startup+3.00096 s]
/proc/loadavg: 0.93 0.98 0.93 2/107 21138
/proc/meminfo: memFree=1713152/2059040 swapFree=4192956/4192956
[pid=21137] ppid=21135 vsize=51272 CPUtime=2.99
/proc/21137/stat : 21137 (pbscip.linux.x8) R 21135 21137 20280 0 -1 4202496 37193 0 0 0 280 19 0 0 25 0 1 0 12203867 52502528 12006 1992294400 4194304 8223781 140734310949936 18446744073709551615 6206490 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21137/statm: 12818 12006 465 984 0 11831 0
Current children cumulated CPU time (s) 2.99
Current children cumulated vsize (KiB) 51272

Child status: 0
Real time (s): 3.0312
CPU time (s): 3.03154
CPU user time (s): 2.83457
CPU system time (s): 0.19697
CPU usage (%): 100.011
Max. virtual memory (cumulated for all children) (KiB): 150448

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.83457
system time used= 0.19697
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 37204
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= 7

runsolver used 0.006998 second user time and 0.022996 second system time

The end

Launcher Data 

Begin job on node019 at 2010-07-06 20:11:57
IDJOB=2685180
IDBENCH=74870
IDSOLVER=1169
FILE ID=node019/2685180-1278439917
PBS_JOBID= 11233453
Free space on /tmp= 62344 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j90/normalized-j9039_3-unsat.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2685180-1278439917/watcher-2685180-1278439917 -o /tmp/evaluation-result-2685180-1278439917/solver-2685180-1278439917 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2685180-1278439917.opb -t 1800 -m 1800

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= fc45b70f2bffc38ba49073a3c4955a67
RANDOM SEED=360057434

node019.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.244
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.48
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.244
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.44
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1846244 kB
Buffers:         15108 kB
Cached:          67256 kB
SwapCached:          0 kB
Active:          61468 kB
Inactive:        81180 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1846244 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6168 kB
Writeback:           0 kB
AnonPages:       60148 kB
Mapped:          14500 kB
Slab:            48156 kB
PageTables:       4216 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   182408 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62340 MiB
End job on node019 at 2010-07-06 20:12:00