Trace number 2665961

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 0.52292 0.522509

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga12_11_sat_pb.cnf.cr.opb
MD5SUM05acc78c42ec3368f84785abcf0f7ebb
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.008998
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables198
Total number of constraints166
Number of constraints which are clauses143
Number of constraints which are cardinality constraints (but not clauses)23
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint6
Maximum length of a constraint12
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 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 13
Number of bits of the biggest sum of numbers4
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-2665961-1276328894.opb>
0.00/0.01	c original problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 166 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.00/0.02	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 166 upgd conss, 0 impls, 23 clqs
0.00/0.03	c presolving (2 rounds):
0.00/0.03	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03	c  0 implications, 23 cliques
0.00/0.03	c presolved problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 166 constraints
0.00/0.03	c      23 constraints of type <setppc>
0.00/0.03	c     143 constraints of type <logicor>
0.00/0.03	c transformed objective value is always integral (scale: 1)
0.00/0.03	c Presolving Time: 0.01
0.00/0.03	c - non default parameters ----------------------------------------------------------------------
0.00/0.03	c # SCIP version 1.2.1.2
0.00/0.03	c 
0.00/0.03	c # frequency for displaying node information lines
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03	c display/freq = 10000
0.00/0.03	c 
0.00/0.03	c # maximal time in seconds to run
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/time = 1800
0.00/0.03	c 
0.00/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/memory = 1620
0.00/0.03	c 
0.00/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c limits/solutions = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03	c separating/maxrounds = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/maxroundsroot = 5
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify inequalities
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/linear/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03	c constraints/knapsack/disaggregation = FALSE
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify knapsacks
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c presolving/probing/maxrounds = 0
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/coefdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03	c heuristics/crossover/freq = -1
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/crossover/nodesofs = 750
0.00/0.03	c 
0.00/0.03	c # number of nodes without incumbent change that heuristic should wait
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03	c heuristics/crossover/nwaitingnodes = 100
0.00/0.03	c 
0.00/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03	c # [type: real, range: [0,1], default: 0.1]
0.00/0.03	c heuristics/crossover/nodesquot = 0.15
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixed 
0.00/0.03	c # [type: real, range: [0,1], default: 0.666]
0.00/0.03	c heuristics/crossover/minfixingrate = 0.5
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/feaspump/freq = -1
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/fracdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/guideddiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/intshifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/linesearchdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/nlp/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/objpscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03	c # [type: real, range: [0,1], default: 0.01]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/oneopt/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/pscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/rens/freq = -1
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixable 
0.00/0.03	c # [type: real, range: [0,1], default: 0.5]
0.00/0.03	c heuristics/rens/minfixingrate = 0.3
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/rens/nodesofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/rootsoldiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/rounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/shifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/simplerounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/trivial/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/trysol/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/veclendiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/zirounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/cmir/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/flowcover/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/rapidlearning/freq = 0
0.00/0.03	c 
0.00/0.03	c -----------------------------------------------------------------------------------------------
0.00/0.03	c start solving
0.00/0.03	c 
0.00/0.04	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.04	c   0.0s|     1 |     0 |    73 |     - | 799k|   0 |  64 | 198 | 166 | 198 | 166 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.17	c   0.1s|     1 |     0 |   148 |     - |1137k|   0 |  75 | 198 | 241 | 198 | 174 |   8 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.20	c   0.2s|     1 |     0 |   280 |     - |1187k|   0 |  79 | 198 | 241 | 198 | 181 |  15 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.24	c   0.2s|     1 |     0 |   440 |     - |1335k|   0 |  64 | 198 | 241 | 198 | 187 |  21 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.27	c   0.2s|     1 |     0 |   546 |     - |1556k|   0 |  63 | 198 | 241 | 198 | 194 |  28 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.29	c   0.2s|     1 |     0 |   645 |     - |1637k|   0 |  57 | 198 | 241 | 198 | 202 |  36 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.32	c   0.3s|     1 |     2 |   645 |     - |1637k|   0 |  57 | 198 | 241 | 198 | 202 |  36 |   0 |  11 | 0.000000e+00 |      --      |    Inf 
0.49/0.51	c * 0.5s|    16 |     0 |   750 |   7.0 |1681k|  14 |   - | 198 | 245 | 198 | 178 |  36 |   4 | 182 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.49/0.51	c 
0.49/0.51	c SCIP Status        : problem is solved [optimal solution found]
0.49/0.51	c Solving Time (sec) : 0.45
0.49/0.51	c Solving Nodes      : 16
0.49/0.51	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.49/0.51	c Dual Bound         : +0.00000000000000e+00
0.49/0.51	c Gap                : 0.00 %
0.49/0.51	s SATISFIABLE
0.49/0.51	v -x24 -x22 -x5 -x2 -x10 -x83 -x82 -x81 -x48 -x46 -x39 -x18 -x3 -x11 -x36 -x31 -x30 -x29 -x28 -x27 -x25 -x17 -x34 -x47 -x7 -x84 -x43 
0.49/0.51	v -x77 -x6 -x23 -x74 -x44 -x4 -x15 -x38 -x186 -x185 x184 -x183 -x182 -x181 -x80 -x132 x131 -x130 -x128 -x127 -x126 -x124 -x122 
0.49/0.51	v -x121 -x13 -x78 -x35 -x21 -x12 -x1 -x59 x58 -x56 -x55 -x54 -x53 -x52 -x51 -x49 -x19 -x60 -x162 -x161 -x160 -x159 -x158 -x42 
0.49/0.51	v -x40 -x50 -x125 x20 -x14 -x168 -x167 -x166 -x165 x164 -x163 x79 -x71 -x70 -x69 -x67 -x66 x64 -x62 x108 -x107 -x106 -x105 -x104 
0.49/0.51	v -x103 -x102 -x101 -x99 -x97 -x75 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 x87 -x86 -x129 -x65 -x33 -x198 -x197 -x196 
0.49/0.51	v x195 -x194 -x193 -x72 -x68 -x37 -x45 x26 -x8 -x192 -x191 -x190 -x189 -x188 x187 x9 -x63 -x157 -x156 x155 -x154 -x153 x41 -x180 
0.49/0.51	v x179 -x178 -x177 -x176 -x175 -x57 -x61 -x142 -x141 -x140 -x139 x138 -x98 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 
0.49/0.51	v -x111 -x110 -x147 x146 -x145 -x144 -x143 -x123 -x100 -x16 x109 -x73 x137 -x136 -x135 -x134 -x133 -x85 x174 -x173 -x172 -x171 
0.49/0.51	v -x170 -x169 -x32 -x152 -x151 -x150 x149 -x148 -x76 
0.49/0.51	c SCIP Status        : problem is solved [optimal solution found]
0.49/0.51	c Solving Time       :       0.45
0.49/0.51	c Original Problem   :
0.49/0.51	c   Problem name     : HOME/instance-2665961-1276328894.opb
0.49/0.51	c   Variables        : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.51	c   Constraints      : 166 initial, 166 maximal
0.49/0.51	c Presolved Problem  :
0.49/0.51	c   Problem name     : t_HOME/instance-2665961-1276328894.opb
0.49/0.51	c   Variables        : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.51	c   Constraints      : 166 initial, 245 maximal
0.49/0.51	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.49/0.51	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   setppc           :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   linear           :       0.01          0          0          0          0          0          0          0          0
0.49/0.51	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.49/0.51	c   root node        :          -          0          -          -          0          -          -          -          -
0.49/0.51	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.49/0.51	c   integral         :          0          0          0         19          0          0          6          0          0         28
0.49/0.51	c   setppc           :         23          5         33          1          0          0         99          0          0          0
0.49/0.51	c   linear           :          0+         5         32          0          0          0          0          0          0          0
0.49/0.51	c   logicor          :        143+         5         14          1          0          0          1          0          0          0
0.49/0.51	c   countsols        :          0          0          0          1          0          0          0          0          0          0
0.49/0.51	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.49/0.51	c   integral         :       0.19       0.00       0.00       0.19       0.00
0.49/0.51	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.49/0.51	c   linear           :       0.00       0.00       0.00       0.00       0.00
0.49/0.51	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.49/0.51	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.49/0.51	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.49/0.51	c   vbounds          :       0.00          1          0          0
0.49/0.51	c   rootredcost      :       0.00          0          0          0
0.49/0.51	c   pseudoobj        :       0.00          0          0          0
0.49/0.51	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.49/0.51	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.49/0.51	c   infeasible LP    :       0.00          1          1          4       12.5          0        0.0          0
0.49/0.51	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.49/0.51	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.49/0.51	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.49/0.51	c   applied globally :          -          -          -          4       12.5          -          -          -
0.49/0.51	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.49/0.51	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.49/0.51	c   cut pool         :       0.00          4          -          -          0          -    (maximal pool size: 240)
0.49/0.51	c   redcost          :       0.00         19          0          0          0          0
0.49/0.51	c   impliedbounds    :       0.00          5          0          0          0          0
0.49/0.51	c   intobj           :       0.00          0          0          0          0          0
0.49/0.51	c   cgmip            :       0.00          0          0          0          0          0
0.49/0.51	c   gomory           :       0.06          5          0          0        490          0
0.49/0.51	c   strongcg         :       0.05          5          0          0        652          0
0.49/0.51	c   cmir             :       0.00          0          0          0          0          0
0.49/0.51	c   flowcover        :       0.00          0          0          0          0          0
0.49/0.51	c   clique           :       0.00          5          0          0          0          0
0.49/0.51	c   zerohalf         :       0.00          0          0          0          0          0
0.49/0.51	c   mcf              :       0.00          1          0          0          0          0
0.49/0.51	c   rapidlearning    :       0.08          1          0          0          0         75
0.49/0.51	c Pricers            :       Time      Calls       Vars
0.49/0.51	c   problem variables:       0.00          0          0
0.49/0.51	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.49/0.51	c   relpscost        :       0.19         18          0          6          0          0         28
0.49/0.51	c   pscost           :       0.00          0          0          0          0          0          0
0.49/0.51	c   inference        :       0.00          0          0          0          0          0          0
0.49/0.51	c   mostinf          :       0.00          0          0          0          0          0          0
0.49/0.51	c   leastinf         :       0.00          0          0          0          0          0          0
0.49/0.51	c   fullstrong       :       0.00          0          0          0          0          0          0
0.49/0.51	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.49/0.51	c   random           :       0.00          0          0          0          0          0          0
0.49/0.51	c Primal Heuristics  :       Time      Calls      Found
0.49/0.51	c   LP solutions     :       0.00          -          1
0.49/0.51	c   pseudo solutions :       0.00          -          0
0.49/0.51	c   trivial          :       0.00          1          0
0.49/0.51	c   simplerounding   :       0.00          0          0
0.49/0.51	c   zirounding       :       0.00          0          0
0.49/0.51	c   rounding         :       0.00          0          0
0.49/0.51	c   shifting         :       0.00          0          0
0.49/0.51	c   intshifting      :       0.00          0          0
0.49/0.51	c   oneopt           :       0.00          0          0
0.49/0.51	c   twoopt           :       0.00          0          0
0.49/0.51	c   fixandinfer      :       0.00          0          0
0.49/0.51	c   feaspump         :       0.00          0          0
0.49/0.51	c   coefdiving       :       0.00          0          0
0.49/0.51	c   pscostdiving     :       0.00          0          0
0.49/0.51	c   fracdiving       :       0.00          0          0
0.49/0.51	c   veclendiving     :       0.00          0          0
0.49/0.51	c   intdiving        :       0.00          0          0
0.49/0.51	c   actconsdiving    :       0.00          0          0
0.49/0.51	c   objpscostdiving  :       0.00          0          0
0.49/0.51	c   rootsoldiving    :       0.00          0          0
0.49/0.51	c   linesearchdiving :       0.00          0          0
0.49/0.51	c   guideddiving     :       0.00          0          0
0.49/0.51	c   octane           :       0.00          0          0
0.49/0.51	c   rens             :       0.00          0          0
0.49/0.51	c   rins             :       0.00          0          0
0.49/0.51	c   localbranching   :       0.00          0          0
0.49/0.51	c   mutation         :       0.00          0          0
0.49/0.51	c   crossover        :       0.00          0          0
0.49/0.51	c   dins             :       0.00          0          0
0.49/0.51	c   undercover       :       0.00          0          0
0.49/0.51	c   nlp              :       0.00          0          0
0.49/0.51	c   trysol           :       0.00          0          0
0.49/0.51	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.49/0.51	c   primal LP        :       0.00          0          0       0.00          -
0.49/0.51	c   dual LP          :       0.05         25        750      30.00   15000.00
0.49/0.51	c   lex dual LP      :       0.00          0          0       0.00          -
0.49/0.51	c   barrier LP       :       0.00          0          0       0.00          -
0.49/0.51	c   diving/probing LP:       0.00          0          0       0.00          -
0.49/0.51	c   strong branching :       0.19        182       2731      15.01   14373.68
0.49/0.51	c     (at root node) :          -         11        361      32.82          -
0.49/0.51	c   conflict analysis:       0.00          0          0       0.00          -
0.49/0.51	c B&B Tree           :
0.49/0.51	c   number of runs   :          1
0.49/0.51	c   nodes            :         16
0.49/0.51	c   nodes (total)    :         16
0.49/0.51	c   nodes left       :          0
0.49/0.51	c   max depth        :         14
0.49/0.51	c   max depth (total):         14
0.49/0.51	c   backtracks       :          0 (0.0%)
0.49/0.51	c   delayed cutoffs  :          0
0.49/0.51	c   repropagations   :          1 (1 domain reductions, 0 cutoffs)
0.49/0.51	c   avg switch length:       2.00
0.49/0.51	c   switching time   :       0.00
0.49/0.51	c Solution           :
0.49/0.51	c   Solutions found  :          1 (1 improvements)
0.49/0.51	c   First Solution   : +0.00000000000000e+00   (in run 1, after 16 nodes, 0.45 seconds, depth 14, found by <relaxation>)
0.49/0.51	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 16 nodes, 0.45 seconds, depth 14, found by <relaxation>)
0.49/0.51	c   Dual Bound       : +0.00000000000000e+00
0.49/0.51	c   Gap              :       0.00 %
0.49/0.51	c   Root Dual Bound  : +0.00000000000000e+00
0.49/0.51	c   Root Iterations  :        645
0.49/0.52	c Time complete: 0.51.

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-2665961-1276328894/watcher-2665961-1276328894 -o /tmp/evaluation-result-2665961-1276328894/solver-2665961-1276328894 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665961-1276328894.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.09 1.04 1.01 3/106 10006
/proc/meminfo: memFree=1848660/2059040 swapFree=4135896/4192956
[pid=10006] ppid=10004 vsize=9288 CPUtime=0
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 7191 0 -1 4202496 1069 0 0 0 0 0 0 0 20 0 1 0 6544835 9510912 989 1992294400 4194304 9819077 140735428119392 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/10006/statm: 2322 999 371 1374 0 943 0

