Trace number 2664526

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
SCIPnone SCIP 1.2.1.2 without any LP solverSAT 0.314951 0.31452

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga14_13_sat_pb.cnf.cr.opb
MD5SUMc93baf194c905dcd2c2597569ae179ef
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 variables273
Total number of constraints222
Number of constraints which are clauses195
Number of constraints which are cardinality constraints (but not clauses)27
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: NONE] [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-2664526-1276328226.opb>
0.00/0.01	c original problem has 273 variables (273 bin, 0 int, 0 impl, 0 cont) and 222 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.01	c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
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, 222 upgd conss, 0 impls, 27 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, 27 cliques
0.00/0.03	c presolved problem has 273 variables (273 bin, 0 int, 0 impl, 0 cont) and 222 constraints
0.00/0.03	c      27 constraints of type <setppc>
0.00/0.03	c     195 constraints of type <logicor>
0.00/0.03	c transformed objective value is always integral (scale: 1)
0.00/0.03	c Presolving Time: 0.01
0.00/0.03	c - non default parameters ----------------------------------------------------------------------
0.00/0.03	c # SCIP version 1.2.1.2
0.00/0.03	c 
0.00/0.03	c # frequency for displaying node information lines
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03	c display/freq = 10000
0.00/0.03	c 
0.00/0.03	c # maximal time in seconds to run
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/time = 1800
0.00/0.03	c 
0.00/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/memory = 1620
0.00/0.03	c 
0.00/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c limits/solutions = 1
0.00/0.03	c 
0.00/0.03	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c lp/solvefreq = -1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03	c separating/maxrounds = 1
0.00/0.03	c 
0.00/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/maxroundsroot = 5
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify inequalities
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/linear/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03	c constraints/knapsack/disaggregation = FALSE
0.00/0.03	c 
0.00/0.03	c # should presolving try to simplify knapsacks
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03	c 
0.00/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c presolving/probing/maxrounds = 0
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/coefdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03	c heuristics/crossover/freq = -1
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/crossover/nodesofs = 750
0.00/0.03	c 
0.00/0.03	c # number of nodes without incumbent change that heuristic should wait
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03	c heuristics/crossover/nwaitingnodes = 100
0.00/0.03	c 
0.00/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03	c # [type: real, range: [0,1], default: 0.1]
0.00/0.03	c heuristics/crossover/nodesquot = 0.15
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixed 
0.00/0.03	c # [type: real, range: [0,1], default: 0.666]
0.00/0.03	c heuristics/crossover/minfixingrate = 0.5
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/feaspump/freq = -1
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/fracdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/guideddiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/intshifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/linesearchdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/nlp/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/objpscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03	c # [type: real, range: [0,1], default: 0.01]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/oneopt/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/pscostdiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/rens/freq = -1
0.00/0.03	c 
0.00/0.03	c # minimum percentage of integer variables that have to be fixable 
0.00/0.03	c # [type: real, range: [0,1], default: 0.5]
0.00/0.03	c heuristics/rens/minfixingrate = 0.3
0.00/0.03	c 
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/rens/nodesofs = 2000
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03	c heuristics/rootsoldiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/rounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/shifting/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/simplerounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c heuristics/trivial/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/trysol/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/veclendiving/freq = -1
0.00/0.03	c 
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03	c 
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03	c 
0.00/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03	c heuristics/zirounding/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03	c separating/cmir/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.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 |     2 |     0 |     - | 865k|   0 |   - | 273 | 222 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.29/0.30	c * 0.2s|  2119 |     0 |     0 |   0.0 |1050k| 172 |   - | 273 | 240 |   0 |   0 |   0 |  55 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.29/0.30	c 
0.29/0.30	c SCIP Status        : problem is solved [optimal solution found]
0.29/0.30	c Solving Time (sec) : 0.25
0.29/0.30	c Solving Nodes      : 2119
0.29/0.30	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.29/0.30	c Dual Bound         : +0.00000000000000e+00
0.29/0.30	c Gap                : 0.00 %
0.29/0.30	s SATISFIABLE
0.29/0.30	v -x75 -x78 -x81 -x139 -x138 -x135 -x131 -x68 -x64 -x60 -x134 -x152 -x150 -x149 -x148 x83 -x61 -x71 x146 -x128 -x41 -x40 -x34 -x33 
0.29/0.30	v -x31 -x32 -x39 -x151 -x80 x37 -x137 -x69 -x13 -x12 -x9 -x8 -x6 -x1 -x57 -x36 -x30 -x179 -x178 -x177 -x176 -x175 x172 -x171 
0.29/0.30	v -x170 -x147 -x5 -x2 -x130 -x154 -x72 -x35 -x62 -x168 -x167 -x166 -x165 -x163 -x160 -x158 -x157 -x156 -x181 -x79 -x73 -x14 -x143 
0.29/0.30	v -x38 -x59 -x77 x155 -x159 -x112 -x110 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x100 -x99 -x66 -x82 -x11 -x4 -x180 x58 -x56 
0.29/0.30	v -x53 -x52 -x50 -x49 -x48 -x47 -x46 x45 -x43 x10 -x67 x140 -x162 -x29 -x70 -x98 -x97 -x95 -x94 -x93 -x92 -x90 -x89 -x88 -x87 
0.29/0.30	v -x86 -x85 -x74 -x125 -x124 -x123 x119 -x117 -x116 -x115 -x114 -x113 -x133 -x174 -x55 -x129 -x144 -x169 -x63 -x118 -x76 -x206 
0.29/0.30	v -x205 -x204 -x203 x202 -x201 -x65 -x252 x251 -x250 -x249 -x248 -x247 -x246 x109 -x3 -x51 -x122 -x153 -x161 -x141 -x28 -x26 
0.29/0.30	v -x25 -x24 -x23 -x21 -x20 -x19 -x18 -x15 x96 -x111 -x120 -x126 -x136 -x231 -x230 -x229 -x228 x227 -x226 -x225 x22 -x142 -x91 -x173 
0.29/0.30	v -x259 -x258 -x257 -x256 -x255 -x254 x253 -x54 -x44 -x182 -x238 -x237 -x236 -x235 -x234 x233 -x232 -x121 x188 -x187 -x186 
0.29/0.30	v -x185 -x184 -x183 -x127 -x218 -x217 -x216 -x215 -x214 x213 -x132 -x17 -x266 -x265 x264 -x263 -x262 -x261 -x260 -x27 -x224 x223 
0.29/0.30	v -x222 -x221 -x220 -x219 -x7 -x42 -x200 -x199 x198 -x197 -x196 -x195 -x101 -x273 -x272 -x271 x270 -x269 -x268 -x267 -x84 -x212 
0.29/0.30	v -x211 -x210 -x209 -x208 -x207 -x145 -x194 -x193 -x192 x191 -x190 -x189 -x16 x245 -x244 -x243 -x242 -x241 -x240 -x239 -x164 
0.29/0.30	c SCIP Status        : problem is solved [optimal solution found]
0.29/0.30	c Solving Time       :       0.25
0.29/0.30	c Original Problem   :
0.29/0.30	c   Problem name     : HOME/instance-2664526-1276328226.opb
0.29/0.30	c   Variables        : 273 (273 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.30	c   Constraints      : 222 initial, 222 maximal
0.29/0.30	c Presolved Problem  :
0.29/0.30	c   Problem name     : t_HOME/instance-2664526-1276328226.opb
0.29/0.30	c   Variables        : 273 (273 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.30	c   Constraints      : 222 initial, 241 maximal
0.29/0.30	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.29/0.30	c   trivial          :       0.01          0          0          0          0          0          0          0          0
0.29/0.30	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.29/0.30	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.29/0.30	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.29/0.30	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.29/0.30	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.29/0.30	c   setppc           :       0.00          0          0          0          0          0          0          0          0
0.29/0.30	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.29/0.30	c   root node        :          -          0          -          -          0          -          -          -          -
0.29/0.30	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.29/0.30	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.29/0.30	c   setppc           :         27          0       2674          0       2091         33       1425          0          0          0
0.29/0.30	c   logicor          :        195+         0       1061          0       2092         14        825          0          0          0
0.29/0.30	c   countsols        :          0          0          0          0       2092          0          0          0          0          0
0.29/0.30	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.29/0.30	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.29/0.30	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.29/0.30	c   logicor          :       0.08       0.00       0.00       0.00       0.08
0.29/0.30	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.29/0.30	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.29/0.30	c   vbounds          :       0.00          1          0          0
0.29/0.30	c   rootredcost      :       0.01          0          0          0
0.29/0.30	c   pseudoobj        :       0.00          0          0          0
0.29/0.30	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.29/0.30	c   propagation      :       0.00         47         47        326       53.9          2       25.0          -
0.29/0.30	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.30	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.30	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.29/0.30	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.29/0.30	c   applied globally :          -          -          -         20       19.8          -          -          -
0.29/0.30	c   applied locally  :          -          -          -         35       45.5          -          -          -
0.29/0.30	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.29/0.30	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.29/0.30	c   redcost          :       0.00          0          0          0          0          0
0.29/0.30	c   impliedbounds    :       0.00          0          0          0          0          0
0.29/0.30	c   intobj           :       0.00          0          0          0          0          0
0.29/0.30	c   cgmip            :       0.00          0          0          0          0          0
0.29/0.30	c   gomory           :       0.00          0          0          0          0          0
0.29/0.30	c   strongcg         :       0.00          0          0          0          0          0
0.29/0.30	c   cmir             :       0.00          0          0          0          0          0
0.29/0.30	c   flowcover        :       0.00          0          0          0          0          0
0.29/0.30	c   clique           :       0.00          0          0          0          0          0
0.29/0.30	c   zerohalf         :       0.00          0          0          0          0          0
0.29/0.30	c   mcf              :       0.00          0          0          0          0          0
0.29/0.30	c   rapidlearning    :       0.00          0          0          0          0          0
0.29/0.30	c Pricers            :       Time      Calls       Vars
0.29/0.30	c   problem variables:       0.00          0          0
0.29/0.30	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.29/0.30	c   relpscost        :       0.00          0          0          0          0          0          0
0.29/0.30	c   pscost           :       0.00          0          0          0          0          0          0
0.29/0.30	c   inference        :       0.10       2091          0          0          0          0       4182
0.29/0.30	c   mostinf          :       0.00          0          0          0          0          0          0
0.29/0.30	c   leastinf         :       0.00          0          0          0          0          0          0
0.29/0.30	c   fullstrong       :       0.00          0          0          0          0          0          0
0.29/0.30	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.29/0.30	c   random           :       0.00          0          0          0          0          0          0
0.29/0.30	c Primal Heuristics  :       Time      Calls      Found
0.29/0.30	c   LP solutions     :       0.00          -          0
0.29/0.30	c   pseudo solutions :       0.00          -          1
0.29/0.30	c   trivial          :       0.00          1          0
0.29/0.30	c   simplerounding   :       0.00          0          0
0.29/0.30	c   zirounding       :       0.00          0          0
0.29/0.30	c   rounding         :       0.00          0          0
0.29/0.30	c   shifting         :       0.00          0          0
0.29/0.30	c   intshifting      :       0.00          0          0
0.29/0.30	c   oneopt           :       0.00          0          0
0.29/0.30	c   twoopt           :       0.00          0          0
0.29/0.30	c   fixandinfer      :       0.00          0          0
0.29/0.30	c   feaspump         :       0.00          0          0
0.29/0.30	c   coefdiving       :       0.00          0          0
0.29/0.30	c   pscostdiving     :       0.00          0          0
0.29/0.30	c   fracdiving       :       0.00          0          0
0.29/0.30	c   veclendiving     :       0.00          0          0
0.29/0.30	c   intdiving        :       0.00          0          0
0.29/0.30	c   actconsdiving    :       0.00          0          0
0.29/0.30	c   objpscostdiving  :       0.00          0          0
0.29/0.30	c   rootsoldiving    :       0.00          0          0
0.29/0.30	c   linesearchdiving :       0.00          0          0
0.29/0.30	c   guideddiving     :       0.00          0          0
0.29/0.30	c   octane           :       0.00          0          0
0.29/0.30	c   rens             :       0.00          0          0
0.29/0.30	c   rins             :       0.00          0          0
0.29/0.30	c   localbranching   :       0.00          0          0
0.29/0.30	c   mutation         :       0.00          0          0
0.29/0.30	c   crossover        :       0.00          0          0
0.29/0.30	c   dins             :       0.00          0          0
0.29/0.30	c   undercover       :       0.00          0          0
0.29/0.30	c   nlp              :       0.00          0          0
0.29/0.30	c   trysol           :       0.00          0          0
0.29/0.30	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.29/0.30	c   primal LP        :       0.00          0          0       0.00          -
0.29/0.30	c   dual LP          :       0.00          0          0       0.00          -
0.29/0.30	c   lex dual LP      :       0.00          0          0       0.00          -
0.29/0.30	c   barrier LP       :       0.00          0          0       0.00          -
0.29/0.30	c   diving/probing LP:       0.00          0          0       0.00          -
0.29/0.30	c   strong branching :       0.00          0          0       0.00          -
0.29/0.30	c     (at root node) :          -          0          0       0.00          -
0.29/0.30	c   conflict analysis:       0.00          0          0       0.00          -
0.29/0.30	c B&B Tree           :
0.29/0.30	c   number of runs   :          1
0.29/0.30	c   nodes            :       2119
0.29/0.30	c   nodes (total)    :       2119
0.29/0.30	c   nodes left       :          0
0.29/0.30	c   max depth        :        172
0.29/0.30	c   max depth (total):        172
0.29/0.30	c   backtracks       :         21 (1.0%)
0.29/0.30	c   delayed cutoffs  :         29
0.29/0.30	c   repropagations   :         82 (347 domain reductions, 20 cutoffs)
0.29/0.30	c   avg switch length:       2.55
0.29/0.30	c   switching time   :       0.02
0.29/0.30	c Solution           :
0.29/0.30	c   Solutions found  :          1 (1 improvements)
0.29/0.30	c   First Solution   : +0.00000000000000e+00   (in run 1, after 2119 nodes, 0.25 seconds, depth 159, found by <relaxation>)
0.29/0.30	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 2119 nodes, 0.25 seconds, depth 159, found by <relaxation>)
0.29/0.30	c   Dual Bound       : +0.00000000000000e+00
0.29/0.30	c   Gap              :       0.00 %
0.29/0.30	c   Root Dual Bound  : +0.00000000000000e+00
0.29/0.30	c   Root Iterations  :          0
0.29/0.31	c Time complete: 0.3.

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-2664526-1276328226/watcher-2664526-1276328226 -o /tmp/evaluation-result-2664526-1276328226/solver-2664526-1276328226 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664526-1276328226.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.01 1.00 1.00 3/106 11229
/proc/meminfo: memFree=1843636/2059040 swapFree=4136244/4192956
[pid=11229] ppid=11227 vsize=6584 CPUtime=0
/proc/11229/stat : 11229 (pbscip.linux.x8) R 11227 11229 10523 0 -1 4202496 978 0 0 0 0 0 0 0 20 0 1 0 8426591 6742016 901 1992294400 4194304 7136930 140734311753744 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/11229/statm: 1646 911 254 719 0 925 0

[startup+0.0422691 s]
/proc/loadavg: 1.01 1.00 1.00 3/106 11229
/proc/meminfo: memFree=1843636/2059040 swapFree=4136244/4192956
[pid=11229] ppid=11227 vsize=12036 CPUtime=0.04
/proc/11229/stat : 11229 (pbscip.linux.x8) R 11227 11229 10523 0 -1 4202496 3972 0 0 0 2 2 0 0 20 0 1 0 8426591 12324864 2256 1992294400 4194304 7136930 140734311753744 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11229/statm: 3009 2256 374 719 0 2288 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 12036

[startup+0.101273 s]
/proc/loadavg: 1.01 1.00 1.00 3/106 11229
/proc/meminfo: memFree=1843636/2059040 swapFree=4136244/4192956
[pid=11229] ppid=11227 vsize=12380 CPUtime=0.09
/proc/11229/stat : 11229 (pbscip.linux.x8) R 11227 11229 10523 0 -1 4202496 4072 0 0 0 7 2 0 0 20 0 1 0 8426591 12677120 2356 1992294400 4194304 7136930 140734311753744 18446744073709551615 4697611 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11229/statm: 3095 2356 379 719 0 2374 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 12380

[startup+0.301294 s]
/proc/loadavg: 1.01 1.00 1.00 3/106 11229
/proc/meminfo: memFree=1843636/2059040 swapFree=4136244/4192956
[pid=11229] ppid=11227 vsize=13076 CPUtime=0.29
/proc/11229/stat : 11229 (pbscip.linux.x8) R 11227 11229 10523 0 -1 4202496 4267 0 0 0 25 4 0 0 20 0 1 0 8426591 13389824 2551 1992294400 4194304 7136930 140734311753744 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11229/statm: 3269 2551 379 719 0 2548 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 13076

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

Child status: 0
Real time (s): 0.31452
CPU time (s): 0.314951
CPU user time (s): 0.266959
CPU system time (s): 0.047992
CPU usage (%): 100.137
Max. virtual memory (cumulated for all children) (KiB): 13076

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

runsolver used 0.003999 second user time and 0.011998 second system time

The end

Launcher Data 

Begin job on node002 at 2010-06-12 09:37:06
IDJOB=2664526
IDBENCH=1432
IDSOLVER=1167
FILE ID=node002/2664526-1276328226
PBS_JOBID= 11173165
Free space on /tmp= 62400 MiB

SOLVER NAME= SCIPnone SCIP 1.2.1.2 without any LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-fpga14_13_sat_pb.cnf.cr.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.none -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2664526-1276328226/watcher-2664526-1276328226 -o /tmp/evaluation-result-2664526-1276328226/solver-2664526-1276328226 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664526-1276328226.opb -t 1800 -m 1800

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

MD5SUM BENCH= c93baf194c905dcd2c2597569ae179ef
RANDOM SEED=127681478

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

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

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1844040 kB
Buffers:         11648 kB
Cached:         119544 kB
SwapCached:      17024 kB
Active:         102876 kB
Inactive:        48152 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1844040 kB
SwapTotal:     4192956 kB
SwapFree:      4136244 kB
Dirty:            3668 kB
Writeback:           0 kB
AnonPages:       10788 kB
Mapped:           9172 kB
Slab:            42192 kB
PageTables:       4024 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   179952 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= 62396 MiB
End job on node002 at 2010-06-12 09:37:07