Trace number 2665947

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 1.37579 1.37713

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga12_10_sat_pb.cnf.cr.opb
MD5SUM08f887bbbbfea31f6c38c070eebe6907
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.003998
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables180
Total number of constraints152
Number of constraints which are clauses130
Number of constraints which are cardinality constraints (but not clauses)22
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-2665947-1276327199.opb>
0.00/0.01	c original problem has 180 variables (180 bin, 0 int, 0 impl, 0 cont) and 152 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.01/0.02	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 152 upgd conss, 0 impls, 22 clqs
0.01/0.03	c presolving (2 rounds):
0.01/0.03	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03	c  0 implications, 22 cliques
0.01/0.03	c presolved problem has 180 variables (180 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.01/0.03	c      22 constraints of type <setppc>
0.01/0.03	c     130 constraints of type <logicor>
0.01/0.03	c transformed objective value is always integral (scale: 1)
0.01/0.03	c Presolving Time: 0.00
0.01/0.03	c - non default parameters ----------------------------------------------------------------------
0.01/0.03	c # SCIP version 1.2.1.2
0.01/0.03	c 
0.01/0.03	c # frequency for displaying node information lines
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03	c display/freq = 10000
0.01/0.03	c 
0.01/0.03	c # maximal time in seconds to run
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03	c limits/time = 1799.99
0.01/0.03	c 
0.01/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03	c limits/memory = 1620
0.01/0.03	c 
0.01/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c limits/solutions = 1
0.01/0.03	c 
0.01/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03	c separating/maxrounds = 1
0.01/0.03	c 
0.01/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c separating/maxroundsroot = 5
0.01/0.03	c 
0.01/0.03	c # should presolving try to simplify inequalities
0.01/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03	c constraints/linear/simplifyinequalities = TRUE
0.01/0.03	c 
0.01/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03	c constraints/knapsack/disaggregation = FALSE
0.01/0.03	c 
0.01/0.03	c # should presolving try to simplify knapsacks
0.01/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03	c 
0.01/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c presolving/probing/maxrounds = 0
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/coefdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03	c heuristics/crossover/freq = -1
0.01/0.03	c 
0.01/0.03	c # number of nodes added to the contingent of the total nodes
0.01/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03	c heuristics/crossover/nodesofs = 750
0.01/0.03	c 
0.01/0.03	c # number of nodes without incumbent change that heuristic should wait
0.01/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03	c heuristics/crossover/nwaitingnodes = 100
0.01/0.03	c 
0.01/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03	c # [type: real, range: [0,1], default: 0.1]
0.01/0.03	c heuristics/crossover/nodesquot = 0.15
0.01/0.03	c 
0.01/0.03	c # minimum percentage of integer variables that have to be fixed 
0.01/0.03	c # [type: real, range: [0,1], default: 0.666]
0.01/0.03	c heuristics/crossover/minfixingrate = 0.5
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03	c heuristics/feaspump/freq = -1
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/fracdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/guideddiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/intshifting/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/linesearchdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/nlp/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03	c heuristics/objpscostdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03	c # [type: real, range: [0,1], default: 0.01]
0.01/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/oneopt/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/pscostdiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c heuristics/rens/freq = -1
0.01/0.03	c 
0.01/0.03	c # minimum percentage of integer variables that have to be fixable 
0.01/0.03	c # [type: real, range: [0,1], default: 0.5]
0.01/0.03	c heuristics/rens/minfixingrate = 0.3
0.01/0.03	c 
0.01/0.03	c # number of nodes added to the contingent of the total nodes
0.01/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03	c heuristics/rens/nodesofs = 2000
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03	c heuristics/rootsoldiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/rounding/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/shifting/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/simplerounding/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c heuristics/trivial/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/trysol/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03	c heuristics/veclendiving/freq = -1
0.01/0.03	c 
0.01/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03	c 
0.01/0.03	c # additional number of allowed LP iterations
0.01/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03	c 
0.01/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03	c heuristics/zirounding/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c separating/cmir/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03	c separating/flowcover/freq = -1
0.01/0.03	c 
0.01/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03	c separating/rapidlearning/freq = 0
0.01/0.03	c 
0.01/0.03	c -----------------------------------------------------------------------------------------------
0.01/0.03	c start solving
0.01/0.03	c 
0.01/0.03	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.01/0.03	c   0.0s|     1 |     0 |    57 |     - | 735k|   0 |  54 | 180 | 152 | 180 | 152 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |    88 |     - | 951k|   0 |  56 | 180 | 152 | 180 | 156 |   4 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.12	c   0.1s|     1 |     0 |    99 |     - |1032k|   0 |  59 | 180 | 152 | 180 | 157 |   5 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.15	c   0.1s|     1 |     0 |   162 |     - |1124k|   0 |  52 | 180 | 152 | 180 | 161 |   9 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.18	c   0.1s|     1 |     0 |   219 |     - |1291k|   0 |  63 | 180 | 152 | 180 | 166 |  14 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.21	c   0.2s|     1 |     0 |   320 |     - |1459k|   0 |  71 | 180 | 152 | 180 | 172 |  20 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.26	c   0.2s|     1 |     2 |   320 |     - |1460k|   0 |  71 | 180 | 152 | 180 | 172 |  20 |   0 |  14 | 0.000000e+00 |      --      |    Inf 
1.29/1.36	c * 1.2s|    92 |     0 |  1318 |  11.0 |1534k|  18 |   - | 180 | 165 | 180 | 164 |  20 |  13 | 825 | 0.000000e+00 | 0.000000e+00 |   0.00%
1.29/1.36	c 
1.29/1.36	c SCIP Status        : problem is solved [optimal solution found]
1.29/1.36	c Solving Time (sec) : 1.17
1.29/1.36	c Solving Nodes      : 92
1.29/1.36	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
1.29/1.36	c Dual Bound         : +0.00000000000000e+00
1.29/1.36	c Gap                : 0.00 %
1.29/1.36	s SATISFIABLE
1.29/1.36	v x108 -x105 -x42 -x17 -x23 -x21 -x44 -x38 -x41 -x40 -x96 -x90 x88 -x87 -x85 -x98 -x92 -x102 -x106 -x100 -x79 -x24 -x101 -x12 -x10 
1.29/1.36	v -x9 -x6 -x2 -x8 -x3 -x5 -x78 -x77 x37 -x15 -x81 -x82 -x11 -x43 -x1 x7 -x86 -x91 -x93 -x83 -x13 -x73 x22 -x39 -x48 -x104 -x75 
1.29/1.36	v -x19 -x84 -x60 -x58 -x57 -x56 -x55 -x54 -x53 -x52 x51 -x50 -x49 -x145 -x144 -x143 -x142 -x141 -x89 -x46 -x16 -x72 -x71 -x69 
1.29/1.36	v x68 -x66 -x65 -x64 -x63 -x62 -x76 -x140 -x139 -x138 x137 -x136 -x4 x35 -x34 -x32 -x31 -x29 -x28 -x27 -x25 -x107 -x94 -x103 -x155 
1.29/1.36	v -x154 -x153 x152 -x151 -x67 -x59 -x33 -x26 -x20 -x165 -x164 -x163 -x162 -x161 -x45 -x18 -x120 -x119 -x118 -x117 -x115 x114 
1.29/1.36	v -x113 -x112 -x111 -x110 -x109 x74 -x47 -x97 -x175 -x174 -x173 -x172 x171 -x95 -x180 -x179 x178 -x177 -x176 -x36 -x116 -x135 
1.29/1.36	v -x134 -x133 -x132 x131 -x99 -x170 x169 -x168 -x167 -x166 -x70 -x130 -x129 x128 -x127 -x126 -x14 x160 -x159 -x158 -x157 -x156 
1.29/1.36	v -x80 -x125 x124 -x123 -x122 -x121 -x61 x150 -x149 -x148 -x147 -x146 -x30 
1.29/1.36	c SCIP Status        : problem is solved [optimal solution found]
1.29/1.36	c Solving Time       :       1.17
1.29/1.36	c Original Problem   :
1.29/1.36	c   Problem name     : HOME/instance-2665947-1276327199.opb
1.29/1.36	c   Variables        : 180 (180 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36	c   Constraints      : 152 initial, 152 maximal
1.29/1.36	c Presolved Problem  :
1.29/1.36	c   Problem name     : t_HOME/instance-2665947-1276327199.opb
1.29/1.36	c   Variables        : 180 (180 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36	c   Constraints      : 152 initial, 165 maximal
1.29/1.36	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.29/1.36	c   trivial          :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   setppc           :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   logicor          :       0.00          0          0          0          0          0          0          0          0
1.29/1.36	c   root node        :          -          0          -          -          0          -          -          -          -
1.29/1.36	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.36	c   integral         :          0          0          0        121          0         11         89          0          0        122
1.29/1.36	c   setppc           :         22          5        232          1          0          0        493          0          0          0
1.29/1.36	c   logicor          :        130+         5         99          1          0          0         14          0          0          0
1.29/1.36	c   countsols        :          0          0          0          1          0          0          0          0          0          0
1.29/1.36	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.29/1.36	c   integral         :       0.89       0.00       0.00       0.89       0.00
1.29/1.36	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.29/1.36	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.29/1.36	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.29/1.36	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.29/1.36	c   vbounds          :       0.00          1          0          0
1.29/1.36	c   rootredcost      :       0.00          0          0          0
1.29/1.36	c   pseudoobj        :       0.00          0          0          0
1.29/1.37	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.29/1.37	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.29/1.37	c   infeasible LP    :       0.00         19         12         90       18.1          0        0.0          0
1.29/1.37	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.29/1.37	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.29/1.37	c   applied globally :          -          -          -         13       12.1          -          -          -
1.29/1.37	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.29/1.37	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.29/1.37	c   cut pool         :       0.00          4          -          -         13          -    (maximal pool size: 231)
1.29/1.37	c   redcost          :       0.00         79          0          0          0          0
1.29/1.37	c   impliedbounds    :       0.00          5          0          0          0          0
1.29/1.37	c   intobj           :       0.00          0          0          0          0          0
1.29/1.37	c   cgmip            :       0.00          0          0          0          0          0
1.29/1.37	c   gomory           :       0.05          5          0          0        400          0
1.29/1.37	c   strongcg         :       0.05          5          0          0        538          0
1.29/1.37	c   cmir             :       0.00          0          0          0          0          0
1.29/1.37	c   flowcover        :       0.00          0          0          0          0          0
1.29/1.37	c   clique           :       0.00          5          0          0          0          0
1.29/1.37	c   zerohalf         :       0.00          0          0          0          0          0
1.29/1.37	c   mcf              :       0.00          1          0          0          0          0
1.29/1.37	c   rapidlearning    :       0.02          1          0          0          0          0
1.29/1.37	c Pricers            :       Time      Calls       Vars
1.29/1.37	c   problem variables:       0.00          0          0
1.29/1.37	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.29/1.37	c   relpscost        :       0.89        120         11         89          0          0        122
1.29/1.37	c   pscost           :       0.00          0          0          0          0          0          0
1.29/1.37	c   inference        :       0.00          0          0          0          0          0          0
1.29/1.37	c   mostinf          :       0.00          0          0          0          0          0          0
1.29/1.37	c   leastinf         :       0.00          0          0          0          0          0          0
1.29/1.37	c   fullstrong       :       0.00          0          0          0          0          0          0
1.29/1.37	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.29/1.37	c   random           :       0.00          0          0          0          0          0          0
1.29/1.37	c Primal Heuristics  :       Time      Calls      Found
1.29/1.37	c   LP solutions     :       0.00          -          1
1.29/1.37	c   pseudo solutions :       0.00          -          0
1.29/1.37	c   trivial          :       0.00          1          0
1.29/1.37	c   simplerounding   :       0.00          0          0
1.29/1.37	c   zirounding       :       0.00          0          0
1.29/1.37	c   rounding         :       0.00          0          0
1.29/1.37	c   shifting         :       0.00          0          0
1.29/1.37	c   intshifting      :       0.00          0          0
1.29/1.37	c   oneopt           :       0.00          0          0
1.29/1.37	c   twoopt           :       0.00          0          0
1.29/1.37	c   fixandinfer      :       0.00          0          0
1.29/1.37	c   feaspump         :       0.00          0          0
1.29/1.37	c   coefdiving       :       0.00          0          0
1.29/1.37	c   pscostdiving     :       0.00          0          0
1.29/1.37	c   fracdiving       :       0.00          0          0
1.29/1.37	c   veclendiving     :       0.00          0          0
1.29/1.37	c   intdiving        :       0.00          0          0
1.29/1.37	c   actconsdiving    :       0.00          0          0
1.29/1.37	c   objpscostdiving  :       0.00          0          0
1.29/1.37	c   rootsoldiving    :       0.00          0          0
1.29/1.37	c   linesearchdiving :       0.00          0          0
1.29/1.37	c   guideddiving     :       0.00          0          0
1.29/1.37	c   octane           :       0.00          0          0
1.29/1.37	c   rens             :       0.00          0          0
1.29/1.37	c   rins             :       0.00          0          0
1.29/1.37	c   localbranching   :       0.00          0          0
1.29/1.37	c   mutation         :       0.00          0          0
1.29/1.37	c   crossover        :       0.00          0          0
1.29/1.37	c   dins             :       0.00          0          0
1.29/1.37	c   undercover       :       0.00          0          0
1.29/1.37	c   nlp              :       0.00          0          0
1.29/1.37	c   trysol           :       0.00          0          0
1.29/1.37	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.29/1.37	c   primal LP        :       0.00          0          0       0.00          -
1.29/1.37	c   dual LP          :       0.11        145       1318       9.09   11981.82
1.29/1.37	c   lex dual LP      :       0.00          0          0       0.00          -
1.29/1.37	c   barrier LP       :       0.00          0          0       0.00          -
1.29/1.37	c   diving/probing LP:       0.00          0          0       0.00          -
1.29/1.37	c   strong branching :       0.89        825      14198      17.21   15952.81
1.29/1.37	c     (at root node) :          -         14        804      57.43          -
1.29/1.37	c   conflict analysis:       0.00          0          0       0.00          -
1.29/1.37	c B&B Tree           :
1.29/1.37	c   number of runs   :          1
1.29/1.37	c   nodes            :         92
1.29/1.37	c   nodes (total)    :         92
1.29/1.37	c   nodes left       :          0
1.29/1.37	c   max depth        :         18
1.29/1.37	c   max depth (total):         18
1.29/1.37	c   backtracks       :         11 (12.0%)
1.29/1.37	c   delayed cutoffs  :          0
1.29/1.37	c   repropagations   :         19 (28 domain reductions, 0 cutoffs)
1.29/1.37	c   avg switch length:       3.59
1.29/1.37	c   switching time   :       0.01
1.29/1.37	c Solution           :
1.29/1.37	c   Solutions found  :          1 (1 improvements)
1.29/1.37	c   First Solution   : +0.00000000000000e+00   (in run 1, after 92 nodes, 1.17 seconds, depth 18, found by <relaxation>)
1.29/1.37	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 92 nodes, 1.17 seconds, depth 18, found by <relaxation>)
1.29/1.37	c   Dual Bound       : +0.00000000000000e+00
1.29/1.37	c   Gap              :       0.00 %
1.29/1.37	c   Root Dual Bound  : +0.00000000000000e+00
1.29/1.37	c   Root Iterations  :        320
1.29/1.37	c Time complete: 1.36.

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-2665947-1276327199/watcher-2665947-1276327199 -o /tmp/evaluation-result-2665947-1276327199/solver-2665947-1276327199 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665947-1276327199.opb -t 1800 -m 1800 

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 11114
/proc/meminfo: memFree=1879672/2059040 swapFree=4135044/4192956
[pid=11114] ppid=11112 vsize=9288 CPUtime=0
/proc/11114/stat : 11114 (pbscip.linux.x8) R 11112 11114 9294 0 -1 4202496 1054 0 0 0 0 0 0 0 20 0 1 0 8321193 9510912 975 1992294400 4194304 9819077 140735657077392 18446744073709551615 8675093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/11114/statm: 2322 985 371 1374 0 943 0

[startup+0.0237849 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 11114
/proc/meminfo: memFree=1879672/2059040 swapFree=4135044/4192956
[pid=11114] ppid=11112 vsize=12932 CPUtime=0.01
/proc/11114/stat : 11114 (pbscip.linux.x8) R 11112 11114 9294 0 -1 4202496 2613 0 0 0 1 0 0 0 20 0 1 0 8321193 13242368 1924 1992294400 4194304 9819077 140735657077392 18446744073709551615 8716122 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11114/statm: 3233 1926 485 1374 0 1854 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 12932

[startup+0.101792 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 11114
/proc/meminfo: memFree=1879672/2059040 swapFree=4135044/4192956
[pid=11114] ppid=11112 vsize=17060 CPUtime=0.09
/proc/11114/stat : 11114 (pbscip.linux.x8) R 11112 11114 9294 0 -1 4202496 7743 0 0 0 7 2 0 0 20 0 1 0 8321193 17469440 3111 1992294400 4194304 9819077 140735657077392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11114/statm: 4265 3111 676 1374 0 2886 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 17060

[startup+0.300811 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 11114
/proc/meminfo: memFree=1879672/2059040 swapFree=4135044/4192956
[pid=11114] ppid=11112 vsize=18720 CPUtime=0.29
/proc/11114/stat : 11114 (pbscip.linux.x8) R 11112 11114 9294 0 -1 4202496 8793 0 0 0 25 4 0 0 20 0 1 0 8321193 19169280 3136 1992294400 4194304 9819077 140735657077392 18446744073709551615 8657695 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11114/statm: 4680 3136 689 1374 0 3301 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 18720

[startup+0.700848 s]
/proc/loadavg: 1.00 1.00 1.00 3/106 11114
/proc/meminfo: memFree=1879672/2059040 swapFree=4135044/4192956
[pid=11114] ppid=11112 vsize=18720 CPUtime=0.69
/proc/11114/stat : 11114 (pbscip.linux.x8) R 11112 11114 9294 0 -1 4202496 14175 0 0 0 60 9 0 0 20 0 1 0 8321193 19169280 3154 1992294400 4194304 9819077 140735657077392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11114/statm: 4680 3154 703 1374 0 3301 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 18720

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

[startup+1.10889 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 11115
/proc/meminfo: memFree=1869124/2059040 swapFree=4135044/4192956
[pid=11114] ppid=11112 vsize=18904 CPUtime=1.1
/proc/11114/stat : 11114 (pbscip.linux.x8) R 11112 11114 9294 0 -1 4202496 21527 0 0 0 95 15 0 0 22 0 1 0 8321193 19357696 3171 1992294400 4194304 9819077 140735657077392 18446744073709551615 8720183 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11114/statm: 4726 3171 707 1374 0 3347 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 18904

[startup+1.30091 s]
/proc/loadavg: 1.00 1.00 1.00 2/107 11115
/proc/meminfo: memFree=1869124/2059040 swapFree=4135044/4192956
[pid=11114] ppid=11112 vsize=17868 CPUtime=1.29
/proc/11114/stat : 11114 (pbscip.linux.x8) R 11112 11114 9294 0 -1 4202496 24629 0 0 0 112 17 0 0 22 0 1 0 8321193 18296832 3168 1992294400 4194304 9819077 140735657077392 18446744073709551615 8657695 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11114/statm: 4467 3168 707 1374 0 3088 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 17868

Child status: 0
Real time (s): 1.37713
CPU time (s): 1.37579
CPU user time (s): 1.18982
CPU system time (s): 0.185971
CPU usage (%): 99.903
Max. virtual memory (cumulated for all children) (KiB): 18904

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

runsolver used 0.003999 second user time and 0.019996 second system time

The end

Launcher Data 

Begin job on node015 at 2010-06-12 09:19:59
IDJOB=2665947
IDBENCH=1423
IDSOLVER=1168
FILE ID=node015/2665947-1276327199
PBS_JOBID= 11173155
Free space on /tmp= 62548 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_10_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-2665947-1276327199/watcher-2665947-1276327199 -o /tmp/evaluation-result-2665947-1276327199/solver-2665947-1276327199 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.clp -f HOME/instance-2665947-1276327199.opb -t 1800 -m 1800

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

MD5SUM BENCH= 08f887bbbbfea31f6c38c070eebe6907
RANDOM SEED=971422957

node015.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.244
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.48
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1880076 kB
Buffers:          8864 kB
Cached:         102588 kB
SwapCached:      13944 kB
Active:         105920 kB
Inactive:        21412 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1880076 kB
SwapTotal:     4192956 kB
SwapFree:      4135044 kB
Dirty:            6304 kB
Writeback:           0 kB
AnonPages:       10776 kB
Mapped:           7512 kB
Slab:            29764 kB
PageTables:       4060 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   181820 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= 62540 MiB
End job on node015 at 2010-06-12 09:20:00