Trace number 2684774

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 4.72628 4.72718

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j120/
normalized-j12023_3-unsat.opb
MD5SUMcab64fb449176610fb00692a41666b1e
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.339947
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables23958
Total number of constraints79333
Number of constraints which are clauses78941
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints392
Minimum length of a constraint1
Maximum length of a constraint38
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 22
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 225
Number of bits of the biggest sum of numbers8
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-2684774-1278433526.opb>
1.19/1.27	c original problem has 23958 variables (23958 bin, 0 int, 0 impl, 0 cont) and 79333 constraints
1.19/1.27	c problem read
1.19/1.27	c No objective function, only one solution is needed.
1.19/1.28	c presolving settings loaded
1.59/1.67	c presolving:
4.40/4.42	c presolving (1 rounds):
4.40/4.42	c  2325 deleted vars, 9233 deleted constraints, 2325 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
4.40/4.42	c  3536602 implications, 0 cliques
4.40/4.45	c presolving detected infeasibility
4.40/4.45	c Presolving Time: 2.73
4.40/4.45	c - non default parameters ----------------------------------------------------------------------
4.40/4.45	c # SCIP version 1.2.1.2
4.40/4.45	c 
4.40/4.45	c # frequency for displaying node information lines
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 100]
4.40/4.45	c display/freq = 10000
4.40/4.45	c 
4.40/4.45	c # maximal time in seconds to run
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.40/4.45	c limits/time = 1798.73
4.40/4.45	c 
4.40/4.45	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.40/4.45	c limits/memory = 1620
4.40/4.45	c 
4.40/4.45	c # solving stops, if the given number of solutions were found (-1: no limit)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: -1]
4.40/4.45	c limits/solutions = 1
4.40/4.45	c 
4.40/4.45	c # maximal number of separation rounds per node (-1: unlimited)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 5]
4.40/4.45	c separating/maxrounds = 1
4.40/4.45	c 
4.40/4.45	c # maximal number of separation rounds in the root node (-1: unlimited)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: -1]
4.40/4.45	c separating/maxroundsroot = 5
4.40/4.45	c 
4.40/4.45	c # should presolving try to simplify inequalities
4.40/4.45	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.40/4.45	c constraints/linear/simplifyinequalities = TRUE
4.40/4.45	c 
4.40/4.45	c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.40/4.45	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.40/4.45	c constraints/knapsack/disaggregation = FALSE
4.40/4.45	c 
4.40/4.45	c # should presolving try to simplify knapsacks
4.40/4.45	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.40/4.45	c constraints/knapsack/simplifyinequalities = TRUE
4.40/4.45	c 
4.40/4.45	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: -1]
4.40/4.45	c presolving/probing/maxrounds = 0
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/coefdiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.40/4.45	c heuristics/coefdiving/maxlpiterquot = 0.075
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/coefdiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 30]
4.40/4.45	c heuristics/crossover/freq = -1
4.40/4.45	c 
4.40/4.45	c # number of nodes added to the contingent of the total nodes
4.40/4.45	c # [type: longint, range: [0,9223372036854775807], default: 500]
4.40/4.45	c heuristics/crossover/nodesofs = 750
4.40/4.45	c 
4.40/4.45	c # number of nodes without incumbent change that heuristic should wait
4.40/4.45	c # [type: longint, range: [0,9223372036854775807], default: 200]
4.40/4.45	c heuristics/crossover/nwaitingnodes = 100
4.40/4.45	c 
4.40/4.45	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.40/4.45	c # [type: real, range: [0,1], default: 0.1]
4.40/4.45	c heuristics/crossover/nodesquot = 0.15
4.40/4.45	c 
4.40/4.45	c # minimum percentage of integer variables that have to be fixed 
4.40/4.45	c # [type: real, range: [0,1], default: 0.666]
4.40/4.45	c heuristics/crossover/minfixingrate = 0.5
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 20]
4.40/4.45	c heuristics/feaspump/freq = -1
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/feaspump/maxlpiterofs = 2000
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/fracdiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.40/4.45	c heuristics/fracdiving/maxlpiterquot = 0.075
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/fracdiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/guideddiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.40/4.45	c heuristics/guideddiving/maxlpiterquot = 0.075
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/guideddiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.40/4.45	c heuristics/intdiving/maxlpiterquot = 0.075
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/intshifting/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/linesearchdiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.40/4.45	c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/linesearchdiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 1]
4.40/4.45	c heuristics/nlp/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 20]
4.40/4.45	c heuristics/objpscostdiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to total iteration number
4.40/4.45	c # [type: real, range: [0,1], default: 0.01]
4.40/4.45	c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/objpscostdiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 1]
4.40/4.45	c heuristics/oneopt/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/pscostdiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.40/4.45	c heuristics/pscostdiving/maxlpiterquot = 0.075
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/pscostdiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 0]
4.40/4.45	c heuristics/rens/freq = -1
4.40/4.45	c 
4.40/4.45	c # minimum percentage of integer variables that have to be fixable 
4.40/4.45	c # [type: real, range: [0,1], default: 0.5]
4.40/4.45	c heuristics/rens/minfixingrate = 0.3
4.40/4.45	c 
4.40/4.45	c # number of nodes added to the contingent of the total nodes
4.40/4.45	c # [type: longint, range: [0,9223372036854775807], default: 500]
4.40/4.45	c heuristics/rens/nodesofs = 2000
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 20]
4.40/4.45	c heuristics/rootsoldiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.40/4.45	c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/rootsoldiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 1]
4.40/4.45	c heuristics/rounding/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/shifting/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 1]
4.40/4.45	c heuristics/simplerounding/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 0]
4.40/4.45	c heuristics/trivial/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 1]
4.40/4.45	c heuristics/trysol/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 10]
4.40/4.45	c heuristics/veclendiving/freq = -1
4.40/4.45	c 
4.40/4.45	c # maximal fraction of diving LP iterations compared to node LP iterations
4.40/4.45	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.40/4.45	c heuristics/veclendiving/maxlpiterquot = 0.075
4.40/4.45	c 
4.40/4.45	c # additional number of allowed LP iterations
4.40/4.45	c # [type: int, range: [0,2147483647], default: 1000]
4.40/4.45	c heuristics/veclendiving/maxlpiterofs = 1500
4.40/4.45	c 
4.40/4.45	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 1]
4.40/4.45	c heuristics/zirounding/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 0]
4.40/4.45	c separating/cmir/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: 0]
4.40/4.45	c separating/flowcover/freq = -1
4.40/4.45	c 
4.40/4.45	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.40/4.45	c # [type: int, range: [-1,2147483647], default: -1]
4.40/4.45	c separating/rapidlearning/freq = 0
4.40/4.45	c 
4.40/4.45	c -----------------------------------------------------------------------------------------------
4.40/4.45	c start solving
4.40/4.45	c 
4.40/4.45	c SCIP Status        : problem is solved [infeasible]
4.40/4.45	c Solving Time (sec) : 2.95
4.40/4.45	c Solving Nodes      : 0
4.40/4.45	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
4.40/4.45	c Dual Bound         : -1.00000000000000e+20
4.40/4.45	c Gap                : infinite
4.40/4.45	s UNSATISFIABLE
4.40/4.45	c SCIP Status        : problem is solved [infeasible]
4.40/4.45	c Solving Time       :       2.95
4.40/4.45	c Original Problem   :
4.40/4.45	c   Problem name     : HOME/instance-2684774-1278433526.opb
4.40/4.45	c   Variables        : 23958 (23958 binary, 0 integer, 0 implicit integer, 0 continuous)
4.40/4.45	c   Constraints      : 79333 initial, 79333 maximal
4.40/4.45	c Presolved Problem  :
4.40/4.45	c   Problem name     : t_HOME/instance-2684774-1278433526.opb
4.40/4.45	c   Variables        : 21633 (21633 binary, 0 integer, 0 implicit integer, 0 continuous)
4.40/4.45	c   Constraints      : 70100 initial, 70100 maximal
4.40/4.45	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
4.40/4.45	c   trivial          :       0.00          0          0          0          0          0          0          0          0
4.40/4.45	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
4.40/4.45	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
4.40/4.45	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
4.40/4.45	c   implics          :       0.00          0          0          0          0          0          0          0          0
4.40/4.45	c   probing          :       0.00          0          0          0          0          0          0          0          0
4.40/4.45	c   linear           :       2.56       2325          0          0       2325          0       9233          0          0
4.40/4.45	c   root node        :          -          0          -          -          0          -          -          -          -
4.40/4.45	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
4.40/4.45	c   integral         :          0          0          0          0          0          0          0          0          0          0
4.40/4.45	c   linear           :      70100          0          0          0          0          0          0          0          0          0
4.40/4.45	c   countsols        :          0          0          0          0          0          0          0          0          0          0
4.40/4.45	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
4.40/4.45	c   integral         :       0.00       0.00       0.00       0.00       0.00
4.40/4.45	c   linear           :       0.00       0.00       0.00       0.00       0.00
4.40/4.45	c   countsols        :       0.00       0.00       0.00       0.00       0.00
4.40/4.45	c Propagators        :       Time      Calls    Cutoffs    DomReds
4.40/4.45	c   pseudoobj        :       0.00          0          0          0
4.40/4.45	c   rootredcost      :       0.00          0          0          0
4.40/4.45	c   vbounds          :       0.00          0          0          0
4.40/4.45	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
4.40/4.45	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
4.40/4.45	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
4.40/4.45	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
4.40/4.45	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
4.40/4.45	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
4.40/4.45	c   applied globally :          -          -          -          0        0.0          -          -          -
4.40/4.45	c   applied locally  :          -          -          -          0        0.0          -          -          -
4.40/4.45	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
4.40/4.45	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
4.40/4.45	c   redcost          :       0.00          0          0          0          0          0
4.40/4.45	c   impliedbounds    :       0.00          0          0          0          0          0
4.40/4.45	c   intobj           :       0.00          0          0          0          0          0
4.40/4.45	c   cgmip            :       0.00          0          0          0          0          0
4.40/4.45	c   gomory           :       0.00          0          0          0          0          0
4.40/4.45	c   strongcg         :       0.00          0          0          0          0          0
4.40/4.45	c   cmir             :       0.00          0          0          0          0          0
4.40/4.45	c   flowcover        :       0.00          0          0          0          0          0
4.40/4.45	c   clique           :       0.00          0          0          0          0          0
4.40/4.45	c   zerohalf         :       0.00          0          0          0          0          0
4.40/4.45	c   mcf              :       0.00          0          0          0          0          0
4.40/4.45	c   rapidlearning    :       0.00          0          0          0          0          0
4.40/4.45	c Pricers            :       Time      Calls       Vars
4.40/4.45	c   problem variables:       0.00          0          0
4.40/4.45	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
4.40/4.45	c   pscost           :       0.00          0          0          0          0          0          0
4.40/4.45	c   inference        :       0.00          0          0          0          0          0          0
4.40/4.45	c   mostinf          :       0.00          0          0          0          0          0          0
4.40/4.45	c   leastinf         :       0.00          0          0          0          0          0          0
4.40/4.45	c   fullstrong       :       0.00          0          0          0          0          0          0
4.40/4.45	c   allfullstrong    :       0.00          0          0          0          0          0          0
4.40/4.45	c   random           :       0.00          0          0          0          0          0          0
4.40/4.45	c   relpscost        :       0.00          0          0          0          0          0          0
4.40/4.45	c Primal Heuristics  :       Time      Calls      Found
4.40/4.45	c   LP solutions     :       0.00          -          0
4.40/4.45	c   pseudo solutions :       0.00          -          0
4.40/4.45	c   trivial          :       0.04          1          0
4.40/4.45	c   simplerounding   :       0.00          0          0
4.40/4.45	c   zirounding       :       0.00          0          0
4.40/4.45	c   rounding         :       0.00          0          0
4.40/4.45	c   shifting         :       0.00          0          0
4.40/4.45	c   intshifting      :       0.00          0          0
4.40/4.45	c   oneopt           :       0.00          0          0
4.40/4.45	c   twoopt           :       0.00          0          0
4.40/4.45	c   fixandinfer      :       0.00          0          0
4.40/4.45	c   feaspump         :       0.00          0          0
4.40/4.45	c   coefdiving       :       0.00          0          0
4.40/4.45	c   pscostdiving     :       0.00          0          0
4.40/4.45	c   fracdiving       :       0.00          0          0
4.40/4.45	c   veclendiving     :       0.00          0          0
4.40/4.45	c   intdiving        :       0.00          0          0
4.40/4.45	c   actconsdiving    :       0.00          0          0
4.40/4.45	c   objpscostdiving  :       0.00          0          0
4.40/4.45	c   rootsoldiving    :       0.00          0          0
4.40/4.45	c   linesearchdiving :       0.00          0          0
4.40/4.45	c   guideddiving     :       0.00          0          0
4.40/4.45	c   octane           :       0.00          0          0
4.40/4.45	c   rens             :       0.00          0          0
4.40/4.45	c   rins             :       0.00          0          0
4.40/4.45	c   localbranching   :       0.00          0          0
4.40/4.45	c   mutation         :       0.00          0          0
4.40/4.45	c   crossover        :       0.00          0          0
4.40/4.45	c   dins             :       0.00          0          0
4.40/4.45	c   undercover       :       0.00          0          0
4.40/4.45	c   nlp              :       0.00          0          0
4.40/4.45	c   trysol           :       0.00          0          0
4.40/4.45	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
4.40/4.45	c   primal LP        :       0.00          0          0       0.00          -
4.40/4.45	c   dual LP          :       0.00          0          0       0.00          -
4.40/4.45	c   lex dual LP      :       0.00          0          0       0.00          -
4.40/4.45	c   barrier LP       :       0.00          0          0       0.00          -
4.40/4.45	c   diving/probing LP:       0.00          0          0       0.00          -
4.40/4.45	c   strong branching :       0.00          0          0       0.00          -
4.40/4.45	c     (at root node) :          -          0          0       0.00          -
4.40/4.45	c   conflict analysis:       0.00          0          0       0.00          -
4.40/4.45	c B&B Tree           :
4.40/4.45	c   number of runs   :          1
4.40/4.45	c   nodes            :          0
4.40/4.45	c   nodes (total)    :          0
4.40/4.45	c   nodes left       :          1
4.40/4.45	c   max depth        :         -1
4.40/4.45	c   max depth (total):         -1
4.40/4.45	c   backtracks       :          0 (0.0%)
4.40/4.45	c   delayed cutoffs  :          0
4.40/4.45	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
4.40/4.45	c   avg switch length:       0.00
4.40/4.45	c   switching time   :       0.00
4.40/4.45	c Solution           :
4.40/4.45	c   Solutions found  :          0 (0 improvements)
4.40/4.45	c   Primal Bound     : infeasible
4.40/4.45	c   Dual Bound       :          -
4.40/4.45	c   Gap              :   infinite
4.40/4.45	c   Root Dual Bound  :          -
4.40/4.45	c   Root Iterations  :          0
4.69/4.72	c Time complete: 4.71.

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-2684774-1278433526/watcher-2684774-1278433526 -o /tmp/evaluation-result-2684774-1278433526/solver-2684774-1278433526 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2684774-1278433526.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: 1.40 1.88 1.96 2/105 21993
/proc/meminfo: memFree=1482324/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=7724 CPUtime=0
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 1073 0 0 0 0 0 0 0 25 0 1 0 11560569 7909376 992 1992294400 4194304 8223781 140736017419648 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21993/statm: 1931 1002 348 984 0 944 0

