Trace number 2665829

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.2.1.2 with Clp 1.11.1 (Release Version) as LP solverSAT 2.6416 2.64265

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
namasivayam/tsp/normalized-t3002.11tsp11.1900564822.opb
MD5SUMf89b9c55daed76b61e2a82c59790b13b
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.023995
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables231
Total number of constraints2707
Number of constraints which are clauses2684
Number of constraints which are cardinality constraints (but not clauses)22
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint110
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 25
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 609
Number of bits of the biggest sum of numbers10
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: Clp 1.11.1] [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-2665829-1276289777.opb>
0.00/0.05	c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05	c problem read
0.00/0.05	c No objective function, only one solution is needed.
0.00/0.05	c presolving settings loaded
0.00/0.07	c presolving:
0.09/0.12	c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13	c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.14	c presolving (3 rounds):
0.09/0.14	c  0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.14	c  242 implications, 22 cliques
0.09/0.14	c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.14	c       1 constraints of type <knapsack>
0.09/0.14	c      22 constraints of type <setppc>
0.09/0.14	c    2541 constraints of type <logicor>
0.09/0.14	c transformed objective value is always integral (scale: 1)
0.09/0.14	c Presolving Time: 0.07
0.09/0.14	c - non default parameters ----------------------------------------------------------------------
0.09/0.14	c # SCIP version 1.2.1.2
0.09/0.14	c 
0.09/0.14	c # frequency for displaying node information lines
0.09/0.14	c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14	c display/freq = 10000
0.09/0.14	c 
0.09/0.14	c # maximal time in seconds to run
0.09/0.14	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14	c limits/time = 1799.95
0.09/0.14	c 
0.09/0.14	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14	c limits/memory = 1620
0.09/0.14	c 
0.09/0.14	c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14	c limits/solutions = 1
0.09/0.14	c 
0.09/0.14	c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.14	c separating/maxrounds = 1
0.09/0.14	c 
0.09/0.14	c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14	c separating/maxroundsroot = 5
0.09/0.14	c 
0.09/0.14	c # should presolving try to simplify inequalities
0.09/0.14	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14	c constraints/linear/simplifyinequalities = TRUE
0.09/0.14	c 
0.09/0.14	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.14	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.14	c constraints/knapsack/disaggregation = FALSE
0.09/0.14	c 
0.09/0.14	c # should presolving try to simplify knapsacks
0.09/0.14	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14	c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.14	c 
0.09/0.14	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14	c presolving/probing/maxrounds = 0
0.09/0.14	c 
0.09/0.14	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14	c heuristics/coefdiving/freq = -1
0.09/0.14	c 
0.09/0.14	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14	c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.14	c 
0.09/0.14	c # additional number of allowed LP iterations
0.09/0.14	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14	c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.14	c 
0.09/0.14	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.14	c heuristics/crossover/freq = -1
0.09/0.14	c 
0.09/0.14	c # number of nodes added to the contingent of the total nodes
0.09/0.14	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14	c heuristics/crossover/nodesofs = 750
0.09/0.14	c 
0.09/0.14	c # number of nodes without incumbent change that heuristic should wait
0.09/0.14	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.14	c heuristics/crossover/nwaitingnodes = 100
0.09/0.14	c 
0.09/0.14	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.14	c # [type: real, range: [0,1], default: 0.1]
0.09/0.14	c heuristics/crossover/nodesquot = 0.15
0.09/0.14	c 
0.09/0.14	c # minimum percentage of integer variables that have to be fixed 
0.09/0.14	c # [type: real, range: [0,1], default: 0.666]
0.09/0.14	c heuristics/crossover/minfixingrate = 0.5
0.09/0.14	c 
0.09/0.14	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14	c heuristics/feaspump/freq = -1
0.09/0.14	c 
0.09/0.14	c # additional number of allowed LP iterations
0.09/0.14	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14	c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.14	c 
0.09/0.14	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14	c heuristics/fracdiving/freq = -1
0.09/0.14	c 
0.09/0.14	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14	c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.14	c 
0.09/0.14	c # additional number of allowed LP iterations
0.09/0.14	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14	c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.14	c 
0.09/0.14	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.14	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14	c heuristics/guideddiving/freq = -1
0.09/0.14	c 
0.09/0.14	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14	c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.14	c 
0.09/0.14	c # additional number of allowed LP iterations
0.09/0.14	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14	c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15	c 
0.09/0.15	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15	c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15	c heuristics/intshifting/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15	c heuristics/linesearchdiving/freq = -1
0.09/0.15	c 
0.09/0.15	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15	c 
0.09/0.15	c # additional number of allowed LP iterations
0.09/0.15	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15	c heuristics/nlp/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15	c heuristics/objpscostdiving/freq = -1
0.09/0.15	c 
0.09/0.15	c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15	c # [type: real, range: [0,1], default: 0.01]
0.09/0.15	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15	c 
0.09/0.15	c # additional number of allowed LP iterations
0.09/0.15	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15	c heuristics/oneopt/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15	c heuristics/pscostdiving/freq = -1
0.09/0.15	c 
0.09/0.15	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15	c 
0.09/0.15	c # additional number of allowed LP iterations
0.09/0.15	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15	c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15	c heuristics/rens/freq = -1
0.09/0.15	c 
0.09/0.15	c # minimum percentage of integer variables that have to be fixable 
0.09/0.15	c # [type: real, range: [0,1], default: 0.5]
0.09/0.15	c heuristics/rens/minfixingrate = 0.3
0.09/0.15	c 
0.09/0.15	c # number of nodes added to the contingent of the total nodes
0.09/0.15	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15	c heuristics/rens/nodesofs = 2000
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15	c heuristics/rootsoldiving/freq = -1
0.09/0.15	c 
0.09/0.15	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15	c 
0.09/0.15	c # additional number of allowed LP iterations
0.09/0.15	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15	c heuristics/rounding/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15	c heuristics/shifting/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15	c heuristics/simplerounding/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15	c heuristics/trivial/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15	c heuristics/trysol/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15	c heuristics/veclendiving/freq = -1
0.09/0.15	c 
0.09/0.15	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15	c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15	c 
0.09/0.15	c # additional number of allowed LP iterations
0.09/0.15	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15	c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15	c 
0.09/0.15	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15	c heuristics/zirounding/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15	c separating/cmir/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15	c separating/flowcover/freq = -1
0.09/0.15	c 
0.09/0.15	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15	c separating/rapidlearning/freq = 0
0.09/0.15	c 
0.09/0.15	c -----------------------------------------------------------------------------------------------
0.09/0.15	c start solving
0.09/0.15	c 
0.09/0.17	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.09/0.17	c   0.1s|     1 |     0 |    70 |     - |3551k|   0 |  29 | 231 |2564 | 231 |2564 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.52	c   0.4s|     1 |     0 |    95 |     - |4057k|   0 |  46 | 231 |2745 | 231 |2571 |   7 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.79/0.82	c   0.7s|     1 |     0 |   464 |     - |4762k|   0 |  63 | 231 |2745 | 231 |2575 |  11 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.10/1.19	c   1.1s|     1 |     0 |   575 |     - |5071k|   0 |  74 | 231 |2745 | 231 |2580 |  16 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
1.99/2.04	c   1.9s|     1 |     0 |  1614 |     - |5074k|   0 |  62 | 231 |2745 | 231 |2581 |  17 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.59/2.62	c   2.5s|     1 |     0 |  2172 |     - |5622k|   0 |   0 | 231 |2745 | 231 |2584 |  20 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
2.59/2.62	c * 2.5s|     1 |     0 |  2172 |     - |5626k|   0 |   - | 231 |2745 | 231 |2584 |  20 |   0 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
2.59/2.62	c 
2.59/2.62	c SCIP Status        : problem is solved [optimal solution found]
2.59/2.62	c Solving Time (sec) : 2.48
2.59/2.62	c Solving Nodes      : 1
2.59/2.62	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
2.59/2.62	c Dual Bound         : +0.00000000000000e+00
2.59/2.62	c Gap                : 0.00 %
2.59/2.62	s SATISFIABLE
2.59/2.62	v -x221 -x211 -x201 -x191 -x181 -x171 x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220 
2.59/2.62	v -x199 -x189 -x179 x169 -x159 -x149 -x139 -x129 x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 x208 
2.59/2.62	v -x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196 
2.59/2.62	v -x186 -x176 -x155 x145 -x135 -x125 -x225 -x215 -x205 -x195 -x185 -x175 -x165 -x144 -x134 x124 -x224 -x214 -x204 -x194 -x184 
2.59/2.62	v -x174 -x164 -x154 x133 -x123 -x223 -x213 -x203 x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 x212 -x202 -x192 -x182 -x172 -x162 
2.59/2.62	v -x152 -x142 -x132 -x121 -x120 -x119 -x118 x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106 -x105 -x104 
2.59/2.62	v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 x80 
2.59/2.62	v -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 x55 -x54 
2.59/2.62	v -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 
2.59/2.62	v -x28 -x27 -x26 -x25 -x24 x23 -x22 -x11 x21 -x10 -x20 -x9 -x19 -x8 -x18 -x7 -x17 x6 -x16 -x5 -x15 -x4 -x14 -x3 -x13 -x2 -x12 
2.59/2.62	v -x1 
2.59/2.62	c SCIP Status        : problem is solved [optimal solution found]
2.59/2.62	c Solving Time       :       2.48
2.59/2.62	c Original Problem   :
2.59/2.62	c   Problem name     : HOME/instance-2665829-1276289777.opb
2.59/2.62	c   Variables        : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.62	c   Constraints      : 2707 initial, 2707 maximal
2.59/2.62	c Presolved Problem  :
2.59/2.62	c   Problem name     : t_HOME/instance-2665829-1276289777.opb
2.59/2.62	c   Variables        : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.62	c   Constraints      : 2564 initial, 2745 maximal
2.59/2.62	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.59/2.62	c   trivial          :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   implics          :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   setppc           :       0.00          0          0          0          0          0          0          0          0
2.59/2.62	c   linear           :       0.04          0          0          0          0          0        143          0          0
2.59/2.62	c   logicor          :       0.02          0          0          0          0          0          0          0          0
2.59/2.62	c   root node        :          -          0          -          -          0          -          -          -          -
2.59/2.62	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.59/2.62	c   integral         :          0          0          0          1          0          0          0          0          0          0
2.59/2.62	c   knapsack         :          1          5          1          1          0          0          0          0          0          0
2.59/2.62	c   setppc           :         22          5          1          1          0          0          0          0          0          0
2.59/2.62	c   linear           :          0+         5          0          0          0          0          0          8          0          0
2.59/2.62	c   logicor          :       2541          5          1          1          0          0          0          0          0          0
2.59/2.62	c   countsols        :          0          0          0          1          0          0          0          0          0          0
2.59/2.62	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.59/2.62	c   integral         :       0.00       0.00       0.00       0.00       0.00
2.59/2.62	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
2.59/2.62	c   setppc           :       0.00       0.00       0.00       0.00       0.00
2.59/2.62	c   linear           :       0.00       0.00       0.00       0.00       0.00
2.59/2.62	c   logicor          :       0.00       0.00       0.00       0.00       0.00
2.59/2.62	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.59/2.62	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.59/2.62	c   vbounds          :       0.00          1          0          0
2.59/2.62	c   rootredcost      :       0.00          0          0          0
2.59/2.62	c   pseudoobj        :       0.00          0          0          0
2.59/2.62	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.59/2.62	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
2.59/2.62	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
2.59/2.62	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.59/2.62	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.59/2.62	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.59/2.62	c   applied globally :          -          -          -          0        0.0          -          -          -
2.59/2.62	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.59/2.62	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.59/2.62	c   cut pool         :       0.00          4          -          -         14          -    (maximal pool size: 595)
2.59/2.62	c   redcost          :       0.00          5          0          0          0          0
2.59/2.62	c   impliedbounds    :       0.00          5          0          0          0          0
2.59/2.62	c   intobj           :       0.00          0          0          0          0          0
2.59/2.62	c   cgmip            :       0.00          0          0          0          0          0
2.59/2.62	c   gomory           :       0.60          5          0          0       1000          0
2.59/2.62	c   strongcg         :       0.56          5          0          0       1680          0
2.59/2.62	c   cmir             :       0.00          0          0          0          0          0
2.59/2.62	c   flowcover        :       0.00          0          0          0          0          0
2.59/2.62	c   clique           :       0.00          5          0          0          0          0
2.59/2.62	c   zerohalf         :       0.00          0          0          0          0          0
2.59/2.62	c   mcf              :       0.01          1          0          0          0          0
2.59/2.62	c   rapidlearning    :       0.21          1          0          0          0        181
2.59/2.62	c Pricers            :       Time      Calls       Vars
2.59/2.62	c   problem variables:       0.00          0          0
2.59/2.62	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.59/2.62	c   pscost           :       0.00          0          0          0          0          0          0
2.59/2.62	c   inference        :       0.00          0          0          0          0          0          0
2.59/2.62	c   mostinf          :       0.00          0          0          0          0          0          0
2.59/2.62	c   leastinf         :       0.00          0          0          0          0          0          0
2.59/2.62	c   fullstrong       :       0.00          0          0          0          0          0          0
2.59/2.62	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.59/2.62	c   random           :       0.00          0          0          0          0          0          0
2.59/2.62	c   relpscost        :       0.00          0          0          0          0          0          0
2.59/2.62	c Primal Heuristics  :       Time      Calls      Found
2.59/2.62	c   LP solutions     :       0.00          -          1
2.59/2.62	c   pseudo solutions :       0.00          -          0
2.59/2.62	c   trivial          :       0.00          1          0
2.59/2.62	c   simplerounding   :       0.00          0          0
2.59/2.62	c   zirounding       :       0.00          0          0
2.59/2.62	c   rounding         :       0.00          0          0
2.59/2.62	c   shifting         :       0.00          0          0
2.59/2.62	c   intshifting      :       0.00          0          0
2.59/2.62	c   oneopt           :       0.00          0          0
2.59/2.62	c   twoopt           :       0.00          0          0
2.59/2.62	c   fixandinfer      :       0.00          0          0
2.59/2.62	c   feaspump         :       0.00          0          0
2.59/2.62	c   coefdiving       :       0.00          0          0
2.59/2.62	c   pscostdiving     :       0.00          0          0
2.59/2.62	c   fracdiving       :       0.00          0          0
2.59/2.62	c   veclendiving     :       0.00          0          0
2.59/2.62	c   intdiving        :       0.00          0          0
2.59/2.62	c   actconsdiving    :       0.00          0          0
2.59/2.62	c   objpscostdiving  :       0.00          0          0
2.59/2.62	c   rootsoldiving    :       0.00          0          0
2.59/2.62	c   linesearchdiving :       0.00          0          0
2.59/2.62	c   guideddiving     :       0.00          0          0
2.59/2.62	c   octane           :       0.00          0          0
2.59/2.62	c   rens             :       0.00          0          0
2.59/2.62	c   rins             :       0.00          0          0
2.59/2.62	c   localbranching   :       0.00          0          0
2.59/2.62	c   mutation         :       0.00          0          0
2.59/2.62	c   crossover        :       0.00          0          0
2.59/2.62	c   dins             :       0.00          0          0
2.59/2.62	c   undercover       :       0.00          0          0
2.59/2.62	c   nlp              :       0.00          0          0
2.59/2.62	c   trysol           :       0.00          0          0
2.59/2.62	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.59/2.62	c   primal LP        :       0.00          0          0       0.00          -
2.59/2.62	c   dual LP          :       1.02          6       2172     362.00    2129.41
2.59/2.62	c   lex dual LP      :       0.00          0          0       0.00          -
2.59/2.62	c   barrier LP       :       0.00          0          0       0.00          -
2.59/2.62	c   diving/probing LP:       0.00          0          0       0.00          -
2.59/2.62	c   strong branching :       0.00          0          0       0.00          -
2.59/2.62	c     (at root node) :          -          0          0       0.00          -
2.59/2.62	c   conflict analysis:       0.00          0          0       0.00          -
2.59/2.62	c B&B Tree           :
2.59/2.62	c   number of runs   :          1
2.59/2.62	c   nodes            :          1
2.59/2.62	c   nodes (total)    :          1
2.59/2.62	c   nodes left       :          0
2.59/2.62	c   max depth        :          0
2.59/2.62	c   max depth (total):          0
2.59/2.62	c   backtracks       :          0 (0.0%)
2.59/2.62	c   delayed cutoffs  :          0
2.59/2.62	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
2.59/2.62	c   avg switch length:       2.00
2.59/2.62	c   switching time   :       0.00
2.59/2.62	c Solution           :
2.59/2.62	c   Solutions found  :          1 (1 improvements)
2.59/2.62	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1 nodes, 2.48 seconds, depth 0, found by <relaxation>)
2.59/2.62	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1 nodes, 2.48 seconds, depth 0, found by <relaxation>)
2.59/2.62	c   Dual Bound       : +0.00000000000000e+00
2.59/2.62	c   Gap              :       0.00 %
2.59/2.62	c   Root Dual Bound  : +0.00000000000000e+00
2.59/2.62	c   Root Iterations  :       2172
2.59/2.64	c Time complete: 2.63.

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-2665829-1276289777/watcher-2665829-1276289777 -o /tmp/evaluation-result-2665829-1276289777/solver-2665829-1276289777 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665829-1276289777.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.38 1.10 1.02 3/106 5881
/proc/meminfo: memFree=1553868/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=9288 CPUtime=0
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 1175 0 0 0 0 0 0 0 21 0 1 0 2629525 9510912 1101 1992294400 4194304 9819077 140737439139696 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/5881/statm: 2322 1111 371 1374 0 943 0

