Trace number 2665742

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 6.40502 6.40647

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1110967327.opb
MD5SUM2f07147cae0700166272793878b966d6
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.096985
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables169
Total number of constraints101
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
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 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1162
Number of bits of the biggest sum of numbers11
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-2665742-1276274471.opb>
0.00/0.01	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.01	c presolving:
0.00/0.02	c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03	c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03	c presolving (3 rounds):
0.00/0.03	c  0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03	c  8 implications, 68 cliques
0.00/0.03	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03	c       1 constraints of type <knapsack>
0.00/0.03	c      68 constraints of type <setppc>
0.00/0.03	c       4 constraints of type <logicor>
0.00/0.03	c transformed objective value is always integral (scale: 1)
0.00/0.03	c Presolving Time: 0.01
0.00/0.03	c - non default parameters ----------------------------------------------------------------------
0.00/0.03	c # SCIP version 1.2.1.2
0.00/0.03	c 
0.00/0.03	c # frequency for displaying node information lines
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03	c display/freq = 10000
0.00/0.03	c 
0.00/0.03	c # maximal time in seconds to run
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/time = 1800
0.00/0.03	c 
0.00/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/memory = 1620
0.00/0.03	c 
0.00/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c limits/solutions = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03	c separating/maxrounds = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/maxroundsroot = 5
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify inequalities
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/linear/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03	c constraints/knapsack/disaggregation = FALSE
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify knapsacks
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c presolving/probing/maxrounds = 0
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/coefdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03	c heuristics/crossover/freq = -1
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/crossover/nodesofs = 750
0.00/0.03	c 
0.00/0.03	c # number of nodes without incumbent change that heuristic should wait
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03	c heuristics/crossover/nwaitingnodes = 100
0.00/0.03	c 
0.00/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03	c # [type: real, range: [0,1], default: 0.1]
0.00/0.03	c heuristics/crossover/nodesquot = 0.15
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixed 
0.00/0.03	c # [type: real, range: [0,1], default: 0.666]
0.00/0.03	c heuristics/crossover/minfixingrate = 0.5
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/feaspump/freq = -1
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/fracdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/guideddiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/intshifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/linesearchdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/nlp/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/objpscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03	c # [type: real, range: [0,1], default: 0.01]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/oneopt/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/pscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/rens/freq = -1
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixable 
0.00/0.03	c # [type: real, range: [0,1], default: 0.5]
0.00/0.03	c heuristics/rens/minfixingrate = 0.3
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/rens/nodesofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/rootsoldiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/rounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/shifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/simplerounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/trivial/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/trysol/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/veclendiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/zirounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/cmir/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/flowcover/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/rapidlearning/freq = 0
0.00/0.03	c 
0.00/0.03	c -----------------------------------------------------------------------------------------------
0.00/0.03	c start solving
0.00/0.03	c 
0.00/0.04	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.04	c   0.0s|     1 |     0 |    49 |     - | 743k|   0 |  42 | 169 |  73 | 169 |  73 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.20/0.25	c   0.2s|     1 |     0 |    83 |     - |1229k|   0 |  58 | 169 | 195 | 169 | 105 |  32 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.20/0.27	c   0.2s|     1 |     0 |   120 |     - |1240k|   0 |  68 | 169 | 195 | 169 | 114 |  41 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.30	c   0.2s|     1 |     0 |   155 |     - |1244k|   0 |  74 | 169 | 195 | 169 | 120 |  47 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.33	c   0.3s|     1 |     0 |   207 |     - |1251k|   0 |  78 | 169 | 195 | 169 | 124 |  51 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.35	c   0.3s|     1 |     0 |   211 |     - |1252k|   0 |  79 | 169 | 195 | 169 | 126 |  53 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.79/0.86	c   0.8s|     1 |     2 |   211 |     - |1253k|   0 |  79 | 169 | 195 | 169 | 126 |  53 |   0 |   9 | 0.000000e+00 |      --      |    Inf 
6.29/6.39	c * 6.2s|    26 |     0 |  2224 |  80.5 |1221k|  14 |   - | 169 | 122 | 169 | 110 |  53 |   7 | 361 | 0.000000e+00 | 0.000000e+00 |   0.00%
6.29/6.39	c 
6.29/6.39	c SCIP Status        : problem is solved [optimal solution found]
6.29/6.39	c Solving Time (sec) : 6.21
6.29/6.39	c Solving Nodes      : 26
6.29/6.39	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
6.29/6.39	c Dual Bound         : +0.00000000000000e+00
6.29/6.39	c Gap                : 0.00 %
6.29/6.39	s SATISFIABLE
6.29/6.39	v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 
6.29/6.39	v -x147 -x146 -x145 -x144 -x143 -x142 x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 
6.29/6.39	v x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106 
6.29/6.39	v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 
6.29/6.39	v -x81 -x80 x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 x59 -x58 -x57 -x56 
6.29/6.39	v -x55 -x54 -x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 
6.29/6.39	v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 
6.29/6.39	v x4 -x3 -x2 -x1 
6.29/6.39	c SCIP Status        : problem is solved [optimal solution found]
6.29/6.39	c Solving Time       :       6.21
6.29/6.39	c Original Problem   :
6.29/6.39	c   Problem name     : HOME/instance-2665742-1276274471.opb
6.29/6.39	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
6.29/6.39	c   Constraints      : 101 initial, 101 maximal
6.29/6.39	c Presolved Problem  :
6.29/6.39	c   Problem name     : t_HOME/instance-2665742-1276274471.opb
6.29/6.39	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
6.29/6.39	c   Constraints      : 73 initial, 195 maximal
6.29/6.39	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
6.29/6.39	c   trivial          :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   implics          :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   probing          :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   setppc           :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   linear           :       0.01          0          0          0          0          0         28          0          0
6.29/6.39	c   logicor          :       0.00          0          0          0          0          0          0          0          0
6.29/6.39	c   root node        :          -         35          -          -         35          -          -          -          -
6.29/6.39	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
6.29/6.39	c   integral         :          0          0          0         85          0          2        167          0          0         30
6.29/6.39	c   knapsack         :          1          5        131          1          0          0          0          0          0          0
6.29/6.39	c   setppc           :         68          5        131          1          0          0        313          0          0          0
6.29/6.39	c   linear           :          0+         5        130          0          0          0          0          0          0          0
6.29/6.39	c   logicor          :          4+         5         14          1          0          0          5          0          0          0
6.29/6.39	c   countsols        :          0          0          0          1          0          0          0          0          0          0
6.29/6.39	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
6.29/6.39	c   integral         :       5.70       0.00       0.00       5.70       0.00
6.29/6.39	c   knapsack         :       0.01       0.01       0.00       0.00       0.00
6.29/6.39	c   setppc           :       0.00       0.00       0.00       0.00       0.00
6.29/6.39	c   linear           :       0.02       0.00       0.02       0.00       0.00
6.29/6.39	c   logicor          :       0.00       0.00       0.00       0.00       0.00
6.29/6.39	c   countsols        :       0.00       0.00       0.00       0.00       0.00
6.29/6.39	c Propagators        :       Time      Calls    Cutoffs    DomReds
6.29/6.39	c   vbounds          :       0.00          1          0          0
6.29/6.39	c   rootredcost      :       0.00          0          0          0
6.29/6.39	c   pseudoobj        :       0.00          0          0          0
6.29/6.39	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
6.29/6.39	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
6.29/6.39	c   infeasible LP    :       0.00          8          5         15       28.4          0        0.0          0
6.29/6.39	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
6.29/6.39	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
6.29/6.39	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
6.29/6.39	c   applied globally :          -          -          -          5       15.2          -          -          -
6.29/6.39	c   applied locally  :          -          -          -          2       35.5          -          -          -
6.29/6.39	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
6.29/6.39	c   cut pool         :       0.00          4          -          -         10          -    (maximal pool size: 101)
6.29/6.39	c   redcost          :       0.00         24          0          0          0          0
6.29/6.39	c   impliedbounds    :       0.00          5          0          0          0          0
6.29/6.39	c   intobj           :       0.00          0          0          0          0          0
6.29/6.39	c   cgmip            :       0.00          0          0          0          0          0
6.29/6.39	c   gomory           :       0.04          5          0          0         29          0
6.29/6.39	c   strongcg         :       0.03          5          0          0         61          0
6.29/6.39	c   cmir             :       0.00          0          0          0          0          0
6.29/6.39	c   flowcover        :       0.00          0          0          0          0          0
6.29/6.39	c   clique           :       0.01          5          0          0         20          0
6.29/6.39	c   zerohalf         :       0.00          0          0          0          0          0
6.29/6.39	c   mcf              :       0.00          1          0          0          0          0
6.29/6.39	c   rapidlearning    :       0.17          1          0          0          0        122
6.29/6.39	c Pricers            :       Time      Calls       Vars
6.29/6.39	c   problem variables:       0.00          0          0
6.29/6.39	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
6.29/6.39	c   relpscost        :       5.70         84          2        167          0          0         30
6.29/6.39	c   pscost           :       0.00          0          0          0          0          0          0
6.29/6.39	c   inference        :       0.00          0          0          0          0          0          0
6.29/6.39	c   mostinf          :       0.00          0          0          0          0          0          0
6.29/6.39	c   leastinf         :       0.00          0          0          0          0          0          0
6.29/6.39	c   fullstrong       :       0.00          0          0          0          0          0          0
6.29/6.39	c   allfullstrong    :       0.00          0          0          0          0          0          0
6.29/6.39	c   random           :       0.00          0          0          0          0          0          0
6.29/6.39	c Primal Heuristics  :       Time      Calls      Found
6.29/6.39	c   LP solutions     :       0.00          -          1
6.29/6.39	c   pseudo solutions :       0.00          -          0
6.29/6.39	c   trivial          :       0.00          1          0
6.29/6.39	c   simplerounding   :       0.00          0          0
6.29/6.39	c   zirounding       :       0.00          0          0
6.29/6.39	c   rounding         :       0.00          0          0
6.29/6.39	c   shifting         :       0.00          0          0
6.29/6.39	c   intshifting      :       0.00          0          0
6.29/6.39	c   oneopt           :       0.00          0          0
6.29/6.39	c   twoopt           :       0.00          0          0
6.29/6.39	c   fixandinfer      :       0.00          0          0
6.29/6.39	c   feaspump         :       0.00          0          0
6.29/6.39	c   coefdiving       :       0.00          0          0
6.29/6.39	c   pscostdiving     :       0.00          0          0
6.29/6.39	c   fracdiving       :       0.00          0          0
6.29/6.39	c   veclendiving     :       0.00          0          0
6.29/6.39	c   intdiving        :       0.00          0          0
6.29/6.39	c   actconsdiving    :       0.00          0          0
6.29/6.39	c   objpscostdiving  :       0.00          0          0
6.29/6.39	c   rootsoldiving    :       0.00          0          0
6.29/6.39	c   linesearchdiving :       0.00          0          0
6.29/6.39	c   guideddiving     :       0.00          0          0
6.29/6.39	c   octane           :       0.00          0          0
6.29/6.39	c   rens             :       0.00          0          0
6.29/6.39	c   rins             :       0.00          0          0
6.29/6.39	c   localbranching   :       0.00          0          0
6.29/6.39	c   mutation         :       0.00          0          0
6.29/6.39	c   crossover        :       0.00          0          0
6.29/6.39	c   dins             :       0.00          0          0
6.29/6.39	c   undercover       :       0.00          0          0
6.29/6.39	c   nlp              :       0.00          0          0
6.29/6.39	c   trysol           :       0.00          0          0
6.29/6.39	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
6.29/6.39	c   primal LP        :       0.00          0          0       0.00          -
6.29/6.39	c   dual LP          :       0.20         99       2224      22.46   11120.00
6.29/6.39	c   lex dual LP      :       0.00          0          0       0.00          -
6.29/6.39	c   barrier LP       :       0.00          0          0       0.00          -
6.29/6.39	c   diving/probing LP:       0.00          0          0       0.00          -
6.29/6.39	c   strong branching :       5.69        361      88813     246.02   15608.61
6.29/6.39	c     (at root node) :          -          9       5362     595.78          -
6.29/6.39	c   conflict analysis:       0.00          0          0       0.00          -
6.29/6.39	c B&B Tree           :
6.29/6.39	c   number of runs   :          1
6.29/6.39	c   nodes            :         26
6.29/6.39	c   nodes (total)    :         26
6.29/6.39	c   nodes left       :          0
6.29/6.39	c   max depth        :         14
6.29/6.39	c   max depth (total):         14
6.29/6.39	c   backtracks       :          1 (3.8%)
6.29/6.39	c   delayed cutoffs  :          0
6.29/6.39	c   repropagations   :         12 (5 domain reductions, 0 cutoffs)
6.29/6.39	c   avg switch length:       2.62
6.29/6.39	c   switching time   :       0.00
6.29/6.39	c Solution           :
6.29/6.39	c   Solutions found  :          1 (1 improvements)
6.29/6.39	c   First Solution   : +0.00000000000000e+00   (in run 1, after 26 nodes, 6.21 seconds, depth 14, found by <relaxation>)
6.29/6.39	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 26 nodes, 6.21 seconds, depth 14, found by <relaxation>)
6.29/6.39	c   Dual Bound       : +0.00000000000000e+00
6.29/6.39	c   Gap              :       0.00 %
6.29/6.39	c   Root Dual Bound  : +0.00000000000000e+00
6.29/6.39	c   Root Iterations  :        211
6.39/6.40	c Time complete: 6.4.

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-2665742-1276274471/watcher-2665742-1276274471 -o /tmp/evaluation-result-2665742-1276274471/solver-2665742-1276274471 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665742-1276274471.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.00 1.00 1.00 2/106 3760
/proc/meminfo: memFree=1576336/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=9288 CPUtime=0
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 1090 0 0 0 0 0 0 0 20 0 1 0 1102547 9510912 1011 1992294400 4194304 9819077 140737286968960 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/3760/statm: 2322 1020 371 1374 0 943 0

