Trace number 3452337

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 NameAnswerobjective functionCPU timeWall clock time
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4OPT-3 0.011997 0.0171309

General information on the benchmark

Namenormalized-PB07/OPT-SMALLINT-NLC/submittedPB07/
manquinho/mis/normalized-mis_10_4_4.opb
MD5SUM9a543df5f30972279456c42c388b29ff
Bench CategoryOPT-SMALLINT-NLC (optimisation, small integers, non linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark-3
Best CPU time to get the best result obtained on this benchmark0.000999
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function -3
Optimality of the best value was proved YES
Number of variables10
Total number of constraints10
Number of constraints which are clauses0
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints10
Minimum length of a constraint4
Maximum length of a constraint6
Number of terms in the objective function 10
Biggest coefficient in the objective function 1
Number of bits for the biggest coefficient in the objective function 1
Sum of the numbers in the objective function 10
Number of bits of the sum of numbers in the objective function 4
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 10
Number of bits of the biggest sum of numbers4
Number of products (including duplicates)46
Sum of products size (including duplicates)92
Number of different products23
Sum of products size46

Quality of the solution as a function of time


Download the above graph as a PDF file / as an EPS file

Solver Data 

0.00/0.01	c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01	c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01	c 
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c reading problem <HOME/instance-3452337-1307108118.opb>
0.00/0.01	c original problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 10 constraints
0.00/0.01	c problem read
0.00/0.01	c presolving settings loaded
0.00/0.01	o 0
0.00/0.01	c feasible solution found by trivial heuristic, objective value  0.000000e+00
0.00/0.01	c presolving:
0.00/0.01	c (round 1) 23 del vars, 10 del conss, 0 add conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 92 impls, 0 clqs
0.00/0.01	c (round 2) 23 del vars, 10 del conss, 0 add conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 23 upgd conss, 138 impls, 0 clqs
0.00/0.01	c presolving (3 rounds):
0.00/0.01	c  23 deleted vars, 10 deleted constraints, 0 added constraints, 23 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01	c  138 implications, 0 cliques
0.00/0.01	c presolved problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.00/0.01	c      23 constraints of type <logicor>
0.00/0.01	c transformed objective value is always integral (scale: 1)
0.00/0.01	c Presolving Time: 0.00
0.00/0.01	c - non default parameters ----------------------------------------------------------------------
0.00/0.01	c # SCIP version 2.0.1.4
0.00/0.01	c 
0.00/0.01	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c conflict/interconss = 0
0.00/0.01	c 
0.00/0.01	c # should binary conflicts be preferred?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c conflict/preferbinary = TRUE
0.00/0.01	c 
0.00/0.01	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c constraints/agelimit = 1
0.00/0.01	c 
0.00/0.01	c # should enforcement of pseudo solution be disabled?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/disableenfops = TRUE
0.00/0.01	c 
0.00/0.01	c # frequency for displaying node information lines
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01	c display/freq = 10000
0.00/0.01	c 
0.00/0.01	c # maximal time in seconds to run
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/time = 1800
0.00/0.01	c 
0.00/0.01	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/memory = 13950
0.00/0.01	c 
0.00/0.01	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c lp/solvefreq = 0
0.00/0.01	c 
0.00/0.01	c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.01	c # [type: char, range: {lafpsqd}, default: l]
0.00/0.01	c lp/pricing = a
0.00/0.01	c 
0.00/0.01	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01	c # [type: int, range: [1,2], default: 1]
0.00/0.01	c timing/clocktype = 2
0.00/0.01	c 
0.00/0.01	c # belongs reading time to solving time?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c timing/reading = TRUE
0.00/0.01	c 
0.00/0.01	c # should presolving try to simplify inequalities
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/linear/simplifyinequalities = TRUE
0.00/0.01	c 
0.00/0.01	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/indicator/addCouplingCons = TRUE
0.00/0.01	c 
0.00/0.01	c # should presolving try to simplify knapsacks
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01	c 
0.00/0.01	c # priority of node selection rule <dfs> in standard mode
0.00/0.01	c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.01	c nodeselection/dfs/stdpriority = 1000000
0.00/0.01	c 
0.00/0.01	c -----------------------------------------------------------------------------------------------
0.00/0.01	c start solving
0.00/0.01	c 
0.00/0.01	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.01	c t 0.0s|     1 |     0 |    10 |     - | 192k|   0 |  10 |  10 |  23 |  10 |  23 |   0 |   0 |   0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.01	o -1
0.00/0.01	c R 0.0s|     1 |     0 |    10 |     - | 192k|   0 |  10 |  10 |  23 |  10 |  23 |   0 |   0 |   0 |-5.000000e+00 |-1.000000e+00 |  80.00%
0.00/0.01	o -2
0.00/0.01	c s 0.0s|     1 |     0 |    10 |     - | 192k|   0 |  10 |  10 |  23 |  10 |  23 |   0 |   0 |   0 |-5.000000e+00 |-2.000000e+00 |  60.00%
0.00/0.01	c   0.0s|     1 |     0 |    17 |     - | 196k|   0 |   9 |  10 |  23 |  10 |  27 |   4 |   0 |   0 |-3.800000e+00 |-2.000000e+00 |  47.37%
0.00/0.01	o -3
0.00/0.01	c b 0.0s|     1 |     0 |    17 |     - | 197k|   0 |   - |  10 |  23 |  10 |  27 |   4 |   0 |   0 |-3.800000e+00 |-3.000000e+00 |  21.05%
0.00/0.01	c   0.0s|     1 |     0 |    17 |     - | 197k|   0 |   - |  10 |  23 |  10 |  27 |   4 |   0 |   0 |-3.000000e+00 |-3.000000e+00 |   0.00%
0.00/0.01	c 
0.00/0.01	c SCIP Status        : problem is solved [optimal solution found]
0.00/0.01	c Solving Time (sec) : 0.01
0.00/0.01	c Solving Nodes      : 1
0.00/0.01	c Primal Bound       : -3.00000000000000e+00 (4 solutions)
0.00/0.01	c Dual Bound         : -3.00000000000000e+00
0.00/0.01	c Gap                : 0.00 %
0.00/0.01	s OPTIMUM FOUND
0.00/0.01	v x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 -x1 
0.00/0.01	c SCIP Status        : problem is solved [optimal solution found]
0.00/0.01	c Total Time         :       0.01
0.00/0.01	c   solving          :       0.01
0.00/0.01	c   presolving       :       0.00 (included in solving)
0.00/0.01	c   reading          :       0.00 (included in solving)
0.00/0.01	c Original Problem   :
0.00/0.01	c   Problem name     : HOME/instance-3452337-1307108118.opb
0.00/0.01	c   Variables        : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01	c   Constraints      : 10 initial, 10 maximal
0.00/0.01	c Presolved Problem  :
0.00/0.01	c   Problem name     : t_HOME/instance-3452337-1307108118.opb
0.00/0.01	c   Variables        : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01	c   Constraints      : 23 initial, 23 maximal
0.00/0.01	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.00/0.01	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   and              :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   linear           :       0.00         23          0          0         23          0         10          0          0          0
0.00/0.01	c   logicor          :       0.00          0          0          0          0          0          0          0          0          0
0.00/0.01	c   root node        :          -          0          -          -          0          -          -          -          -          -
0.00/0.01	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.01	c   integral         :          0          0          0          0          0          8          0          0          0          0          0          0
0.00/0.01	c   logicor          :         23          1         11          0          0          4          0          0          0          0          0          0
0.00/0.01	c   countsols        :          0          0          0          0          0          6          0          0          0          0          0          0
0.00/0.01	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.00/0.01	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.01	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.01	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.00/0.01	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.00/0.01	c   vbounds          :          0          0          0          0
0.00/0.01	c   rootredcost      :          0          0          0          0
0.00/0.01	c   pseudoobj        :          3          0          0          0
0.00/0.01	c Propagator Timings :  TotalTime  Propagate    Resprop
0.00/0.01	c   vbounds          :       0.00       0.00       0.00
0.00/0.01	c   rootredcost      :       0.00       0.00       0.00
0.00/0.01	c   pseudoobj        :       0.00       0.00       0.00
0.00/0.01	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.00/0.01	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.00/0.01	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.01	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.01	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.01	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.00/0.01	c   applied globally :          -          -          -          0        0.0          -          -          -
0.00/0.01	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.00/0.01	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.00/0.01	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 7)
0.00/0.01	c   redcost          :       0.00          1          0          0          0          0
0.00/0.01	c   impliedbounds    :       0.00          1          0          0          0          0
0.00/0.01	c   intobj           :       0.00          0          0          0          0          0
0.00/0.01	c   gomory           :       0.00          1          0          0         10          0
0.00/0.01	c   cgmip            :       0.00          0          0          0          0          0
0.00/0.01	c   closecuts        :       0.00          0          0          0          0          0
0.00/0.01	c   strongcg         :       0.00          1          0          0         10          0
0.00/0.01	c   cmir             :       0.00          1          0          0          0          0
0.00/0.01	c   flowcover        :       0.00          1          0          0          0          0
0.00/0.01	c   clique           :       0.00          1          0          0          6          0
0.00/0.01	c   zerohalf         :       0.00          0          0          0          0          0
0.00/0.01	c   mcf              :       0.00          1          0          0          0          0
0.00/0.01	c   oddcycle         :       0.00          0          0          0          0          0
0.00/0.01	c   rapidlearning    :       0.00          0          0          0          0          0
0.00/0.01	c Pricers            :       Time      Calls       Vars
0.00/0.01	c   problem variables:       0.00          0          0
0.00/0.01	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.01	c   pscost           :       0.00          0          0          0          0          0          0
0.00/0.01	c   inference        :       0.00          0          0          0          0          0          0
0.00/0.01	c   mostinf          :       0.00          0          0          0          0          0          0
0.00/0.01	c   leastinf         :       0.00          0          0          0          0          0          0
0.00/0.01	c   fullstrong       :       0.00          0          0          0          0          0          0
0.00/0.01	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.00/0.01	c   random           :       0.00          0          0          0          0          0          0
0.00/0.01	c   relpscost        :       0.00          0          0          0          0          0          0
0.00/0.01	c Primal Heuristics  :       Time      Calls      Found
0.00/0.01	c   LP solutions     :       0.00          -          0
0.00/0.01	c   pseudo solutions :       0.00          -          0
0.00/0.01	c   trivial          :       0.00          2          1
0.00/0.01	c   shiftandpropagate:       0.00          0          0
0.00/0.01	c   simplerounding   :       0.00          1          0
0.00/0.01	c   zirounding       :       0.00          0          0
0.00/0.01	c   rounding         :       0.00          1          1
0.00/0.01	c   shifting         :       0.00          1          1
0.00/0.01	c   intshifting      :       0.00          0          0
0.00/0.01	c   oneopt           :       0.00          1          1
0.00/0.01	c   twoopt           :       0.00          0          0
0.00/0.01	c   fixandinfer      :       0.00          0          0
0.00/0.01	c   feaspump         :       0.00          0          0
0.00/0.01	c   clique           :       0.00          0          0
0.00/0.01	c   coefdiving       :       0.00          0          0
0.00/0.01	c   pscostdiving     :       0.00          0          0
0.00/0.01	c   fracdiving       :       0.00          0          0
0.00/0.01	c   veclendiving     :       0.00          0          0
0.00/0.01	c   intdiving        :       0.00          0          0
0.00/0.01	c   actconsdiving    :       0.00          0          0
0.00/0.01	c   objpscostdiving  :       0.00          0          0
0.00/0.01	c   rootsoldiving    :       0.00          0          0
0.00/0.01	c   linesearchdiving :       0.00          0          0
0.00/0.01	c   guideddiving     :       0.00          0          0
0.00/0.01	c   octane           :       0.00          0          0
0.00/0.01	c   rens             :       0.00          0          0
0.00/0.01	c   rins             :       0.00          0          0
0.00/0.01	c   localbranching   :       0.00          0          0
0.00/0.01	c   mutation         :       0.00          0          0
0.00/0.01	c   crossover        :       0.00          0          0
0.00/0.01	c   dins             :       0.00          0          0
0.00/0.01	c   vbounds          :       0.00          0          0
0.00/0.01	c   undercover       :       0.00          0          0
0.00/0.01	c   subnlp           :       0.00          0          0
0.00/0.01	c   trysol           :       0.00          0          0
0.00/0.01	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.00/0.01	c   primal LP        :       0.00          0          0       0.00          -
0.00/0.01	c   dual LP          :       0.00          2         17       8.50          -
0.00/0.01	c   lex dual LP      :       0.00          0          0       0.00          -
0.00/0.01	c   barrier LP       :       0.00          0          0       0.00          -
0.00/0.01	c   diving/probing LP:       0.00          0          0       0.00          -
0.00/0.01	c   strong branching :       0.00          0          0       0.00          -
0.00/0.01	c     (at root node) :          -          0          0       0.00          -
0.00/0.01	c   conflict analysis:       0.00          0          0       0.00          -
0.00/0.01	c B&B Tree           :
0.00/0.01	c   number of runs   :          1
0.00/0.01	c   nodes            :          1
0.00/0.01	c   nodes (total)    :          1
0.00/0.01	c   nodes left       :          0
0.00/0.01	c   max depth        :          0
0.00/0.01	c   max depth (total):          0
0.00/0.01	c   backtracks       :          0 (0.0%)
0.00/0.01	c   delayed cutoffs  :          0
0.00/0.01	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.00/0.01	c   avg switch length:       2.00
0.00/0.01	c   switching time   :       0.00
0.00/0.01	c Solution           :
0.00/0.01	c   Solutions found  :          4 (4 improvements)
0.00/0.01	c   First Solution   : +0.00000000000000e+00   (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.01	c   Primal Bound     : -3.00000000000000e+00   (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <oneopt>)
0.00/0.01	c   Dual Bound       : -3.00000000000000e+00
0.00/0.01	c   Gap              :       0.00 %
0.00/0.01	c   Root Dual Bound  : -3.00000000000000e+00
0.00/0.01	c   Root Iterations  :         17
0.00/0.01	c Time complete: 0.

Verifier Data 

OK	-3

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.0 (svn: 977)

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3452337-1307108118/watcher-3452337-1307108118 -o /tmp/evaluation-result-3452337-1307108118/solver-3452337-1307108118 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452337-1307108118.opb -t 1800 -m 15500 

running on 4 cores: 1,3,5,7

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 2.07 2.05 2.01 2/458 8436
/proc/meminfo: memFree=26205756/32951124 swapFree=60688864/67111528
[pid=8436] ppid=8434 vsize=6600 CPUtime=0 cores=1,3,5,7
/proc/8436/stat : 8436 (scip-2.0.1.4.li) R 8434 8436 6853 0 -1 4202496 782 0 0 0 0 0 0 0 25 0 1 0 822410020 6758400 735 33554432000 4194304 9128323 140736689320016 18446744073709551615 6405856 0 0 4096 0 0 0 0 17 3 0 0 0
/proc/8436/statm: 1650 739 342 1205 0 441 0

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

Child status: 0
Real time (s): 0.0171309
CPU time (s): 0.011997
CPU user time (s): 0.009998
CPU system time (s): 0.001999
CPU usage (%): 70.0314
Max. virtual memory (cumulated for all children) (KiB): 0

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

runsolver used 0.002999 second user time and 0.013997 second system time

The end

Launcher Data 

Begin job on node132 at 2011-06-03 15:35:19
IDJOB=3452337
IDBENCH=48201
IDSOLVER=1949
FILE ID=node132/3452337-1307108118
RUNJOBID= node132-1307106311-8205
PBS_JOBID= 13497999
Free space on /tmp= 73868 MiB

SOLVER NAME= SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4
BENCH NAME= PB07/normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/manquinho/mis/normalized-mis_10_4_4.opb
COMMAND LINE= HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3452337-1307108118/watcher-3452337-1307108118 -o /tmp/evaluation-result-3452337-1307108118/solver-3452337-1307108118 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452337-1307108118.opb -t 1800 -m 15500

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= 9a543df5f30972279456c42c388b29ff
RANDOM SEED=959373169

node132.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	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5333.66
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.76
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.77
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.67
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.82
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.833
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32951124 kB
MemFree:      26206036 kB
Buffers:        316588 kB
Cached:        3023976 kB
SwapCached:      15140 kB
Active:        1130468 kB
Inactive:      5351840 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951124 kB
LowFree:      26206036 kB
SwapTotal:    67111528 kB
SwapFree:     60688864 kB
Dirty:           25180 kB
Writeback:           0 kB
AnonPages:     3134372 kB
Mapped:          21808 kB
Slab:           145084 kB
PageTables:      49540 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587088 kB
Committed_AS: 109310872 kB
VmallocTotal: 34359738367 kB
VmallocUsed:     33868 kB
VmallocChunk: 34359703231 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 73856 MiB
End job on node132 at 2011-06-03 15:35:19