[startup+0.0125361 s]
/proc/loadavg: 1.40 1.88 1.96 2/105 21993
/proc/meminfo: memFree=1482324/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=9128 CPUtime=0
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 1589 0 0 0 0 0 0 0 25 0 1 0 11560569 9347072 1508 1992294400 4194304 8223781 140736017419648 18446744073709551615 6205568 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21993/statm: 2282 1508 363 984 0 1295 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 9128

[startup+0.100545 s]
/proc/loadavg: 1.40 1.88 1.96 2/105 21993
/proc/meminfo: memFree=1482324/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=17008 CPUtime=0.09
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 3549 0 0 0 8 1 0 0 25 0 1 0 11560569 17416192 3468 1992294400 4194304 8223781 140736017419648 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21993/statm: 4252 3468 363 984 0 3265 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17008

[startup+0.30057 s]
/proc/loadavg: 1.40 1.88 1.96 2/105 21993
/proc/meminfo: memFree=1482324/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=25744 CPUtime=0.29
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 5746 0 0 0 27 2 0 0 25 0 1 0 11560569 26361856 5665 1992294400 4194304 8223781 140736017419648 18446744073709551615 5648817 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21993/statm: 6436 5665 363 984 0 5449 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 25744

[startup+0.700619 s]
/proc/loadavg: 1.40 1.88 1.96 2/105 21993
/proc/meminfo: memFree=1482324/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=35644 CPUtime=0.69
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 8229 0 0 0 66 3 0 0 25 0 1 0 11560569 36499456 8148 1992294400 4194304 8223781 140736017419648 18446744073709551615 7162682 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21993/statm: 8911 8148 363 984 0 7924 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 35644

