Trace number 1884568

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
SCIPclp SCIP 1.1.0.7 with CLP 1.8.2SAT 0.352946 0.352575

General information on the benchmark

Name/PURE-SAT/SAT09/
CRAFTED/ramseycube/Q3inK08.opb
MD5SUM5c56a56b4fe6be286b693fbfdefb5f08
Bench CategoryPURE-SAT (instances containing only clauses)
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.022996
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables28
Total number of constraints1680
Number of constraints which are clauses1680
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint12
Maximum length of a constraint12
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 11
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 23
Number of bits of the biggest sum of numbers5
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.05	c SCIP version 1.1.0.7
0.00/0.05	c LP-Solver Clp 1.8.2
0.00/0.05	c user parameter file <scip.set> not found - using default parameters
0.00/0.05	c read problem <HOME/instance-1884568-1245259557.opb>
0.00/0.05	c original problem has 28 variables (28 bin, 0 int, 0 impl, 0 cont) and 1680 constraints
0.00/0.06	c No objective function, only one solution is needed.
0.00/0.06	c start presolving problem
0.00/0.06	c presolving:
0.07/0.09	c (round 1) 0 del vars, 840 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.09/0.10	c presolving (2 rounds):
0.09/0.10	c  0 deleted vars, 840 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.10	c  0 implications, 0 cliques
0.09/0.10	c presolved problem has 28 variables (28 bin, 0 int, 0 impl, 0 cont) and 840 constraints
0.09/0.10	c     840 constraints of type <linear>
0.09/0.10	c transformed objective value is always integral (scale: 1)
0.09/0.10	c Presolving Time: 0.04
0.09/0.10	c SATUNSAT-LIN
0.09/0.10	c -----------------------------------------------------------------------------------------------
0.09/0.10	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.10	c separating/flowcover/freq = c -1
0.09/0.10	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.10	c separating/cmir/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.10	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.10	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/veclendiving/freq = c -1
0.09/0.10	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.10	c heuristics/simplerounding/freq = c -1
0.09/0.10	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/shifting/freq = c -1
0.09/0.10	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.10	c heuristics/rounding/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.10	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.10	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.10	c heuristics/rootsoldiving/freq = c -1
0.09/0.10	c # number of nodes added to the contingent of the total nodes
0.09/0.10	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.10	c heuristics/rens/nodesofs = c 2000
0.09/0.10	c # minimum percentage of integer variables that have to be fixable 
0.09/0.10	c # [type: real, range: [0,1], default: 0.5]
0.09/0.10	c heuristics/rens/minfixingrate = c 0.3
0.09/0.10	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.10	c heuristics/rens/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.10	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.10	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/pscostdiving/freq = c -1
0.09/0.10	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.10	c heuristics/oneopt/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.10	c # [type: real, range: [0,1], default: 0.01]
0.09/0.10	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.10	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.10	c heuristics/objpscostdiving/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.10	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.10	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/linesearchdiving/freq = c -1
0.09/0.10	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/intshifting/freq = c -1
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.10	c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.10	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.10	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/guideddiving/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.10	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.10	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/fracdiving/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.10	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.10	c heuristics/feaspump/freq = c -1
0.09/0.10	c # minimum percentage of integer variables that have to be fixed 
0.09/0.10	c # [type: real, range: [0,1], default: 0.666]
0.09/0.10	c heuristics/crossover/minfixingrate = c 0.5
0.09/0.10	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.10	c # [type: real, range: [0,1], default: 0.1]
0.09/0.10	c heuristics/crossover/nodesquot = c 0.15
0.09/0.10	c # number of nodes without incumbent change that heuristic should wait
0.09/0.10	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.10	c heuristics/crossover/nwaitingnodes = c 100
0.09/0.10	c # number of nodes added to the contingent of the total nodes
0.09/0.10	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.10	c heuristics/crossover/nodesofs = c 750
0.09/0.10	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.10	c heuristics/crossover/freq = c -1
0.09/0.10	c # additional number of allowed LP iterations
0.09/0.10	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.10	c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.10	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.10	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.10	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.10	c heuristics/coefdiving/freq = c -1
0.09/0.10	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.10	c presolving/probing/maxrounds = c 0
0.09/0.10	c # should presolving try to simplify knapsacks
0.09/0.10	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10	c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.10	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.10	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.10	c constraints/knapsack/disaggregation = c FALSE
0.09/0.10	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.10	c constraints/knapsack/maxnumcardlift = c 0
0.09/0.10	c # should presolving try to simplify inequalities
0.09/0.10	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.10	c constraints/linear/simplifyinequalities = c TRUE
0.09/0.10	c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.10	c separating/maxroundsroot = c 5
0.09/0.10	c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.10	c separating/maxrounds = c 1
0.09/0.10	c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.10	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.10	c limits/solutions = c 1
0.09/0.10	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.10	c limits/memory = c 1620
0.09/0.10	c # maximal time in seconds to run
0.09/0.10	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.10	c limits/time = c 1791
0.09/0.10	c # frequency for displaying node information lines
0.09/0.10	c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.10	c display/freq = c 10000
0.09/0.10	c -----------------------------------------------------------------------------------------------
0.09/0.10	c start solving problem
0.09/0.10	c 
0.09/0.12	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.09/0.12	c   0.1s|     1 |     0 |    25 |2859k|   0 |   7 |  28 | 840 | 840 |  28 | 840 |   0 |   0 |   0 | 2.333333e+00 |      --      |    Inf 
0.09/0.19	c   0.1s|     1 |     2 |    25 |2880k|   0 |   7 |  28 | 840 | 840 |  28 | 840 |   0 |   0 |   7 | 2.333333e+00 |      --      |    Inf 
0.29/0.33	c * 0.3s|     5 |     3 |   128 |2890k|   4 |   - |  28 | 840 | 840 |  28 | 840 |   0 |   0 |  22 | 2.333333e+00 | 5.000000e+00 | 114.29%
0.29/0.33	c 
0.29/0.33	c SCIP Status        : solving was interrupted [solution limit reached]
0.29/0.33	c Solving Time (sec) : 0.26
0.29/0.33	c Solving Nodes      : 5
0.29/0.33	c Primal Bound       : +5.00000000000000e+00 (1 solutions)
0.29/0.33	c Dual Bound         : +2.33333333333334e+00
0.29/0.33	c Gap                : 114.29 %
0.29/0.33	c NODE         5
0.29/0.33	c DUAL BOUND   2.33333
0.29/0.33	c PRIMAL BOUND 5
0.29/0.33	c GAP          1.14286
0.29/0.33	s SATISFIABLE
0.29/0.33	v -x7 -x12 -x6 -x26 x5 -x19 -x20 -x25 -x15 -x10 -x13 x16 -x18 -x21 -x8 -x3 -x28 x27 -x24 x23 -x22 -x17 -x14 x11 -x9 -x4 -x2 -x1 
0.29/0.33	c SCIP Status        : solving was interrupted [solution limit reached]
0.29/0.33	c Solving Time       :       0.26
0.29/0.33	c Original Problem   :
0.29/0.33	c   Problem name     : HOME/instance-1884568-1245259557.opb
0.29/0.33	c   Variables        : 28 (28 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33	c   Constraints      : 1680 initial, 1680 maximal
0.29/0.33	c Presolved Problem  :
0.29/0.33	c   Problem name     : t_HOME/instance-1884568-1245259557.opb
0.29/0.33	c   Variables        : 28 (28 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.33	c   Constraints      : 840 initial, 840 maximal
0.29/0.33	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.29/0.33	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.29/0.33	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.29/0.33	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.29/0.33	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.29/0.33	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.29/0.33	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.29/0.33	c   linear           :       0.04          0          0          0          0          0        840          0          0
0.29/0.33	c   root node        :          -          0          -          -          0          -          -          -          -
0.29/0.33	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.29/0.33	c   integral         :          0          0          0          5          0          0          0          0          0          8
0.29/0.33	c   linear           :        840          1          5          1          0          0          0          0          0          0
0.29/0.33	c   countsols        :          0          0          0          1          0          0          0          0          0          0
0.29/0.33	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.29/0.33	c   integral         :       0.18       0.00       0.00       0.18       0.00
0.29/0.33	c   linear           :       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.29/0.33	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.29/0.33	c   rootredcost      :       0.00          0          0          0
0.29/0.33	c   pseudoobj        :       0.00          6          0          0
0.29/0.33	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.29/0.33	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.29/0.33	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.33	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.33	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.33	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.29/0.33	c   applied globally :          -          -          -          0        0.0          -          -          -
0.29/0.33	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.29/0.33	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.29/0.33	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.29/0.33	c   redcost          :       0.00          5          0          0          0          0
0.29/0.33	c   impliedbounds    :       0.00          1          0          0          0          0
0.29/0.33	c   intobj           :       0.00          0          0          0          0          0
0.29/0.34	c   gomory           :       0.00          1          0          0          0          0
0.29/0.34	c   strongcg         :       0.00          1          0          0          0          0
0.29/0.34	c   cmir             :       0.00          0          0          0          0          0
0.29/0.34	c   flowcover        :       0.00          0          0          0          0          0
0.29/0.34	c   clique           :       0.00          1          0          0          0          0
0.29/0.34	c   zerohalf         :       0.00          0          0          0          0          0
0.29/0.34	c   mcf              :       0.00          1          0          0          0          0
0.29/0.34	c Pricers            :       Time      Calls       Vars
0.29/0.34	c   problem variables:       0.00          0          0
0.29/0.34	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.29/0.34	c   relpscost        :       0.18          4          0          0          0          0          8
0.29/0.34	c   pscost           :       0.00          0          0          0          0          0          0
0.29/0.34	c   inference        :       0.00          0          0          0          0          0          0
0.29/0.34	c   mostinf          :       0.00          0          0          0          0          0          0
0.29/0.34	c   leastinf         :       0.00          0          0          0          0          0          0
0.29/0.34	c   fullstrong       :       0.00          0          0          0          0          0          0
0.29/0.34	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.29/0.34	c   random           :       0.00          0          0          0          0          0          0
0.29/0.34	c Primal Heuristics  :       Time      Calls      Found
0.29/0.34	c   LP solutions     :       0.00          -          1
0.29/0.34	c   pseudo solutions :       0.00          -          0
0.29/0.34	c   simplerounding   :       0.00          0          0
0.29/0.34	c   rounding         :       0.00          0          0
0.29/0.34	c   shifting         :       0.00          0          0
0.29/0.34	c   intshifting      :       0.00          0          0
0.29/0.34	c   oneopt           :       0.00          0          0
0.29/0.34	c   fixandinfer      :       0.00          0          0
0.29/0.34	c   feaspump         :       0.00          0          0
0.29/0.34	c   coefdiving       :       0.00          0          0
0.29/0.34	c   pscostdiving     :       0.00          0          0
0.29/0.34	c   fracdiving       :       0.00          0          0
0.29/0.34	c   veclendiving     :       0.00          0          0
0.29/0.34	c   intdiving        :       0.00          0          0
0.29/0.34	c   actconsdiving    :       0.00          0          0
0.29/0.34	c   objpscostdiving  :       0.00          0          0
0.29/0.34	c   rootsoldiving    :       0.00          0          0
0.29/0.34	c   linesearchdiving :       0.00          0          0
0.29/0.34	c   guideddiving     :       0.00          0          0
0.29/0.34	c   octane           :       0.00          0          0
0.29/0.34	c   rens             :       0.00          0          0
0.29/0.34	c   rins             :       0.00          0          0
0.29/0.34	c   localbranching   :       0.00          0          0
0.29/0.34	c   mutation         :       0.00          0          0
0.29/0.34	c   crossover        :       0.00          0          0
0.29/0.34	c   dins             :       0.00          0          0
0.29/0.34	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.29/0.34	c   primal LP        :       0.00          0          0       0.00          -
0.29/0.34	c   dual LP          :       0.03          5        128      25.60    4266.67
0.29/0.34	c   barrier LP       :       0.00          0          0       0.00          -
0.29/0.34	c   diving/probing LP:       0.00          0          0       0.00          -
0.29/0.34	c   strong branching :       0.18         22        764      34.73    4244.44
0.29/0.34	c     (at root node) :          -          7        220      31.43          -
0.29/0.34	c   conflict analysis:       0.00          0          0       0.00          -
0.29/0.34	c B&B Tree           :
0.29/0.34	c   number of runs   :          1
0.29/0.34	c   nodes            :          5
0.29/0.34	c   nodes (total)    :          5
0.29/0.34	c   nodes left       :          3
0.29/0.34	c   max depth        :          4
0.29/0.34	c   max depth (total):          4
0.29/0.34	c   backtracks       :          0 (0.0%)
0.29/0.34	c   delayed cutoffs  :          0
0.29/0.34	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.29/0.34	c   avg switch length:       1.00
0.29/0.34	c   switching time   :       0.00
0.29/0.34	c Solution           :
0.29/0.34	c   Solutions found  :          1 (1 improvements)
0.29/0.34	c   Primal Bound     : +5.00000000000000e+00   (in run 1, after 5 nodes, 0.26 seconds, depth 4, found by <relaxation>)
0.29/0.34	c   Dual Bound       : +2.33333333333334e+00
0.29/0.34	c   Gap              :     114.29 %
0.29/0.34	c   Root Dual Bound  : +2.33333333333333e+00
0.29/0.35	c Time complete: 0.35.

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-1884568-1245259557/watcher-1884568-1245259557 -o /tmp/evaluation-result-1884568-1245259557/solver-1884568-1245259557 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884568-1245259557.opb 

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.99 0.97 0.91 3/64 6430
/proc/meminfo: memFree=1813176/2055920 swapFree=4181552/4192956
[pid=6430] ppid=6428 vsize=5812 CPUtime=0
/proc/6430/stat : 6430 (pbscip.linux.x8) R 6428 6430 6296 0 -1 4194304 516 0 0 0 0 0 0 0 18 0 1 0 193555789 5951488 500 1992294400 4194304 9342243 548682068736 18446744073709551615 8223232 0 0 4096 0 0 0 0 17 1 0 0
/proc/6430/statm: 1453 501 332 1256 0 192 0

[startup+0.0723059 s]
/proc/loadavg: 0.99 0.97 0.91 3/64 6430
/proc/meminfo: memFree=1813176/2055920 swapFree=4181552/4192956
[pid=6430] ppid=6428 vsize=17808 CPUtime=0.07
/proc/6430/stat : 6430 (pbscip.linux.x8) R 6428 6430 6296 0 -1 4194304 3586 0 0 0 6 1 0 0 18 0 1 0 193555789 18235392 3216 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/6430/statm: 4452 3216 454 1256 0 3191 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 17808

[startup+0.101307 s]
/proc/loadavg: 0.99 0.97 0.91 3/64 6430
/proc/meminfo: memFree=1813176/2055920 swapFree=4181552/4192956
[pid=6430] ppid=6428 vsize=19868 CPUtime=0.09
/proc/6430/stat : 6430 (pbscip.linux.x8) R 6428 6430 6296 0 -1 4194304 4103 0 0 0 8 1 0 0 18 0 1 0 193555789 20344832 3733 1992294400 4194304 9342243 548682068736 18446744073709551615 4401518 0 0 4096 16384 0 0 0 17 1 0 0
/proc/6430/statm: 4967 3733 457 1256 0 3706 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 19868

[startup+0.301328 s]
/proc/loadavg: 0.99 0.97 0.91 3/64 6430
/proc/meminfo: memFree=1813176/2055920 swapFree=4181552/4192956
[pid=6430] ppid=6428 vsize=24592 CPUtime=0.29
/proc/6430/stat : 6430 (pbscip.linux.x8) R 6428 6430 6296 0 -1 4194304 5260 0 0 0 27 2 0 0 18 0 1 0 193555789 25182208 4393 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/6430/statm: 6148 4393 630 1256 0 4887 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 24592

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

Child status: 0
Real time (s): 0.352575
CPU time (s): 0.352946
CPU user time (s): 0.320951
CPU system time (s): 0.031995
CPU usage (%): 100.105
Max. virtual memory (cumulated for all children) (KiB): 25456

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

runsolver used 0.004999 second user time and 0.006998 second system time

The end

Launcher Data 

Begin job on node19 at 2009-06-17 19:25:57
IDJOB=1884568
IDBENCH=71970
IDSOLVER=684
FILE ID=node19/1884568-1245259557
PBS_JOBID= 9372434
Free space on /tmp= 66136 MiB

SOLVER NAME= SCIPclp SCIP 1.1.0.7 with CLP 1.8.2
BENCH NAME= PB09/normalized-PB09/PURE-SAT/SAT09/CRAFTED/ramseycube/Q3inK08.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-1884568-1245259557/watcher-1884568-1245259557 -o /tmp/evaluation-result-1884568-1245259557/solver-1884568-1245259557 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1884568-1245259557.opb

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

MD5SUM BENCH= 5c56a56b4fe6be286b693fbfdefb5f08
RANDOM SEED=2043071061

node19.alineos.net Linux 2.6.9-22.EL.rootsmp #1 SMP Mon Oct 3 08:59:52 CEST 2005

/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.234
cache size	: 2048 KB
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 pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5914.62
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.234
cache size	: 2048 KB
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 pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5586.94
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2055920 kB
MemFree:       1813656 kB
Buffers:         39572 kB
Cached:         137384 kB
SwapCached:       6236 kB
Active:          43336 kB
Inactive:       142524 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1813656 kB
SwapTotal:     4192956 kB
SwapFree:      4181552 kB
Dirty:           11872 kB
Writeback:           0 kB
Mapped:          13636 kB
Slab:            42260 kB
Committed_AS:   212836 kB
PageTables:       1456 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264952 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66124 MiB
End job on node19 at 2009-06-17 19:25:57