Trace number 2665792

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 2.01069 2.01103

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111227012.opb
MD5SUMf1ef73d71b7207a4f4673a4d36adcee2
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.152976
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 1220
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-2665792-1276278642.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.00
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 |    55 |     - | 743k|   0 |  42 | 169 |  73 | 169 |  73 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.26	c   0.2s|     1 |     0 |   100 |     - |1140k|   0 |  58 | 169 | 220 | 169 |  97 |  24 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.29	c   0.2s|     1 |     0 |   227 |     - |1290k|   0 |  60 | 169 | 220 | 169 | 107 |  34 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.31	c   0.3s|     1 |     0 |   323 |     - |1333k|   0 |  60 | 169 | 220 | 169 | 114 |  41 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.34	c   0.3s|     1 |     0 |   382 |     - |1414k|   0 |  60 | 169 | 220 | 169 | 119 |  46 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.37	c   0.3s|     1 |     0 |   565 |     - |1426k|   0 |  61 | 169 | 220 | 169 | 124 |  51 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.89/0.93	c   0.9s|     1 |     0 |   700 |     - |1413k|   0 |  60 | 169 | 208 | 169 | 124 |  51 |   0 |  13 | 0.000000e+00 |      --      |    Inf 
1.10/1.19	c   1.1s|     1 |     0 |   883 |     - |1336k|   0 |  62 | 169 | 137 | 169 | 124 |  51 |   0 |  20 | 0.000000e+00 |      --      |    Inf 
1.39/1.49	c   1.4s|     1 |     0 |  1197 |     - |1327k|   0 |  51 | 169 | 128 | 169 | 124 |  51 |   0 |  29 | 0.000000e+00 |      --      |    Inf 
1.49/1.58	c   1.5s|     1 |     0 |  1257 |     - |1325k|   0 |  52 | 169 | 126 | 169 | 124 |  51 |   0 |  35 | 0.000000e+00 |      --      |    Inf 
1.60/1.66	c   1.6s|     1 |     0 |  1304 |     - |1316k|   0 |  55 | 169 | 118 | 169 | 124 |  51 |   0 |  40 | 0.000000e+00 |      --      |    Inf 
1.69/1.75	c   1.7s|     1 |     0 |  1327 |     - |1308k|   0 |  54 | 169 | 110 | 169 | 103 |  51 |   0 |  45 | 0.000000e+00 |      --      |    Inf 
1.79/1.82	c   1.7s|     1 |     0 |  1327 |     - |1307k|   0 |   - | 169 | 110 | 169 | 103 |  51 |   0 |  50 | 0.000000e+00 |      --      |    Inf 
1.79/1.82	c (run 1, node 1) restarting after 34 global fixings of integer variables
1.79/1.82	c 
1.79/1.82	c (restart) converted 30 cuts from the global cut pool into linear constraints
1.79/1.82	c 
1.79/1.82	c presolving:
1.79/1.83	c (round 1) 34 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 84 clqs
1.79/1.83	c (round 2) 34 del vars, 22 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 14 impls, 84 clqs
1.79/1.84	c (round 3) 34 del vars, 22 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 48 upgd conss, 14 impls, 84 clqs
1.79/1.85	c (round 4) 34 del vars, 22 del conss, 0 chg bounds, 2 chg sides, 1 chg coeffs, 48 upgd conss, 14 impls, 84 clqs
1.79/1.85	c presolving (5 rounds):
1.79/1.85	c  34 deleted vars, 22 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 1 changed coefficients
1.79/1.85	c  14 implications, 84 cliques
1.79/1.85	c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 118 constraints
1.79/1.85	c      12 constraints of type <knapsack>
1.79/1.85	c      84 constraints of type <setppc>
1.79/1.85	c      22 constraints of type <logicor>
1.79/1.85	c transformed objective value is always integral (scale: 1)
1.79/1.85	c Presolving Time: 0.02
1.79/1.85	c 
1.79/1.86	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.79/1.86	c   1.8s|     1 |     0 |  1418 |     - | 920k|   0 |  44 | 135 | 118 | 135 |  98 |   0 |   0 |  50 | 0.000000e+00 |      --      |    Inf 
1.79/1.89	c   1.8s|     1 |     0 |  1505 |     - |1197k|   0 |  56 | 135 | 118 | 135 | 108 |  10 |   0 |  50 | 0.000000e+00 |      --      |    Inf 
1.99/2.00	c   1.9s|     1 |     0 |  1705 |     - |1197k|   0 |   - | 135 | 118 | 135 | 108 |  10 |   0 |  56 |      --      |      --      |   0.00%
1.99/2.00	c   1.9s|     1 |     0 |  1705 |     - |1197k|   0 |   - | 135 | 118 | 135 | 108 |  10 |   0 |  56 |      --      |      --      |   0.00%
1.99/2.00	c 
1.99/2.00	c SCIP Status        : problem is solved [infeasible]
1.99/2.00	c Solving Time (sec) : 1.89
1.99/2.00	c Solving Nodes      : 1 (total of 2 nodes in 2 runs)
1.99/2.00	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
1.99/2.00	c Dual Bound         : +1.00000000000000e+20
1.99/2.00	c Gap                : 0.00 %
1.99/2.00	s UNSATISFIABLE
1.99/2.00	c SCIP Status        : problem is solved [infeasible]
1.99/2.00	c Solving Time       :       1.89
1.99/2.00	c Original Problem   :
1.99/2.00	c   Problem name     : HOME/instance-2665792-1276278642.opb
1.99/2.00	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.00	c   Constraints      : 101 initial, 101 maximal
1.99/2.00	c Presolved Problem  :
1.99/2.00	c   Problem name     : t_HOME/instance-2665792-1276278642.opb
1.99/2.00	c   Variables        : 135 (135 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.00	c   Constraints      : 118 initial, 118 maximal
1.99/2.00	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.99/2.00	c   trivial          :       0.00         34          0          0          0          0          0          0          0
1.99/2.00	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.99/2.00	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.99/2.00	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.99/2.00	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.99/2.00	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.99/2.00	c   knapsack         :       0.01          0          0          0          0          0          0          0          1
1.99/2.00	c   setppc           :       0.01          0          0          0          0          0          0          0          0
1.99/2.00	c   linear           :       0.00          0          0          0          0          0         47          2          0
1.99/2.00	c   logicor          :       0.00          0          0          0          0          0          3          0          0
1.99/2.00	c   root node        :          -         39          -          -         39          -          -          -          -
1.99/2.00	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.99/2.00	c   integral         :          0          0          0          8          0          0         39          0          0          0
1.99/2.00	c   knapsack         :         12          6          9          0          0          0          0          0          0          0
1.99/2.00	c   setppc           :         84          6          9          0          0          0          0          0          0          0
1.99/2.00	c   logicor          :         22          6          3          0          0          0          0          0          0          0
1.99/2.00	c   countsols        :          0          0          0          0          0          0          0          0          0          0
1.99/2.00	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.99/2.00	c   integral         :       1.47       0.00       0.00       1.47       0.00
1.99/2.00	c   knapsack         :       0.01       0.01       0.00       0.00       0.00
1.99/2.00	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.99/2.00	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.99/2.00	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.99/2.00	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.99/2.00	c   vbounds          :       0.00          2          0          0
1.99/2.00	c   rootredcost      :       0.00          0          0          0
1.99/2.00	c   pseudoobj        :       0.00          0          0          0
1.99/2.00	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.99/2.00	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.99/2.00	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.00	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.00	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.00	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.99/2.00	c   applied globally :          -          -          -          0        0.0          -          -          -
1.99/2.00	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.99/2.00	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.99/2.00	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 83)
1.99/2.00	c   redcost          :       0.00          6          0          0          0          0
1.99/2.00	c   impliedbounds    :       0.00          6          0          0          0          0
1.99/2.00	c   intobj           :       0.00          0          0          0          0          0
1.99/2.00	c   cgmip            :       0.00          0          0          0          0          0
1.99/2.00	c   gomory           :       0.05          6          0          0         20          0
1.99/2.00	c   strongcg         :       0.05          6          0          0        189          0
1.99/2.00	c   cmir             :       0.00          0          0          0          0          0
1.99/2.00	c   flowcover        :       0.00          0          0          0          0          0
1.99/2.00	c   clique           :       0.00          6          0          0         30          0
1.99/2.00	c   zerohalf         :       0.00          0          0          0          0          0
1.99/2.00	c   mcf              :       0.00          2          0          0          0          0
1.99/2.00	c   rapidlearning    :       0.17          1          0          0          0        147
1.99/2.00	c Pricers            :       Time      Calls       Vars
1.99/2.00	c   problem variables:       0.00          0          0
1.99/2.00	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.99/2.00	c   relpscost        :       1.47          8          0         39          0          0          0
1.99/2.00	c   pscost           :       0.00          0          0          0          0          0          0
1.99/2.00	c   inference        :       0.00          0          0          0          0          0          0
1.99/2.00	c   mostinf          :       0.00          0          0          0          0          0          0
1.99/2.00	c   leastinf         :       0.00          0          0          0          0          0          0
1.99/2.00	c   fullstrong       :       0.00          0          0          0          0          0          0
1.99/2.00	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.99/2.00	c   random           :       0.00          0          0          0          0          0          0
1.99/2.00	c Primal Heuristics  :       Time      Calls      Found
1.99/2.00	c   LP solutions     :       0.00          -          0
1.99/2.00	c   pseudo solutions :       0.00          -          0
1.99/2.00	c   trivial          :       0.00          1          0
1.99/2.00	c   simplerounding   :       0.00          0          0
1.99/2.00	c   zirounding       :       0.00          0          0
1.99/2.00	c   rounding         :       0.00          0          0
1.99/2.00	c   shifting         :       0.00          0          0
1.99/2.00	c   intshifting      :       0.00          0          0
1.99/2.00	c   oneopt           :       0.00          0          0
1.99/2.00	c   twoopt           :       0.00          0          0
1.99/2.00	c   fixandinfer      :       0.00          0          0
1.99/2.00	c   feaspump         :       0.00          0          0
1.99/2.00	c   coefdiving       :       0.00          0          0
1.99/2.00	c   pscostdiving     :       0.00          0          0
1.99/2.00	c   fracdiving       :       0.00          0          0
1.99/2.00	c   veclendiving     :       0.00          0          0
1.99/2.00	c   intdiving        :       0.00          0          0
1.99/2.00	c   actconsdiving    :       0.00          0          0
1.99/2.00	c   objpscostdiving  :       0.00          0          0
1.99/2.00	c   rootsoldiving    :       0.00          0          0
1.99/2.00	c   linesearchdiving :       0.00          0          0
1.99/2.00	c   guideddiving     :       0.00          0          0
1.99/2.00	c   octane           :       0.00          0          0
1.99/2.00	c   rens             :       0.00          0          0
1.99/2.00	c   rins             :       0.00          0          0
1.99/2.00	c   localbranching   :       0.00          0          0
1.99/2.00	c   mutation         :       0.00          0          0
1.99/2.00	c   crossover        :       0.00          0          0
1.99/2.00	c   dins             :       0.00          0          0
1.99/2.00	c   undercover       :       0.00          0          0
1.99/2.00	c   nlp              :       0.00          0          0
1.99/2.00	c   trysol           :       0.00          0          0
1.99/2.00	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.99/2.00	c   primal LP        :       0.01          0          0       0.00       0.00
1.99/2.00	c   dual LP          :       0.10         15       1705     113.67   17050.00
1.99/2.00	c   lex dual LP      :       0.00          0          0       0.00          -
1.99/2.00	c   barrier LP       :       0.00          0          0       0.00          -
1.99/2.00	c   diving/probing LP:       0.00          0          0       0.00          -
1.99/2.00	c   strong branching :       1.47         56      21629     386.23   14713.61
1.99/2.00	c     (at root node) :          -         56      21629     386.23          -
1.99/2.00	c   conflict analysis:       0.00          0          0       0.00          -
1.99/2.00	c B&B Tree           :
1.99/2.00	c   number of runs   :          2
1.99/2.00	c   nodes            :          1
1.99/2.00	c   nodes (total)    :          2
1.99/2.00	c   nodes left       :          0
1.99/2.00	c   max depth        :          0
1.99/2.00	c   max depth (total):          0
1.99/2.00	c   backtracks       :          0 (0.0%)
1.99/2.00	c   delayed cutoffs  :          0
1.99/2.00	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.99/2.00	c   avg switch length:       2.00
1.99/2.00	c   switching time   :       0.00
1.99/2.00	c Solution           :
1.99/2.00	c   Solutions found  :          0 (0 improvements)
1.99/2.00	c   Primal Bound     : infeasible
1.99/2.00	c   Dual Bound       :          -
1.99/2.00	c   Gap              :       0.00 %
1.99/2.00	c   Root Dual Bound  :          -
1.99/2.00	c   Root Iterations  :       1705
1.99/2.01	c Time complete: 2.

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-2665792-1276278642/watcher-2665792-1276278642 -o /tmp/evaluation-result-2665792-1276278642/solver-2665792-1276278642 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665792-1276278642.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.04 1.04 1.01 3/106 5859
/proc/meminfo: memFree=1563028/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=8260 CPUtime=0
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 1014 0 0 0 0 0 0 0 20 0 1 0 3468185 8458240 935 1992294400 4194304 9819077 140736320381696 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/5859/statm: 2322 945 371 1374 0 943 0