[startup+0.093972 s]
/proc/loadavg: 1.38 1.10 1.02 3/106 5881
/proc/meminfo: memFree=1553868/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=17184 CPUtime=0.08
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 3688 0 0 0 7 1 0 0 18 0 1 0 2629525 17596416 2997 1992294400 4194304 9819077 140737439139696 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 4296 2997 487 1374 0 2917 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 17184

[startup+0.100974 s]
/proc/loadavg: 1.38 1.10 1.02 3/106 5881
/proc/meminfo: memFree=1553868/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=17480 CPUtime=0.09
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 3768 0 0 0 8 1 0 0 18 0 1 0 2629525 17899520 3077 1992294400 4194304 9819077 140737439139696 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 4406 3084 489 1374 0 3027 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17480

[startup+0.301015 s]
/proc/loadavg: 1.38 1.10 1.02 3/106 5881
/proc/meminfo: memFree=1553868/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=36996 CPUtime=0.29
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 10872 0 0 0 25 4 0 0 18 0 1 0 2629525 37883904 7303 1992294400 4194304 9819077 140737439139696 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 9249 7304 668 1374 0 7870 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 36996

[startup+0.701083 s]
/proc/loadavg: 1.38 1.10 1.02 3/106 5881
/proc/meminfo: memFree=1553868/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=30516 CPUtime=0.69
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 13580 0 0 0 63 6 0 0 18 0 1 0 2629525 31248384 6527 1992294400 4194304 9819077 140737439139696 18446744073709551615 7308981 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 7629 6527 692 1374 0 6250 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 30516

