Trace number 2664261

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
SCIPnone SCIP 1.2.1.2 without any LP solverSAT 2.73258 2.73336

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
prestwich/robin/normalized-robin8.opb
MD5SUMb99d95db889fb1865f00b4b2c1a82fb3
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
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.068988
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables784
Total number of constraints256
Number of constraints which are clauses112
Number of constraints which are cardinality constraints (but not clauses)144
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint28
Maximum length of a constraint49
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 2
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 51
Number of bits of the biggest sum of numbers6
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.00	c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664261-1276268855.opb>
0.00/0.02	c original problem has 784 variables (784 bin, 0 int, 0 impl, 0 cont) and 256 constraints
0.00/0.02	c problem read
0.00/0.02	c No objective function, only one solution is needed.
0.00/0.02	c presolving settings loaded
0.00/0.02	c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.02/0.03	c presolving:
0.02/0.04	c (round 1) 0 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 32 upgd conss, 0 impls, 112 clqs
0.02/0.07	c (round 2) 0 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 144 upgd conss, 0 impls, 112 clqs
0.02/0.08	c presolving (3 rounds):
0.02/0.08	c  0 deleted vars, 112 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.08	c  0 implications, 112 cliques
0.02/0.08	c presolved problem has 784 variables (784 bin, 0 int, 0 impl, 0 cont) and 144 constraints
0.02/0.08	c      32 constraints of type <knapsack>
0.02/0.08	c     112 constraints of type <setppc>
0.02/0.08	c transformed objective value is always integral (scale: 1)
0.02/0.08	c Presolving Time: 0.04
0.02/0.08	c - non default parameters ----------------------------------------------------------------------
0.02/0.08	c # SCIP version 1.2.1.2
0.02/0.08	c 
0.02/0.08	c # frequency for displaying node information lines
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.08	c display/freq = 10000
0.02/0.08	c 
0.02/0.08	c # maximal time in seconds to run
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.08	c limits/time = 1799.98
0.02/0.08	c 
0.02/0.08	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.08	c limits/memory = 1620
0.02/0.08	c 
0.02/0.08	c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08	c limits/solutions = 1
0.02/0.08	c 
0.02/0.08	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.08	c lp/solvefreq = -1
0.02/0.08	c 
0.02/0.08	c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.08	c separating/maxrounds = 1
0.02/0.08	c 
0.02/0.08	c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08	c separating/maxroundsroot = 5
0.02/0.08	c 
0.02/0.08	c # should presolving try to simplify inequalities
0.02/0.08	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08	c constraints/linear/simplifyinequalities = TRUE
0.02/0.08	c 
0.02/0.08	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.08	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.08	c constraints/knapsack/disaggregation = FALSE
0.02/0.08	c 
0.02/0.08	c # should presolving try to simplify knapsacks
0.02/0.08	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.08	c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.08	c 
0.02/0.08	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08	c presolving/probing/maxrounds = 0
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/coefdiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.08	c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.08	c heuristics/crossover/freq = -1
0.02/0.08	c 
0.02/0.08	c # number of nodes added to the contingent of the total nodes
0.02/0.08	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.08	c heuristics/crossover/nodesofs = 750
0.02/0.08	c 
0.02/0.08	c # number of nodes without incumbent change that heuristic should wait
0.02/0.08	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.08	c heuristics/crossover/nwaitingnodes = 100
0.02/0.08	c 
0.02/0.08	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.08	c # [type: real, range: [0,1], default: 0.1]
0.02/0.08	c heuristics/crossover/nodesquot = 0.15
0.02/0.08	c 
0.02/0.08	c # minimum percentage of integer variables that have to be fixed 
0.02/0.08	c # [type: real, range: [0,1], default: 0.666]
0.02/0.08	c heuristics/crossover/minfixingrate = 0.5
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.08	c heuristics/feaspump/freq = -1
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/fracdiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.08	c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/guideddiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.08	c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.08	c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/intshifting/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/linesearchdiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.08	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.08	c heuristics/nlp/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.08	c heuristics/objpscostdiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.08	c # [type: real, range: [0,1], default: 0.01]
0.02/0.08	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.08	c heuristics/oneopt/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/pscostdiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.08	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.08	c heuristics/rens/freq = -1
0.02/0.08	c 
0.02/0.08	c # minimum percentage of integer variables that have to be fixable 
0.02/0.08	c # [type: real, range: [0,1], default: 0.5]
0.02/0.08	c heuristics/rens/minfixingrate = 0.3
0.02/0.08	c 
0.02/0.08	c # number of nodes added to the contingent of the total nodes
0.02/0.08	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.08	c heuristics/rens/nodesofs = 2000
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.08	c heuristics/rootsoldiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.08	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.08	c heuristics/rounding/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/shifting/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.08	c heuristics/simplerounding/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.08	c heuristics/trivial/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.08	c heuristics/trysol/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.08	c heuristics/veclendiving/freq = -1
0.02/0.08	c 
0.02/0.08	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.08	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.08	c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.08	c 
0.02/0.08	c # additional number of allowed LP iterations
0.02/0.08	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.08	c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.08	c 
0.02/0.08	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.08	c heuristics/zirounding/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.08	c separating/cmir/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.08	c separating/flowcover/freq = -1
0.02/0.08	c 
0.02/0.08	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.08	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.08	c separating/rapidlearning/freq = 0
0.02/0.08	c 
0.02/0.08	c -----------------------------------------------------------------------------------------------
0.02/0.08	c start solving
0.02/0.08	c 
0.02/0.08	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.02/0.08	c   0.0s|     1 |     2 |     0 |     - |2547k|   0 |   - | 784 | 144 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.69/2.71	c * 2.5s|  9367 |     0 |     0 |   0.0 |3120k| 369 |   - | 784 | 399 |   0 |   0 |   0 | 276 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
2.69/2.71	c 
2.69/2.71	c SCIP Status        : problem is solved [optimal solution found]
2.69/2.71	c Solving Time (sec) : 2.54
2.69/2.71	c Solving Nodes      : 9367
2.69/2.71	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
2.69/2.71	c Dual Bound         : +0.00000000000000e+00
2.69/2.71	c Gap                : 0.00 %
2.69/2.72	s SATISFIABLE
2.69/2.72	v -x784 -x783 -x782 -x781 -x780 -x779 -x778 -x777 -x776 -x775 -x774 -x773 -x772 -x771 -x770 -x769 -x768 -x767 -x766 -x765 -x764 -x763 
2.69/2.72	v -x762 -x761 -x760 -x759 -x758 x757 -x756 -x755 -x754 -x753 -x752 -x751 -x750 -x749 -x748 -x747 -x746 -x745 -x744 -x743 x742 
2.69/2.72	v -x741 -x740 -x739 -x738 -x737 -x736 -x735 -x734 -x733 -x732 -x731 -x730 -x729 x728 -x727 -x726 -x725 -x724 -x723 -x722 -x721 
2.69/2.72	v -x720 -x719 -x718 -x717 -x716 -x715 -x714 -x713 -x712 -x711 -x710 -x709 -x708 -x707 -x706 -x705 -x704 -x703 -x702 -x701 -x700 
2.69/2.72	v -x699 -x698 -x697 -x696 x695 -x694 -x693 -x692 -x691 -x690 -x689 -x688 -x687 -x686 -x685 -x684 -x683 -x682 -x681 -x680 -x679 
2.69/2.72	v -x678 -x677 -x676 -x675 -x674 -x673 -x672 -x671 -x670 -x669 -x668 -x667 -x666 -x665 -x664 -x663 -x662 -x661 -x660 -x659 
2.69/2.72	v -x658 -x657 -x656 -x655 -x654 x653 -x652 -x651 -x650 -x649 -x648 -x647 -x646 -x645 -x644 -x643 -x642 -x641 x640 -x639 -x638 -x637 
2.69/2.72	v -x636 -x635 -x634 -x633 -x632 -x631 -x630 -x629 -x628 -x627 -x626 -x625 -x624 -x623 -x622 -x621 -x620 -x619 -x618 -x617 
2.69/2.72	v -x616 -x615 -x614 -x613 -x612 -x611 -x610 -x609 -x608 -x607 -x606 -x605 x604 -x603 -x602 -x601 -x600 -x599 -x598 -x597 -x596 
2.69/2.72	v -x595 -x594 -x593 -x592 -x591 -x590 -x589 -x588 -x587 -x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579 -x578 -x577 -x576 -x575 
2.69/2.72	v -x574 -x573 -x572 -x571 -x570 -x569 -x568 x567 -x566 -x565 -x564 -x563 -x562 -x561 -x560 -x559 x558 -x557 -x556 -x555 -x554 
2.69/2.72	v -x553 -x552 -x551 -x550 -x549 -x548 -x547 -x546 -x545 -x544 -x543 -x542 -x541 -x540 -x539 -x538 -x537 -x536 -x535 -x534 -x533 
2.69/2.72	v -x532 -x531 -x530 -x529 -x528 -x527 -x526 -x525 -x524 -x523 -x522 -x521 -x520 -x519 -x518 -x517 -x516 -x515 -x514 -x513 -x512 
2.69/2.72	v -x511 -x510 -x509 x508 -x507 -x506 -x505 -x504 -x503 -x502 -x501 -x500 -x499 x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491 
2.69/2.72	v -x490 -x489 -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 -x472 -x471 -x470 
2.69/2.72	v -x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 x456 -x455 -x454 -x453 -x452 -x451 -x450 -x449 
2.69/2.72	v -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x440 -x439 x438 -x437 -x436 -x435 -x434 -x433 -x432 -x431 -x430 -x429 -x428 
2.69/2.72	v -x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 
2.69/2.72	v -x406 -x405 x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 
2.69/2.72	v -x385 -x384 x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 
2.69/2.72	v -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 
2.69/2.72	v -x343 -x342 x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 -x328 -x327 -x326 -x325 -x324 x323 
2.69/2.72	v -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 
2.69/2.72	v -x301 x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 
2.69/2.72	v -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 
2.69/2.72	v -x259 x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 
2.69/2.72	v -x238 x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 x221 -x220 -x219 -x218 
2.69/2.72	v -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 
2.69/2.72	v -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 
2.69/2.72	v -x176 -x175 -x174 -x173 -x172 -x171 x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 
2.69/2.72	v -x155 -x154 -x153 -x152 x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 
2.69/2.72	v -x134 x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 
2.69/2.72	v -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 
2.69/2.72	v -x90 -x89 -x88 x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 
2.69/2.72	v -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 
2.69/2.72	v -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 x17 -x16 
2.69/2.72	v -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1 
2.69/2.72	c SCIP Status        : problem is solved [optimal solution found]
2.69/2.72	c Solving Time       :       2.54
2.69/2.72	c Original Problem   :
2.69/2.72	c   Problem name     : HOME/instance-2664261-1276268855.opb
2.69/2.72	c   Variables        : 784 (784 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.72	c   Constraints      : 256 initial, 256 maximal
2.69/2.72	c Presolved Problem  :
2.69/2.72	c   Problem name     : t_HOME/instance-2664261-1276268855.opb
2.69/2.72	c   Variables        : 784 (784 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.72	c   Constraints      : 144 initial, 399 maximal
2.69/2.72	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.69/2.72	c   trivial          :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   implics          :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   knapsack         :       0.03          0          0          0          0          0          0          0          0
2.69/2.72	c   setppc           :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   linear           :       0.01          0          0          0          0          0        112          0          0
2.69/2.72	c   logicor          :       0.00          0          0          0          0          0          0          0          0
2.69/2.72	c   root node        :          -          0          -          -          0          -          -          -          -
2.69/2.72	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.69/2.72	c   integral         :          0          0          0          0          0          0          0          0          0          0
2.69/2.72	c   knapsack         :         32          0      10619          0       9295          6       4212          0          0          0
2.69/2.72	c   setppc           :        112          0      10612          0       9294        103      13833          0          0          0
2.69/2.72	c   logicor          :          0+         0       1232          0          0          0         92          0          0          0
2.69/2.72	c   countsols        :          0          0          0          0       9295          0          0          0          0          0
2.69/2.72	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.69/2.72	c   integral         :       0.00       0.00       0.00       0.00       0.00
2.69/2.72	c   knapsack         :       0.60       0.00       0.08       0.00       0.52
2.69/2.72	c   setppc           :       0.79       0.00       0.09       0.00       0.70
2.69/2.72	c   logicor          :       0.00       0.00       0.00       0.00       0.00
2.69/2.72	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.69/2.72	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.69/2.72	c   vbounds          :       0.00          1          0          0
2.69/2.72	c   rootredcost      :       0.00          0          0          0
2.69/2.72	c   pseudoobj        :       0.00          0          0          0
2.69/2.72	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.69/2.72	c   propagation      :       0.04        109        109        645      108.2         27       46.6          -
2.69/2.72	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.69/2.72	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.69/2.72	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.69/2.72	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.69/2.72	c   applied globally :          -          -          -        255       47.2          -          -          -
2.69/2.72	c   applied locally  :          -          -          -         21      114.1          -          -          -
2.69/2.72	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.69/2.72	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
2.69/2.72	c   redcost          :       0.00          0          0          0          0          0
2.69/2.72	c   impliedbounds    :       0.00          0          0          0          0          0
2.69/2.72	c   intobj           :       0.00          0          0          0          0          0
2.69/2.72	c   cgmip            :       0.00          0          0          0          0          0
2.69/2.72	c   gomory           :       0.00          0          0          0          0          0
2.69/2.72	c   strongcg         :       0.00          0          0          0          0          0
2.69/2.72	c   cmir             :       0.00          0          0          0          0          0
2.69/2.72	c   flowcover        :       0.00          0          0          0          0          0
2.69/2.72	c   clique           :       0.00          0          0          0          0          0
2.69/2.72	c   zerohalf         :       0.00          0          0          0          0          0
2.69/2.72	c   mcf              :       0.00          0          0          0          0          0
2.69/2.72	c   rapidlearning    :       0.00          0          0          0          0          0
2.69/2.72	c Pricers            :       Time      Calls       Vars
2.69/2.72	c   problem variables:       0.00          0          0
2.69/2.72	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.69/2.72	c   relpscost        :       0.00          0          0          0          0          0          0
2.69/2.72	c   pscost           :       0.00          0          0          0          0          0          0
2.69/2.72	c   inference        :       0.87       9294          0          0          0          0      18588
2.69/2.72	c   mostinf          :       0.00          0          0          0          0          0          0
2.69/2.72	c   leastinf         :       0.00          0          0          0          0          0          0
2.69/2.72	c   fullstrong       :       0.00          0          0          0          0          0          0
2.69/2.72	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.69/2.72	c   random           :       0.00          0          0          0          0          0          0
2.69/2.72	c Primal Heuristics  :       Time      Calls      Found
2.69/2.72	c   LP solutions     :       0.00          -          0
2.69/2.72	c   pseudo solutions :       0.01          -          1
2.69/2.72	c   trivial          :       0.00          1          0
2.69/2.72	c   simplerounding   :       0.00          0          0
2.69/2.72	c   zirounding       :       0.00          0          0
2.69/2.72	c   rounding         :       0.00          0          0
2.69/2.72	c   shifting         :       0.00          0          0
2.69/2.72	c   intshifting      :       0.00          0          0
2.69/2.72	c   oneopt           :       0.00          0          0
2.69/2.72	c   twoopt           :       0.00          0          0
2.69/2.72	c   fixandinfer      :       0.00          0          0
2.69/2.72	c   feaspump         :       0.00          0          0
2.69/2.72	c   coefdiving       :       0.00          0          0
2.69/2.72	c   pscostdiving     :       0.00          0          0
2.69/2.72	c   fracdiving       :       0.00          0          0
2.69/2.72	c   veclendiving     :       0.00          0          0
2.69/2.72	c   intdiving        :       0.00          0          0
2.69/2.72	c   actconsdiving    :       0.00          0          0
2.69/2.72	c   objpscostdiving  :       0.00          0          0
2.69/2.72	c   rootsoldiving    :       0.00          0          0
2.69/2.72	c   linesearchdiving :       0.00          0          0
2.69/2.72	c   guideddiving     :       0.00          0          0
2.69/2.72	c   octane           :       0.00          0          0
2.69/2.72	c   rens             :       0.00          0          0
2.69/2.72	c   rins             :       0.00          0          0
2.69/2.72	c   localbranching   :       0.00          0          0
2.69/2.72	c   mutation         :       0.00          0          0
2.69/2.72	c   crossover        :       0.00          0          0
2.69/2.72	c   dins             :       0.00          0          0
2.69/2.72	c   undercover       :       0.00          0          0
2.69/2.72	c   nlp              :       0.00          0          0
2.69/2.72	c   trysol           :       0.00          0          0
2.69/2.72	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.69/2.72	c   primal LP        :       0.00          0          0       0.00          -
2.69/2.72	c   dual LP          :       0.00          0          0       0.00          -
2.69/2.72	c   lex dual LP      :       0.00          0          0       0.00          -
2.69/2.72	c   barrier LP       :       0.00          0          0       0.00          -
2.69/2.72	c   diving/probing LP:       0.00          0          0       0.00          -
2.69/2.72	c   strong branching :       0.00          0          0       0.00          -
2.69/2.72	c     (at root node) :          -          0          0       0.00          -
2.69/2.72	c   conflict analysis:       0.00          0          0       0.00          -
2.69/2.72	c B&B Tree           :
2.69/2.72	c   number of runs   :          1
2.69/2.72	c   nodes            :       9367
2.69/2.72	c   nodes (total)    :       9367
2.69/2.72	c   nodes left       :          0
2.69/2.72	c   max depth        :        369
2.69/2.72	c   max depth (total):        369
2.69/2.72	c   backtracks       :         48 (0.5%)
2.69/2.72	c   delayed cutoffs  :         39
2.69/2.72	c   repropagations   :        415 (3590 domain reductions, 37 cutoffs)
2.69/2.72	c   avg switch length:       2.26
2.69/2.72	c   switching time   :       0.08
2.69/2.72	c Solution           :
2.69/2.72	c   Solutions found  :          1 (1 improvements)
2.69/2.72	c   First Solution   : +0.00000000000000e+00   (in run 1, after 9367 nodes, 2.53 seconds, depth 222, found by <relaxation>)
2.69/2.72	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 9367 nodes, 2.53 seconds, depth 222, found by <relaxation>)
2.69/2.72	c   Dual Bound       : +0.00000000000000e+00
2.69/2.72	c   Gap              :       0.00 %
2.69/2.72	c   Root Dual Bound  : +0.00000000000000e+00
2.69/2.72	c   Root Iterations  :          0
2.69/2.73	c Time complete: 2.72.

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-2664261-1276268855/watcher-2664261-1276268855 -o /tmp/evaluation-result-2664261-1276268855/solver-2664261-1276268855 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664261-1276268855.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.04 1.53 1.50 3/106 6082
/proc/meminfo: memFree=1477812/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=6584 CPUtime=0
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 1051 0 0 0 0 0 0 0 23 0 1 0 2486880 6742016 973 1992294400 4194304 7136930 140733651246016 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/6082/statm: 1646 981 254 719 0 925 0

[startup+0.034077 s]
/proc/loadavg: 1.04 1.53 1.50 3/106 6082
/proc/meminfo: memFree=1477812/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=10692 CPUtime=0.02
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 2501 0 0 0 2 0 0 0 23 0 1 0 2486880 10948608 2069 1992294400 4194304 7136930 140733651246016 18446744073709551615 6164672 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6082/statm: 2673 2084 291 719 0 1952 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 10692

[startup+0.101093 s]
/proc/loadavg: 1.04 1.53 1.50 3/106 6082
/proc/meminfo: memFree=1477812/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=14468 CPUtime=0.09
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 5131 0 0 0 8 1 0 0 18 0 1 0 2486880 14815232 2900 1992294400 4194304 7136930 140733651246016 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6082/statm: 3617 2900 381 719 0 2896 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 14468

[startup+0.301138 s]
/proc/loadavg: 1.04 1.53 1.50 3/106 6082
/proc/meminfo: memFree=1477812/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=14872 CPUtime=0.29
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 5242 0 0 0 26 3 0 0 18 0 1 0 2486880 15228928 3011 1992294400 4194304 7136930 140733651246016 18446744073709551615 5892363 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6082/statm: 3718 3011 387 719 0 2997 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 14872

[startup+0.701231 s]
/proc/loadavg: 1.04 1.53 1.50 3/106 6082
/proc/meminfo: memFree=1477812/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=15584 CPUtime=0.69
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 5424 0 0 0 64 5 0 0 18 0 1 0 2486880 15958016 3193 1992294400 4194304 7136930 140733651246016 18446744073709551615 4414503 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6082/statm: 3896 3193 387 719 0 3175 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 15584

[startup+1.50041 s]
/proc/loadavg: 1.04 1.52 1.50 2/107 6083
/proc/meminfo: memFree=1465404/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=17144 CPUtime=1.49
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 5805 0 0 0 141 8 0 0 19 0 1 0 2486880 17555456 3574 1992294400 4194304 7136930 140733651246016 18446744073709551615 5892378 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6082/statm: 4286 3574 387 719 0 3565 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 17144

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

[startup+2.3006 s]
/proc/loadavg: 1.04 1.52 1.50 2/107 6083
/proc/meminfo: memFree=1464164/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=18444 CPUtime=2.29
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 6142 0 0 0 217 12 0 0 21 0 1 0 2486880 18886656 3911 1992294400 4194304 7136930 140733651246016 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6082/statm: 4611 3911 387 719 0 3890 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 18444

[startup+2.70069 s]
/proc/loadavg: 1.04 1.52 1.50 2/107 6083
/proc/meminfo: memFree=1464164/2059040 swapFree=4192956/4192956
[pid=6082] ppid=6080 vsize=18716 CPUtime=2.69
/proc/6082/stat : 6082 (pbscip.linux.x8) R 6080 6082 5211 0 -1 4202496 6221 0 0 0 254 15 0 0 22 0 1 0 2486880 19165184 3990 1992294400 4194304 7136930 140733651246016 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/6082/statm: 4679 3990 387 719 0 3958 0
Current children cumulated CPU time (s) 2.69
Current children cumulated vsize (KiB) 18716

Child status: 0
Real time (s): 2.73336
CPU time (s): 2.73258
CPU user time (s): 2.57761
CPU system time (s): 0.154976
CPU usage (%): 99.9715
Max. virtual memory (cumulated for all children) (KiB): 18716

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

runsolver used 0.005999 second user time and 0.025996 second system time

The end

Launcher Data 

Begin job on node014 at 2010-06-11 17:07:35
IDJOB=2664261
IDBENCH=1152
IDSOLVER=1167
FILE ID=node014/2664261-1276268855
PBS_JOBID= 11172197
Free space on /tmp= 62460 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/prestwich/robin/normalized-robin8.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.none -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2664261-1276268855/watcher-2664261-1276268855 -o /tmp/evaluation-result-2664261-1276268855/solver-2664261-1276268855 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664261-1276268855.opb -t 1800 -m 1800

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

MD5SUM BENCH= b99d95db889fb1865f00b4b2c1a82fb3
RANDOM SEED=1304597383

node014.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.258
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.51
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.258
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	: 5599.54
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1478216 kB
Buffers:         50780 kB
Cached:         389200 kB
SwapCached:          0 kB
Active:         164488 kB
Inactive:       335356 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1478216 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            3624 kB
Writeback:           0 kB
AnonPages:       59792 kB
Mapped:          15376 kB
Slab:            59184 kB
PageTables:       4004 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181392 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= 62456 MiB
End job on node014 at 2010-06-11 17:07:38