[startup+0.0725859 s]
/proc/loadavg: 1.04 1.04 1.01 3/106 5859
/proc/meminfo: memFree=1563028/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=22240 CPUtime=0.06
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 7455 0 0 0 4 2 0 0 20 0 1 0 3468185 22773760 3931 1992294400 4194304 9819077 140736320381696 18446744073709551615 5960701 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5859/statm: 5560 3931 673 1374 0 4181 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 22240

[startup+0.101588 s]
/proc/loadavg: 1.04 1.04 1.01 3/106 5859
/proc/meminfo: memFree=1563028/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=23564 CPUtime=0.09
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 8844 0 0 0 6 3 0 0 20 0 1 0 3468185 24129536 4292 1992294400 4194304 9819077 140736320381696 18446744073709551615 4854295 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5859/statm: 5891 4292 681 1374 0 4512 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23564

[startup+0.301609 s]
/proc/loadavg: 1.04 1.04 1.01 3/106 5859
/proc/meminfo: memFree=1563028/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=17104 CPUtime=0.29
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 9025 0 0 0 25 4 0 0 20 0 1 0 3468185 17514496 3179 1992294400 4194304 9819077 140736320381696 18446744073709551615 6007097 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5859/statm: 4276 3179 694 1374 0 2897 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 17104

