Trace number 2666280

Some explanations

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

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

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

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverSAT 2.52961 2.5306

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_500_10_5_15.opb
MD5SUM5332756aaf3462bb729ff5c6a427694c
Bench CategoryDEC-SMALLINT-NLC (no optimisation, small integers, non 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 benchmark1.09683
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables1000
Total number of constraints1502
Number of constraints which are clauses500
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints1001
Minimum length of a constraint2
Maximum length of a constraint1000
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 15
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 1000
Number of bits of the biggest sum of numbers10
Number of products (including duplicates)12540
Sum of products size (including duplicates)25080
Number of different products6270
Sum of products size12540

Solver Data 

0.00/0.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00	c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00	c 
0.00/0.00	c user parameter file <scip.set> not found - using default parameters
0.00/0.00	c reading problem <HOME/instance-2666280-1276676532.opb>
0.10/0.11	c original problem has 7270 variables (7270 bin, 0 int, 0 impl, 0 cont) and 7772 constraints
0.10/0.11	c problem read
0.10/0.11	c No objective function, only one solution is needed.
0.10/0.11	c presolving settings loaded
0.19/0.21	c presolving:
0.49/0.50	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1501 upgd conss, 51160 impls, 1000 clqs
0.69/0.75	c presolving (2 rounds):
0.69/0.75	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.75	c  51160 implications, 1000 cliques
0.69/0.75	c presolved problem has 7270 variables (7270 bin, 0 int, 0 impl, 0 cont) and 7772 constraints
0.69/0.75	c       1 constraints of type <knapsack>
0.69/0.75	c    1000 constraints of type <setppc>
0.69/0.75	c    6270 constraints of type <and>
0.69/0.75	c       1 constraints of type <linear>
0.69/0.75	c     500 constraints of type <logicor>
0.69/0.75	c transformed objective value is always integral (scale: 1)
0.69/0.75	c Presolving Time: 0.40
0.69/0.75	c - non default parameters ----------------------------------------------------------------------
0.69/0.75	c # SCIP version 1.2.1.2
0.69/0.75	c 
0.69/0.75	c # frequency for displaying node information lines
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.75	c display/freq = 10000
0.69/0.75	c 
0.69/0.75	c # maximal time in seconds to run
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.75	c limits/time = 1799.89
0.69/0.75	c 
0.69/0.75	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.75	c limits/memory = 1620
0.69/0.75	c 
0.69/0.75	c # solving stops, if the given number of solutions were found (-1: no limit)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.75	c limits/solutions = 1
0.69/0.75	c 
0.69/0.75	c # maximal number of separation rounds per node (-1: unlimited)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 5]
0.69/0.75	c separating/maxrounds = 1
0.69/0.75	c 
0.69/0.75	c # maximal number of separation rounds in the root node (-1: unlimited)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.75	c separating/maxroundsroot = 5
0.69/0.75	c 
0.69/0.75	c # should presolving try to simplify inequalities
0.69/0.75	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.75	c constraints/linear/simplifyinequalities = TRUE
0.69/0.75	c 
0.69/0.75	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.69/0.75	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.69/0.75	c constraints/knapsack/disaggregation = FALSE
0.69/0.75	c 
0.69/0.75	c # should presolving try to simplify knapsacks
0.69/0.75	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.75	c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.75	c 
0.69/0.75	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.75	c presolving/probing/maxrounds = 0
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/coefdiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.75	c heuristics/coefdiving/maxlpiterquot = 0.075
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/coefdiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 30]
0.69/0.75	c heuristics/crossover/freq = -1
0.69/0.75	c 
0.69/0.75	c # number of nodes added to the contingent of the total nodes
0.69/0.75	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.75	c heuristics/crossover/nodesofs = 750
0.69/0.75	c 
0.69/0.75	c # number of nodes without incumbent change that heuristic should wait
0.69/0.75	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.69/0.75	c heuristics/crossover/nwaitingnodes = 100
0.69/0.75	c 
0.69/0.75	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.69/0.75	c # [type: real, range: [0,1], default: 0.1]
0.69/0.75	c heuristics/crossover/nodesquot = 0.15
0.69/0.75	c 
0.69/0.75	c # minimum percentage of integer variables that have to be fixed 
0.69/0.75	c # [type: real, range: [0,1], default: 0.666]
0.69/0.75	c heuristics/crossover/minfixingrate = 0.5
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.75	c heuristics/feaspump/freq = -1
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/feaspump/maxlpiterofs = 2000
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/fracdiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.75	c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/guideddiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.75	c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.75	c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/intshifting/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/linesearchdiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.75	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.75	c heuristics/nlp/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.75	c heuristics/objpscostdiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.75	c # [type: real, range: [0,1], default: 0.01]
0.69/0.75	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.75	c heuristics/oneopt/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/pscostdiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.75	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.75	c heuristics/rens/freq = -1
0.69/0.75	c 
0.69/0.75	c # minimum percentage of integer variables that have to be fixable 
0.69/0.75	c # [type: real, range: [0,1], default: 0.5]
0.69/0.75	c heuristics/rens/minfixingrate = 0.3
0.69/0.75	c 
0.69/0.75	c # number of nodes added to the contingent of the total nodes
0.69/0.75	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.75	c heuristics/rens/nodesofs = 2000
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.75	c heuristics/rootsoldiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.75	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.75	c heuristics/rounding/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/shifting/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.75	c heuristics/simplerounding/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.75	c heuristics/trivial/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.75	c heuristics/trysol/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.75	c heuristics/veclendiving/freq = -1
0.69/0.75	c 
0.69/0.75	c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.75	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.75	c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.75	c 
0.69/0.75	c # additional number of allowed LP iterations
0.69/0.75	c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.75	c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.75	c 
0.69/0.75	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.75	c heuristics/zirounding/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.75	c separating/cmir/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.75	c separating/flowcover/freq = -1
0.69/0.75	c 
0.69/0.75	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.75	c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.75	c separating/rapidlearning/freq = 0
0.69/0.75	c 
0.69/0.75	c -----------------------------------------------------------------------------------------------
0.69/0.75	c start solving
0.69/0.76	c 
0.89/0.90	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.89/0.90	c   0.6s|     1 |     0 |    49 |     - |  32M|   0 |   7 |7270 |7772 |7270 |  14k|   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.29/2.39	c   1.8s|     1 |     0 |    50 |     - |  32M|   0 |   0 |7270 |7772 |7270 |  14k|   3 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.39/2.40	c * 1.8s|     1 |     0 |    50 |     - |  32M|   0 |   - |7270 |7772 |7270 |  14k|   3 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
2.39/2.40	c 
2.39/2.40	c SCIP Status        : problem is solved [optimal solution found]
2.39/2.40	c Solving Time (sec) : 1.80
2.39/2.40	c Solving Nodes      : 1
2.39/2.40	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
2.39/2.40	c Dual Bound         : +0.00000000000000e+00
2.39/2.40	c Gap                : 0.00 %
2.39/2.42	s SATISFIABLE
2.39/2.42	v -x726 -x906 -x819 -x684 -x986 -x974 -x873 -x952 -x631 -x770 -x902 -x898 -x828 -x606 -x993 -x972 -x812 -x658 -x793 -x848 -x997 -x945 
2.39/2.42	v -x893 -x885 -x816 -x752 -x685 -x817 -x757 -x625 -x814 -x894 -x973 -x617 -x858 -x943 -x918 -x781 -x841 -x929 -x587 -x1000 
2.39/2.42	v -x691 -x629 -x711 -x971 -x593 -x755 -x674 -x831 -x730 -x673 -x909 -x890 -x879 -x830 -x892 -x567 -x632 -x601 -x630 -x667 -x565 
2.39/2.42	v -x643 -x905 -x575 -x788 -x697 -x678 -x964 -x896 -x907 -x656 -x754 -x559 -x583 -x995 -x743 -x689 -x670 -x557 -x942 -x880 -x845 
2.39/2.42	v -x780 -x735 -x710 -x910 -x775 -x767 -x712 -x823 -x794 -x784 -x683 -x662 -x605 -x900 -x613 -x877 -x548 -x776 -x576 -x732 -x916 
2.39/2.42	v -x856 -x999 -x796 -x951 -x950 -x588 -x547 -x976 -x843 -x930 -x834 -x544 -x737 -x750 -x739 -x863 -x749 -x645 -x620 -x600 -x795 
2.39/2.42	v -x700 -x948 -x821 -x701 -x875 -x707 -x668 -x722 -x675 -x562 -x889 -x924 -x769 -x798 -x539 -x660 -x748 -x962 -x708 -x738 
2.39/2.42	v -x833 -x642 -x729 -x985 -x687 -x640 -x966 -x810 -x694 -x759 -x955 -x903 -x637 -x983 -x865 -x771 -x537 -x826 -x939 -x932 -x797 
2.39/2.42	v -x731 -x982 -x876 -x682 -x803 -x532 -x838 -x638 -x802 -x965 -x531 -x753 -x679 -x713 -x665 -x599 -x530 -x967 -x840 -x555 -x720 
2.39/2.42	v -x805 -x584 -x560 -x734 -x733 -x864 -x984 -x960 -x891 -x536 -x949 -x768 -x854 -x958 -x589 -x969 -x760 -x696 -x615 -x740 -x860 
2.39/2.42	v -x623 -x604 -x883 -x778 -x917 -x607 -x970 -x609 -x914 -x842 -x827 -x703 -x571 -x946 -x959 -x920 -x725 -x523 -x791 -x936 -x981 
2.39/2.42	v -x718 -x835 -x806 -x522 -x953 -x855 -x818 -x596 -x534 -x556 -x923 -x672 -x649 -x577 -x695 -x839 -x744 -x704 -x919 -x688 -x746 
2.39/2.42	v -x912 -x808 -x671 -x614 -x563 -x677 -x857 -x992 -x772 -x550 -x558 -x709 -x926 -x991 -x569 -x908 -x852 -x836 -x621 -x519 
2.39/2.42	v -x652 -x886 -x822 -x899 -x751 -x517 -x783 -x529 -x820 -x764 -x867 -x716 -x516 -x927 -x693 -x651 -x639 -x815 -x570 -x765 -x944 
2.39/2.42	v -x545 -x998 -x626 -x925 -x853 -x773 -x686 -x654 -x566 -x549 -x956 -x636 -x758 -x542 -x622 -x635 -x514 -x895 -x872 -x846 -x789 
2.39/2.42	v -x756 -x655 -x618 -x564 -x619 -x602 -x742 -x978 -x938 -x996 -x868 -x513 -x947 -x552 -x646 -x627 -x715 -x568 -x931 -x904 -x782 
2.39/2.42	v -x698 -x657 -x581 -x533 -x901 -x598 -x897 -x979 -x994 -x661 -x580 -x518 -x870 -x963 -x525 -x937 -x813 -x747 -x610 -x551 -x592 
2.39/2.42	v -x988 -x721 -x871 -x807 -x520 -x515 -x647 -x844 -x509 -x977 -x824 -x761 -x641 -x524 -x579 -x719 -x659 -x590 -x792 -x935 -x653 
2.39/2.42	v -x887 -x528 -x508 -x957 -x837 -x681 -x597 -x664 -x980 -x799 -x779 -x975 -x762 -x804 -x888 -x745 -x507 -x913 -x859 -x648 
2.39/2.42	v -x541 -x591 -x851 -x940 -x869 -x934 -x628 -x717 -x811 -x663 -x582 -x578 -x535 -x543 -x990 -x928 -x724 -x989 -x774 -x505 -x850 
2.39/2.42	v -x763 -x705 -x616 -x594 -x702 -x608 -x624 -x736 -x666 -x714 -x504 -x933 -x825 -x786 -x669 -x644 -x612 -x603 -x586 -x526 -x512 
2.39/2.42	v -x538 -x954 -x866 -x511 -x572 -x941 -x862 -x800 -x809 -x585 -x503 -x690 -x561 -x554 -x540 -x728 -x847 -x553 -x884 -x961 -x832 
2.39/2.42	v -x874 -x680 -x506 -x502 -x968 -x922 -x881 -x878 -x790 -x785 -x723 -x692 -x634 -x595 -x510 -x915 -x987 -x829 -x727 -x521 -x911 
2.39/2.42	v -x699 -x861 x849 x527 x501 x801 x787 x741 x706 x546 x882 x574 x650 x921 x633 -x777 x573 -x611 -x766 x676 -x500 -x499 -x498 
2.39/2.42	v -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 -x489 -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 
2.39/2.42	v -x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 
2.39/2.42	v -x455 -x454 -x453 -x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 -x435 
2.39/2.42	v -x434 -x433 -x432 -x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 
2.39/2.42	v -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 
2.39/2.42	v -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373 
2.39/2.42	v -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 
2.39/2.42	v -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 
2.39/2.42	v -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 
2.39/2.42	v -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 
2.39/2.42	v -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 
2.39/2.42	v -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 
2.39/2.42	v -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 
2.39/2.42	v -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 
2.39/2.42	v -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 
2.39/2.42	v -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 
2.39/2.42	v -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 
2.39/2.42	v -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 
2.39/2.42	v -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 
2.39/2.42	v -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 
2.39/2.42	v -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 
2.39/2.42	v -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 
2.39/2.42	v -x27 -x26 -x25 -x24 -x23 -x22 -x21 x20 x19 x18 -x17 x16 x15 x14 x13 x12 -x11 x10 x9 x8 x7 x6 x5 x4 -x3 -x2 -x1 
2.39/2.42	c SCIP Status        : problem is solved [optimal solution found]
2.39/2.42	c Solving Time       :       1.80
2.39/2.42	c Original Problem   :
2.39/2.42	c   Problem name     : HOME/instance-2666280-1276676532.opb
2.39/2.42	c   Variables        : 7270 (7270 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.42	c   Constraints      : 7772 initial, 7772 maximal
2.39/2.42	c Presolved Problem  :
2.39/2.42	c   Problem name     : t_HOME/instance-2666280-1276676532.opb
2.39/2.42	c   Variables        : 7270 (7270 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.42	c   Constraints      : 7772 initial, 7772 maximal
2.39/2.42	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.39/2.42	c   trivial          :       0.00          0          0          0          0          0          0          0          0
2.39/2.42	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.39/2.42	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.39/2.42	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.39/2.42	c   implics          :       0.01          0          0          0          0          0          0          0          0
2.39/2.42	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.39/2.42	c   knapsack         :       0.03          0          0          0          0          0          0          0          0
2.39/2.42	c   setppc           :       0.02          0          0          0          0          0          0          0          0
2.39/2.42	c   and              :       0.23          0          0          0          0          0          0          0          0
2.39/2.42	c   linear           :       0.05          0          0          0          0          0          0          0          0
2.39/2.42	c   logicor          :       0.00          0          0          0          0          0          0          0          0
2.39/2.42	c   root node        :          -          0          -          -          0          -          -          -          -
2.39/2.42	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.39/2.42	c   integral         :          0          0          0          1          0          0          0          0          0          0
2.39/2.42	c   knapsack         :          1          2          1          1          0          0          0          0          0          0
2.39/2.42	c   setppc           :       1000          2          1          1          0          0          0          0          0          0
2.39/2.42	c   and              :       6270          2          1          1          0          0          0          0          0          0
2.39/2.42	c   linear           :          1          2          1          1          0          0          0          0          0          0
2.39/2.42	c   logicor          :        500          2          1          1          0          0          0          0          0          0
2.39/2.42	c   countsols        :          0          0          0          1          0          0          0          0          0          0
2.39/2.42	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.39/2.42	c   integral         :       0.00       0.00       0.00       0.00       0.00
2.39/2.42	c   knapsack         :       0.05       0.05       0.00       0.00       0.00
2.39/2.42	c   setppc           :       0.00       0.00       0.00       0.00       0.00
2.39/2.42	c   and              :       0.01       0.01       0.00       0.00       0.00
2.39/2.42	c   linear           :       0.00       0.00       0.00       0.00       0.00
2.39/2.42	c   logicor          :       0.00       0.00       0.00       0.00       0.00
2.39/2.42	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.39/2.42	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.39/2.42	c   vbounds          :       0.00          1          0          0
2.39/2.42	c   rootredcost      :       0.00          0          0          0
2.39/2.42	c   pseudoobj        :       0.00          0          0          0
2.39/2.42	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.39/2.42	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
2.39/2.42	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.39/2.42	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.39/2.42	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.39/2.42	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.39/2.42	c   applied globally :          -          -          -          0        0.0          -          -          -
2.39/2.42	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.39/2.42	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.39/2.42	c   cut pool         :       0.00          1          -          -          0          -    (maximal pool size: 5)
2.39/2.42	c   redcost          :       0.00          2          0          0          0          0
2.39/2.42	c   impliedbounds    :       0.00          1          0          0          0          0
2.39/2.42	c   intobj           :       0.00          0          0          0          0          0
2.39/2.42	c   cgmip            :       0.00          0          0          0          0          0
2.39/2.42	c   gomory           :       0.13          1          0          0        164          0
2.39/2.42	c   strongcg         :       0.12          1          0          0        164          0
2.39/2.42	c   cmir             :       0.00          0          0          0          0          0
2.39/2.42	c   flowcover        :       0.00          0          0          0          0          0
2.39/2.42	c   clique           :       0.05          1          0          0          1          0
2.39/2.42	c   zerohalf         :       0.00          0          0          0          0          0
2.39/2.42	c   mcf              :       0.03          1          0          0          0          0
2.39/2.42	c   rapidlearning    :       0.81          1          0          0          0          0
2.39/2.42	c Pricers            :       Time      Calls       Vars
2.39/2.42	c   problem variables:       0.00          0          0
2.39/2.42	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.39/2.42	c   pscost           :       0.00          0          0          0          0          0          0
2.39/2.42	c   inference        :       0.00          0          0          0          0          0          0
2.39/2.42	c   mostinf          :       0.00          0          0          0          0          0          0
2.39/2.42	c   leastinf         :       0.00          0          0          0          0          0          0
2.39/2.42	c   fullstrong       :       0.00          0          0          0          0          0          0
2.39/2.42	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.39/2.42	c   random           :       0.00          0          0          0          0          0          0
2.39/2.42	c   relpscost        :       0.00          0          0          0          0          0          0
2.39/2.42	c Primal Heuristics  :       Time      Calls      Found
2.39/2.42	c   LP solutions     :       0.00          -          1
2.39/2.42	c   pseudo solutions :       0.00          -          0
2.39/2.42	c   trivial          :       0.01          1          0
2.39/2.42	c   simplerounding   :       0.00          0          0
2.39/2.42	c   zirounding       :       0.00          0          0
2.39/2.42	c   rounding         :       0.00          0          0
2.39/2.42	c   shifting         :       0.00          0          0
2.39/2.42	c   intshifting      :       0.00          0          0
2.39/2.42	c   oneopt           :       0.00          0          0
2.39/2.42	c   twoopt           :       0.00          0          0
2.39/2.42	c   fixandinfer      :       0.00          0          0
2.39/2.42	c   feaspump         :       0.00          0          0
2.39/2.42	c   coefdiving       :       0.00          0          0
2.39/2.42	c   pscostdiving     :       0.00          0          0
2.39/2.42	c   fracdiving       :       0.00          0          0
2.39/2.42	c   veclendiving     :       0.00          0          0
2.39/2.42	c   intdiving        :       0.00          0          0
2.39/2.42	c   actconsdiving    :       0.00          0          0
2.39/2.42	c   objpscostdiving  :       0.00          0          0
2.39/2.42	c   rootsoldiving    :       0.00          0          0
2.39/2.42	c   linesearchdiving :       0.00          0          0
2.39/2.42	c   guideddiving     :       0.00          0          0
2.39/2.42	c   octane           :       0.00          0          0
2.39/2.42	c   rens             :       0.00          0          0
2.39/2.42	c   rins             :       0.00          0          0
2.39/2.42	c   localbranching   :       0.00          0          0
2.39/2.42	c   mutation         :       0.00          0          0
2.39/2.42	c   crossover        :       0.00          0          0
2.39/2.42	c   dins             :       0.00          0          0
2.39/2.42	c   undercover       :       0.00          0          0
2.39/2.42	c   nlp              :       0.00          0          0
2.39/2.42	c   trysol           :       0.00          0          0
2.39/2.42	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.39/2.42	c   primal LP        :       0.00          0          0       0.00          -
2.39/2.42	c   dual LP          :       0.04          2         50      25.00    1250.00
2.39/2.42	c   lex dual LP      :       0.00          0          0       0.00          -
2.39/2.42	c   barrier LP       :       0.00          0          0       0.00          -
2.39/2.42	c   diving/probing LP:       0.00          0          0       0.00          -
2.39/2.42	c   strong branching :       0.00          0          0       0.00          -
2.39/2.42	c     (at root node) :          -          0          0       0.00          -
2.39/2.42	c   conflict analysis:       0.00          0          0       0.00          -
2.39/2.42	c B&B Tree           :
2.39/2.42	c   number of runs   :          1
2.39/2.42	c   nodes            :          1
2.39/2.42	c   nodes (total)    :          1
2.39/2.42	c   nodes left       :          0
2.39/2.42	c   max depth        :          0
2.39/2.42	c   max depth (total):          0
2.39/2.42	c   backtracks       :          0 (0.0%)
2.39/2.42	c   delayed cutoffs  :          0
2.39/2.42	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
2.39/2.42	c   avg switch length:       2.00
2.39/2.42	c   switching time   :       0.00
2.39/2.42	c Solution           :
2.39/2.42	c   Solutions found  :          1 (1 improvements)
2.39/2.42	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1 nodes, 1.80 seconds, depth 0, found by <relaxation>)
2.39/2.42	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1 nodes, 1.80 seconds, depth 0, found by <relaxation>)
2.39/2.42	c   Dual Bound       : +0.00000000000000e+00
2.39/2.42	c   Gap              :       0.00 %
2.39/2.42	c   Root Dual Bound  : +0.00000000000000e+00
2.39/2.42	c   Root Iterations  :         50
2.49/2.53	c Time complete: 2.52.