[startup+0.0571109 s]
/proc/loadavg: 1.09 1.04 1.01 3/106 10006
/proc/meminfo: memFree=1848660/2059040 swapFree=4135896/4192956
[pid=10006] ppid=10004 vsize=16184 CPUtime=0.04
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 7191 0 -1 4202496 4378 0 0 0 3 1 0 0 20 0 1 0 6544835 16572416 2645 1992294400 4194304 9819077 140735428119392 18446744073709551615 6054629 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 4046 2646 639 1374 0 2667 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 16184

[startup+0.101114 s]
/proc/loadavg: 1.09 1.04 1.01 3/106 10006
/proc/meminfo: memFree=1848660/2059040 swapFree=4135896/4192956
[pid=10006] ppid=10004 vsize=24524 CPUtime=0.09
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 7191 0 -1 4202496 7745 0 0 0 6 3 0 0 20 0 1 0 6544835 25112576 4470 1992294400 4194304 9819077 140735428119392 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 6131 4470 664 1374 0 4752 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 24524

[startup+0.30113 s]
/proc/loadavg: 1.09 1.04 1.01 3/106 10006
/proc/meminfo: memFree=1848660/2059040 swapFree=4135896/4192956
[pid=10006] ppid=10004 vsize=19556 CPUtime=0.29
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 7191 0 -1 4202496 8002 0 0 0 25 4 0 0 20 0 1 0 6544835 20025344 3331 1992294400 4194304 9819077 140735428119392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 4889 3331 685 1374 0 3510 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 19556

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