[startup+1.50072 s]
/proc/loadavg: 1.40 1.88 1.96 2/106 21994
/proc/meminfo: memFree=1440776/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=116432 CPUtime=1.49
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 28413 0 0 0 139 10 0 0 25 0 1 0 11560569 119226368 27957 1992294400 4194304 8223781 140736017419648 18446744073709551615 6205568 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/21993/statm: 29108 27971 389 984 0 28121 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 116432

[startup+3.10091 s]
/proc/loadavg: 1.40 1.88 1.96 2/106 21994
/proc/meminfo: memFree=1331656/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=209068 CPUtime=3.09
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 51063 0 0 0 287 22 0 0 25 0 1 0 11560569 214085632 50607 1992294400 4194304 8223781 140736017419648 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/21993/statm: 52267 50607 440 984 0 51280 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 209068

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

[startup+3.90101 s]
/proc/loadavg: 1.40 1.88 1.96 2/106 21994
/proc/meminfo: memFree=1277220/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=232316 CPUtime=3.89
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 56804 0 0 0 363 26 0 0 25 0 1 0 11560569 237891584 56348 1992294400 4194304 8223781 140736017419648 18446744073709551615 6207442 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/21993/statm: 58079 56351 440 984 0 57092 0
Current children cumulated CPU time (s) 3.89
Current children cumulated vsize (KiB) 232316