Verifier Data 

OK	0

Watcher Data 

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2666280-1276676532/watcher-2666280-1276676532 -o /tmp/evaluation-result-2666280-1276676532/solver-2666280-1276676532 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666280-1276676532.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.11 1.03 1.01 2/105 15544
/proc/meminfo: memFree=1753408/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=7724 CPUtime=0
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 1107 0 0 0 0 0 0 0 25 0 1 0 8946681 7909376 1027 1992294400 4194304 8223781 140734649765664 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15544/statm: 1931 1036 348 984 0 944 0

[startup+0.016795 s]
/proc/loadavg: 1.11 1.03 1.01 2/105 15544
/proc/meminfo: memFree=1753408/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=10484 CPUtime=0
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 1914 0 0 0 0 0 0 0 25 0 1 0 8946681 10735616 1834 1992294400 4194304 8223781 140734649765664 18446744073709551615 4525424 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15544/statm: 2621 1834 364 984 0 1634 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 10484

[startup+0.101804 s]
/proc/loadavg: 1.11 1.03 1.01 2/105 15544
/proc/meminfo: memFree=1753408/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=18796 CPUtime=0.1
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 4004 0 0 0 8 2 0 0 25 0 1 0 8946681 19247104 3924 1992294400 4194304 8223781 140734649765664 18446744073709551615 7210435 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15544/statm: 4699 3924 364 984 0 3712 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 18796

