Trace number 2665700

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solverSAT 6.98594 6.98865

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
prestwich/armies/normalized-army8.9ls.opb
MD5SUMf22ee27ae396dfbceb6d2e4359af424f
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.096984
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables220
Total number of constraints332
Number of constraints which are clauses202
Number of constraints which are cardinality constraints (but not clauses)2
Number of constraints which are nor clauses,nor cardinality constraints128
Minimum length of a constraint2
Maximum length of a constraint64
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 9
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 73
Number of bits of the biggest sum of numbers7
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-2665700-1276269662.opb>
0.00/0.01	c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 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.02	c presolving:
0.02/0.03	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.02/0.04	c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.02/0.04	c presolving (3 rounds):
0.02/0.04	c  8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.04	c  5244 implications, 0 cliques
0.02/0.04	c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.02/0.04	c     130 constraints of type <knapsack>
0.02/0.04	c     202 constraints of type <logicor>
0.02/0.04	c transformed objective value is always integral (scale: 1)
0.02/0.04	c Presolving Time: 0.02
0.02/0.04	c - non default parameters ----------------------------------------------------------------------
0.02/0.04	c # SCIP version 1.2.1.2
0.02/0.04	c 
0.02/0.04	c # frequency for displaying node information lines
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04	c display/freq = 10000
0.02/0.04	c 
0.02/0.04	c # maximal time in seconds to run
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04	c limits/time = 1799.99
0.02/0.04	c 
0.02/0.04	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04	c limits/memory = 1620
0.02/0.04	c 
0.02/0.04	c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04	c limits/solutions = 1
0.02/0.04	c 
0.02/0.04	c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.04	c separating/maxrounds = 1
0.02/0.04	c 
0.02/0.04	c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04	c separating/maxroundsroot = 5
0.02/0.04	c 
0.02/0.04	c # should presolving try to simplify inequalities
0.02/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04	c constraints/linear/simplifyinequalities = TRUE
0.02/0.04	c 
0.02/0.04	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.04	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.04	c constraints/knapsack/disaggregation = FALSE
0.02/0.04	c 
0.02/0.04	c # should presolving try to simplify knapsacks
0.02/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04	c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04	c 
0.02/0.04	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04	c presolving/probing/maxrounds = 0
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04	c heuristics/coefdiving/freq = -1
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04	c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.04	c heuristics/crossover/freq = -1
0.02/0.04	c 
0.02/0.04	c # number of nodes added to the contingent of the total nodes
0.02/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.04	c heuristics/crossover/nodesofs = 750
0.02/0.04	c 
0.02/0.04	c # number of nodes without incumbent change that heuristic should wait
0.02/0.04	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.04	c heuristics/crossover/nwaitingnodes = 100
0.02/0.04	c 
0.02/0.04	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.04	c # [type: real, range: [0,1], default: 0.1]
0.02/0.04	c heuristics/crossover/nodesquot = 0.15
0.02/0.04	c 
0.02/0.04	c # minimum percentage of integer variables that have to be fixed 
0.02/0.04	c # [type: real, range: [0,1], default: 0.666]
0.02/0.04	c heuristics/crossover/minfixingrate = 0.5
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04	c heuristics/feaspump/freq = -1
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04	c heuristics/fracdiving/freq = -1
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04	c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04	c heuristics/guideddiving/freq = -1
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04	c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04	c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04	c heuristics/intshifting/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04	c heuristics/linesearchdiving/freq = -1
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04	c heuristics/nlp/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04	c heuristics/objpscostdiving/freq = -1
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.04	c # [type: real, range: [0,1], default: 0.01]
0.02/0.04	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04	c heuristics/oneopt/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04	c heuristics/pscostdiving/freq = -1
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04	c heuristics/rens/freq = -1
0.02/0.04	c 
0.02/0.04	c # minimum percentage of integer variables that have to be fixable 
0.02/0.04	c # [type: real, range: [0,1], default: 0.5]
0.02/0.04	c heuristics/rens/minfixingrate = 0.3
0.02/0.04	c 
0.02/0.04	c # number of nodes added to the contingent of the total nodes
0.02/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.04	c heuristics/rens/nodesofs = 2000
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04	c heuristics/rootsoldiving/freq = -1
0.02/0.04	c 
0.02/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.04	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.04	c 
0.02/0.04	c # additional number of allowed LP iterations
0.02/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04	c heuristics/rounding/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04	c heuristics/shifting/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04	c heuristics/simplerounding/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04	c heuristics/trivial/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04	c heuristics/trysol/freq = -1
0.02/0.04	c 
0.02/0.04	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.05	c heuristics/veclendiving/freq = -1
0.02/0.05	c 
0.02/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.05	c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.05	c 
0.02/0.05	c # additional number of allowed LP iterations
0.02/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.05	c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.05	c 
0.02/0.05	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.05	c heuristics/zirounding/freq = -1
0.02/0.05	c 
0.02/0.05	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.05	c separating/cmir/freq = -1
0.02/0.05	c 
0.02/0.05	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.05	c separating/flowcover/freq = -1
0.02/0.05	c 
0.02/0.05	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05	c separating/rapidlearning/freq = 0
0.02/0.05	c 
0.02/0.05	c -----------------------------------------------------------------------------------------------
0.02/0.05	c start solving
0.02/0.05	c 
0.02/0.05	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.02/0.05	c   0.0s|     1 |     0 |    88 |     - |1302k|   0 |  52 | 212 | 332 | 212 | 324 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.25	c   0.2s|     1 |     0 |   199 |     - |1647k|   0 | 101 | 212 | 333 | 212 | 484 | 160 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.37	c   0.3s|     1 |     0 |   276 |     - |2786k|   0 | 117 | 212 | 333 | 212 | 577 | 253 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.39/0.46	c   0.4s|     1 |     0 |   290 |     - |3554k|   0 | 116 | 212 | 333 | 212 | 588 | 264 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.49/0.57	c   0.5s|     1 |     0 |   305 |     - |4264k|   0 | 117 | 212 | 333 | 212 | 592 | 268 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.59/0.67	c   0.6s|     1 |     0 |   323 |     - |5008k|   0 | 117 | 212 | 333 | 212 | 593 | 269 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.69/0.79	c   0.7s|     1 |     2 |   323 |     - |5008k|   0 | 117 | 212 | 333 | 212 | 593 | 269 |   0 |  10 | 0.000000e+00 |      --      |    Inf 
6.89/6.97	c * 6.2s|  2538 |     0 | 16643 |   6.4 |5622k|  37 |   - | 212 |1546 | 212 | 423 | 269 |1435 |1406 | 0.000000e+00 | 0.000000e+00 |   0.00%
6.89/6.97	c 
6.89/6.97	c SCIP Status        : problem is solved [optimal solution found]
6.89/6.97	c Solving Time (sec) : 6.25
6.89/6.97	c Solving Nodes      : 2538
6.89/6.97	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
6.89/6.97	c Dual Bound         : +0.00000000000000e+00
6.89/6.97	c Gap                : 0.00 %
6.89/6.97	s SATISFIABLE
6.89/6.97	v -x219 x220 x217 -x218 x215 -x216 -x213 x214 -x211 x212 -x209 -x210 -x207 -x208 -x205 x206 -x203 x204 -x201 x202 -x199 x200 -x197 
6.89/6.97	v x198 -x195 x196 -x193 x194 -x191 x192 x189 -x190 x187 -x188 x185 -x186 x183 -x184 x181 -x182 x179 -x180 -x177 -x178 -x175 -x176 
6.89/6.97	v -x173 x174 -x171 x172 x169 -x170 x167 -x168 x165 -x166 x163 -x164 -x161 x162 -x159 x160 -x157 x158 -x155 x156 x153 -x154 
6.89/6.97	v x151 -x152 x149 -x150 -x147 x148 x145 -x146 -x143 x144 -x141 x142 -x139 x140 x137 -x138 x135 -x136 -x133 x134 x131 -x132 x129 
6.89/6.97	v -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90 -x88 
6.89/6.97	v -x86 -x84 -x82 -x80 -x78 -x76 -x74 -x72 x70 -x68 x66 -x64 -x62 -x60 -x58 -x56 x54 -x52 x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36 
6.89/6.97	v -x34 -x32 -x30 -x28 x26 x24 -x22 -x20 x18 -x16 -x14 -x12 -x10 x8 x6 -x4 -x2 x127 -x125 -x123 -x121 -x119 -x117 x115 -x113 
6.89/6.97	v x111 x109 -x107 -x105 -x103 -x101 x99 -x97 -x95 x93 x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65 -x63 
6.89/6.97	v -x61 -x59 -x57 -x55 -x53 -x51 -x49 x47 x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13 
6.89/6.97	v -x11 -x9 -x7 -x5 -x3 -x1 
6.89/6.97	c SCIP Status        : problem is solved [optimal solution found]
6.89/6.97	c Solving Time       :       6.25
6.89/6.97	c Original Problem   :
6.89/6.97	c   Problem name     : HOME/instance-2665700-1276269662.opb
6.89/6.97	c   Variables        : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
6.89/6.97	c   Constraints      : 332 initial, 332 maximal
6.89/6.97	c Presolved Problem  :
6.89/6.97	c   Problem name     : t_HOME/instance-2665700-1276269662.opb
6.89/6.97	c   Variables        : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
6.89/6.97	c   Constraints      : 332 initial, 1564 maximal
6.89/6.97	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
6.89/6.97	c   trivial          :       0.00          0          0          0          0          0          0          0          0
6.89/6.97	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
6.89/6.97	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
6.89/6.97	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
6.89/6.97	c   implics          :       0.00          0          8          0          0          0          0          0          0
6.89/6.97	c   probing          :       0.00          0          0          0          0          0          0          0          0
6.89/6.97	c   knapsack         :       0.01          0          0          0          0          0          0          0          0
6.89/6.97	c   linear           :       0.01          0          0          0          0          0          0          0          0
6.89/6.97	c   logicor          :       0.00          0          0          0          0          0          0          0          0
6.89/6.97	c   root node        :          -          0          -          -          0          -          -          -          -
6.89/6.97	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
6.89/6.97	c   integral         :          0          0          0       1594          0         12        182          0          0       2926
6.89/6.97	c   knapsack         :        130          5      10462          0          0       1188      27691        273          0          0
6.89/6.97	c   linear           :          0+         5        153          0          0          0          0          0          0          0
6.89/6.97	c   logicor          :        202+         5       6228          1          0         95      14946          0          0          0
6.89/6.97	c   countsols        :          0          0          0          1          0          0          0          0          0          0
6.89/6.97	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
6.89/6.97	c   integral         :       2.80       0.00       0.00       2.80       0.00
6.89/6.97	c   knapsack         :       0.24       0.01       0.23       0.00       0.00
6.89/6.97	c   linear           :       0.00       0.00       0.00       0.00       0.00
6.89/6.97	c   logicor          :       0.09       0.00       0.09       0.00       0.00
6.89/6.97	c   countsols        :       0.00       0.00       0.00       0.00       0.00
6.89/6.97	c Propagators        :       Time      Calls    Cutoffs    DomReds
6.89/6.97	c   vbounds          :       0.00          1          0          0
6.89/6.97	c   rootredcost      :       0.00          0          0          0
6.89/6.97	c   pseudoobj        :       0.01          0          0          0
6.89/6.97	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
6.89/6.97	c   propagation      :       0.11       1283       1116       9308       56.7         17       41.0          -
6.89/6.97	c   infeasible LP    :       0.02         99          0          0        0.0          0        0.0          0
6.89/6.97	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
6.89/6.97	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
6.89/6.97	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
6.89/6.97	c   applied globally :          -          -          -       1426       17.2          -          -          -
6.89/6.97	c   applied locally  :          -          -          -          9       79.7          -          -          -
6.89/6.97	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
6.89/6.97	c   cut pool         :       0.00          4          -          -        247          -    (maximal pool size: 1197)
6.89/6.97	c   redcost          :       0.00       1510          0          0          0          0
6.89/6.97	c   impliedbounds    :       0.00          5          0          0        371          0
6.89/6.97	c   intobj           :       0.00          0          0          0          0          0
6.89/6.97	c   cgmip            :       0.00          0          0          0          0          0
6.89/6.97	c   gomory           :       0.17          5          0          0        142          0
6.89/6.97	c   strongcg         :       0.21          5          0          0       1489          0
6.89/6.97	c   cmir             :       0.00          0          0          0          0          0
6.89/6.97	c   flowcover        :       0.00          0          0          0          0          0
6.89/6.97	c   clique           :       0.00          1          0          0          0          0
6.89/6.97	c   zerohalf         :       0.00          0          0          0          0          0
6.89/6.97	c   mcf              :       0.00          1          0          0          0          0
6.89/6.97	c   rapidlearning    :       0.14          1          0          0          0          1
6.89/6.97	c Pricers            :       Time      Calls       Vars
6.89/6.97	c   problem variables:       0.00          0          0
6.89/6.97	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
6.89/6.97	c   relpscost        :       2.79       1593         12        182          0          0       2926
6.89/6.97	c   pscost           :       0.00          0          0          0          0          0          0
6.89/6.97	c   inference        :       0.00          0          0          0          0          0          0
6.89/6.97	c   mostinf          :       0.00          0          0          0          0          0          0
6.89/6.97	c   leastinf         :       0.00          0          0          0          0          0          0
6.89/6.97	c   fullstrong       :       0.00          0          0          0          0          0          0
6.89/6.97	c   allfullstrong    :       0.00          0          0          0          0          0          0
6.89/6.97	c   random           :       0.00          0          0          0          0          0          0
6.89/6.97	c Primal Heuristics  :       Time      Calls      Found
6.89/6.97	c   LP solutions     :       0.00          -          1
6.89/6.97	c   pseudo solutions :       0.00          -          0
6.89/6.97	c   trivial          :       0.00          1          0
6.89/6.97	c   simplerounding   :       0.00          0          0
6.89/6.97	c   zirounding       :       0.00          0          0
6.89/6.97	c   rounding         :       0.00          0          0
6.89/6.97	c   shifting         :       0.00          0          0
6.89/6.97	c   intshifting      :       0.00          0          0
6.89/6.97	c   oneopt           :       0.00          0          0
6.89/6.97	c   twoopt           :       0.00          0          0
6.89/6.97	c   fixandinfer      :       0.00          0          0
6.89/6.97	c   feaspump         :       0.00          0          0
6.89/6.97	c   coefdiving       :       0.00          0          0
6.89/6.97	c   pscostdiving     :       0.00          0          0
6.89/6.97	c   fracdiving       :       0.00          0          0
6.89/6.97	c   veclendiving     :       0.00          0          0
6.89/6.97	c   intdiving        :       0.00          0          0
6.89/6.97	c   actconsdiving    :       0.00          0          0
6.89/6.97	c   objpscostdiving  :       0.00          0          0
6.89/6.97	c   rootsoldiving    :       0.00          0          0
6.89/6.97	c   linesearchdiving :       0.00          0          0
6.89/6.97	c   guideddiving     :       0.00          0          0
6.89/6.97	c   octane           :       0.00          0          0
6.89/6.97	c   rens             :       0.00          0          0
6.89/6.97	c   rins             :       0.00          0          0
6.89/6.97	c   localbranching   :       0.00          0          0
6.89/6.97	c   mutation         :       0.00          0          0
6.89/6.97	c   crossover        :       0.00          0          0
6.89/6.97	c   dins             :       0.00          0          0
6.89/6.97	c   undercover       :       0.00          0          0
6.89/6.97	c   nlp              :       0.00          0          0
6.89/6.97	c   trysol           :       0.00          0          0
6.89/6.97	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
6.89/6.97	c   primal LP        :       0.00          0          0       0.00          -
6.89/6.97	c   dual LP          :       2.05       1693      16643       9.83    8118.54
6.89/6.97	c   lex dual LP      :       0.00          0          0       0.00          -
6.89/6.97	c   barrier LP       :       0.00          0          0       0.00          -
6.89/6.97	c   diving/probing LP:       0.00          0          0       0.00          -
6.89/6.97	c   strong branching :       2.72       1406      20850      14.83    7665.44
6.89/6.97	c     (at root node) :          -         10        700      70.00          -
6.89/6.97	c   conflict analysis:       0.00          0          0       0.00          -
6.89/6.97	c B&B Tree           :
6.89/6.97	c   number of runs   :          1
6.89/6.97	c   nodes            :       2538
6.89/6.97	c   nodes (total)    :       2538
6.89/6.97	c   nodes left       :          0
6.89/6.97	c   max depth        :         37
6.89/6.97	c   max depth (total):         37
6.89/6.97	c   backtracks       :        523 (20.6%)
6.89/6.97	c   delayed cutoffs  :        335
6.89/6.97	c   repropagations   :       2102 (11055 domain reductions, 320 cutoffs)
6.89/6.97	c   avg switch length:       3.63
6.89/6.97	c   switching time   :       0.22
6.89/6.97	c Solution           :
6.89/6.97	c   Solutions found  :          1 (1 improvements)
6.89/6.97	c   First Solution   : +0.00000000000000e+00   (in run 1, after 2538 nodes, 6.25 seconds, depth 24, found by <relaxation>)
6.89/6.97	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 2538 nodes, 6.25 seconds, depth 24, found by <relaxation>)
6.89/6.97	c   Dual Bound       : +0.00000000000000e+00
6.89/6.97	c   Gap              :       0.00 %
6.89/6.97	c   Root Dual Bound  : +0.00000000000000e+00
6.89/6.97	c   Root Iterations  :        323
6.89/6.98	c Time complete: 6.97.

