Trace number 2665759

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 3.39248 3.39317

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1110967523.opb
MD5SUM5cdd8cb1372de7a07cb58778faffedf0
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.316951
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 1188
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-2665759-1276276130.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.04	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.23	c   0.2s|     1 |     0 |    79 |     - |1239k|   0 |  59 | 169 | 220 | 169 |  98 |  25 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.26	c   0.2s|     1 |     0 |   126 |     - |1248k|   0 |  66 | 169 | 220 | 169 | 104 |  31 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.28	c   0.2s|     1 |     0 |   167 |     - |1251k|   0 |  67 | 169 | 220 | 169 | 110 |  37 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.30	c   0.2s|     1 |     0 |   211 |     - |1255k|   0 |  70 | 169 | 220 | 169 | 115 |  42 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.34	c   0.3s|     1 |     0 |   403 |     - |1307k|   0 |  62 | 169 | 220 | 169 | 118 |  45 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.69/0.72	c   0.7s|     1 |     2 |   403 |     - |1308k|   0 |  62 | 169 | 220 | 169 | 118 |  45 |   0 |   9 | 0.000000e+00 |      --      |    Inf 
3.30/3.38	c 
3.30/3.38	c SCIP Status        : problem is solved [infeasible]
3.30/3.38	c Solving Time (sec) : 3.26
3.30/3.38	c Solving Nodes      : 7
3.30/3.38	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
3.30/3.38	c Dual Bound         : +1.00000000000000e+20
3.30/3.38	c Gap                : 0.00 %
3.30/3.38	s UNSATISFIABLE
3.30/3.38	c SCIP Status        : problem is solved [infeasible]
3.30/3.38	c Solving Time       :       3.26
3.30/3.38	c Original Problem   :
3.30/3.38	c   Problem name     : HOME/instance-2665759-1276276130.opb
3.30/3.38	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.30/3.38	c   Constraints      : 101 initial, 101 maximal
3.30/3.38	c Presolved Problem  :
3.30/3.38	c   Problem name     : t_HOME/instance-2665759-1276276130.opb
3.30/3.38	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.30/3.38	c   Constraints      : 73 initial, 220 maximal
3.30/3.38	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
3.30/3.38	c   trivial          :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   implics          :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   probing          :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   knapsack         :       0.01          0          0          0          0          0          0          0          0
3.30/3.38	c   setppc           :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   linear           :       0.00          0          0          0          0          0         28          0          0
3.30/3.38	c   logicor          :       0.00          0          0          0          0          0          0          0          0
3.30/3.38	c   root node        :          -         37          -          -         37          -          -          -          -
3.30/3.38	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
3.30/3.38	c   integral         :          0          0          0         31          0          4         90          0          0          6
3.30/3.38	c   knapsack         :          1          5         34          0          0          0          0          0          0          0
3.30/3.38	c   setppc           :         68          5         34          0          0          0         74          0          0          0
3.30/3.38	c   linear           :          0+         5         33          0          0          0          0          0          0          0
3.30/3.38	c   logicor          :          4          5          4          0          0          0          1          0          0          0
3.30/3.38	c   countsols        :          0          0          0          0          0          0          0          0          0          0
3.30/3.38	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
3.30/3.38	c   integral         :       2.93       0.00       0.00       2.93       0.00
3.30/3.38	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
3.30/3.38	c   setppc           :       0.01       0.00       0.01       0.00       0.00
3.30/3.38	c   linear           :       0.00       0.00       0.00       0.00       0.00
3.30/3.38	c   logicor          :       0.00       0.00       0.00       0.00       0.00
3.30/3.38	c   countsols        :       0.00       0.00       0.00       0.00       0.00
3.30/3.38	c Propagators        :       Time      Calls    Cutoffs    DomReds
3.30/3.38	c   vbounds          :       0.00          1          0          0
3.30/3.38	c   rootredcost      :       0.00          0          0          0
3.30/3.38	c   pseudoobj        :       0.00          0          0          0
3.30/3.38	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
3.30/3.38	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
3.30/3.38	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
3.30/3.38	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
3.30/3.38	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
3.30/3.38	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
3.30/3.38	c   applied globally :          -          -          -          0        0.0          -          -          -
3.30/3.38	c   applied locally  :          -          -          -          0        0.0          -          -          -
3.30/3.38	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
3.30/3.38	c   cut pool         :       0.00          4          -          -          6          -    (maximal pool size: 109)
3.30/3.38	c   redcost          :       0.00         11          0          0          0          0
3.30/3.38	c   impliedbounds    :       0.00          5          0          0          0          0
3.30/3.38	c   intobj           :       0.00          0          0          0          0          0
3.30/3.38	c   cgmip            :       0.00          0          0          0          0          0
3.30/3.38	c   gomory           :       0.06          5          0          0         33          0
3.30/3.38	c   strongcg         :       0.03          5          0          0         62          0
3.30/3.38	c   cmir             :       0.00          0          0          0          0          0
3.30/3.38	c   flowcover        :       0.00          0          0          0          0          0
3.30/3.38	c   clique           :       0.00          5          0          0         23          0
3.30/3.38	c   zerohalf         :       0.00          0          0          0          0          0
3.30/3.38	c   mcf              :       0.00          1          0          0          0          0
3.30/3.38	c   rapidlearning    :       0.15          1          0          0          0        147
3.30/3.38	c Pricers            :       Time      Calls       Vars
3.30/3.38	c   problem variables:       0.00          0          0
3.30/3.38	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
3.30/3.38	c   relpscost        :       2.93         31          4         90          0          0          6
3.30/3.38	c   pscost           :       0.00          0          0          0          0          0          0
3.30/3.38	c   inference        :       0.00          0          0          0          0          0          0
3.30/3.38	c   mostinf          :       0.00          0          0          0          0          0          0
3.30/3.38	c   leastinf         :       0.00          0          0          0          0          0          0
3.30/3.38	c   fullstrong       :       0.00          0          0          0          0          0          0
3.30/3.38	c   allfullstrong    :       0.00          0          0          0          0          0          0
3.30/3.38	c   random           :       0.00          0          0          0          0          0          0
3.30/3.38	c Primal Heuristics  :       Time      Calls      Found
3.30/3.38	c   LP solutions     :       0.00          -          0
3.30/3.38	c   pseudo solutions :       0.00          -          0
3.30/3.38	c   trivial          :       0.00          1          0
3.30/3.38	c   simplerounding   :       0.00          0          0
3.30/3.38	c   zirounding       :       0.00          0          0
3.30/3.38	c   rounding         :       0.00          0          0
3.30/3.38	c   shifting         :       0.00          0          0
3.30/3.38	c   intshifting      :       0.00          0          0
3.30/3.38	c   oneopt           :       0.00          0          0
3.30/3.38	c   twoopt           :       0.00          0          0
3.30/3.38	c   fixandinfer      :       0.00          0          0
3.30/3.38	c   feaspump         :       0.00          0          0
3.30/3.38	c   coefdiving       :       0.00          0          0
3.30/3.38	c   pscostdiving     :       0.00          0          0
3.30/3.38	c   fracdiving       :       0.00          0          0
3.30/3.38	c   veclendiving     :       0.00          0          0
3.30/3.38	c   intdiving        :       0.00          0          0
3.30/3.38	c   actconsdiving    :       0.00          0          0
3.30/3.38	c   objpscostdiving  :       0.00          0          0
3.30/3.38	c   rootsoldiving    :       0.00          0          0
3.30/3.38	c   linesearchdiving :       0.00          0          0
3.30/3.38	c   guideddiving     :       0.00          0          0
3.30/3.38	c   octane           :       0.00          0          0
3.30/3.38	c   rens             :       0.00          0          0
3.30/3.38	c   rins             :       0.00          0          0
3.30/3.38	c   localbranching   :       0.00          0          0
3.30/3.38	c   mutation         :       0.00          0          0
3.30/3.38	c   crossover        :       0.00          0          0
3.30/3.38	c   dins             :       0.00          0          0
3.30/3.38	c   undercover       :       0.00          0          0
3.30/3.38	c   nlp              :       0.00          0          0
3.30/3.38	c   trysol           :       0.00          0          0
3.30/3.38	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
3.30/3.38	c   primal LP        :       0.00          0          0       0.00          -
3.30/3.38	c   dual LP          :       0.06         36       1266      35.17   21100.00
3.30/3.38	c   lex dual LP      :       0.00          0          0       0.00          -
3.30/3.38	c   barrier LP       :       0.00          0          0       0.00          -
3.30/3.38	c   diving/probing LP:       0.00          0          0       0.00          -
3.30/3.38	c   strong branching :       2.93        212      52944     249.74   18069.62
3.30/3.38	c     (at root node) :          -          9       5000     555.56          -
3.30/3.38	c   conflict analysis:       0.00          0          0       0.00          -
3.30/3.38	c B&B Tree           :
3.30/3.38	c   number of runs   :          1
3.30/3.38	c   nodes            :          7
3.30/3.38	c   nodes (total)    :          7
3.30/3.38	c   nodes left       :          0
3.30/3.38	c   max depth        :          3
3.30/3.38	c   max depth (total):          3
3.30/3.38	c   backtracks       :          1 (14.3%)
3.30/3.38	c   delayed cutoffs  :          0
3.30/3.38	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
3.30/3.38	c   avg switch length:       2.00
3.30/3.38	c   switching time   :       0.01
3.30/3.38	c Solution           :
3.30/3.38	c   Solutions found  :          0 (0 improvements)
3.30/3.38	c   Primal Bound     : infeasible
3.30/3.38	c   Dual Bound       :          -
3.30/3.38	c   Gap              :       0.00 %
3.30/3.38	c   Root Dual Bound  : +0.00000000000000e+00
3.30/3.38	c   Root Iterations  :        403
3.30/3.39	c Time complete: 3.38.

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-2665759-1276276130/watcher-2665759-1276276130 -o /tmp/evaluation-result-2665759-1276276130/solver-2665759-1276276130 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665759-1276276130.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.46 1.17 1.06 3/106 5429
/proc/meminfo: memFree=1564468/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=9288 CPUtime=0
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 1055 0 0 0 0 0 0 0 20 0 1 0 3214517 9510912 976 1992294400 4194304 9819077 140735627775552 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/5429/statm: 2322 986 371 1374 0 943 0