[startup+0.300822 s]
/proc/loadavg: 1.11 1.03 1.01 2/105 15544
/proc/meminfo: memFree=1753408/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=37476 CPUtime=0.29
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 9030 0 0 0 23 6 0 0 25 0 1 0 8946681 38375424 8329 1992294400 4194304 8223781 140734649765664 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15544/statm: 9369 8329 426 984 0 8382 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 37476

[startup+0.700862 s]
/proc/loadavg: 1.11 1.03 1.01 2/105 15544
/proc/meminfo: memFree=1753408/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=40908 CPUtime=0.69
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 11387 0 0 0 49 20 0 0 25 0 1 0 8946681 41889792 9144 1992294400 4194304 8223781 140734649765664 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15544/statm: 10227 9144 459 984 0 9240 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 40908

[startup+1.50094 s]
/proc/loadavg: 1.11 1.03 1.01 2/106 15545
/proc/meminfo: memFree=1693012/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=104332 CPUtime=1.49
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 28003 0 0 0 118 31 0 0 19 0 1 0 8946681 106835968 24490 1992294400 4194304 8223781 140734649765664 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15544/statm: 26083 24490 587 984 0 25096 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 104332

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

[startup+2.30202 s]
/proc/loadavg: 1.10 1.03 1.01 2/106 15545
/proc/meminfo: memFree=1652464/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=110044 CPUtime=2.29
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 31883 0 0 0 179 50 0 0 20 0 1 0 8946681 112685056 25800 1992294400 4194304 8223781 140734649765664 18446744073709551615 4657658 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15544/statm: 27511 25800 595 984 0 26524 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 110044

