Trace number 2704759

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.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverUNSAT 2.24666 2.24776

General information on the benchmark

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

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-2704759-1278580479/watcher-2704759-1278580479 -o /tmp/evaluation-result-2704759-1278580479/solver-2704759-1278580479 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704759-1278580479.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.00 0.99 0.91 3/105 29466
/proc/meminfo: memFree=1778664/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=7904 CPUtime=0
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 1108 0 0 0 0 0 0 0 25 0 1 0 26256333 8093696 1019 1992294400 4194304 8395647 140734024496384 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29466/statm: 1976 1027 365 1026 0 946 0

[startup+0.053455 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29466
/proc/meminfo: memFree=1778664/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=14616 CPUtime=0.04
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 2928 0 0 0 4 0 0 0 25 0 1 0 26256333 14966784 2839 1992294400 4194304 8395647 140734024496384 18446744073709551615 7382061 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29466/statm: 3654 2839 390 1026 0 2624 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 14616

[startup+0.10046 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29466
/proc/meminfo: memFree=1778664/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=18420 CPUtime=0.09
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 3892 0 0 0 8 1 0 0 25 0 1 0 26256333 18862080 3803 1992294400 4194304 8395647 140734024496384 18446744073709551615 7385711 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29466/statm: 4605 3803 390 1026 0 3575 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 18420

[startup+0.300482 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29466
/proc/meminfo: memFree=1778664/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=23984 CPUtime=0.29
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 5301 0 0 0 28 1 0 0 25 0 1 0 26256333 24559616 5212 1992294400 4194304 8395647 140734024496384 18446744073709551615 7370128 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29466/statm: 5996 5212 390 1026 0 4966 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 23984

[startup+0.700526 s]
/proc/loadavg: 1.00 0.99 0.91 3/105 29466
/proc/meminfo: memFree=1778664/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=67136 CPUtime=0.69
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 16291 0 0 0 64 5 0 0 25 0 1 0 26256333 68747264 15848 1992294400 4194304 8395647 140734024496384 18446744073709551615 4216693 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29466/statm: 16784 15848 410 1026 0 15754 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 67136

[startup+1.50062 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29467
/proc/meminfo: memFree=1698304/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=118640 CPUtime=1.49
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 28843 0 0 0 139 10 0 0 25 0 1 0 26256333 121487360 28400 1992294400 4194304 8395647 140734024496384 18446744073709551615 6085551 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29466/statm: 29660 28400 469 1026 0 28630 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 118640

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

[startup+1.90066 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29467
/proc/meminfo: memFree=1698304/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=131076 CPUtime=1.89
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 31902 0 0 0 178 11 0 0 25 0 1 0 26256333 134221824 31459 1992294400 4194304 8395647 140734024496384 18446744073709551615 4684118 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/29466/statm: 32769 31459 469 1026 0 31739 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 131076

[startup+2.10069 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29467
/proc/meminfo: memFree=1652052/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=133116 CPUtime=2.1
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 32348 0 0 0 199 11 0 0 25 0 1 0 26256333 136310784 31905 1992294400 4194304 8395647 140734024496384 18446744073709551615 4448743 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29466/statm: 33279 31905 499 1026 0 32249 0
Current children cumulated CPU time (s) 2.1
Current children cumulated vsize (KiB) 133116

[startup+2.2087 s]
/proc/loadavg: 1.00 0.99 0.91 2/106 29467
/proc/meminfo: memFree=1652052/2059040 swapFree=4139760/4192956
[pid=29466] ppid=29464 vsize=133116 CPUtime=2.2
/proc/29466/stat : 29466 (pbscip.linux.x8) R 29464 29466 28623 0 -1 4202496 32350 0 0 0 209 11 0 0 25 0 1 0 26256333 136310784 31907 1992294400 4194304 8395647 140734024496384 18446744073709551615 6345725 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/29466/statm: 33279 31907 501 1026 0 32249 0
Current children cumulated CPU time (s) 2.2
Current children cumulated vsize (KiB) 133116

Child status: 0
Real time (s): 2.24776
CPU time (s): 2.24666
CPU user time (s): 2.11768
CPU system time (s): 0.12898
CPU usage (%): 99.9512
Max. virtual memory (cumulated for all children) (KiB): 133116

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

runsolver used 0.009998 second user time and 0.022996 second system time

The end

Launcher Data 

Begin job on node085 at 2010-07-08 11:14:39
IDJOB=2704759
IDBENCH=74866
IDSOLVER=1213
FILE ID=node085/2704759-1278580479
PBS_JOBID= 11240063
Free space on /tmp= 121796 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j90/normalized-j9012_2-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-2704759-1278580479/watcher-2704759-1278580479 -o /tmp/evaluation-result-2704759-1278580479/solver-2704759-1278580479 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704759-1278580479.opb -t 1800 -m 1800

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

MD5SUM BENCH= e779a123dad7c0bfc06fe135207f182b
RANDOM SEED=2074526157

node085.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.215
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.43
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.215
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.39
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1779068 kB
Buffers:         21336 kB
Cached:         161096 kB
SwapCached:       6996 kB
Active:         121488 kB
Inactive:        74912 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1779068 kB
SwapTotal:     4192956 kB
SwapFree:      4139760 kB
Dirty:           13164 kB
Writeback:           4 kB
AnonPages:       11796 kB
Mapped:          12016 kB
Slab:            61880 kB
PageTables:       4088 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181456 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= 121788 MiB
End job on node085 at 2010-07-08 11:14:41