[startup+0.0840599 s]
/proc/loadavg: 1.46 1.17 1.06 3/106 5429
/proc/meminfo: memFree=1564468/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=23764 CPUtime=0.07
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 8864 0 0 0 5 2 0 0 20 0 1 0 3214517 24334336 4313 1992294400 4194304 9819077 140735627775552 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5429/statm: 5941 4313 679 1374 0 4562 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 23764

[startup+0.102062 s]
/proc/loadavg: 1.46 1.17 1.06 3/106 5429
/proc/meminfo: memFree=1564468/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=23764 CPUtime=0.09
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 8891 0 0 0 7 2 0 0 20 0 1 0 3214517 24334336 4340 1992294400 4194304 9819077 140735627775552 18446744073709551615 4854299 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5429/statm: 5941 4340 681 1374 0 4562 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23764

[startup+0.301088 s]
/proc/loadavg: 1.46 1.17 1.06 3/106 5429
/proc/meminfo: memFree=1564468/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=17276 CPUtime=0.29
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 9059 0 0 0 26 3 0 0 20 0 1 0 3214517 17690624 3214 1992294400 4194304 9819077 140735627775552 18446744073709551615 4310845 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5429/statm: 4319 3214 694 1374 0 2940 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 17276

[startup+0.700139 s]
/proc/loadavg: 1.46 1.17 1.06 3/106 5429
/proc/meminfo: memFree=1564468/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=18840 CPUtime=0.69
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 9665 0 0 0 65 4 0 0 21 0 1 0 3214517 19292160 3246 1992294400 4194304 9819077 140735627775552 18446744073709551615 7317184 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5429/statm: 4710 3246 700 1374 0 3331 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 18840

