Trace number 2665731

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 solverUNSAT 5.39818 5.3996

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111217555.opb
MD5SUM6e4ce17645d1ea8394af123256e7adc9
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.246961
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
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 1222
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-2665731-1276273334.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 = 1799.99
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.19/0.27	c   0.2s|     1 |     0 |    69 |     - |1157k|   0 |  56 | 169 | 206 | 169 | 104 |  31 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.29	c   0.2s|     1 |     0 |   115 |     - |1290k|   0 |  70 | 169 | 206 | 169 | 113 |  40 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.33	c   0.3s|     1 |     0 |   190 |     - |1423k|   0 |  71 | 169 | 206 | 169 | 119 |  46 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.35	c   0.3s|     1 |     0 |   227 |     - |1428k|   0 |  76 | 169 | 206 | 169 | 125 |  52 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.39/0.40	c   0.4s|     1 |     0 |   422 |     - |1534k|   0 |  76 | 169 | 206 | 169 | 128 |  55 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.79/0.87	c   0.8s|     1 |     0 |   474 |     - |1530k|   0 |  76 | 169 | 203 | 169 | 128 |  55 |   0 |  10 | 0.000000e+00 |      --      |    Inf 
1.29/1.31	c   1.2s|     1 |     0 |   488 |     - |1525k|   0 |  77 | 169 | 199 | 169 | 128 |  55 |   0 |  21 | 0.000000e+00 |      --      |    Inf 
1.69/1.73	c   1.7s|     1 |     0 |   495 |     - |1524k|   0 |  77 | 169 | 198 | 169 | 128 |  55 |   0 |  31 | 0.000000e+00 |      --      |    Inf 
2.20/2.23	c   2.1s|     1 |     0 |   655 |     - |1516k|   0 |  72 | 169 | 191 | 169 | 128 |  55 |   0 |  43 | 0.000000e+00 |      --      |    Inf 
2.69/2.76	c   2.7s|     1 |     0 |   684 |     - |1482k|   0 |  73 | 169 | 159 | 169 | 128 |  55 |   0 |  56 | 0.000000e+00 |      --      |    Inf 
3.09/3.17	c   3.1s|     1 |     0 |   707 |     - |1463k|   0 |  69 | 169 | 142 | 169 | 116 |  55 |   0 |  67 | 0.000000e+00 |      --      |    Inf 
3.59/3.62	c   3.5s|     1 |     0 |   809 |     - |1459k|   0 |  67 | 169 | 139 | 169 | 116 |  55 |   0 |  80 | 0.000000e+00 |      --      |    Inf 
3.89/3.93	c   3.8s|     1 |     0 |   896 |     - |1458k|   0 |  65 | 169 | 138 | 169 | 116 |  55 |   0 |  91 | 0.000000e+00 |      --      |    Inf 
4.09/4.20	c   4.1s|     1 |     0 |   936 |     - |1458k|   0 |  65 | 169 | 138 | 169 | 116 |  55 |   0 | 101 | 0.000000e+00 |      --      |    Inf 
4.30/4.35	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
4.30/4.35	c   4.2s|     1 |     0 |   936 |     - |1458k|   0 |   - | 169 | 138 | 169 | 116 |  55 |   0 | 107 | 0.000000e+00 |      --      |    Inf 
4.30/4.35	c (run 1, node 1) restarting after 38 global fixings of integer variables
4.30/4.35	c 
4.30/4.35	c (restart) converted 43 cuts from the global cut pool into linear constraints
4.30/4.35	c 
4.30/4.35	c presolving:
4.30/4.36	c (round 1) 38 del vars, 9 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 80 clqs
4.30/4.37	c (round 2) 38 del vars, 9 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 103 upgd conss, 16 impls, 80 clqs
4.30/4.39	c (round 3) 38 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 1 chg coeffs, 103 upgd conss, 16 impls, 80 clqs
4.30/4.39	c (round 4) 38 del vars, 11 del conss, 0 chg bounds, 4 chg sides, 2 chg coeffs, 103 upgd conss, 16 impls, 80 clqs
4.30/4.39	c presolving (5 rounds):
4.30/4.39	c  38 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 2 changed coefficients
4.30/4.39	c  16 implications, 80 cliques
4.30/4.39	c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 170 constraints
4.30/4.39	c      25 constraints of type <knapsack>
4.30/4.39	c      79 constraints of type <setppc>
4.30/4.39	c      66 constraints of type <logicor>
4.30/4.39	c transformed objective value is always integral (scale: 1)
4.30/4.39	c Presolving Time: 0.04
4.30/4.39	c 
4.30/4.40	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
4.30/4.40	c   4.2s|     1 |     0 |   992 |     - |1105k|   0 |  44 | 131 | 170 | 131 | 108 |   0 |   0 | 107 | 0.000000e+00 |      --      |    Inf 
4.40/4.43	c   4.3s|     1 |     0 |  1037 |     - |1373k|   0 |  53 | 131 | 170 | 131 | 119 |  11 |   0 | 107 | 0.000000e+00 |      --      |    Inf 
4.59/4.64	c   4.5s|     1 |     0 |  1071 |     - |1371k|   0 |  55 | 131 | 168 | 131 | 119 |  11 |   0 | 117 | 0.000000e+00 |      --      |    Inf 
4.79/4.87	c   4.7s|     1 |     0 |  1149 |     - |1370k|   0 |  48 | 131 | 166 | 131 | 119 |  11 |   0 | 130 | 0.000000e+00 |      --      |    Inf 
4.89/4.99	c   4.8s|     1 |     0 |  1184 |     - |1370k|   0 |  49 | 131 | 164 | 131 | 119 |  11 |   0 | 138 | 0.000000e+00 |      --      |    Inf 
4.99/5.07	c   4.9s|     1 |     0 |  1258 |     - |1370k|   0 |  47 | 131 | 164 | 131 | 119 |  11 |   0 | 144 | 0.000000e+00 |      --      |    Inf 
5.09/5.13	c   5.0s|     1 |     0 |  1289 |     - |1368k|   0 |  45 | 131 | 161 | 131 | 119 |  11 |   0 | 149 | 0.000000e+00 |      --      |    Inf 
5.09/5.17	c   5.0s|     1 |     0 |  1289 |     - |1368k|   0 |   - | 131 | 161 | 131 | 119 |  11 |   0 | 154 | 0.000000e+00 |      --      |    Inf 
5.09/5.17	c (run 2, node 1) restarting after 30 global fixings of integer variables
5.09/5.17	c 
5.09/5.17	c (restart) converted 11 cuts from the global cut pool into linear constraints
5.09/5.17	c 
5.09/5.17	c presolving:
5.09/5.19	c (round 1) 30 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 26 impls, 80 clqs
5.19/5.20	c (round 2) 30 del vars, 51 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 11 upgd conss, 26 impls, 80 clqs
5.19/5.20	c presolving (3 rounds):
5.19/5.20	c  30 deleted vars, 51 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
5.19/5.20	c  26 implications, 80 cliques
5.19/5.20	c presolved problem has 101 variables (101 bin, 0 int, 0 impl, 0 cont) and 121 constraints
5.19/5.20	c      31 constraints of type <knapsack>
5.19/5.20	c      79 constraints of type <setppc>
5.19/5.20	c      11 constraints of type <logicor>
5.19/5.20	c transformed objective value is always integral (scale: 1)
5.19/5.20	c Presolving Time: 0.06
5.19/5.20	c 
5.19/5.21	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
5.19/5.21	c   5.0s|     1 |     0 |  1347 |     - |1078k|   0 |  40 | 101 | 121 | 101 | 110 |   0 |   0 | 154 | 0.000000e+00 |      --      |    Inf 
5.19/5.24	c   5.0s|     1 |     0 |  1410 |     - |1417k|   0 |  55 | 101 | 121 | 101 | 124 |  14 |   0 | 154 | 0.000000e+00 |      --      |    Inf 
5.19/5.29	c   5.1s|     1 |     0 |  1446 |     - |1417k|   0 |  53 | 101 | 121 | 101 | 124 |  14 |   0 | 159 | 0.000000e+00 |      --      |    Inf 
5.29/5.39	c   5.2s|     1 |     0 |  1564 |     - |1416k|   0 |   - | 101 | 119 | 101 | 124 |  14 |   0 | 164 |      --      |      --      |   0.00%
5.29/5.39	c   5.2s|     1 |     0 |  1564 |     - |1416k|   0 |   - | 101 | 119 | 101 | 124 |  14 |   0 | 164 |      --      |      --      |   0.00%
5.29/5.39	c 
5.29/5.39	c SCIP Status        : problem is solved [infeasible]
5.29/5.39	c Solving Time (sec) : 5.19
5.29/5.39	c Solving Nodes      : 1 (total of 3 nodes in 3 runs)
5.29/5.39	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
5.29/5.39	c Dual Bound         : +1.00000000000000e+20
5.29/5.39	c Gap                : 0.00 %
5.29/5.39	s UNSATISFIABLE
5.29/5.39	c SCIP Status        : problem is solved [infeasible]
5.29/5.39	c Solving Time       :       5.19
5.29/5.39	c Original Problem   :
5.29/5.39	c   Problem name     : HOME/instance-2665731-1276273334.opb
5.29/5.39	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.39	c   Constraints      : 101 initial, 101 maximal
5.29/5.39	c Presolved Problem  :
5.29/5.39	c   Problem name     : t_HOME/instance-2665731-1276273334.opb
5.29/5.39	c   Variables        : 101 (101 binary, 0 integer, 0 implicit integer, 0 continuous)
5.29/5.39	c   Constraints      : 121 initial, 121 maximal
5.29/5.39	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
5.29/5.39	c   trivial          :       0.00         68          0          0          0          0          0          0          0
5.29/5.39	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   implics          :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   probing          :       0.00          0          0          0          0          0          0          0          0
5.29/5.39	c   knapsack         :       0.04          0          0          0          0          0          0          0          3
5.29/5.39	c   setppc           :       0.01          0          0          0          0          0          9          0          0
5.29/5.39	c   linear           :       0.01          0          0          0          0          0         33          4          0
5.29/5.39	c   logicor          :       0.00          0          0          0          0          0         48          0          0
5.29/5.39	c   root node        :          -         78          -          -         78          -          -          -          -
5.29/5.39	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
5.29/5.39	c   integral         :          0          0          0         18          0          0         78          0          0          0
5.29/5.39	c   knapsack         :         31          7         19          0          0          0          0          0          0          0
5.29/5.39	c   setppc           :         79          7         19          0          0          0          0          0          0          0
5.29/5.39	c   logicor          :         11          7          9          0          0          0          0          0          0          0
5.29/5.39	c   countsols        :          0          0          0          0          0          0          0          0          0          0
5.29/5.39	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
5.29/5.39	c   integral         :       4.60       0.00       0.00       4.60       0.00
5.29/5.39	c   knapsack         :       0.02       0.02       0.00       0.00       0.00
5.29/5.39	c   setppc           :       0.00       0.00       0.00       0.00       0.00
5.29/5.39	c   logicor          :       0.00       0.00       0.00       0.00       0.00
5.29/5.39	c   countsols        :       0.00       0.00       0.00       0.00       0.00
5.29/5.39	c Propagators        :       Time      Calls    Cutoffs    DomReds
5.29/5.39	c   vbounds          :       0.00          3          0          0
5.29/5.39	c   rootredcost      :       0.00          0          0          0
5.29/5.39	c   pseudoobj        :       0.00          0          0          0
5.29/5.39	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
5.29/5.39	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
5.29/5.39	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
5.29/5.39	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
5.29/5.39	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
5.29/5.39	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
5.29/5.39	c   applied globally :          -          -          -          0        0.0          -          -          -
5.29/5.39	c   applied locally  :          -          -          -          0        0.0          -          -          -
5.29/5.39	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
5.29/5.39	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 129)
5.29/5.39	c   redcost          :       0.00          7          0          0          0          0
5.29/5.39	c   impliedbounds    :       0.00          7          0          0          0          0
5.29/5.39	c   intobj           :       0.00          0          0          0          0          0
5.29/5.39	c   cgmip            :       0.00          0          0          0          0          0
5.29/5.39	c   gomory           :       0.06          7          0          0         65          0
5.29/5.39	c   strongcg         :       0.06          7          0          0        312          0
5.29/5.39	c   cmir             :       0.00          0          0          0          0          0
5.29/5.39	c   flowcover        :       0.00          0          0          0          0          0
5.29/5.39	c   clique           :       0.00          7          0          0         31          0
5.29/5.39	c   zerohalf         :       0.00          0          0          0          0          0
5.29/5.39	c   mcf              :       0.00          3          0          0          0          0
5.29/5.39	c   rapidlearning    :       0.19          1          0          0          0        133
5.29/5.39	c Pricers            :       Time      Calls       Vars
5.29/5.39	c   problem variables:       0.00          0          0
5.29/5.39	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
5.29/5.39	c   relpscost        :       4.60         18          0         78          0          0          0
5.29/5.39	c   pscost           :       0.00          0          0          0          0          0          0
5.29/5.39	c   inference        :       0.00          0          0          0          0          0          0
5.29/5.39	c   mostinf          :       0.00          0          0          0          0          0          0
5.29/5.39	c   leastinf         :       0.00          0          0          0          0          0          0
5.29/5.39	c   fullstrong       :       0.00          0          0          0          0          0          0
5.29/5.39	c   allfullstrong    :       0.00          0          0          0          0          0          0
5.29/5.39	c   random           :       0.00          0          0          0          0          0          0
5.29/5.39	c Primal Heuristics  :       Time      Calls      Found
5.29/5.39	c   LP solutions     :       0.00          -          0
5.29/5.39	c   pseudo solutions :       0.00          -          0
5.29/5.39	c   trivial          :       0.00          1          0
5.29/5.39	c   simplerounding   :       0.00          0          0
5.29/5.39	c   zirounding       :       0.00          0          0
5.29/5.39	c   rounding         :       0.00          0          0
5.29/5.39	c   shifting         :       0.00          0          0
5.29/5.39	c   intshifting      :       0.00          0          0
5.29/5.39	c   oneopt           :       0.00          0          0
5.29/5.39	c   twoopt           :       0.00          0          0
5.29/5.39	c   fixandinfer      :       0.00          0          0
5.29/5.39	c   feaspump         :       0.00          0          0
5.29/5.39	c   coefdiving       :       0.00          0          0
5.29/5.39	c   pscostdiving     :       0.00          0          0
5.29/5.39	c   fracdiving       :       0.00          0          0
5.29/5.39	c   veclendiving     :       0.00          0          0
5.29/5.39	c   intdiving        :       0.00          0          0
5.29/5.39	c   actconsdiving    :       0.00          0          0
5.29/5.39	c   objpscostdiving  :       0.00          0          0
5.29/5.39	c   rootsoldiving    :       0.00          0          0
5.29/5.39	c   linesearchdiving :       0.00          0          0
5.29/5.39	c   guideddiving     :       0.00          0          0
5.29/5.39	c   octane           :       0.00          0          0
5.29/5.39	c   rens             :       0.00          0          0
5.29/5.39	c   rins             :       0.00          0          0
5.29/5.39	c   localbranching   :       0.00          0          0
5.29/5.39	c   mutation         :       0.00          0          0
5.29/5.39	c   crossover        :       0.00          0          0
5.29/5.39	c   dins             :       0.00          0          0
5.29/5.39	c   undercover       :       0.00          0          0
5.29/5.39	c   nlp              :       0.00          0          0
5.29/5.39	c   trysol           :       0.00          0          0
5.29/5.39	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
5.29/5.39	c   primal LP        :       0.01          0          0       0.00       0.00
5.29/5.39	c   dual LP          :       0.16         26       1564      60.15    9775.00
5.29/5.39	c   lex dual LP      :       0.00          0          0       0.00          -
5.29/5.39	c   barrier LP       :       0.00          0          0       0.00          -
5.29/5.39	c   diving/probing LP:       0.00          0          0       0.00          -
5.29/5.39	c   strong branching :       4.60        164      60995     371.92   13259.78
5.29/5.39	c     (at root node) :          -        164      60995     371.92          -
5.29/5.39	c   conflict analysis:       0.00          0          0       0.00          -
5.29/5.39	c B&B Tree           :
5.29/5.39	c   number of runs   :          3
5.29/5.39	c   nodes            :          1
5.29/5.39	c   nodes (total)    :          3
5.29/5.39	c   nodes left       :          0
5.29/5.39	c   max depth        :          0
5.29/5.39	c   max depth (total):          0
5.29/5.39	c   backtracks       :          0 (0.0%)
5.29/5.39	c   delayed cutoffs  :          0
5.29/5.39	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
5.29/5.39	c   avg switch length:       2.00
5.29/5.39	c   switching time   :       0.00
5.29/5.39	c Solution           :
5.29/5.39	c   Solutions found  :          0 (0 improvements)
5.29/5.39	c   Primal Bound     : infeasible
5.29/5.39	c   Dual Bound       :          -
5.29/5.39	c   Gap              :       0.00 %
5.29/5.39	c   Root Dual Bound  :          -
5.29/5.39	c   Root Iterations  :       1564
5.29/5.39	c Time complete: 5.39.