[startup+0.701651 s]
/proc/loadavg: 1.04 1.04 1.01 3/106 5859
/proc/meminfo: memFree=1563028/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=18476 CPUtime=0.69
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 9607 0 0 0 64 5 0 0 21 0 1 0 3468185 18919424 3210 1992294400 4194304 9819077 140736320381696 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5859/statm: 4619 3210 700 1374 0 3240 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 18476

[startup+1.50173 s]
/proc/loadavg: 1.04 1.04 1.01 2/107 5860
/proc/meminfo: memFree=1552356/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=18252 CPUtime=1.49
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 10671 0 0 0 142 7 0 0 23 0 1 0 3468185 18690048 3204 1992294400 4194304 9819077 140736320381696 18446744073709551615 6656908 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5859/statm: 4563 3204 700 1374 0 3184 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 18252

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

[startup+1.90178 s]
/proc/loadavg: 1.04 1.04 1.01 2/107 5860
/proc/meminfo: memFree=1552356/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=18908 CPUtime=1.9
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 14278 0 0 0 181 9 0 0 25 0 1 0 3468185 19361792 3263 1992294400 4194304 9819077 140736320381696 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5859/statm: 4727 3263 711 1374 0 3348 0
Current children cumulated CPU time (s) 1.9
Current children cumulated vsize (KiB) 18908