[startup+2.50203 s]
/proc/loadavg: 1.10 1.03 1.01 2/106 15545
/proc/meminfo: memFree=1652464/2059040 swapFree=4140808/4192956
[pid=15544] ppid=15542 vsize=68960 CPUtime=2.49
/proc/15544/stat : 15544 (pbscip.linux.x8) R 15542 15544 15039 0 -1 4202496 32489 0 0 0 198 51 0 0 20 0 1 0 8946681 70615040 16028 1992294400 4194304 8223781 140734649765664 18446744073709551615 6206490 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15544/statm: 17240 16028 607 984 0 16253 0
Current children cumulated CPU time (s) 2.49
Current children cumulated vsize (KiB) 68960

Child status: 0
Real time (s): 2.5306
CPU time (s): 2.52961
CPU user time (s): 2.00869
CPU system time (s): 0.52092
CPU usage (%): 99.9609
Max. virtual memory (cumulated for all children) (KiB): 110044

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.00869
system time used= 0.52092
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 32493
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= 4
involuntary context switches= 28

runsolver used 0.009998 second user time and 0.021996 second system time

The end

Launcher Data 

Begin job on node089 at 2010-06-16 10:22:12
IDJOB=2666280
IDBENCH=48298
IDSOLVER=1169
FILE ID=node089/2666280-1276676532
PBS_JOBID= 11172535
Free space on /tmp= 62556 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_500_10_5_15.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-2666280-1276676532/watcher-2666280-1276676532 -o /tmp/evaluation-result-2666280-1276676532/solver-2666280-1276676532 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666280-1276676532.opb -t 1800 -m 1800

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

MD5SUM BENCH= 5332756aaf3462bb729ff5c6a427694c
RANDOM SEED=428805310

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

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

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1753812 kB
Buffers:        101676 kB
Cached:         123184 kB
SwapCached:       6556 kB
Active:          97120 kB
Inactive:       141520 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1753812 kB
SwapTotal:     4192956 kB
SwapFree:      4140808 kB
Dirty:            4796 kB
Writeback:           0 kB
AnonPages:       11280 kB
Mapped:          13064 kB
Slab:            44868 kB
PageTables:       4068 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   182152 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= 62552 MiB
End job on node089 at 2010-06-16 10:22:15