Trace number 3738575

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
PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)SAT 0.008998 0.0100011

General information on the benchmark

Name/DEC-SMALLINT-LIN/leberre/opb-paranoid/misc2010/
datasets/caixa/normalized-1096.cudf.paranoid.opb
MD5SUM0f951e665f9319822c7d88883bb07124
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, linear constraints)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables1
Total number of constraints1
Number of constraints which are clauses1
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint1
Maximum length of a constraint1
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 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 2
Number of bits of the biggest sum of numbers2
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.1.0.7
0.00/0.00	c LP-Solver SoPlex 1.4.1
0.00/0.00	c user parameter file <scip.set> not found - using default parameters
0.00/0.00	c read problem <HOME/instance-3738575-1338755665.opb>
0.00/0.00	c original problem has 1 variables (1 bin, 0 int, 0 impl, 0 cont) and 1 constraints
0.00/0.00	c No objective function, only one solution is needed.
0.00/0.00	c start presolving problem
0.00/0.00	c presolving:
0.00/0.00	c presolving (1 rounds):
0.00/0.00	c  1 deleted vars, 1 deleted constraints, 1 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.00	c  0 implications, 0 cliques
0.00/0.00	c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.00/0.00	c transformed objective value is always integral (scale: 1)
0.00/0.00	c Presolving Time: 0.00
0.00/0.00	c PURESAT
0.00/0.00	c -----------------------------------------------------------------------------------------------
0.00/0.00	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.00	c separating/flowcover/freq = c -1
0.00/0.00	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.00	c separating/cmir/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.00	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.00	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/veclendiving/freq = c -1
0.00/0.00	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.00	c heuristics/simplerounding/freq = c -1
0.00/0.00	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/shifting/freq = c -1
0.00/0.00	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.00	c heuristics/rounding/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.00	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.00	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.00	c heuristics/rootsoldiving/freq = c -1
0.00/0.00	c # number of nodes added to the contingent of the total nodes
0.00/0.00	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.00	c heuristics/rens/nodesofs = c 2000
0.00/0.00	c # minimum percentage of integer variables that have to be fixable 
0.00/0.00	c # [type: real, range: [0,1], default: 0.5]
0.00/0.00	c heuristics/rens/minfixingrate = c 0.3
0.00/0.00	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.00	c heuristics/rens/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.00	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.00	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/pscostdiving/freq = c -1
0.00/0.00	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.00	c heuristics/oneopt/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.00	c # [type: real, range: [0,1], default: 0.01]
0.00/0.00	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.00	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.00	c heuristics/objpscostdiving/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.00	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.00	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/linesearchdiving/freq = c -1
0.00/0.00	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/intshifting/freq = c -1
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.00	c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.00	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.00	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/guideddiving/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.00	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.00	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/fracdiving/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.00	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.00	c heuristics/feaspump/freq = c -1
0.00/0.00	c # minimum percentage of integer variables that have to be fixed 
0.00/0.00	c # [type: real, range: [0,1], default: 0.666]
0.00/0.00	c heuristics/crossover/minfixingrate = c 0.5
0.00/0.00	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.00	c # [type: real, range: [0,1], default: 0.1]
0.00/0.00	c heuristics/crossover/nodesquot = c 0.15
0.00/0.00	c # number of nodes without incumbent change that heuristic should wait
0.00/0.00	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.00	c heuristics/crossover/nwaitingnodes = c 100
0.00/0.00	c # number of nodes added to the contingent of the total nodes
0.00/0.00	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.00	c heuristics/crossover/nodesofs = c 750
0.00/0.00	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.00	c heuristics/crossover/freq = c -1
0.00/0.00	c # additional number of allowed LP iterations
0.00/0.00	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.00	c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.00	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.00	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.00	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.00	c heuristics/coefdiving/freq = c -1
0.00/0.00	c # priority of node selection rule <dfs> in standard mode
0.00/0.00	c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.00	c nodeselection/dfs/stdpriority = c 1000000
0.00/0.00	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.00	c presolving/probing/maxrounds = c 0
0.00/0.00	c # should presolving try to simplify knapsacks
0.00/0.00	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00	c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.00	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.00	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.00	c constraints/knapsack/disaggregation = c FALSE
0.00/0.00	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.00	c constraints/knapsack/maxnumcardlift = c 0
0.00/0.00	c # should presolving try to simplify inequalities
0.00/0.00	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00	c constraints/linear/simplifyinequalities = c TRUE
0.00/0.00	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.00	c separating/maxroundsroot = c 5
0.00/0.00	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.00	c separating/maxrounds = c 1
0.00/0.00	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.00	c # [type: char, range: {lafpsqd}, default: l]
0.00/0.00	c lp/pricing = c a
0.00/0.00	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.00	c lp/solvefreq = c 0
0.00/0.00	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.00	c limits/solutions = c 1
0.00/0.00	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.00	c limits/memory = c 13950
0.00/0.00	c # maximal time in seconds to run
0.00/0.00	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.00	c limits/time = c 1791
0.00/0.00	c # frequency for displaying node information lines
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.00	c display/freq = c 10000
0.00/0.00	c # should enforcement of pseudo solution be disabled?
0.00/0.00	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00	c constraints/disableenfops = c TRUE
0.00/0.00	c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.00	c constraints/agelimit = c 1
0.00/0.00	c # should binary conflicts be preferred?
0.00/0.00	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00	c conflict/preferbinary = c TRUE
0.00/0.00	c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.00	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.00	c conflict/interconss = c 0
0.00/0.00	c -----------------------------------------------------------------------------------------------
0.00/0.00	c start solving problem
0.00/0.00	c 
0.00/0.00	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.00	c   0.0s|     1 |     0 |     0 |  82k|   0 |   0 |   0 |   0 |   0 |   0 |   0 |   0 |   0 |   0 | 1.000000e+00 |      --      |    Inf 
0.00/0.00	c * 0.0s|     1 |     0 |     0 |  82k|   0 |   - |   0 |   0 |   0 |   0 |   0 |   0 |   0 |   0 | 1.000000e+00 | 1.000000e+00 |   0.00%
0.00/0.00	c 
0.00/0.00	c SCIP Status        : problem is solved [optimal solution found]
0.00/0.00	c Solving Time (sec) : 0.00
0.00/0.00	c Solving Nodes      : 1
0.00/0.00	c Primal Bound       : +1.00000000000000e+00 (1 solutions)
0.00/0.00	c Dual Bound         : +1.00000000000000e+00
0.00/0.00	c Gap                : 0.00 %
0.00/0.00	c NODE         1
0.00/0.00	c DUAL BOUND   1
0.00/0.00	c PRIMAL BOUND 1
0.00/0.00	c GAP          0
0.00/0.00	s SATISFIABLE
0.00/0.00	v x1 
0.00/0.00	c SCIP Status        : problem is solved [optimal solution found]
0.00/0.00	c Solving Time       :       0.00
0.00/0.00	c Original Problem   :
0.00/0.00	c   Problem name     : HOME/instance-3738575-1338755665.opb
0.00/0.00	c   Variables        : 1 (1 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.00	c   Constraints      : 1 initial, 1 maximal
0.00/0.00	c Presolved Problem  :
0.00/0.00	c   Problem name     : t_HOME/instance-3738575-1338755665.opb
0.00/0.00	c   Variables        : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.00	c   Constraints      : 0 initial, 0 maximal
0.00/0.00	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.00/0.00	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.00/0.00	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.00/0.00	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.00/0.00	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.00/0.00	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.00/0.00	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.00/0.00	c   linear           :       0.00          1          0          0          1          0          1          0          0
0.00/0.00	c   root node        :          -          0          -          -          0          -          -          -          -
0.00/0.00	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.00	c   integral         :          0          0          0          1          0          0          0          0          0          0
0.00/0.00	c   countsols        :          0          0          0          1          0          0          0          0          0          0
0.00/0.00	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.00/0.00	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.00/0.00	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.00/0.00	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.00/0.00	c   rootredcost      :       0.00          0          0          0
0.00/0.00	c   pseudoobj        :       0.00          0          0          0
0.00/0.00	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.00/0.00	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.00/0.00	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.00	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.00	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.00/0.00	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.00/0.00	c   applied globally :          -          -          -          0        0.0          -          -          -
0.00/0.00	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.00/0.00	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.00/0.00	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.00/0.00	c   redcost          :       0.00          0          0          0          0          0
0.00/0.00	c   impliedbounds    :       0.00          0          0          0          0          0
0.00/0.00	c   intobj           :       0.00          0          0          0          0          0
0.00/0.00	c   gomory           :       0.00          0          0          0          0          0
0.00/0.00	c   strongcg         :       0.00          0          0          0          0          0
0.00/0.00	c   cmir             :       0.00          0          0          0          0          0
0.00/0.00	c   flowcover        :       0.00          0          0          0          0          0
0.00/0.00	c   clique           :       0.00          1          0          0          0          0
0.00/0.00	c   zerohalf         :       0.00          0          0          0          0          0
0.00/0.00	c   mcf              :       0.00          0          0          0          0          0
0.00/0.00	c Pricers            :       Time      Calls       Vars
0.00/0.00	c   problem variables:       0.00          0          0
0.00/0.00	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.00/0.00	c   pscost           :       0.00          0          0          0          0          0          0
0.00/0.00	c   inference        :       0.00          0          0          0          0          0          0
0.00/0.00	c   mostinf          :       0.00          0          0          0          0          0          0
0.00/0.00	c   leastinf         :       0.00          0          0          0          0          0          0
0.00/0.00	c   fullstrong       :       0.00          0          0          0          0          0          0
0.00/0.00	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.00/0.00	c   random           :       0.00          0          0          0          0          0          0
0.00/0.00	c   relpscost        :       0.00          0          0          0          0          0          0
0.00/0.00	c Primal Heuristics  :       Time      Calls      Found
0.00/0.00	c   LP solutions     :       0.00          -          1
0.00/0.00	c   pseudo solutions :       0.00          -          0
0.00/0.00	c   simplerounding   :       0.00          0          0
0.00/0.00	c   rounding         :       0.00          0          0
0.00/0.00	c   shifting         :       0.00          0          0
0.00/0.00	c   intshifting      :       0.00          0          0
0.00/0.00	c   oneopt           :       0.00          0          0
0.00/0.00	c   fixandinfer      :       0.00          0          0
0.00/0.00	c   feaspump         :       0.00          0          0
0.00/0.00	c   coefdiving       :       0.00          0          0
0.00/0.00	c   pscostdiving     :       0.00          0          0
0.00/0.00	c   fracdiving       :       0.00          0          0
0.00/0.00	c   veclendiving     :       0.00          0          0
0.00/0.00	c   intdiving        :       0.00          0          0
0.00/0.00	c   actconsdiving    :       0.00          0          0
0.00/0.00	c   objpscostdiving  :       0.00          0          0
0.00/0.00	c   rootsoldiving    :       0.00          0          0
0.00/0.00	c   linesearchdiving :       0.00          0          0
0.00/0.00	c   guideddiving     :       0.00          0          0
0.00/0.00	c   octane           :       0.00          0          0
0.00/0.00	c   rens             :       0.00          0          0
0.00/0.00	c   rins             :       0.00          0          0
0.00/0.00	c   localbranching   :       0.00          0          0
0.00/0.00	c   mutation         :       0.00          0          0
0.00/0.00	c   crossover        :       0.00          0          0
0.00/0.00	c   dins             :       0.00          0          0
0.00/0.00	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.00/0.00	c   primal LP        :       0.00          0          0       0.00          -
0.00/0.00	c   dual LP          :       0.00          0          0       0.00          -
0.00/0.00	c   barrier LP       :       0.00          0          0       0.00          -
0.00/0.00	c   diving/probing LP:       0.00          0          0       0.00          -
0.00/0.00	c   strong branching :       0.00          0          0       0.00          -
0.00/0.00	c     (at root node) :          -          0          0       0.00          -
0.00/0.00	c   conflict analysis:       0.00          0          0       0.00          -
0.00/0.00	c B&B Tree           :
0.00/0.00	c   number of runs   :          1
0.00/0.00	c   nodes            :          1
0.00/0.00	c   nodes (total)    :          1
0.00/0.00	c   nodes left       :          0
0.00/0.00	c   max depth        :          0
0.00/0.00	c   max depth (total):          0
0.00/0.00	c   backtracks       :          0 (0.0%)
0.00/0.00	c   delayed cutoffs  :          0
0.00/0.00	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.00/0.00	c   avg switch length:       2.00
0.00/0.00	c   switching time   :       0.00
0.00/0.00	c Solution           :
0.00/0.00	c   Solutions found  :          1 (1 improvements)
0.00/0.00	c   Primal Bound     : +1.00000000000000e+00   (in run 1, after 1 nodes, 0.00 seconds, depth 0, found by <relaxation>)
0.00/0.00	c   Dual Bound       : +1.00000000000000e+00
0.00/0.00	c   Gap              :       0.00 %
0.00/0.00	c   Root Dual Bound  : +1.00000000000000e+00
0.00/0.00	c Time complete: 0.

Verifier Data 

OK	0

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 989)

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

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

