Trace number 2664531

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.139978 0.139667

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/
FPGA_SAT05/normalized-fpga12_11_sat_pb.cnf.cr.opb
MD5SUM05acc78c42ec3368f84785abcf0f7ebb
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.008998
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables198
Total number of constraints166
Number of constraints which are clauses143
Number of constraints which are cardinality constraints (but not clauses)23
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: 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-2664531-1276328893.opb>
0.00/0.01	c original problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 166 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.02	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 166 upgd conss, 0 impls, 23 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, 23 cliques
0.00/0.03	c presolved problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 166 constraints
0.00/0.03	c      23 constraints of type <setppc>
0.00/0.03	c     143 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.00
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.03	c separating/flowcover/freq = -1
0.00/0.03	c 
0.00/0.03	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/rapidlearning/freq = 0
0.00/0.03	c 
0.00/0.03	c -----------------------------------------------------------------------------------------------
0.00/0.03	c start solving
0.00/0.03	c 
0.00/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.00/0.03	c   0.0s|     1 |     2 |     0 |     - | 644k|   0 |   - | 198 | 166 |   0 |   0 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.13	c * 0.1s|   957 |     0 |     0 |   0.0 | 782k| 109 |   - | 198 | 193 |   0 |   0 |   0 |  35 |   0 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.09/0.13	c 
0.09/0.13	c SCIP Status        : problem is solved [optimal solution found]
0.09/0.13	c Solving Time (sec) : 0.09
0.09/0.13	c Solving Nodes      : 957
0.09/0.13	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.09/0.13	c Dual Bound         : +0.00000000000000e+00
0.09/0.13	c Gap                : 0.00 %
0.09/0.13	s SATISFIABLE
0.09/0.13	v -x24 -x22 -x5 -x2 -x10 -x83 -x82 -x81 x48 -x46 -x39 -x18 -x3 -x11 -x36 -x31 x30 -x29 -x28 -x27 -x25 -x17 -x34 -x47 -x7 -x84 -x43 
0.09/0.13	v -x77 -x6 x23 x74 -x44 -x4 -x15 -x38 -x186 -x185 x184 -x183 -x182 -x181 -x80 -x132 -x131 x130 -x128 -x127 -x126 -x124 -x122 
0.09/0.13	v -x121 -x13 -x78 -x35 -x21 -x12 -x1 -x59 -x58 -x56 -x55 -x54 -x53 -x52 -x51 x49 -x19 -x60 -x162 -x161 x160 -x159 -x158 -x42 -x40 
0.09/0.13	v -x50 -x125 -x20 -x14 x168 -x167 -x166 -x165 -x164 -x163 -x79 -x71 -x70 -x69 -x67 -x66 -x64 -x62 -x108 -x107 -x106 -x105 -x104 
0.09/0.13	v -x103 -x102 -x101 x99 -x97 -x75 -x96 -x95 -x94 -x93 -x92 -x91 -x90 x89 -x88 -x87 -x86 -x129 -x65 -x33 -x198 -x197 -x196 -x195 
0.09/0.13	v x194 -x193 -x72 x68 -x37 -x45 -x26 -x8 -x192 -x191 -x190 x189 -x188 -x187 x9 -x63 x157 -x156 -x155 -x154 -x153 -x41 -x180 
0.09/0.13	v -x179 -x178 -x177 -x176 x175 -x57 -x61 -x142 -x141 -x140 -x139 x138 -x98 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 
0.09/0.13	v -x111 -x110 -x147 x146 -x145 -x144 -x143 -x123 -x100 -x16 -x109 -x73 -x137 -x136 -x135 x134 -x133 -x85 -x174 x173 -x172 -x171 
0.09/0.13	v -x170 -x169 -x32 -x152 -x151 -x150 -x149 -x148 -x76 
0.09/0.13	c SCIP Status        : problem is solved [optimal solution found]
0.09/0.13	c Solving Time       :       0.09
0.09/0.13	c Original Problem   :
0.09/0.13	c   Problem name     : HOME/instance-2664531-1276328893.opb
0.09/0.13	c   Variables        : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13	c   Constraints      : 166 initial, 166 maximal
0.09/0.13	c Presolved Problem  :
0.09/0.13	c   Problem name     : t_HOME/instance-2664531-1276328893.opb
0.09/0.13	c   Variables        : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13	c   Constraints      : 166 initial, 193 maximal
0.09/0.13	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.09/0.13	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   setppc           :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.09/0.13	c   root node        :          -          0          -          -          0          -          -          -          -
0.09/0.13	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.09/0.13	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.09/0.13	c   setppc           :         23          0       1208          0        941         22        616          0          0          0
0.09/0.13	c   logicor          :        143+         0        530          0        942          2        367          0          0          0
0.09/0.13	c   countsols        :          0          0          0          0        942          0          0          0          0          0
0.09/0.13	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.09/0.13	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.09/0.13	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.09/0.13	c   logicor          :       0.03       0.00       0.00       0.00       0.03
0.09/0.13	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.09/0.13	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.09/0.13	c   vbounds          :       0.00          1          0          0
0.09/0.13	c   rootredcost      :       0.00          0          0          0
0.09/0.13	c   pseudoobj        :       0.00          0          0          0
0.09/0.13	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.09/0.13	c   propagation      :       0.00         24         24        117       42.1          0        0.0          -
0.09/0.13	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.13	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.13	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.13	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.09/0.13	c   applied globally :          -          -          -         27       21.0          -          -          -
0.09/0.13	c   applied locally  :          -          -          -          8       41.8          -          -          -
0.09/0.13	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.09/0.13	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.09/0.13	c   redcost          :       0.00          0          0          0          0          0
0.09/0.13	c   impliedbounds    :       0.00          0          0          0          0          0
0.09/0.13	c   intobj           :       0.00          0          0          0          0          0
0.09/0.13	c   cgmip            :       0.00          0          0          0          0          0
0.09/0.13	c   gomory           :       0.00          0          0          0          0          0
0.09/0.13	c   strongcg         :       0.00          0          0          0          0          0
0.09/0.13	c   cmir             :       0.00          0          0          0          0          0
0.09/0.13	c   flowcover        :       0.00          0          0          0          0          0
0.09/0.13	c   clique           :       0.00          0          0          0          0          0
0.09/0.13	c   zerohalf         :       0.00          0          0          0          0          0
0.09/0.13	c   mcf              :       0.00          0          0          0          0          0
0.09/0.13	c   rapidlearning    :       0.00          0          0          0          0          0
0.09/0.13	c Pricers            :       Time      Calls       Vars
0.09/0.13	c   problem variables:       0.00          0          0
0.09/0.13	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.09/0.13	c   relpscost        :       0.00          0          0          0          0          0          0
0.09/0.13	c   pscost           :       0.00          0          0          0          0          0          0
0.09/0.13	c   inference        :       0.03        941          0          0          0          0       1882
0.09/0.13	c   mostinf          :       0.00          0          0          0          0          0          0
0.09/0.13	c   leastinf         :       0.00          0          0          0          0          0          0
0.09/0.13	c   fullstrong       :       0.00          0          0          0          0          0          0
0.09/0.13	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.09/0.13	c   random           :       0.00          0          0          0          0          0          0
0.09/0.13	c Primal Heuristics  :       Time      Calls      Found
0.09/0.13	c   LP solutions     :       0.00          -          0
0.09/0.13	c   pseudo solutions :       0.00          -          1
0.09/0.13	c   trivial          :       0.00          1          0
0.09/0.13	c   simplerounding   :       0.00          0          0
0.09/0.13	c   zirounding       :       0.00          0          0
0.09/0.13	c   rounding         :       0.00          0          0
0.09/0.13	c   shifting         :       0.00          0          0
0.09/0.13	c   intshifting      :       0.00          0          0
0.09/0.13	c   oneopt           :       0.00          0          0
0.09/0.13	c   twoopt           :       0.00          0          0
0.09/0.13	c   fixandinfer      :       0.00          0          0
0.09/0.13	c   feaspump         :       0.00          0          0
0.09/0.13	c   coefdiving       :       0.00          0          0
0.09/0.13	c   pscostdiving     :       0.00          0          0
0.09/0.13	c   fracdiving       :       0.00          0          0
0.09/0.13	c   veclendiving     :       0.00          0          0
0.09/0.13	c   intdiving        :       0.00          0          0
0.09/0.13	c   actconsdiving    :       0.00          0          0
0.09/0.13	c   objpscostdiving  :       0.00          0          0
0.09/0.13	c   rootsoldiving    :       0.00          0          0
0.09/0.13	c   linesearchdiving :       0.00          0          0
0.09/0.13	c   guideddiving     :       0.00          0          0
0.09/0.13	c   octane           :       0.00          0          0
0.09/0.13	c   rens             :       0.00          0          0
0.09/0.13	c   rins             :       0.00          0          0
0.09/0.13	c   localbranching   :       0.00          0          0
0.09/0.13	c   mutation         :       0.00          0          0
0.09/0.13	c   crossover        :       0.00          0          0
0.09/0.13	c   dins             :       0.00          0          0
0.09/0.13	c   undercover       :       0.00          0          0
0.09/0.13	c   nlp              :       0.00          0          0
0.09/0.13	c   trysol           :       0.00          0          0
0.09/0.13	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.09/0.13	c   primal LP        :       0.00          0          0       0.00          -
0.09/0.13	c   dual LP          :       0.00          0          0       0.00          -
0.09/0.13	c   lex dual LP      :       0.00          0          0       0.00          -
0.09/0.13	c   barrier LP       :       0.00          0          0       0.00          -
0.09/0.13	c   diving/probing LP:       0.00          0          0       0.00          -
0.09/0.13	c   strong branching :       0.00          0          0       0.00          -
0.09/0.13	c     (at root node) :          -          0          0       0.00          -
0.09/0.13	c   conflict analysis:       0.00          0          0       0.00          -
0.09/0.13	c B&B Tree           :
0.09/0.13	c   number of runs   :          1
0.09/0.13	c   nodes            :        957
0.09/0.13	c   nodes (total)    :        957
0.09/0.13	c   nodes left       :          0
0.09/0.13	c   max depth        :        109
0.09/0.13	c   max depth (total):        109
0.09/0.13	c   backtracks       :         10 (1.0%)
0.09/0.13	c   delayed cutoffs  :          9
0.09/0.13	c   repropagations   :         24 (129 domain reductions, 9 cutoffs)
0.09/0.13	c   avg switch length:       2.04
0.09/0.13	c   switching time   :       0.01
0.09/0.13	c Solution           :
0.09/0.13	c   Solutions found  :          1 (1 improvements)
0.09/0.13	c   First Solution   : +0.00000000000000e+00   (in run 1, after 957 nodes, 0.09 seconds, depth 109, found by <relaxation>)
0.09/0.13	c   Primal Bound     : +0.00000000000000e+00   (in run 1, after 957 nodes, 0.09 seconds, depth 109, found by <relaxation>)
0.09/0.13	c   Dual Bound       : +0.00000000000000e+00
0.09/0.13	c   Gap              :       0.00 %
0.09/0.13	c   Root Dual Bound  : +0.00000000000000e+00
0.09/0.13	c   Root Iterations  :          0
0.09/0.13	c Time complete: 0.13.

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-2664531-1276328893/watcher-2664531-1276328893 -o /tmp/evaluation-result-2664531-1276328893/solver-2664531-1276328893 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664531-1276328893.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.10 1.04 1.01 3/106 9979
/proc/meminfo: memFree=1851884/2059040 swapFree=4135896/4192956
[pid=9979] ppid=9977 vsize=6584 CPUtime=0
/proc/9979/stat : 9979 (pbscip.linux.x8) R 9977 9979 7191 0 -1 4202496 1006 0 0 0 0 0 0 0 17 0 1 0 6544741 6742016 928 1992294400 4194304 7136930 140735687174288 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/9979/statm: 1646 938 254 719 0 925 0