Verifier Data 

OK	0

Watcher Data 

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2665700-1276269662/watcher-2665700-1276269662 -o /tmp/evaluation-result-2665700-1276269662/solver-2665700-1276269662 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665700-1276269662.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 0.97 3/106 3802
/proc/meminfo: memFree=1580848/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=9288 CPUtime=0
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 1038 0 0 0 0 0 0 0 20 0 1 0 2570171 9510912 959 1992294400 4194304 9819077 140734512455488 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/3802/statm: 2322 969 371 1374 0 943 0

[startup+0.0338821 s]
/proc/loadavg: 1.00 1.00 0.97 3/106 3802
/proc/meminfo: memFree=1580848/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=14824 CPUtime=0.02
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 3051 0 0 0 2 0 0 0 20 0 1 0 2570171 15179776 2362 1992294400 4194304 9819077 140734512455488 18446744073709551615 8675093 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 3706 2373 492 1374 0 2327 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 14824

[startup+0.101897 s]
/proc/loadavg: 1.00 1.00 0.97 3/106 3802
/proc/meminfo: memFree=1580848/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=24604 CPUtime=0.09
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 6961 0 0 0 6 3 0 0 20 0 1 0 2570171 25194496 4443 1992294400 4194304 9819077 140734512455488 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 6151 4443 668 1374 0 4772 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 24604

