Trace number 2667360

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
SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverSAT 2.54161 2.54276

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga15_13_sat_pb.cnf.cr.opb
MD5SUM5525732a92b9529feed86b3ca7f3367f
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.004998
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables293
Total number of constraints236
Number of constraints which are clauses208
Number of constraints which are cardinality constraints (but not clauses)28
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint7
Maximum length of a constraint15
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 16
Number of bits of the biggest sum of numbers5
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: SoPlex 1.4.2] [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-2667360-1276323041.opb>
0.00/0.01	c original problem has 293 variables (293 bin, 0 int, 0 impl, 0 cont) and 236 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.03	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 236 upgd conss, 0 impls, 28 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, 28 cliques
0.00/0.03	c presolved problem has 293 variables (293 bin, 0 int, 0 impl, 0 cont) and 236 constraints
0.00/0.03	c      28 constraints of type <setppc>
0.00/0.04	c     208 constraints of type <logicor>
0.00/0.04	c transformed objective value is always integral (scale: 1)
0.00/0.04	c Presolving Time: 0.01
0.00/0.04	c - non default parameters ----------------------------------------------------------------------
0.00/0.04	c # SCIP version 1.2.1.2
0.00/0.04	c 
0.00/0.04	c # frequency for displaying node information lines
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04	c display/freq = 10000
0.00/0.04	c 
0.00/0.04	c # maximal time in seconds to run
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04	c limits/time = 1799.99
0.00/0.04	c 
0.00/0.04	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04	c limits/memory = 1620
0.00/0.04	c 
0.00/0.04	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c limits/solutions = 1
0.00/0.04	c 
0.00/0.04	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.04	c separating/maxrounds = 1
0.00/0.04	c 
0.00/0.04	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c separating/maxroundsroot = 5
0.00/0.04	c 
0.00/0.04	c # should presolving try to simplify inequalities
0.00/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04	c constraints/linear/simplifyinequalities = TRUE
0.00/0.04	c 
0.00/0.04	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.04	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.04	c constraints/knapsack/disaggregation = FALSE
0.00/0.04	c 
0.00/0.04	c # should presolving try to simplify knapsacks
0.00/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04	c 
0.00/0.04	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c presolving/probing/maxrounds = 0
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/coefdiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.04	c heuristics/crossover/freq = -1
0.00/0.04	c 
0.00/0.04	c # number of nodes added to the contingent of the total nodes
0.00/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04	c heuristics/crossover/nodesofs = 750
0.00/0.04	c 
0.00/0.04	c # number of nodes without incumbent change that heuristic should wait
0.00/0.04	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.04	c heuristics/crossover/nwaitingnodes = 100
0.00/0.04	c 
0.00/0.04	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.04	c # [type: real, range: [0,1], default: 0.1]
0.00/0.04	c heuristics/crossover/nodesquot = 0.15
0.00/0.04	c 
0.00/0.04	c # minimum percentage of integer variables that have to be fixed 
0.00/0.04	c # [type: real, range: [0,1], default: 0.666]
0.00/0.04	c heuristics/crossover/minfixingrate = 0.5
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04	c heuristics/feaspump/freq = -1
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/fracdiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/guideddiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/intshifting/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/linesearchdiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/nlp/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04	c heuristics/objpscostdiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.04	c # [type: real, range: [0,1], default: 0.01]
0.00/0.04	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/oneopt/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/pscostdiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04	c heuristics/rens/freq = -1
0.00/0.04	c 
0.00/0.04	c # minimum percentage of integer variables that have to be fixable 
0.00/0.04	c # [type: real, range: [0,1], default: 0.5]
0.00/0.04	c heuristics/rens/minfixingrate = 0.3
0.00/0.04	c 
0.00/0.04	c # number of nodes added to the contingent of the total nodes
0.00/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04	c heuristics/rens/nodesofs = 2000
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04	c heuristics/rootsoldiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/rounding/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/shifting/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/simplerounding/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04	c heuristics/trivial/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/trysol/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/veclendiving/freq = -1
0.00/0.04	c 
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.04	c 
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.04	c 
0.00/0.04	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/zirounding/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04	c separating/cmir/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04	c separating/flowcover/freq = -1
0.00/0.04	c 
0.00/0.04	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c separating/rapidlearning/freq = 0
0.00/0.04	c 
0.00/0.04	c -----------------------------------------------------------------------------------------------
0.00/0.04	c start solving
0.00/0.04	c 
0.00/0.04	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.04	c   0.0s|     1 |     0 |    85 |     - |1158k|   0 |  60 | 293 | 236 | 293 | 236 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.14	c   0.1s|     1 |     0 |   128 |     - |1553k|   0 |  64 | 293 | 236 | 293 | 242 |   6 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.19	c   0.1s|     1 |     0 |   212 |     - |1573k|   0 |  55 | 293 | 236 | 293 | 247 |  11 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.24	c   0.2s|     1 |     0 |   287 |     - |1768k|   0 |  81 | 293 | 236 | 293 | 252 |  16 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.30	c   0.3s|     1 |     0 |   394 |     - |1892k|   0 |  85 | 293 | 236 | 293 | 259 |  23 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.36	c   0.3s|     1 |     0 |   568 |     - |2032k|   0 |  53 | 293 | 236 | 293 | 266 |  30 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.39/0.47	c   0.4s|     1 |     2 |   568 |     - |2032k|   0 |  53 | 293 | 236 | 293 | 266 |  30 |   0 |  22 | 0.000000e+00 |      --      |    Inf 
2.49/2.53	c * 2.4s|   448 |     0 |  3478 |   6.5 |2265k|  31 |   - | 293 | 444 | 293 | 254 |  30 | 209 |1198 | 0.000000e+00 | 0.000000e+00 |   0.00%
2.49/2.53	c 
2.49/2.53	c SCIP Status        : problem is solved [optimal solution found]
2.49/2.53	c Solving Time (sec) : 2.41
2.49/2.53	c Solving Nodes      : 448
2.49/2.53	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
2.49/2.53	c Dual Bound         : +0.00000000000000e+00
2.49/2.53	c Gap                : 0.00 %
2.49/2.53	s SATISFIABLE
2.49/2.53	v -x141 -x34 x146 -x137 -x53 -x139 -x81 -x45 -x143 -x88 -x80 -x78 -x54 -x36 -x40 -x35 -x31 -x79 -x76 x49 -x39 -x179 -x175 -x168 -x167 
2.49/2.53	v -x166 -x43 -x38 -x105 -x102 -x101 -x100 -x94 x93 -x57 -x176 -x165 -x160 -x157 x156 -x155 -x154 -x153 -x151 x42 -x41 -x96 
2.49/2.53	v -x99 -x162 -x47 -x30 -x27 -x25 -x18 -x56 -x26 -x148 -x24 -x178 -x48 -x28 -x144 -x163 -x136 -x23 -x174 -x29 -x37 x84 -x159 -x173 
2.49/2.53	v -x16 -x169 -x171 x170 -x164 -x86 -x89 -x85 -x44 -x152 -x92 -x14 -x12 -x11 -x8 -x7 -x6 -x5 -x4 x1 -x97 -x161 -x46 -x17 -x90 
2.49/2.53	v -x50 -x195 -x194 -x193 -x191 x190 -x189 -x187 -x186 -x184 -x183 -x182 -x181 -x20 -x180 -x147 -x75 x74 -x73 -x72 -x70 -x69 -x68 
2.49/2.53	v -x66 -x64 -x63 -x62 -x61 -x71 -x138 -x150 -x59 -x188 x120 -x119 -x118 -x116 -x114 -x113 -x111 -x108 -x107 -x60 -x19 -x135 
2.49/2.53	v -x132 -x130 -x129 x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x117 -x83 -x219 -x218 -x217 -x216 x215 -x214 -x109 -x110 -x10 
2.49/2.53	v -x95 -x55 -x13 -x82 -x104 -x103 -x149 -x33 -x142 -x192 -x133 -x52 -x112 -x140 -x213 -x212 -x211 -x210 -x209 x208 -x3 -x91 
2.49/2.53	v -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x58 -x286 -x285 -x284 -x283 -x282 -x281 x280 -x134 -x98 -x265 -x264 -x263 x262 -x261 
2.49/2.53	v -x260 -x259 -x131 -x21 -x172 -x185 -x87 -x231 -x230 -x229 x228 -x227 -x226 -x51 -x115 -x293 -x292 -x291 -x290 x289 -x288 
2.49/2.53	v -x287 -x15 -x201 -x200 x199 -x198 -x197 -x196 -x106 -x244 x243 -x242 -x241 -x240 -x239 -x238 -x158 -x77 -x251 -x250 -x249 -x248 
2.49/2.53	v -x247 x246 -x245 -x9 -x272 -x271 x270 -x269 -x268 -x267 -x266 -x177 -x225 x224 -x223 -x222 -x221 -x220 -x65 -x2 -x207 -x206 
2.49/2.53	v -x205 -x204 -x203 -x202 -x32 x258 -x257 -x256 -x255 -x254 -x253 -x252 -x145 -x67 x237 -x236 -x235 -x234 -x233 -x232 x22 
2.49/2.53	c SCIP Status        : problem is solved [optimal solution found]
2.49/2.53	c Solving Time       :       2.41
2.49/2.53	c Original Problem   :
2.49/2.53	c   Problem name     : HOME/instance-2667360-1276323041.opb
2.49/2.53	c   Variables        : 293 (293 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.53	c   Constraints      : 236 initial, 236 maximal
2.49/2.53	c Presolved Problem  :
2.49/2.53	c   Problem name     : t_HOME/instance-2667360-1276323041.opb
2.49/2.53	c   Variables        : 293 (293 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.53	c   Constraints      : 236 initial, 444 maximal
2.49/2.53	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.49/2.53	c   trivial          :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   implics          :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   setppc           :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   logicor          :       0.00          0          0          0          0          0          0          0          0
2.49/2.53	c   root node        :          -          0          -          -          0          -          -          -          -
2.49/2.53	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.49/2.53	c   integral         :          0          0          0        474          0         56        204          0          0        484
2.49/2.53	c   setppc           :         28          5       1416          1          0          3       2035          0          0          0
2.49/2.53	c   logicor          :        208+         5        521          1          0          4        522          0          0          0
2.49/2.53	c   countsols        :          0          0          0          1          0          0          0          0          0          0
2.49/2.53	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.49/2.53	c   integral         :       1.66       0.00       0.00       1.66       0.00
2.49/2.53	c   setppc           :       0.01       0.00       0.01       0.00       0.00
2.49/2.53	c   logicor          :       0.01       0.00       0.01       0.00       0.00
2.49/2.53	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.49/2.53	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.49/2.53	c   vbounds          :       0.00          1          0          0
2.49/2.53	c   rootredcost      :       0.00          0          0          0
2.49/2.53	c   pseudoobj        :       0.00          0          0          0
2.49/2.53	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.49/2.53	c   propagation      :       0.00          7          7         53       29.1          0        0.0          -
2.49/2.53	c   infeasible LP    :       0.03        143        134       1618       29.9          0        0.0          0
2.49/2.53	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.49/2.53	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.49/2.53	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.49/2.53	c   applied globally :          -          -          -        208       18.7          -          -          -
2.49/2.53	c   applied locally  :          -          -          -          1       41.0          -          -          -
2.49/2.53	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.49/2.53	c   cut pool         :       0.00          4          -          -          5          -    (maximal pool size: 223)
2.49/2.53	c   redcost          :       0.00        311          0          0          0          0
2.49/2.53	c   impliedbounds    :       0.00          5          0          0          0          0
2.49/2.53	c   intobj           :       0.00          0          0          0          0          0
2.49/2.53	c   cgmip            :       0.00          0          0          0          0          0
2.49/2.53	c   gomory           :       0.12          5          0          0        624          0
2.49/2.53	c   strongcg         :       0.08          5          0          0        675          0
2.49/2.53	c   cmir             :       0.00          0          0          0          0          0
2.49/2.53	c   flowcover        :       0.00          0          0          0          0          0
2.49/2.53	c   clique           :       0.00          5          0          0          0          0
2.49/2.53	c   zerohalf         :       0.00          0          0          0          0          0
2.49/2.53	c   mcf              :       0.00          1          0          0          0          0
2.49/2.53	c   rapidlearning    :       0.03          1          0          0          0          0
2.49/2.53	c Pricers            :       Time      Calls       Vars
2.49/2.53	c   problem variables:       0.00          0          0
2.49/2.53	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.49/2.53	c   relpscost        :       1.66        473         56        204          0          0        484
2.49/2.53	c   pscost           :       0.00          0          0          0          0          0          0
2.49/2.53	c   inference        :       0.00          0          0          0          0          0          0
2.49/2.53	c   mostinf          :       0.00          0          0          0          0          0          0
2.49/2.53	c   leastinf         :       0.00          0          0          0          0          0          0
2.49/2.53	c   fullstrong       :       0.00          0          0          0          0          0          0
2.49/2.53	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.49/2.53	c   random           :       0.00          0          0          0          0          0          0
2.49/2.53	c Primal Heuristics  :       Time      Calls      Found
2.49/2.53	c   LP solutions     :       0.00          -          1
2.49/2.53	c   pseudo solutions :       0.00          -          0
2.49/2.53	c   trivial          :       0.00          1          0
2.49/2.53	c   simplerounding   :       0.00          0          0
2.49/2.53	c   zirounding       :       0.00          0          0
2.49/2.53	c   rounding         :       0.00          0          0
2.49/2.53	c   shifting         :       0.00          0          0
2.49/2.53	c   intshifting      :       0.00          0          0
2.49/2.53	c   oneopt           :       0.00          0          0
2.49/2.53	c   twoopt           :       0.00          0          0
2.49/2.53	c   fixandinfer      :       0.00          0          0
2.49/2.53	c   feaspump         :       0.00          0          0
2.49/2.53	c   coefdiving       :       0.00          0          0
2.49/2.53	c   pscostdiving     :       0.00          0          0
2.49/2.53	c   fracdiving       :       0.00          0          0
2.49/2.53	c   veclendiving     :       0.00          0          0
2.49/2.53	c   intdiving        :       0.00          0          0
2.49/2.53	c   actconsdiving    :       0.00          0          0
2.49/2.53	c   objpscostdiving  :       0.00          0          0
2.49/2.53	c   rootsoldiving    :       0.00          0          0
2.49/2.53	c   linesearchdiving :       0.00          0          0
2.49/2.53	c   guideddiving     :       0.00          0          0
2.49/2.53	c   octane           :       0.00          0          0
2.49/2.53	c   rens             :       0.00          0          0
2.49/2.53	c   rins             :       0.00          0          0
2.49/2.53	c   localbranching   :       0.00          0          0
2.49/2.53	c   mutation         :       0.00          0          0
2.49/2.53	c   crossover        :       0.00          0          0
2.49/2.53	c   dins             :       0.00          0          0
2.49/2.53	c   undercover       :       0.00          0          0
2.49/2.53	c   nlp              :       0.00          0          0
2.49/2.53	c   trysol           :       0.00          0          0
2.49/2.53	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.49/2.53	c   primal LP        :       0.00          0          0       0.00          -
2.49/2.53	c   dual LP          :       0.35        622       3478       5.59    9937.14
2.49/2.53	c   lex dual LP      :       0.00          0          0       0.00          -
2.49/2.53	c   barrier LP       :       0.00          0          0       0.00          -
2.49/2.53	c   diving/probing LP:       0.00          0          0       0.00          -
2.49/2.53	c   strong branching :       1.64       1198      16031      13.38    9775.00
2.49/2.53	c     (at root node) :          -         22        918      41.73          -
2.49/2.53	c   conflict analysis:       0.00          0          0       0.00          -
2.49/2.53	c B&B Tree           :
2.49/2.53	c   number of runs   :          1
2.49/2.53	c   nodes            :        448
2.49/2.53	c   nodes (total)    :        448
2.49/2.53	c   nodes left       :          0
2.49/2.53	c   max depth        :         31
2.49/2.53	c   max depth (total):         31
2.49/2.53	c   backtracks       :         78 (17.4%)
2.49/2.53	c   delayed cutoffs  :          5
2.49/2.53	c   repropagations   :        366 (323 domain reductions, 1 cutoffs)
2.49/2.53	c   avg switch length:       3.75
2.49/2.53	c   switching time   :       0.04
2.49/2.53	c Solution           :
2.49/2.53	c   Solutions found  :          1 (1 improvements)
2.49/2.53	c   First Solution   : +0.00000000000000e+00   (in run 1, after 448 nodes, 2.41 seconds, depth 17, found by <relaxation>)
2.49/2.53	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 448 nodes, 2.41 seconds, depth 17, found by <relaxation>)
2.49/2.53	c   Dual Bound       : +0.00000000000000e+00
2.49/2.53	c   Gap              :       0.00 %
2.49/2.53	c   Root Dual Bound  : +0.00000000000000e+00
2.49/2.53	c   Root Iterations  :        568
2.49/2.54	c Time complete: 2.53.

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-2667360-1276323041/watcher-2667360-1276323041 -o /tmp/evaluation-result-2667360-1276323041/solver-2667360-1276323041 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667360-1276323041.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: 0.91 0.97 0.99 3/106 9268
/proc/meminfo: memFree=1513536/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=7724 CPUtime=0
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 1015 0 0 0 0 0 0 0 20 0 1 0 7907537 7909376 935 1992294400 4194304 8223781 140734655983040 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/9268/statm: 1931 945 348 984 0 944 0

[startup+0.0847281 s]
/proc/loadavg: 0.91 0.97 0.99 3/106 9268
/proc/meminfo: memFree=1513536/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=15528 CPUtime=0.07
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 4702 0 0 0 6 1 0 0 20 0 1 0 7907537 15900672 2968 1992294400 4194304 8223781 140734655983040 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9268/statm: 3882 2968 534 984 0 2895 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 15528

[startup+0.101853 s]
/proc/loadavg: 0.91 0.97 0.99 3/106 9268
/proc/meminfo: memFree=1513536/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=15936 CPUtime=0.09
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 4785 0 0 0 8 1 0 0 20 0 1 0 7907537 16318464 3051 1992294400 4194304 8223781 140734655983040 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9268/statm: 3984 3051 534 984 0 2997 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 15936

[startup+0.301768 s]
/proc/loadavg: 0.91 0.97 0.99 3/106 9268
/proc/meminfo: memFree=1513536/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=17668 CPUtime=0.29
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 8198 0 0 0 27 2 0 0 20 0 1 0 7907537 18092032 3580 1992294400 4194304 8223781 140734655983040 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9268/statm: 4417 3580 567 984 0 3430 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 17668

[startup+0.700843 s]
/proc/loadavg: 0.91 0.97 0.99 3/106 9268
/proc/meminfo: memFree=1513536/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=17880 CPUtime=0.69
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 8245 0 0 0 66 3 0 0 20 0 1 0 7907537 18309120 3627 1992294400 4194304 8223781 140734655983040 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9268/statm: 4470 3627 568 984 0 3483 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 17880

[startup+1.50099 s]
/proc/loadavg: 0.91 0.97 0.99 2/107 9269
/proc/meminfo: memFree=1500880/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=17880 CPUtime=1.49
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 8249 0 0 0 143 6 0 0 23 0 1 0 7907537 18309120 3631 1992294400 4194304 8223781 140734655983040 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9268/statm: 4470 3631 572 984 0 3483 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 17880

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

[startup+2.30114 s]
/proc/loadavg: 0.91 0.97 0.99 2/107 9269
/proc/meminfo: memFree=1500756/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=18072 CPUtime=2.29
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 8296 0 0 0 220 9 0 0 25 0 1 0 7907537 18505728 3678 1992294400 4194304 8223781 140734655983040 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9268/statm: 4518 3678 572 984 0 3531 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 18072

[startup+2.50118 s]
/proc/loadavg: 0.91 0.97 0.99 2/107 9269
/proc/meminfo: memFree=1500756/2059040 swapFree=4192956/4192956
[pid=9268] ppid=9266 vsize=18072 CPUtime=2.49
/proc/9268/stat : 9268 (pbscip.linux.x8) R 9266 9268 8698 0 -1 4202496 8296 0 0 0 239 10 0 0 25 0 1 0 7907537 18505728 3678 1992294400 4194304 8223781 140734655983040 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9268/statm: 4518 3678 572 984 0 3531 0
Current children cumulated CPU time (s) 2.49
Current children cumulated vsize (KiB) 18072

Child status: 0
Real time (s): 2.54276
CPU time (s): 2.54161
CPU user time (s): 2.42963
CPU system time (s): 0.111982
CPU usage (%): 99.9548
Max. virtual memory (cumulated for all children) (KiB): 18072

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

runsolver used 0.007998 second user time and 0.021996 second system time

The end

Launcher Data 

Begin job on node007 at 2010-06-12 08:10:41
IDJOB=2667360
IDBENCH=1406
IDSOLVER=1169
FILE ID=node007/2667360-1276323041
PBS_JOBID= 11173154
Free space on /tmp= 62456 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-fpga15_13_sat_pb.cnf.cr.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2667360-1276323041/watcher-2667360-1276323041 -o /tmp/evaluation-result-2667360-1276323041/solver-2667360-1276323041 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667360-1276323041.opb -t 1800 -m 1800

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

MD5SUM BENCH= 5525732a92b9529feed86b3ca7f3367f
RANDOM SEED=1027172911

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1514064 kB
Buffers:         98964 kB
Cached:         317216 kB
SwapCached:          0 kB
Active:         179972 kB
Inactive:       295540 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1514064 kB
SwapTotal:     4192956 kB
SwapFree:      4192956 kB
Dirty:            4900 kB
Writeback:           0 kB
AnonPages:       59280 kB
Mapped:          15504 kB
Slab:            47740 kB
PageTables:       4008 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180216 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= 62452 MiB
End job on node007 at 2010-06-12 08:10:43