[startup+1.50123 s]
/proc/loadavg: 1.38 1.10 1.02 2/107 5882
/proc/meminfo: memFree=1530424/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=32044 CPUtime=1.49
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 13936 0 0 0 142 7 0 0 19 0 1 0 2629525 32813056 6871 1992294400 4194304 9819077 140737439139696 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 8011 6871 694 1374 0 6632 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 32044

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

[startup+2.30138 s]
/proc/loadavg: 1.38 1.10 1.02 2/107 5882
/proc/meminfo: memFree=1528564/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=33244 CPUtime=2.29
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 14517 0 0 0 221 8 0 0 21 0 1 0 2629525 34041856 7133 1992294400 4194304 9819077 140737439139696 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 8311 7133 694 1374 0 6932 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 33244

[startup+2.50041 s]
/proc/loadavg: 1.38 1.10 1.02 2/107 5882
/proc/meminfo: memFree=1528564/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=35068 CPUtime=2.49
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 14816 0 0 0 241 8 0 0 21 0 1 0 2629525 35909632 7388 1992294400 4194304 9819077 140737439139696 18446744073709551615 6198346 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 8767 7388 694 1374 0 7388 0
Current children cumulated CPU time (s) 2.49
Current children cumulated vsize (KiB) 35068

[startup+2.60043 s]
/proc/loadavg: 1.38 1.10 1.02 2/107 5882
/proc/meminfo: memFree=1528564/2059040 swapFree=4192956/4192956
[pid=5881] ppid=5879 vsize=34792 CPUtime=2.59
/proc/5881/stat : 5881 (pbscip.linux.x8) R 5879 5881 4214 0 -1 4202496 14897 0 0 0 251 8 0 0 22 0 1 0 2629525 35627008 7397 1992294400 4194304 9819077 140737439139696 18446744073709551615 7290967 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5881/statm: 8698 7397 694 1374 0 7319 0
Current children cumulated CPU time (s) 2.59
Current children cumulated vsize (KiB) 34792