[startup+0.301942 s]
/proc/loadavg: 1.00 1.00 0.97 3/106 3802
/proc/meminfo: memFree=1580848/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=18052 CPUtime=0.29
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 8062 0 0 0 25 4 0 0 20 0 1 0 2570171 18485248 3038 1992294400 4194304 9819077 140734512455488 18446744073709551615 6179008 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 4513 3038 693 1374 0 3134 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 18052

[startup+0.701031 s]
/proc/loadavg: 1.00 1.00 0.97 3/106 3802
/proc/meminfo: memFree=1580848/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=26096 CPUtime=0.69
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 9844 0 0 0 64 5 0 0 21 0 1 0 2570171 26722304 4538 1992294400 4194304 9819077 140734512455488 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 6524 4538 699 1374 0 5145 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 26096

[startup+1.50121 s]
/proc/loadavg: 1.00 1.00 0.97 2/107 3803
/proc/meminfo: memFree=1565340/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=24280 CPUtime=1.49
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 22420 0 0 0 135 14 0 0 23 0 1 0 2570171 24862720 4549 1992294400 4194304 9819077 140734512455488 18446744073709551615 8723754 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 6315 4554 720 1374 0 4936 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 24280

[startup+3.10056 s]
/proc/loadavg: 1.00 1.00 0.97 2/107 3803
/proc/meminfo: memFree=1565092/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=25548 CPUtime=3.09
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 51684 0 0 0 275 34 0 0 25 0 1 0 2570171 26161152 4594 1992294400 4194304 9819077 140734512455488 18446744073709551615 6364949 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 6094 4586 722 1374 0 4715 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 25548