[startup+0.0101419 s]
/proc/loadavg: 1.10 1.04 1.01 3/106 9979
/proc/meminfo: memFree=1851884/2059040 swapFree=4135896/4192956
[pid=9979] ppid=9977 vsize=7612 CPUtime=0
/proc/9979/stat : 9979 (pbscip.linux.x8) R 9977 9979 7191 0 -1 4202496 1357 0 0 0 0 0 0 0 17 0 1 0 6544741 7794688 1279 1992294400 4194304 7136930 140735687174288 18446744073709551615 6346613 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/9979/statm: 1903 1289 254 719 0 1182 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 7612

[startup+0.101148 s]
/proc/loadavg: 1.10 1.04 1.01 3/106 9979
/proc/meminfo: memFree=1851884/2059040 swapFree=4135896/4192956
[pid=9979] ppid=9977 vsize=12052 CPUtime=0.09
/proc/9979/stat : 9979 (pbscip.linux.x8) R 9977 9979 7191 0 -1 4202496 3987 0 0 0 8 1 0 0 17 0 1 0 6544741 12341248 2271 1992294400 4194304 7136930 140735687174288 18446744073709551615 6354266 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/9979/statm: 3013 2271 379 719 0 2292 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 12052

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

Child status: 0
Real time (s): 0.139667
CPU time (s): 0.139978
CPU user time (s): 0.116982
CPU system time (s): 0.022996
CPU usage (%): 100.223
Max. virtual memory (cumulated for all children) (KiB): 12052

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.116982
system time used= 0.022996
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4039
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= 3
involuntary context switches= 1

runsolver used 0.005999 second user time and 0.008998 second system time

The end

Launcher Data 

Begin job on node026 at 2010-06-12 09:48:13
IDJOB=2664531
IDBENCH=1437
IDSOLVER=1167
FILE ID=node026/2664531-1276328893
PBS_JOBID= 11173158
Free space on /tmp= 62508 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-fpga12_11_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-2664531-1276328893/watcher-2664531-1276328893 -o /tmp/evaluation-result-2664531-1276328893/solver-2664531-1276328893 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.none -f HOME/instance-2664531-1276328893.opb -t 1800 -m 1800

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

MD5SUM BENCH= 05acc78c42ec3368f84785abcf0f7ebb
RANDOM SEED=610896292

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

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

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


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1852288 kB
Buffers:         14324 kB
Cached:         102916 kB
SwapCached:      23112 kB
Active:         101324 kB
Inactive:        41408 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1852288 kB
SwapTotal:     4192956 kB
SwapFree:      4135896 kB
Dirty:            3812 kB
Writeback:           0 kB
AnonPages:       10248 kB
Mapped:           8056 kB
Slab:            42260 kB
PageTables:       4060 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   180364 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62508 MiB
End job on node026 at 2010-06-12 09:48:14