[startup+1.50024 s]
/proc/loadavg: 1.42 1.17 1.06 2/107 5430
/proc/meminfo: memFree=1553672/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=17964 CPUtime=1.49
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 9929 0 0 0 143 6 0 0 23 0 1 0 3214517 18395136 3247 1992294400 4194304 9819077 140735627775552 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5429/statm: 4491 3247 721 1374 0 3112 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 17964

[startup+3.10045 s]
/proc/loadavg: 1.42 1.17 1.06 2/107 5430
/proc/meminfo: memFree=1553424/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=17276 CPUtime=3.08
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 10794 0 0 0 299 9 0 0 25 0 1 0 3214517 17690624 3243 1992294400 4194304 9819077 140735627775552 18446744073709551615 7309707 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5429/statm: 4319 3243 721 1374 0 2940 0
Current children cumulated CPU time (s) 3.08
Current children cumulated vsize (KiB) 17276

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

[startup+3.30848 s]
/proc/loadavg: 1.42 1.17 1.06 2/107 5430
/proc/meminfo: memFree=1553176/2059040 swapFree=4192956/4192956
[pid=5429] ppid=5427 vsize=17276 CPUtime=3.3
/proc/5429/stat : 5429 (pbscip.linux.x8) R 5427 5429 3419 0 -1 4202496 10967 0 0 0 320 10 0 0 25 0 1 0 3214517 17690624 3243 1992294400 4194304 9819077 140735627775552 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5429/statm: 4319 3243 721 1374 0 2940 0
Current children cumulated CPU time (s) 3.3
Current children cumulated vsize (KiB) 17276

Child status: 0
Real time (s): 3.39317
CPU time (s): 3.39248
CPU user time (s): 3.2865
CPU system time (s): 0.105983
CPU usage (%): 99.9797
Max. virtual memory (cumulated for all children) (KiB): 24032

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

runsolver used 0.004999 second user time and 0.033994 second system time

The end

Launcher Data 

Begin job on node013 at 2010-06-11 19:08:50
IDJOB=2665759
IDBENCH=1221
IDSOLVER=1168
FILE ID=node013/2665759-1276276130
PBS_JOBID= 11172198
Free space on /tmp= 62424 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.1110967523.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-2665759-1276276130/watcher-2665759-1276276130 -o /tmp/evaluation-result-2665759-1276276130/solver-2665759-1276276130 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665759-1276276130.opb -t 1800 -m 1800

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

MD5SUM BENCH= 5cdd8cb1372de7a07cb58778faffedf0
RANDOM SEED=391155703

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1564996 kB
Buffers:         53640 kB
Cached:         313952 kB
SwapCached:          0 kB
Active:         173832 kB
Inactive:       253004 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1564996 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6220 kB
Writeback:           0 kB
AnonPages:       59176 kB
Mapped:          15388 kB
Slab:            45532 kB
PageTables:       4008 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181576 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= 62420 MiB
End job on node013 at 2010-06-11 19:08:54