[startup+2.00179 s]
/proc/loadavg: 1.04 1.04 1.01 2/107 5860
/proc/meminfo: memFree=1552356/2059040 swapFree=4192956/4192956
[pid=5859] ppid=5857 vsize=17808 CPUtime=1.99
/proc/5859/stat : 5859 (pbscip.linux.x8) R 5857 5859 5381 0 -1 4202496 14680 0 0 0 190 9 0 0 25 0 1 0 3468185 18235392 3251 1992294400 4194304 9819077 140736320381696 18446744073709551615 6391514 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5859/statm: 4452 3251 711 1374 0 3073 0
Current children cumulated CPU time (s) 1.99
Current children cumulated vsize (KiB) 17808

Child status: 0
Real time (s): 2.01103
CPU time (s): 2.01069
CPU user time (s): 1.91371
CPU system time (s): 0.096985
CPU usage (%): 99.9831
Max. virtual memory (cumulated for all children) (KiB): 23828

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.91371
system time used= 0.096985
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 14690
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 23

runsolver used 0.006998 second user time and 0.022996 second system time

The end

Launcher Data 

Begin job on node002 at 2010-06-11 19:50:42
IDJOB=2665792
IDBENCH=1254
IDSOLVER=1168
FILE ID=node002/2665792-1276278642
PBS_JOBID= 11173101
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.1111227012.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-2665792-1276278642/watcher-2665792-1276278642 -o /tmp/evaluation-result-2665792-1276278642/solver-2665792-1276278642 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665792-1276278642.opb -t 1800 -m 1800

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

MD5SUM BENCH= f1ef73d71b7207a4f4673a4d36adcee2
RANDOM SEED=1961206262

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:       1563556 kB
Buffers:         55088 kB
Cached:         313744 kB
SwapCached:          0 kB
Active:         173900 kB
Inactive:       254280 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1563556 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6228 kB
Writeback:           0 kB
AnonPages:       59192 kB
Mapped:          15464 kB
Slab:            45620 kB
PageTables:       4072 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181432 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 19:50:44