[startup+0.070442 s]
/proc/loadavg: 1.00 1.00 1.00 2/106 3760
/proc/meminfo: memFree=1576336/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=23176 CPUtime=0.06
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 6929 0 0 0 4 2 0 0 20 0 1 0 1102547 23732224 4175 1992294400 4194304 9819077 140737286968960 18446744073709551615 4333569 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3760/statm: 5794 4175 673 1374 0 4415 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 23176

[startup+0.101444 s]
/proc/loadavg: 1.00 1.00 1.00 2/106 3760
/proc/meminfo: memFree=1576336/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=23740 CPUtime=0.09
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 8868 0 0 0 6 3 0 0 20 0 1 0 1102547 24309760 4315 1992294400 4194304 9819077 140737286968960 18446744073709551615 4854288 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3760/statm: 5935 4315 681 1374 0 4556 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23740

[startup+0.301458 s]
/proc/loadavg: 1.00 1.00 1.00 2/106 3760
/proc/meminfo: memFree=1576336/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=16988 CPUtime=0.29
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 9014 0 0 0 25 4 0 0 20 0 1 0 1102547 17395712 3167 1992294400 4194304 9819077 140737286968960 18446744073709551615 7478160 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3760/statm: 4297 3169 694 1374 0 2918 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 16988