running on 4 cores: 0,2,4,6

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


[startup+0 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 9106
/proc/meminfo: memFree=30441228/32873844 swapFree=7900/7900
[pid=9106] ppid=9104 vsize=10560 CPUtime=0 cores=0,2,4,6
/proc/9106/stat : 9106 (pbscip.linux.x8) R 9104 9106 8610 0 -1 4202496 2067 0 0 0 0 0 0 0 20 0 1 0 341690992 10813440 1666 33554432000 4194304 7823515 140733743194432 140733743190936 4578512 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/9106/statm: 2897 1670 419 887 0 2007 0

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

Child status: 0
Real time (s): 0.0100011
CPU time (s): 0.008998
CPU user time (s): 0.005999
CPU system time (s): 0.002999
CPU usage (%): 89.9699
Max. virtual memory (cumulated for all children) (KiB): 0

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

runsolver used 0.000999 second user time and 0.006998 second system time

The end

Launcher Data 

Begin job on node137 at 2012-06-03 22:34:25
IDJOB=3738575
IDBENCH=72090
IDSOLVER=2321
FILE ID=node137/3738575-1338755665
RUNJOBID= node137-1338748474-8626
PBS_JOBID= 14636788
Free space on /tmp= 70316 MiB

SOLVER NAME= PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/leberre/opb-paranoid/misc2010/datasets/caixa/normalized-1096.cudf.paranoid.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3738575-1338755665/watcher-3738575-1338755665 -o /tmp/evaluation-result-3738575-1338755665/solver-3738575-1338755665 -C 1800 -W 1900 -M 15500  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3738575-1338755665.opb

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

MD5SUM BENCH= 0f951e665f9319822c7d88883bb07124
RANDOM SEED=417474166

node137.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
initial apicid	: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5333.20
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
initial apicid	: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
initial apicid	: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
initial apicid	: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
initial apicid	: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
initial apicid	: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.90
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
initial apicid	: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.600
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
initial apicid	: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873844 kB
MemFree:        30442112 kB
Buffers:          276148 kB
Cached:          1247864 kB
SwapCached:         5796 kB
Active:           898756 kB
Inactive:         710476 kB
Active(anon):      80288 kB
Inactive(anon):     7172 kB
Active(file):     818468 kB
Inactive(file):   703304 kB
Unevictable:        7900 kB
Mlocked:            7900 kB
SwapTotal:      67108856 kB
SwapFree:       67097500 kB
Dirty:              9776 kB
Writeback:             0 kB
AnonPages:         88440 kB
Mapped:            11512 kB
Shmem:                 0 kB
Slab:             684588 kB
SReclaimable:     125736 kB
SUnreclaim:       558852 kB
KernelStack:        1464 kB
PageTables:         4188 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545776 kB
Committed_AS:     203724 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346368 kB
VmallocChunk:   34341987984 kB
HardwareCorrupted:     0 kB
AnonHugePages:     67584 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7872 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 70304 MiB
End job on node137 at 2012-06-03 22:34:25