Verifier Data

ERROR: no interpretation found !

Watcher Data

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2665731-1276273334/watcher-2665731-1276273334 -o /tmp/evaluation-result-2665731-1276273334/solver-2665731-1276273334 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665731-1276273334.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 3/106 4076
/proc/meminfo: memFree=1575952/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=9288 CPUtime=0
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 1059 0 0 0 0 0 0 0 20 0 1 0 2937365 9510912 980 1992294400 4194304 9819077 140735791401392 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/4076/statm: 2322 989 371 1374 0 943 0

[startup+0.074834 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 4076
/proc/meminfo: memFree=1575952/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=23552 CPUtime=0.07
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 7549 0 0 0 5 2 0 0 20 0 1 0 2937365 24117248 4025 1992294400 4194304 9819077 140735791401392 18446744073709551615 8675093 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 5888 4043 673 1374 0 4509 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 23552

[startup+0.100836 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 4076
/proc/meminfo: memFree=1575952/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=23552 CPUtime=0.09
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 8838 0 0 0 7 2 0 0 20 0 1 0 2937365 24117248 4285 1992294400 4194304 9819077 140735791401392 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 5888 4285 681 1374 0 4509 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23552

[startup+0.300855 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 4076
/proc/meminfo: memFree=1575952/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=17092 CPUtime=0.29
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 9027 0 0 0 26 3 0 0 20 0 1 0 2937365 17502208 3180 1992294400 4194304 9819077 140735791401392 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 4273 3180 694 1374 0 2894 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 17092

[startup+0.700893 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 4076
/proc/meminfo: memFree=1575952/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=18784 CPUtime=0.69
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 9858 0 0 0 65 4 0 0 21 0 1 0 2937365 19234816 3218 1992294400 4194304 9819077 140735791401392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 4696 3218 700 1374 0 3317 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 18784

[startup+1.50097 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 4077
/proc/meminfo: memFree=1565280/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=18752 CPUtime=1.49
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 11858 0 0 0 143 6 0 0 23 0 1 0 2937365 19202048 3212 1992294400 4194304 9819077 140735791401392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 4688 3212 700 1374 0 3309 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 18752

[startup+3.10112 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 4077
/proc/meminfo: memFree=1564908/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=18748 CPUtime=3.09
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 16049 0 0 0 300 9 0 0 25 0 1 0 2937365 19197952 3211 1992294400 4194304 9819077 140735791401392 18446744073709551615 6192320 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 4687 3211 700 1374 0 3308 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 18748

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

[startup+4.70127 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 4077
/proc/meminfo: memFree=1564908/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=19256 CPUtime=4.69
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 23335 0 0 0 455 14 0 0 25 0 1 0 2937365 19718144 3333 1992294400 4194304 9819077 140735791401392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 4814 3333 711 1374 0 3435 0
Current children cumulated CPU time (s) 4.69
Current children cumulated vsize (KiB) 19256

[startup+5.10131 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 4077
/proc/meminfo: memFree=1564908/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=19212 CPUtime=5.09
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 25674 0 0 0 493 16 0 0 25 0 1 0 2937365 19673088 3333 1992294400 4194304 9819077 140735791401392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 4803 3333 711 1374 0 3424 0
Current children cumulated CPU time (s) 5.09
Current children cumulated vsize (KiB) 19212

[startup+5.30133 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 4077
/proc/meminfo: memFree=1564908/2059040 swapFree=4192956/4192956
[pid=4076] ppid=4074 vsize=19620 CPUtime=5.29
/proc/4076/stat : 4076 (pbscip.linux.x8) R 4074 4076 3358 0 -1 4202496 29446 0 0 0 511 18 0 0 25 0 1 0 2937365 20090880 3355 1992294400 4194304 9819077 140735791401392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/4076/statm: 4905 3355 711 1374 0 3526 0
Current children cumulated CPU time (s) 5.29
Current children cumulated vsize (KiB) 19620

Child status: 0
Real time (s): 5.3996
CPU time (s): 5.39818
CPU user time (s): 5.21021
CPU system time (s): 0.187971
CPU usage (%): 99.9737
Max. virtual memory (cumulated for all children) (KiB): 23816

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

runsolver used 0.011998 second user time and 0.040993 second system time

The end

Launcher Data

Begin job on node002 at 2010-06-11 18:22:14
IDJOB=2665731
IDBENCH=1193
IDSOLVER=1168
FILE ID=node002/2665731-1276273334
PBS_JOBID= 11172208
Free space on /tmp= 62392 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.1111217555.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-2665731-1276273334/watcher-2665731-1276273334 -o /tmp/evaluation-result-2665731-1276273334/solver-2665731-1276273334 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665731-1276273334.opb -t 1800 -m 1800

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

MD5SUM BENCH= 6e4ce17645d1ea8394af123256e7adc9
RANDOM SEED=389787793

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1576356 kB
Buffers:         48244 kB
Cached:         308628 kB
SwapCached:          0 kB
Active:         165976 kB
Inactive:       250160 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1576356 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6272 kB
Writeback:           0 kB
AnonPages:       59260 kB
Mapped:          15372 kB
Slab:            44744 kB
PageTables:       4072 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180084 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= 62388 MiB
End job on node002 at 2010-06-11 18:22:19