[startup+4.30106 s]
/proc/loadavg: 1.40 1.88 1.96 2/106 21994
/proc/meminfo: memFree=1251180/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=239944 CPUtime=4.3
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 58418 0 0 0 403 27 0 0 25 0 1 0 11560569 245702656 57962 1992294400 4194304 8223781 140736017419648 18446744073709551615 5966506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/21993/statm: 59986 57962 440 984 0 58999 0
Current children cumulated CPU time (s) 4.3
Current children cumulated vsize (KiB) 239944

[startup+4.70111 s]
/proc/loadavg: 1.40 1.88 1.96 2/106 21994
/proc/meminfo: memFree=1251180/2059040 swapFree=4192956/4192956
[pid=21993] ppid=21991 vsize=57500 CPUtime=4.69
/proc/21993/stat : 21993 (pbscip.linux.x8) R 21991 21993 21941 0 -1 4202496 59211 0 0 0 439 30 0 0 18 0 1 0 11560569 58880000 13418 1992294400 4194304 8223781 140736017419648 18446744073709551615 6206490 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/21993/statm: 14375 13418 465 984 0 13388 0
Current children cumulated CPU time (s) 4.69
Current children cumulated vsize (KiB) 57500

Child status: 0
Real time (s): 4.72718
CPU time (s): 4.72628
CPU user time (s): 4.41733
CPU system time (s): 0.308953
CPU usage (%): 99.981
Max. virtual memory (cumulated for all children) (KiB): 239944

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 4.41733
system time used= 0.308953
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 59222
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= 2
involuntary context switches= 20

runsolver used 0.013997 second user time and 0.030995 second system time

The end

Launcher Data 

Begin job on node080 at 2010-07-06 18:25:27
IDJOB=2684774
IDBENCH=73560
IDSOLVER=1169
FILE ID=node080/2684774-1278433526
PBS_JOBID= 11233470
Free space on /tmp= 62536 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/j120/normalized-j12023_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-2684774-1278433526/watcher-2684774-1278433526 -o /tmp/evaluation-result-2684774-1278433526/solver-2684774-1278433526 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2684774-1278433526.opb -t 1800 -m 1800

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

MD5SUM BENCH= cab64fb449176610fb00692a41666b1e
RANDOM SEED=1738084422

node080.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.255
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.51
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.255
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	: 5999.50
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1482852 kB
Buffers:        100020 kB
Cached:         344512 kB
SwapCached:          0 kB
Active:         177244 kB
Inactive:       326912 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1482852 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6728 kB
Writeback:           0 kB
AnonPages:       59516 kB
Mapped:          14420 kB
Slab:            50188 kB
PageTables:       4096 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181720 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= 62532 MiB
End job on node080 at 2010-07-06 18:25:32