[startup+6.30127 s]
/proc/loadavg: 1.00 1.00 0.97 2/107 3803
/proc/meminfo: memFree=1564472/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=24656 CPUtime=6.28
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 88543 0 0 0 563 65 0 0 25 0 1 0 2570171 25247744 4747 1992294400 4194304 9819077 140734512455488 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 6164 4747 722 1374 0 4785 0
Current children cumulated CPU time (s) 6.28
Current children cumulated vsize (KiB) 24656

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

[startup+6.70135 s]
/proc/loadavg: 1.00 1.00 0.97 2/107 3803
/proc/meminfo: memFree=1564224/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=24920 CPUtime=6.69
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 91835 0 0 0 601 68 0 0 25 0 1 0 2570171 25518080 4817 1992294400 4194304 9819077 140734512455488 18446744073709551615 6003800 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 6230 4817 722 1374 0 4851 0
Current children cumulated CPU time (s) 6.69
Current children cumulated vsize (KiB) 24920

[startup+6.9014 s]
/proc/loadavg: 1.00 1.00 0.97 2/107 3803
/proc/meminfo: memFree=1564224/2059040 swapFree=4192956/4192956
[pid=3802] ppid=3800 vsize=24724 CPUtime=6.89
/proc/3802/stat : 3802 (pbscip.linux.x8) R 3800 3802 3358 0 -1 4202496 93429 0 0 0 619 70 0 0 25 0 1 0 2570171 25317376 4817 1992294400 4194304 9819077 140734512455488 18446744073709551615 8657695 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/3802/statm: 6230 4818 722 1374 0 4851 0
Current children cumulated CPU time (s) 6.89
Current children cumulated vsize (KiB) 24724

Child status: 0
Real time (s): 6.98865
CPU time (s): 6.98594
CPU user time (s): 6.27604
CPU system time (s): 0.709892
CPU usage (%): 99.9612
Max. virtual memory (cumulated for all children) (KiB): 26412

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

runsolver used 0.012998 second user time and 0.045993 second system time

The end

Launcher Data 

Begin job on node002 at 2010-06-11 17:21:02
IDJOB=2665700
IDBENCH=1162
IDSOLVER=1168
FILE ID=node002/2665700-1276269662
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/prestwich/armies/normalized-army8.9ls.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-2665700-1276269662/watcher-2665700-1276269662 -o /tmp/evaluation-result-2665700-1276269662/solver-2665700-1276269662 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665700-1276269662.opb -t 1800 -m 1800

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

MD5SUM BENCH= f22ee27ae396dfbceb6d2e4359af424f
RANDOM SEED=1286547988

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:       1581376 kB
Buffers:         43528 kB
Cached:         308492 kB
SwapCached:          0 kB
Active:         158032 kB
Inactive:       253404 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1581376 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            6240 kB
Writeback:           0 kB
AnonPages:       59440 kB
Mapped:          15500 kB
Slab:            44472 kB
PageTables:       4008 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   179808 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 17:21:09