[startup+0.501146 s]
/proc/loadavg: 1.09 1.04 1.01 3/106 10006
/proc/meminfo: memFree=1848660/2059040 swapFree=4135896/4192956
[pid=10006] ppid=10004 vsize=18832 CPUtime=0.49
/proc/10006/stat : 10006 (pbscip.linux.x8) R 10004 10006 7191 0 -1 4202496 9207 0 0 0 44 5 0 0 20 0 1 0 6544835 19283968 3349 1992294400 4194304 9819077 140735428119392 18446744073709551615 8657695 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10006/statm: 4708 3349 707 1374 0 3329 0
Current children cumulated CPU time (s) 0.49
Current children cumulated vsize (KiB) 18832

Child status: 0
Real time (s): 0.522509
CPU time (s): 0.52292
CPU user time (s): 0.45993
CPU system time (s): 0.06299
CPU usage (%): 100.079
Max. virtual memory (cumulated for all children) (KiB): 24524

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

runsolver used 0.005999 second user time and 0.011998 second system time

The end

Launcher Data 

Begin job on node026 at 2010-06-12 09:48:14
IDJOB=2665961
IDBENCH=1437
IDSOLVER=1168
FILE ID=node026/2665961-1276328894
PBS_JOBID= 11173158
Free space on /tmp= 62508 MiB

SOLVER NAME= SCIPclp SCIP 1.2.1.2 with Clp 1.11.1 (Release Version) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-fpga12_11_sat_pb.cnf.cr.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-2665961-1276328894/watcher-2665961-1276328894 -o /tmp/evaluation-result-2665961-1276328894/solver-2665961-1276328894 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665961-1276328894.opb -t 1800 -m 1800

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

MD5SUM BENCH= 05acc78c42ec3368f84785abcf0f7ebb
RANDOM SEED=868310350

node026.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.201
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.40
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.201
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5599.46
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1849064 kB
Buffers:         14368 kB
Cached:         105928 kB
SwapCached:      23112 kB
Active:         104388 kB
Inactive:        41412 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1849064 kB
SwapTotal:     4192956 kB
SwapFree:      4135896 kB
Dirty:            6812 kB
Writeback:           0 kB
AnonPages:       10292 kB
Mapped:           8000 kB
Slab:            42364 kB
PageTables:       4024 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180864 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62504 MiB
End job on node026 at 2010-06-12 09:48:15