[startup+0.701487 s]
/proc/loadavg: 1.00 1.00 1.00 2/106 3760
/proc/meminfo: memFree=1576336/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=18256 CPUtime=0.7
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 9591 0 0 0 65 5 0 0 21 0 1 0 1102547 18694144 3196 1992294400 4194304 9819077 140737286968960 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3760/statm: 4564 3196 700 1374 0 3185 0
Current children cumulated CPU time (s) 0.7
Current children cumulated vsize (KiB) 18256

[startup+1.50154 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 3761
/proc/meminfo: memFree=1565664/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=18304 CPUtime=1.49
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 10570 0 0 0 143 6 0 0 23 0 1 0 1102547 18743296 3217 1992294400 4194304 9819077 140737286968960 18446744073709551615 6656779 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3760/statm: 4576 3217 721 1374 0 3197 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 18304

[startup+3.10066 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 3761
/proc/meminfo: memFree=1565664/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=18580 CPUtime=3.09
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 12283 0 0 0 300 9 0 0 25 0 1 0 1102547 19025920 3225 1992294400 4194304 9819077 140737286968960 18446744073709551615 6192285 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3760/statm: 4645 3225 723 1374 0 3266 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 18580

[startup+6.30088 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 3761
/proc/meminfo: memFree=1565664/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=17080 CPUtime=6.29
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 15938 0 0 0 613 16 0 0 25 0 1 0 1102547 17489920 3207 1992294400 4194304 9819077 140737286968960 18446744073709551615 6162152 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3760/statm: 4270 3207 723 1374 0 2891 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 17080

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

[startup+6.40089 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 3761
/proc/meminfo: memFree=1565664/2059040 swapFree=4192956/4192956
[pid=3760] ppid=3758 vsize=16052 CPUtime=6.39
/proc/3760/stat : 3760 (pbscip.linux.x8) R 3758 3760 2309 0 -1 4202496 16174 0 0 0 622 17 0 0 25 0 1 0 1102547 16437248 2953 1992294400 4194304 9819077 140737286968960 18446744073709551615 8652668 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/3760/statm: 4013 2953 726 1374 0 2634 0
Current children cumulated CPU time (s) 6.39
Current children cumulated vsize (KiB) 16052

Child status: 0
Real time (s): 6.40647
CPU time (s): 6.40502
CPU user time (s): 6.23105
CPU system time (s): 0.173973
CPU usage (%): 99.9774
Max. virtual memory (cumulated for all children) (KiB): 23872

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

runsolver used 0.012998 second user time and 0.045993 second system time

The end

Launcher Data 

Begin job on node026 at 2010-06-11 18:41:11
IDJOB=2665742
IDBENCH=1204
IDSOLVER=1168
FILE ID=node026/2665742-1276274471
PBS_JOBID= 11172191
Free space on /tmp= 62508 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/wnqueen/normalized-t2001.13queen13.1110967327.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-2665742-1276274471/watcher-2665742-1276274471 -o /tmp/evaluation-result-2665742-1276274471/solver-2665742-1276274471 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665742-1276274471.opb -t 1800 -m 1800

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

MD5SUM BENCH= 2f07147cae0700166272793878b966d6
RANDOM SEED=539352874

node026.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.201
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.40
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.201
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.46
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1577112 kB
Buffers:         43096 kB
Cached:         313320 kB
SwapCached:          0 kB
Active:         170204 kB
Inactive:       245308 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1577112 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6408 kB
Writeback:           0 kB
AnonPages:       59184 kB
Mapped:          15380 kB
Slab:            44620 kB
PageTables:       4052 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180424 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= 62504 MiB
End job on node026 at 2010-06-11 18:41:18