Trace number 2667390

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 1.3128 1.31277

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga14_14_sat_pb.cnf.cr.opb
MD5SUM74c4eb11f12622eba961e655de7451bc
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 variables294
Total number of constraints238
Number of constraints which are clauses210
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 constraint14
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 15
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: 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-2667390-1276328882.opb>
0.00/0.01	c original problem has 294 variables (294 bin, 0 int, 0 impl, 0 cont) and 238 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, 238 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 294 variables (294 bin, 0 int, 0 impl, 0 cont) and 238 constraints
0.00/0.03	c      28 constraints of type <setppc>
0.00/0.03	c     210 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.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.04/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.04/0.05	c   0.0s|     1 |     0 |   150 |     - |1167k|   0 |  77 | 294 | 238 | 294 | 238 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.14	c   0.1s|     1 |     0 |   240 |     - |1434k|   0 |  76 | 294 | 238 | 294 | 245 |   7 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.19	c   0.1s|     1 |     0 |   385 |     - |1679k|   0 |  84 | 294 | 238 | 294 | 256 |  18 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.25	c   0.2s|     1 |     0 |   437 |     - |1955k|   0 |  82 | 294 | 238 | 294 | 262 |  24 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.30	c   0.3s|     1 |     0 |   522 |     - |2305k|   0 |  78 | 294 | 238 | 294 | 272 |  34 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.35	c   0.3s|     1 |     0 |   655 |     - |2590k|   0 |  85 | 294 | 238 | 294 | 286 |  48 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.39/0.44	c   0.4s|     1 |     2 |   655 |     - |2591k|   0 |  85 | 294 | 238 | 294 | 286 |  48 |   0 |  33 | 0.000000e+00 |      --      |    Inf 
1.29/1.30	c * 1.2s|    19 |     0 |   808 |   8.5 |2668k|  18 |   - | 294 | 238 | 294 | 256 |  48 |   0 | 469 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.29/1.30	c 
1.29/1.30	c SCIP Status        : problem is solved [optimal solution found]
1.29/1.30	c Solving Time (sec) : 1.22
1.29/1.30	c Solving Nodes      : 19
1.29/1.30	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.29/1.30	c Dual Bound         : +0.00000000000000e+00
1.29/1.30	c Gap                : 0.00 %
1.29/1.30	s SATISFIABLE
1.29/1.30	v -x87 -x85 -x50 -x53 -x88 -x97 -x48 -x43 -x11 -x10 -x8 -x7 -x6 -x5 -x2 -x55 -x3 -x54 x84 -x78 -x76 -x72 -x70 -x69 -x60 -x59 -x57 
1.29/1.30	v -x80 x51 -x64 -x92 -x1 -x71 -x181 -x177 -x175 -x170 -x62 -x58 -x173 -x182 -x172 -x45 -x77 -x94 -x28 -x24 -x22 -x19 -x74 -x9 
1.29/1.30	v -x178 -x49 -x61 -x79 -x4 -x27 -x46 -x96 -x196 -x195 -x194 -x193 -x192 -x191 x189 -x188 -x186 -x185 -x184 -x183 -x44 -x174 -x26 
1.29/1.30	v -x14 -x140 -x139 -x138 -x136 -x135 -x134 -x131 -x130 -x129 -x52 -x25 -x169 -x65 -x111 -x107 -x106 -x105 -x103 -x102 -x100 -x99 
1.29/1.30	v -x127 -x17 -x16 x90 -x73 -x68 -x190 -x86 -x47 -x137 -x23 x12 -x187 -x13 x171 -x83 -x18 -x133 -x132 -x112 -x224 -x223 -x222 
1.29/1.30	v -x221 x220 -x219 -x218 -x95 x67 -x63 -x56 -x91 -x101 x108 -x109 -x259 x258 -x257 -x256 -x255 -x254 -x253 -x93 -x21 -x20 -x294 
1.29/1.30	v -x293 -x292 -x291 -x290 -x289 x288 -x98 -x252 -x251 -x250 -x249 -x248 x247 -x246 -x176 -x179 -x66 -x154 -x153 -x152 -x151 
1.29/1.30	v -x150 -x149 -x148 -x147 -x146 -x145 x144 -x142 -x141 -x89 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 -x30 -x231 
1.29/1.30	v -x230 x229 -x228 -x227 -x226 -x225 -x75 -x217 x216 -x215 -x214 -x213 -x212 -x211 -x143 x15 -x126 -x125 -x124 -x123 -x121 -x120 
1.29/1.30	v -x118 x117 -x116 -x115 -x114 -x113 x245 -x244 -x243 -x242 -x241 -x240 -x239 -x119 -x203 -x202 -x201 -x200 -x199 x198 -x197 
1.29/1.30	v -x29 -x180 -x287 -x286 -x285 x284 -x283 -x282 -x281 -x110 -x238 -x237 -x236 x235 -x234 -x233 -x232 -x104 -x168 x167 -x166 
1.29/1.30	v -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x280 -x279 -x278 -x277 x276 -x275 -x274 -x82 -x210 -x209 -x208 
1.29/1.30	v -x207 -x206 -x205 x204 x128 -x273 -x272 x271 -x270 -x269 -x268 -x267 -x81 x266 -x265 -x264 -x263 -x262 -x261 -x260 -x122 
1.29/1.30	c SCIP Status        : problem is solved [optimal solution found]
1.29/1.30	c Solving Time       :       1.22
1.29/1.30	c Original Problem   :
1.29/1.30	c   Problem name     : HOME/instance-2667390-1276328882.opb
1.29/1.30	c   Variables        : 294 (294 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.30	c   Constraints      : 238 initial, 238 maximal
1.29/1.30	c Presolved Problem  :
1.29/1.30	c   Problem name     : t_HOME/instance-2667390-1276328882.opb
1.29/1.30	c   Variables        : 294 (294 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.30	c   Constraints      : 238 initial, 238 maximal
1.29/1.30	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.29/1.30	c   trivial          :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   setppc           :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   logicor          :       0.00          0          0          0          0          0          0          0          0
1.29/1.30	c   root node        :          -          0          -          -          0          -          -          -          -
1.29/1.30	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.30	c   integral         :          0          0          0         19          0          0          0          0          0         36
1.29/1.30	c   setppc           :         28          5         37          1          0          0        185          0          0          0
1.29/1.30	c   logicor          :        210          5         14          1          0          0          0          0          0          0
1.29/1.30	c   countsols        :          0          0          0          1          0          0          0          0          0          0
1.29/1.30	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.29/1.30	c   integral         :       0.91       0.00       0.00       0.91       0.00
1.29/1.30	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.29/1.30	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.29/1.30	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.29/1.30	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.29/1.30	c   vbounds          :       0.00          1          0          0
1.29/1.30	c   rootredcost      :       0.00          0          0          0
1.29/1.30	c   pseudoobj        :       0.00          0          0          0
1.29/1.30	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.29/1.30	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.29/1.30	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.30	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.30	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.30	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.29/1.30	c   applied globally :          -          -          -          0        0.0          -          -          -
1.29/1.30	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.29/1.30	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.29/1.30	c   cut pool         :       0.00          4          -          -          0          -    (maximal pool size: 410)
1.29/1.30	c   redcost          :       0.00         23          0          0          0          0
1.29/1.30	c   impliedbounds    :       0.00          5          0          0          0          0
1.29/1.30	c   intobj           :       0.00          0          0          0          0          0
1.29/1.30	c   cgmip            :       0.00          0          0          0          0          0
1.29/1.30	c   gomory           :       0.10          5          0          0        957          0
1.29/1.30	c   strongcg         :       0.08          5          0          0       1105          0
1.29/1.30	c   cmir             :       0.00          0          0          0          0          0
1.29/1.30	c   flowcover        :       0.00          0          0          0          0          0
1.29/1.30	c   clique           :       0.00          5          0          0          0          0
1.29/1.30	c   zerohalf         :       0.00          0          0          0          0          0
1.29/1.30	c   mcf              :       0.00          1          0          0          0          0
1.29/1.30	c   rapidlearning    :       0.03          1          0          0          0          0
1.29/1.30	c Pricers            :       Time      Calls       Vars
1.29/1.30	c   problem variables:       0.00          0          0
1.29/1.30	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.30	c   relpscost        :       0.91         18          0          0          0          0         36
1.29/1.30	c   pscost           :       0.00          0          0          0          0          0          0
1.29/1.30	c   inference        :       0.00          0          0          0          0          0          0
1.29/1.30	c   mostinf          :       0.00          0          0          0          0          0          0
1.29/1.30	c   leastinf         :       0.00          0          0          0          0          0          0
1.29/1.30	c   fullstrong       :       0.00          0          0          0          0          0          0
1.29/1.30	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.29/1.30	c   random           :       0.00          0          0          0          0          0          0
1.29/1.30	c Primal Heuristics  :       Time      Calls      Found
1.29/1.30	c   LP solutions     :       0.00          -          1
1.29/1.30	c   pseudo solutions :       0.00          -          0
1.29/1.30	c   trivial          :       0.00          1          0
1.29/1.30	c   simplerounding   :       0.00          0          0
1.29/1.30	c   zirounding       :       0.00          0          0
1.29/1.30	c   rounding         :       0.00          0          0
1.29/1.30	c   shifting         :       0.00          0          0
1.29/1.30	c   intshifting      :       0.00          0          0
1.29/1.30	c   oneopt           :       0.00          0          0
1.29/1.30	c   twoopt           :       0.00          0          0
1.29/1.30	c   fixandinfer      :       0.00          0          0
1.29/1.30	c   feaspump         :       0.00          0          0
1.29/1.30	c   coefdiving       :       0.00          0          0
1.29/1.30	c   pscostdiving     :       0.00          0          0
1.29/1.30	c   fracdiving       :       0.00          0          0
1.29/1.30	c   veclendiving     :       0.00          0          0
1.29/1.30	c   intdiving        :       0.00          0          0
1.29/1.30	c   actconsdiving    :       0.00          0          0
1.29/1.30	c   objpscostdiving  :       0.00          0          0
1.29/1.30	c   rootsoldiving    :       0.00          0          0
1.29/1.30	c   linesearchdiving :       0.00          0          0
1.29/1.30	c   guideddiving     :       0.00          0          0
1.29/1.30	c   octane           :       0.00          0          0
1.29/1.30	c   rens             :       0.00          0          0
1.29/1.30	c   rins             :       0.00          0          0
1.29/1.30	c   localbranching   :       0.00          0          0
1.29/1.30	c   mutation         :       0.00          0          0
1.29/1.30	c   crossover        :       0.00          0          0
1.29/1.30	c   dins             :       0.00          0          0
1.29/1.30	c   undercover       :       0.00          0          0
1.29/1.30	c   nlp              :       0.00          0          0
1.29/1.30	c   trysol           :       0.00          0          0
1.29/1.30	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.29/1.30	c   primal LP        :       0.00          0          0       0.00          -
1.29/1.30	c   dual LP          :       0.07         24        808      33.67   11542.86
1.29/1.30	c   lex dual LP      :       0.00          0          0       0.00          -
1.29/1.30	c   barrier LP       :       0.00          0          0       0.00          -
1.29/1.30	c   diving/probing LP:       0.00          0          0       0.00          -
1.29/1.30	c   strong branching :       0.91        469       8608      18.35    9459.34
1.29/1.30	c     (at root node) :          -         33        777      23.55          -
1.29/1.30	c   conflict analysis:       0.00          0          0       0.00          -
1.29/1.30	c B&B Tree           :
1.29/1.30	c   number of runs   :          1
1.29/1.30	c   nodes            :         19
1.29/1.30	c   nodes (total)    :         19
1.29/1.30	c   nodes left       :          0
1.29/1.30	c   max depth        :         18
1.29/1.30	c   max depth (total):         18
1.29/1.30	c   backtracks       :          0 (0.0%)
1.29/1.30	c   delayed cutoffs  :          0
1.29/1.30	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.29/1.30	c   avg switch length:       2.00
1.29/1.30	c   switching time   :       0.00
1.29/1.30	c Solution           :
1.29/1.30	c   Solutions found  :          1 (1 improvements)
1.29/1.30	c   First Solution   : +0.00000000000000e+00   (in run 1, after 19 nodes, 1.22 seconds, depth 18, found by <relaxation>)
1.29/1.30	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 19 nodes, 1.22 seconds, depth 18, found by <relaxation>)
1.29/1.30	c   Dual Bound       : +0.00000000000000e+00
1.29/1.30	c   Gap              :       0.00 %
1.29/1.30	c   Root Dual Bound  : +0.00000000000000e+00
1.29/1.30	c   Root Iterations  :        655
1.29/1.31	c Time complete: 1.31.

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-2667390-1276328882/watcher-2667390-1276328882 -o /tmp/evaluation-result-2667390-1276328882/solver-2667390-1276328882 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667390-1276328882.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.22 1.06 1.01 3/106 9748
/proc/meminfo: memFree=1851020/2059040 swapFree=4135896/4192956
[pid=9748] ppid=9746 vsize=7724 CPUtime=0
/proc/9748/stat : 9748 (pbscip.linux.x8) R 9746 9748 7191 0 -1 4202496 1030 0 0 0 0 0 0 0 22 0 1 0 6543654 7909376 950 1992294400 4194304 8223781 140737298003728 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/9748/statm: 1931 960 348 984 0 944 0

[startup+0.047018 s]
/proc/loadavg: 1.22 1.06 1.01 3/106 9748
/proc/meminfo: memFree=1851020/2059040 swapFree=4135896/4192956
[pid=9748] ppid=9746 vsize=14024 CPUtime=0.04
/proc/9748/stat : 9748 (pbscip.linux.x8) R 9746 9748 7191 0 -1 4202496 4321 0 0 0 3 1 0 0 22 0 1 0 6543654 14360576 2586 1992294400 4194304 8223781 140737298003728 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9748/statm: 3506 2586 517 984 0 2519 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 14024

[startup+0.101023 s]
/proc/loadavg: 1.22 1.06 1.01 3/106 9748
/proc/meminfo: memFree=1851020/2059040 swapFree=4135896/4192956
[pid=9748] ppid=9746 vsize=18936 CPUtime=0.09
/proc/9748/stat : 9748 (pbscip.linux.x8) R 9746 9748 7191 0 -1 4202496 5443 0 0 0 8 1 0 0 22 0 1 0 6543654 19390464 3702 1992294400 4194304 8223781 140737298003728 18446744073709551615 7236399 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9748/statm: 4774 3703 550 984 0 3787 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 18936

[startup+0.301039 s]
/proc/loadavg: 1.22 1.06 1.01 3/106 9748
/proc/meminfo: memFree=1851020/2059040 swapFree=4135896/4192956
[pid=9748] ppid=9746 vsize=17280 CPUtime=0.29
/proc/9748/stat : 9748 (pbscip.linux.x8) R 9746 9748 7191 0 -1 4202496 8122 0 0 0 26 3 0 0 22 0 1 0 6543654 17694720 3485 1992294400 4194304 8223781 140737298003728 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9748/statm: 4320 3485 566 984 0 3333 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 17280

[startup+0.70107 s]
/proc/loadavg: 1.22 1.06 1.01 3/106 9748
/proc/meminfo: memFree=1851020/2059040 swapFree=4135896/4192956
[pid=9748] ppid=9746 vsize=17320 CPUtime=0.69
/proc/9748/stat : 9748 (pbscip.linux.x8) R 9746 9748 7191 0 -1 4202496 8150 0 0 0 65 4 0 0 24 0 1 0 6543654 17735680 3500 1992294400 4194304 8223781 140737298003728 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9748/statm: 4330 3500 568 984 0 3343 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 17320

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

[startup+1.1081 s]
/proc/loadavg: 1.20 1.06 1.01 2/107 9749
/proc/meminfo: memFree=1838736/2059040 swapFree=4135896/4192956
[pid=9748] ppid=9746 vsize=17320 CPUtime=1.1
/proc/9748/stat : 9748 (pbscip.linux.x8) R 9746 9748 7191 0 -1 4202496 8150 0 0 0 104 6 0 0 25 0 1 0 6543654 17735680 3500 1992294400 4194304 8223781 140737298003728 18446744073709551615 6446767 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9748/statm: 4330 3500 568 984 0 3343 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 17320

[startup+1.30112 s]
/proc/loadavg: 1.20 1.06 1.01 2/107 9749
/proc/meminfo: memFree=1838736/2059040 swapFree=4135896/4192956
[pid=9748] ppid=9746 vsize=17320 CPUtime=1.29
/proc/9748/stat : 9748 (pbscip.linux.x8) R 9746 9748 7191 0 -1 4202496 8150 0 0 0 123 6 0 0 25 0 1 0 6543654 17735680 3500 1992294400 4194304 8223781 140737298003728 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9748/statm: 4330 3500 568 984 0 3343 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 17320

Child status: 0
Real time (s): 1.31277
CPU time (s): 1.3128
CPU user time (s): 1.24181
CPU system time (s): 0.070989
CPU usage (%): 100.002
Max. virtual memory (cumulated for all children) (KiB): 18936

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

runsolver used 0.005999 second user time and 0.018997 second system time

The end

Launcher Data 

Begin job on node026 at 2010-06-12 09:48:02
IDJOB=2667390
IDBENCH=1436
IDSOLVER=1169
FILE ID=node026/2667390-1276328882
PBS_JOBID= 11173158
Free space on /tmp= 62508 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-fpga14_14_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-2667390-1276328882/watcher-2667390-1276328882 -o /tmp/evaluation-result-2667390-1276328882/solver-2667390-1276328882 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667390-1276328882.opb -t 1800 -m 1800

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

MD5SUM BENCH= 74c4eb11f12622eba961e655de7451bc
RANDOM SEED=1532911893

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:       1851548 kB
Buffers:         14080 kB
Cached:         104180 kB
SwapCached:      23112 kB
Active:         102464 kB
Inactive:        41236 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1851548 kB
SwapTotal:     4192956 kB
SwapFree:      4135896 kB
Dirty:            4984 kB
Writeback:           0 kB
AnonPages:       10288 kB
Mapped:           8092 kB
Slab:            42172 kB
PageTables:       3996 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180364 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:04