Child status: 0
Real time (s): 2.64265
CPU time (s): 2.6416
CPU user time (s): 2.55161
CPU system time (s): 0.089986
CPU usage (%): 99.9603
Max. virtual memory (cumulated for all children) (KiB): 39536

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

runsolver used 0.011998 second user time and 0.021996 second system time

The end

Launcher Data 

Begin job on node027 at 2010-06-11 22:56:17
IDJOB=2665829
IDBENCH=1297
IDSOLVER=1168
FILE ID=node027/2665829-1276289777
PBS_JOBID= 11173099
Free space on /tmp= 62448 MiB

SOLVER NAME= SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/tsp/normalized-t3002.11tsp11.1900564822.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.clp -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2665829-1276289777/watcher-2665829-1276289777 -o /tmp/evaluation-result-2665829-1276289777/solver-2665829-1276289777 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665829-1276289777.opb -t 1800 -m 1800

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

MD5SUM BENCH= f89b9c55daed76b61e2a82c59790b13b
RANDOM SEED=996067639

node027.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		: 2800.261
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	: 5600.52
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		: 2800.261
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:       1554396 kB
Buffers:         62716 kB
Cached:         313944 kB
SwapCached:          0 kB
Active:         178068 kB
Inactive:       258004 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1554396 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6464 kB
Writeback:           0 kB
AnonPages:       59392 kB
Mapped:          15392 kB
Slab:            46712 kB
PageTables:       3980 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181188 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264952 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62440 MiB
End job on node027 at 2010-06-11 22:56:19