Trace number 2664539

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.223965 0.223983

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga13_13_sat_pb.cnf.cr.opb
MD5SUMbf7e21954a6ae09c036e6d4bdde8af91
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.008997
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables254
Total number of constraints208
Number of constraints which are clauses182
Number of constraints which are cardinality constraints (but not clauses)26
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint6
Maximum length of a constraint13
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 14
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-2664539-1276330061.opb>
0.00/0.01	c original problem has 254 variables (254 bin, 0 int, 0 impl, 0 cont) and 208 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.02/0.03	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 208 upgd conss, 0 impls, 26 clqs
0.02/0.03	c presolving (2 rounds):
0.02/0.03	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.03	c  0 implications, 26 cliques
0.02/0.03	c presolved problem has 254 variables (254 bin, 0 int, 0 impl, 0 cont) and 208 constraints
0.02/0.03	c      26 constraints of type <setppc>
0.02/0.03	c     182 constraints of type <logicor>
0.02/0.03	c transformed objective value is always integral (scale: 1)
0.02/0.03	c Presolving Time: 0.01
0.02/0.03	c - non default parameters ----------------------------------------------------------------------
0.02/0.03	c # SCIP version 1.2.1.2
0.02/0.03	c 
0.02/0.03	c # frequency for displaying node information lines
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.03	c display/freq = 10000
0.02/0.03	c 
0.02/0.03	c # maximal time in seconds to run
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03	c limits/time = 1799.99
0.02/0.03	c 
0.02/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.03	c limits/memory = 1620
0.02/0.03	c 
0.02/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03	c limits/solutions = 1
0.02/0.03	c 
0.02/0.03	c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03	c lp/solvefreq = -1
0.02/0.03	c 
0.02/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.03	c separating/maxrounds = 1
0.02/0.03	c 
0.02/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03	c separating/maxroundsroot = 5
0.02/0.03	c 
0.02/0.03	c # should presolving try to simplify inequalities
0.02/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03	c constraints/linear/simplifyinequalities = TRUE
0.02/0.03	c 
0.02/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.03	c constraints/knapsack/disaggregation = FALSE
0.02/0.03	c 
0.02/0.03	c # should presolving try to simplify knapsacks
0.02/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.03	c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.03	c 
0.02/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03	c presolving/probing/maxrounds = 0
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/coefdiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03	c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.03	c heuristics/crossover/freq = -1
0.02/0.03	c 
0.02/0.03	c # number of nodes added to the contingent of the total nodes
0.02/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03	c heuristics/crossover/nodesofs = 750
0.02/0.03	c 
0.02/0.03	c # number of nodes without incumbent change that heuristic should wait
0.02/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.03	c heuristics/crossover/nwaitingnodes = 100
0.02/0.03	c 
0.02/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.03	c # [type: real, range: [0,1], default: 0.1]
0.02/0.03	c heuristics/crossover/nodesquot = 0.15
0.02/0.03	c 
0.02/0.03	c # minimum percentage of integer variables that have to be fixed 
0.02/0.03	c # [type: real, range: [0,1], default: 0.666]
0.02/0.03	c heuristics/crossover/minfixingrate = 0.5
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03	c heuristics/feaspump/freq = -1
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/fracdiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03	c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/guideddiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03	c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03	c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/intshifting/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/linesearchdiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03	c heuristics/nlp/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03	c heuristics/objpscostdiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.03	c # [type: real, range: [0,1], default: 0.01]
0.02/0.03	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03	c heuristics/oneopt/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/pscostdiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03	c heuristics/rens/freq = -1
0.02/0.03	c 
0.02/0.03	c # minimum percentage of integer variables that have to be fixable 
0.02/0.03	c # [type: real, range: [0,1], default: 0.5]
0.02/0.03	c heuristics/rens/minfixingrate = 0.3
0.02/0.03	c 
0.02/0.03	c # number of nodes added to the contingent of the total nodes
0.02/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.03	c heuristics/rens/nodesofs = 2000
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.03	c heuristics/rootsoldiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.03	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03	c heuristics/rounding/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/shifting/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03	c heuristics/simplerounding/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03	c heuristics/trivial/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03	c heuristics/trysol/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.03	c heuristics/veclendiving/freq = -1
0.02/0.03	c 
0.02/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.03	c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.03	c 
0.02/0.03	c # additional number of allowed LP iterations
0.02/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.03	c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.03	c 
0.02/0.03	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.03	c heuristics/zirounding/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03	c separating/cmir/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.03	c separating/flowcover/freq = -1
0.02/0.03	c 
0.02/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.03	c separating/rapidlearning/freq = 0
0.02/0.03	c 
0.02/0.03	c -----------------------------------------------------------------------------------------------
0.02/0.03	c start solving
0.02/0.03	c 
0.02/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.02/0.03	c   0.0s|     1 |     2 |     0 |     - | 812k|   0 |   - | 254 | 208 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.21	c * 0.2s|  1488 |     0 |     0 |   0.0 | 982k| 141 |   - | 254 | 239 |   0 |   0 |   0 |  47 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.19/0.21	c 
0.19/0.21	c SCIP Status        : problem is solved [optimal solution found]
0.19/0.21	c Solving Time (sec) : 0.17
0.19/0.21	c Solving Nodes      : 1488
0.19/0.21	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.19/0.21	c Dual Bound         : +0.00000000000000e+00
0.19/0.21	c Gap                : 0.00 %
0.19/0.21	s SATISFIABLE
0.19/0.21	v -x158 -x156 -x84 -x80 -x82 -x136 -x79 -x168 -x137 -x169 x65 -x59 -x57 -x56 -x53 -x146 -x138 -x167 -x135 -x165 -x148 -x88 x131 x147 
0.19/0.21	v -x63 -x81 -x55 -x26 -x21 -x20 -x15 -x14 -x23 -x142 -x152 -x144 -x128 x127 -x124 -x122 -x121 -x119 x89 -x154 -x162 -x17 -x139 
0.19/0.21	v -x130 -x140 -x22 -x157 -x129 -x151 -x143 -x153 -x145 -x126 -x58 -x166 -x78 -x77 -x76 -x75 -x74 -x73 x72 -x71 -x70 -x69 -x68 
0.19/0.21	v -x67 -x120 -x134 -x90 -x149 -x118 -x91 -x164 x18 -x193 -x192 -x191 -x190 -x189 x188 -x160 -x19 -x161 -x54 -x133 -x85 -x163 
0.19/0.21	v -x155 -x16 -x25 -x86 -x187 -x186 x185 -x184 -x183 -x182 x159 -x37 x35 -x34 -x32 -x30 -x29 -x28 -x27 -x60 -x150 -x38 -x219 -x218 
0.19/0.21	v -x217 -x216 -x215 x214 -x213 -x125 -x64 -x61 -x117 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106 -x105 -x62 x254 -x253 
0.19/0.21	v -x252 -x251 -x250 -x249 -x248 -x39 -x141 -x104 x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x233 x232 
0.19/0.21	v -x231 -x230 -x229 -x228 -x227 -x36 -x175 -x174 -x173 x172 -x171 -x170 -x66 -x212 -x211 -x210 x209 -x208 -x207 -x206 -x33 -x181 
0.19/0.21	v -x180 -x179 -x178 x177 -x176 -x132 -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 x205 -x204 -x203 -x202 
0.19/0.21	v -x201 -x200 -x123 -x247 -x246 -x245 -x244 -x243 -x242 x241 -x116 -x226 -x225 -x224 -x223 x222 -x221 -x220 -x87 -x83 -x13 -x12 
0.19/0.21	v -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 -x1 -x24 -x199 x198 -x197 -x196 -x195 -x194 -x31 -x240 -x239 x238 -x237 -x236 -x235 
0.19/0.21	v -x234 -x115 
0.19/0.21	c SCIP Status        : problem is solved [optimal solution found]
0.19/0.21	c Solving Time       :       0.17
0.19/0.21	c Original Problem   :
0.19/0.21	c   Problem name     : HOME/instance-2664539-1276330061.opb
0.19/0.21	c   Variables        : 254 (254 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.21	c   Constraints      : 208 initial, 208 maximal
0.19/0.21	c Presolved Problem  :
0.19/0.21	c   Problem name     : t_HOME/instance-2664539-1276330061.opb
0.19/0.21	c   Variables        : 254 (254 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.21	c   Constraints      : 208 initial, 239 maximal
0.19/0.21	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.19/0.21	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   setppc           :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.19/0.21	c   root node        :          -          0          -          -          0          -          -          -          -
0.19/0.21	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.19/0.21	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.19/0.21	c   setppc           :         26          0       1878          0       1468         20       1062          0          0          0
0.19/0.21	c   logicor          :        182+         0        731          0       1469          8        613          0          0          0
0.19/0.21	c   countsols        :          0          0          0          0       1469          0          0          0          0          0
0.19/0.21	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.19/0.21	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.19/0.21	c   setppc           :       0.01       0.00       0.01       0.00       0.00
0.19/0.21	c   logicor          :       0.06       0.00       0.01       0.00       0.05
0.19/0.21	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.19/0.21	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.19/0.21	c   vbounds          :       0.00          1          0          0
0.19/0.21	c   rootredcost      :       0.01          0          0          0
0.19/0.21	c   pseudoobj        :       0.00          0          0          0
0.19/0.21	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.19/0.21	c   propagation      :       0.01         28         28        164       49.4          0        0.0          -
0.19/0.21	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.19/0.21	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.19/0.21	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.19/0.21	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.19/0.21	c   applied globally :          -          -          -         31       22.5          -          -          -
0.19/0.21	c   applied locally  :          -          -          -         16       47.8          -          -          -
0.19/0.21	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.19/0.21	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.19/0.21	c   redcost          :       0.00          0          0          0          0          0
0.19/0.21	c   impliedbounds    :       0.00          0          0          0          0          0
0.19/0.21	c   intobj           :       0.00          0          0          0          0          0
0.19/0.21	c   cgmip            :       0.00          0          0          0          0          0
0.19/0.21	c   gomory           :       0.00          0          0          0          0          0
0.19/0.21	c   strongcg         :       0.00          0          0          0          0          0
0.19/0.21	c   cmir             :       0.00          0          0          0          0          0
0.19/0.21	c   flowcover        :       0.00          0          0          0          0          0
0.19/0.21	c   clique           :       0.00          0          0          0          0          0
0.19/0.21	c   zerohalf         :       0.00          0          0          0          0          0
0.19/0.21	c   mcf              :       0.00          0          0          0          0          0
0.19/0.21	c   rapidlearning    :       0.00          0          0          0          0          0
0.19/0.21	c Pricers            :       Time      Calls       Vars
0.19/0.21	c   problem variables:       0.00          0          0
0.19/0.21	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.19/0.21	c   relpscost        :       0.00          0          0          0          0          0          0
0.19/0.21	c   pscost           :       0.00          0          0          0          0          0          0
0.19/0.21	c   inference        :       0.03       1468          0          0          0          0       2936
0.19/0.21	c   mostinf          :       0.00          0          0          0          0          0          0
0.19/0.21	c   leastinf         :       0.00          0          0          0          0          0          0
0.19/0.21	c   fullstrong       :       0.00          0          0          0          0          0          0
0.19/0.21	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.19/0.21	c   random           :       0.00          0          0          0          0          0          0
0.19/0.21	c Primal Heuristics  :       Time      Calls      Found
0.19/0.21	c   LP solutions     :       0.00          -          0
0.19/0.21	c   pseudo solutions :       0.00          -          1
0.19/0.21	c   trivial          :       0.00          1          0
0.19/0.21	c   simplerounding   :       0.00          0          0
0.19/0.21	c   zirounding       :       0.00          0          0
0.19/0.21	c   rounding         :       0.00          0          0
0.19/0.21	c   shifting         :       0.00          0          0
0.19/0.21	c   intshifting      :       0.00          0          0
0.19/0.21	c   oneopt           :       0.00          0          0
0.19/0.21	c   twoopt           :       0.00          0          0
0.19/0.21	c   fixandinfer      :       0.00          0          0
0.19/0.21	c   feaspump         :       0.00          0          0
0.19/0.21	c   coefdiving       :       0.00          0          0
0.19/0.21	c   pscostdiving     :       0.00          0          0
0.19/0.21	c   fracdiving       :       0.00          0          0
0.19/0.21	c   veclendiving     :       0.00          0          0
0.19/0.21	c   intdiving        :       0.00          0          0
0.19/0.21	c   actconsdiving    :       0.00          0          0
0.19/0.21	c   objpscostdiving  :       0.00          0          0
0.19/0.21	c   rootsoldiving    :       0.00          0          0
0.19/0.21	c   linesearchdiving :       0.00          0          0
0.19/0.21	c   guideddiving     :       0.00          0          0
0.19/0.21	c   octane           :       0.00          0          0
0.19/0.21	c   rens             :       0.00          0          0
0.19/0.21	c   rins             :       0.00          0          0
0.19/0.21	c   localbranching   :       0.00          0          0
0.19/0.21	c   mutation         :       0.00          0          0
0.19/0.21	c   crossover        :       0.00          0          0
0.19/0.21	c   dins             :       0.00          0          0
0.19/0.21	c   undercover       :       0.00          0          0
0.19/0.21	c   nlp              :       0.00          0          0
0.19/0.21	c   trysol           :       0.00          0          0
0.19/0.21	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.19/0.21	c   primal LP        :       0.00          0          0       0.00          -
0.19/0.21	c   dual LP          :       0.00          0          0       0.00          -
0.19/0.21	c   lex dual LP      :       0.00          0          0       0.00          -
0.19/0.21	c   barrier LP       :       0.00          0          0       0.00          -
0.19/0.21	c   diving/probing LP:       0.00          0          0       0.00          -
0.19/0.21	c   strong branching :       0.00          0          0       0.00          -
0.19/0.21	c     (at root node) :          -          0          0       0.00          -
0.19/0.21	c   conflict analysis:       0.00          0          0       0.00          -
0.19/0.21	c B&B Tree           :
0.19/0.21	c   number of runs   :          1
0.19/0.21	c   nodes            :       1488
0.19/0.21	c   nodes (total)    :       1488
0.19/0.21	c   nodes left       :          0
0.19/0.21	c   max depth        :        141
0.19/0.21	c   max depth (total):        141
0.19/0.21	c   backtracks       :         12 (0.8%)
0.19/0.21	c   delayed cutoffs  :          9
0.19/0.21	c   repropagations   :         63 (228 domain reductions, 9 cutoffs)
0.19/0.21	c   avg switch length:       2.07
0.19/0.21	c   switching time   :       0.01
0.19/0.21	c Solution           :
0.19/0.21	c   Solutions found  :          1 (1 improvements)
0.19/0.21	c   First Solution   : +0.00000000000000e+00   (in run 1, after 1488 nodes, 0.17 seconds, depth 141, found by <relaxation>)
0.19/0.21	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 1488 nodes, 0.17 seconds, depth 141, found by <relaxation>)
0.19/0.21	c   Dual Bound       : +0.00000000000000e+00
0.19/0.21	c   Gap              :       0.00 %
0.19/0.21	c   Root Dual Bound  : +0.00000000000000e+00
0.19/0.21	c   Root Iterations  :          0
0.19/0.22	c Time complete: 0.21.

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

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


[startup+0 s]
/proc/loadavg: 0.93 0.98 0.99 3/106 11996
/proc/meminfo: memFree=1840732/2059040 swapFree=4136244/4192956
[pid=11996] ppid=11994 vsize=6584 CPUtime=0
/proc/11996/stat : 11996 (pbscip.linux.x8) R 11994 11996 10523 0 -1 4202496 997 0 0 0 0 0 0 0 20 0 1 0 8610110 6742016 919 1992294400 4194304 7136930 140736901195232 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/11996/statm: 1646 929 254 719 0 925 0

[startup+0.0302189 s]
/proc/loadavg: 0.93 0.98 0.99 3/106 11996
/proc/meminfo: memFree=1840732/2059040 swapFree=4136244/4192956
[pid=11996] ppid=11994 vsize=11764 CPUtime=0.02
/proc/11996/stat : 11996 (pbscip.linux.x8) R 11994 11996 10523 0 -1 4202496 2849 0 0 0 2 0 0 0 20 0 1 0 8610110 12046336 2161 1992294400 4194304 7136930 140736901195232 18446744073709551615 4333578 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11996/statm: 2941 2161 344 719 0 2220 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 11764

[startup+0.101227 s]
/proc/loadavg: 0.93 0.98 0.99 3/106 11996
/proc/meminfo: memFree=1840732/2059040 swapFree=4136244/4192956
[pid=11996] ppid=11994 vsize=12068 CPUtime=0.09
/proc/11996/stat : 11996 (pbscip.linux.x8) R 11994 11996 10523 0 -1 4202496 3992 0 0 0 8 1 0 0 20 0 1 0 8610110 12357632 2276 1992294400 4194304 7136930 140736901195232 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11996/statm: 3017 2276 379 719 0 2296 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 12068

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

[startup+0.201237 s]
/proc/loadavg: 0.93 0.98 0.99 3/106 11996
/proc/meminfo: memFree=1840732/2059040 swapFree=4136244/4192956
[pid=11996] ppid=11994 vsize=12572 CPUtime=0.19
/proc/11996/stat : 11996 (pbscip.linux.x8) R 11994 11996 10523 0 -1 4202496 4114 0 0 0 17 2 0 0 20 0 1 0 8610110 12873728 2398 1992294400 4194304 7136930 140736901195232 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/11996/statm: 3143 2398 379 719 0 2422 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 12572

Child status: 0
Real time (s): 0.223983
CPU time (s): 0.223965
CPU user time (s): 0.197969
CPU system time (s): 0.025996
CPU usage (%): 99.992
Max. virtual memory (cumulated for all children) (KiB): 12572

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

runsolver used 0.003999 second user time and 0.012998 second system time

The end

Launcher Data 

Begin job on node002 at 2010-06-12 10:07:41
IDJOB=2664539
IDBENCH=1445
IDSOLVER=1167
FILE ID=node002/2664539-1276330061
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-fpga13_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-2664539-1276330061/watcher-2664539-1276330061 -o /tmp/evaluation-result-2664539-1276330061/solver-2664539-1276330061 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664539-1276330061.opb -t 1800 -m 1800

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

MD5SUM BENCH= bf7e21954a6ae09c036e6d4bdde8af91
RANDOM SEED=460292533

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:       1841136 kB
Buffers:         13624 kB
Cached:         119916 kB
SwapCached:      17024 kB
Active:         109824 kB
Inactive:        43580 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1841136 kB
SwapTotal:     4192956 kB
SwapFree:      4136244 kB
Dirty:            3520 kB
Writeback:           0 kB
AnonPages:       10788 kB
Mapped:           9196 kB
Slab:            42720 kB
PageTables:       4024 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180920 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 10:07:42