Trace number 2666307

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 6.35003 6.35169

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_500_25_5_15.opb
MD5SUMb33a935d423c3fea7f6ee6702f232aa4
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 benchmark2.05069
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)31412
Sum of products size (including duplicates)62824
Number of different products15706
Sum of products size31412

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

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-2666307-1276679153/watcher-2666307-1276679153 -o /tmp/evaluation-result-2666307-1276679153/solver-2666307-1276679153 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666307-1276679153.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: 0.95 0.98 0.99 3/106 15297
/proc/meminfo: memFree=1753324/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=7872 CPUtime=0
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 1036 0 0 0 0 0 0 0 20 0 1 0 9207767 8060928 956 1992294400 4194304 8223781 140734159099472 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15297/statm: 1968 966 348 984 0 981 0

[startup+0.052404 s]
/proc/loadavg: 0.95 0.98 0.99 3/106 15297
/proc/meminfo: memFree=1753324/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=15288 CPUtime=0.04
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 3098 0 0 0 3 1 0 0 20 0 1 0 9207767 15654912 3018 1992294400 4194304 8223781 140734159099472 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15297/statm: 3822 3018 364 984 0 2835 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 15288

[startup+0.101409 s]
/proc/loadavg: 0.95 0.98 0.99 3/106 15297
/proc/meminfo: memFree=1753324/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=19068 CPUtime=0.09
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 4040 0 0 0 8 1 0 0 20 0 1 0 9207767 19525632 3960 1992294400 4194304 8223781 140734159099472 18446744073709551615 5650932 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15297/statm: 4767 3960 364 984 0 3780 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 19068

[startup+0.301431 s]
/proc/loadavg: 0.95 0.98 0.99 3/106 15297
/proc/meminfo: memFree=1753324/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=43544 CPUtime=0.29
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 10473 0 0 0 25 4 0 0 20 0 1 0 9207767 44589056 10029 1992294400 4194304 8223781 140734159099472 18446744073709551615 5953104 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15297/statm: 10886 10029 382 984 0 9899 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 43544

[startup+0.701475 s]
/proc/loadavg: 0.95 0.98 0.99 3/106 15297
/proc/meminfo: memFree=1753324/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=62092 CPUtime=0.69
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 15259 0 0 0 62 7 0 0 20 0 1 0 9207767 63582208 14462 1992294400 4194304 8223781 140734159099472 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15297/statm: 15523 14462 426 984 0 14536 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 62092

[startup+1.50156 s]
/proc/loadavg: 0.95 0.98 0.99 2/107 15298
/proc/meminfo: memFree=1690820/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=82588 CPUtime=1.49
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 22630 0 0 0 123 26 0 0 22 0 1 0 9207767 84570112 19510 1992294400 4194304 8223781 140734159099472 18446744073709551615 6032556 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15297/statm: 20647 19510 516 984 0 19660 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 82588

[startup+3.10074 s]
/proc/loadavg: 0.95 0.98 0.99 2/107 15298
/proc/meminfo: memFree=1631300/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=142620 CPUtime=3.09
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 91691 0 0 0 260 49 0 0 25 0 1 0 9207767 146042880 33297 1992294400 4194304 8223781 140734159099472 18446744073709551615 7253477 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/15297/statm: 35655 33311 584 984 0 34668 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 142620

[startup+6.30109 s]
/proc/loadavg: 0.95 0.98 0.99 2/107 15298
/proc/meminfo: memFree=1614188/2059040 swapFree=4192956/4192956
[pid=15297] ppid=15295 vsize=114936 CPUtime=6.29
/proc/15297/stat : 15297 (pbscip.linux.x8) R 15295 15297 14955 0 -1 4202496 175370 0 0 0 546 83 0 0 25 0 1 0 9207767 117694464 26396 1992294400 4194304 8223781 140734159099472 18446744073709551615 5953359 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/15297/statm: 28734 26396 612 984 0 27747 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 114936

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

Child status: 0
Real time (s): 6.35169
CPU time (s): 6.35003
CPU user time (s): 5.50116
CPU system time (s): 0.84887
CPU usage (%): 99.9739
Max. virtual memory (cumulated for all children) (KiB): 156500

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 5.50116
system time used= 0.84887
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 175378
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= 1
involuntary context switches= 11

runsolver used 0.011998 second user time and 0.041993 second system time

The end

Launcher Data 

Begin job on node042 at 2010-06-16 11:05:53
IDJOB=2666307
IDBENCH=48325
IDSOLVER=1169
FILE ID=node042/2666307-1276679153
PBS_JOBID= 11172555
Free space on /tmp= 62580 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_25_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-2666307-1276679153/watcher-2666307-1276679153 -o /tmp/evaluation-result-2666307-1276679153/solver-2666307-1276679153 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2666307-1276679153.opb -t 1800 -m 1800

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

MD5SUM BENCH= b33a935d423c3fea7f6ee6702f232aa4
RANDOM SEED=1577193505

node042.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.213
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.42
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.213
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.45
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1753852 kB
Buffers:         61244 kB
Cached:         119068 kB
SwapCached:          0 kB
Active:          95744 kB
Inactive:       143948 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1753852 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            5124 kB
Writeback:           0 kB
AnonPages:       59456 kB
Mapped:          15364 kB
Slab:            43760 kB
PageTables:       4032 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   183128 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= 62576 MiB
End job on node042 at 2010-06-16 11:05:59