Trace number 3730376

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
PB10: SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverUNSAT 0.042992 0.044049

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/
aloul/FPGA_SAT05/normalized-chnl30_31_pb.cnf.cr.opb
MD5SUM4d7adbd65e64509ef53d6e98bf824cab
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.031994
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables1860
Total number of constraints122
Number of constraints which are clauses62
Number of constraints which are cardinality constraints (but not clauses)60
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint30
Maximum length of a constraint31
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 32
Number of bits of the biggest sum of numbers6
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.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-3730376-1338682034.opb>
0.00/0.01	c original problem has 1860 variables (1860 bin, 0 int, 0 impl, 0 cont) and 122 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 presolving:
0.00/0.02	c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 62 upgd conss, 0 impls, 60 clqs
0.00/0.02	c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 122 upgd conss, 0 impls, 60 clqs
0.00/0.02	c presolving (3 rounds):
0.00/0.02	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02	c  0 implications, 60 cliques
0.00/0.02	c presolved problem has 1860 variables (1860 bin, 0 int, 0 impl, 0 cont) and 122 constraints
0.00/0.02	c      60 constraints of type <setppc>
0.00/0.02	c      62 constraints of type <logicor>
0.00/0.02	c transformed objective value is always integral (scale: 1)
0.00/0.02	c Presolving Time: 0.01
0.00/0.02	c - non default parameters ----------------------------------------------------------------------
0.00/0.02	c # SCIP version 1.2.1.3
0.00/0.02	c 
0.00/0.02	c # frequency for displaying node information lines
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02	c display/freq = 10000
0.00/0.02	c 
0.00/0.02	c # maximal time in seconds to run
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02	c limits/time = 1790
0.00/0.02	c 
0.00/0.02	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02	c limits/memory = 13950
0.00/0.02	c 
0.00/0.02	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c limits/solutions = 1
0.00/0.02	c 
0.00/0.02	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02	c separating/maxrounds = 1
0.00/0.02	c 
0.00/0.02	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c separating/maxroundsroot = 5
0.00/0.02	c 
0.00/0.02	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02	c # [type: int, range: [1,2], default: 1]
0.00/0.02	c timing/clocktype = 2
0.00/0.02	c 
0.00/0.02	c # should presolving try to simplify inequalities
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/linear/simplifyinequalities = TRUE
0.00/0.02	c 
0.00/0.02	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/indicator/addCouplingCons = TRUE
0.00/0.02	c 
0.00/0.02	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02	c constraints/knapsack/disaggregation = FALSE
0.00/0.02	c 
0.00/0.02	c # should presolving try to simplify knapsacks
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02	c 
0.00/0.02	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c presolving/probing/maxrounds = 0
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/coefdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02	c heuristics/crossover/freq = -1
0.00/0.02	c 
0.00/0.02	c # number of nodes added to the contingent of the total nodes
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02	c heuristics/crossover/nodesofs = 750
0.00/0.02	c 
0.00/0.02	c # number of nodes without incumbent change that heuristic should wait
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02	c heuristics/crossover/nwaitingnodes = 100
0.00/0.02	c 
0.00/0.02	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02	c # [type: real, range: [0,1], default: 0.1]
0.00/0.02	c heuristics/crossover/nodesquot = 0.15
0.00/0.02	c 
0.00/0.02	c # minimum percentage of integer variables that have to be fixed 
0.00/0.02	c # [type: real, range: [0,1], default: 0.666]
0.00/0.02	c heuristics/crossover/minfixingrate = 0.5
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/feaspump/freq = -1
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/fracdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/guideddiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/intshifting/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/linesearchdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/nlp/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/objpscostdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02	c # [type: real, range: [0,1], default: 0.01]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/oneopt/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/pscostdiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/rens/freq = -1
0.00/0.02	c 
0.00/0.02	c # minimum percentage of integer variables that have to be fixable 
0.00/0.02	c # [type: real, range: [0,1], default: 0.5]
0.00/0.02	c heuristics/rens/minfixingrate = 0.3
0.00/0.02	c 
0.00/0.02	c # number of nodes added to the contingent of the total nodes
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02	c heuristics/rens/nodesofs = 2000
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/rootsoldiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/rounding/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/shifting/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/simplerounding/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/trivial/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/trysol/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/veclendiving/freq = -1
0.00/0.02	c 
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.02	c 
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02	c 
0.00/0.02	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/zirounding/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/cmir/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/flowcover/freq = -1
0.00/0.02	c 
0.00/0.02	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c separating/rapidlearning/freq = 0
0.00/0.02	c 
0.00/0.02	c -----------------------------------------------------------------------------------------------
0.00/0.02	c start solving
0.00/0.02	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 |     0 |   774 |     - |4058k|   0 |   - |1860 | 122 |1860 | 122 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.02/0.03	c   0.0s|     1 |     0 |   774 |     - |4058k|   0 |   - |1860 | 122 |1860 | 122 |   0 |   0 |   0 |      --      |      --      |   0.00%
0.02/0.03	c 
0.02/0.03	c SCIP Status        : problem is solved [infeasible]
0.02/0.03	c Solving Time (sec) : 0.02
0.02/0.03	c Solving Nodes      : 1
0.02/0.03	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.02/0.03	c Dual Bound         : +1.00000000000000e+20
0.02/0.03	c Gap                : 0.00 %
0.02/0.03	s UNSATISFIABLE
0.02/0.03	c SCIP Status        : problem is solved [infeasible]
0.02/0.03	c Solving Time       :       0.02
0.02/0.03	c Original Problem   :
0.02/0.03	c   Problem name     : HOME/instance-3730376-1338682034.opb
0.02/0.03	c   Variables        : 1860 (1860 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.03	c   Constraints      : 122 initial, 122 maximal
0.02/0.03	c Presolved Problem  :
0.02/0.03	c   Problem name     : t_HOME/instance-3730376-1338682034.opb
0.02/0.03	c   Variables        : 1860 (1860 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.03	c   Constraints      : 122 initial, 122 maximal
0.02/0.03	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.02/0.03	c   trivial          :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   implics          :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   setppc           :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   logicor          :       0.00          0          0          0          0          0          0          0          0
0.02/0.03	c   root node        :          -          0          -          -          0          -          -          -          -
0.02/0.03	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.02/0.03	c   integral         :          0          0          0          0          0          0          0          0          0          0
0.02/0.03	c   setppc           :         60          0          1          0          0          0          0          0          0          0
0.02/0.03	c   logicor          :         62          0          1          0          0          0          0          0          0          0
0.02/0.03	c   countsols        :          0          0          0          0          0          0          0          0          0          0
0.02/0.03	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.02/0.03	c   integral         :       0.00       0.00       0.00       0.00       0.00
0.02/0.03	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.02/0.03	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.02/0.03	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.02/0.03	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.02/0.03	c   vbounds          :       0.00          1          0          0
0.02/0.03	c   rootredcost      :       0.00          0          0          0
0.02/0.03	c   pseudoobj        :       0.00          0          0          0
0.02/0.03	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.02/0.03	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.02/0.03	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.02/0.03	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.02/0.03	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.02/0.03	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.02/0.03	c   applied globally :          -          -          -          0        0.0          -          -          -
0.02/0.03	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.02/0.03	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.02/0.03	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.02/0.03	c   redcost          :       0.00          0          0          0          0          0
0.02/0.03	c   impliedbounds    :       0.00          0          0          0          0          0
0.02/0.03	c   intobj           :       0.00          0          0          0          0          0
0.02/0.03	c   cgmip            :       0.00          0          0          0          0          0
0.02/0.03	c   gomory           :       0.00          0          0          0          0          0
0.02/0.03	c   strongcg         :       0.00          0          0          0          0          0
0.02/0.03	c   cmir             :       0.00          0          0          0          0          0
0.02/0.03	c   flowcover        :       0.00          0          0          0          0          0
0.02/0.03	c   clique           :       0.00          0          0          0          0          0
0.02/0.03	c   zerohalf         :       0.00          0          0          0          0          0
0.02/0.03	c   mcf              :       0.00          0          0          0          0          0
0.02/0.03	c   rapidlearning    :       0.00          0          0          0          0          0
0.02/0.03	c Pricers            :       Time      Calls       Vars
0.02/0.03	c   problem variables:       0.00          0          0
0.02/0.03	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.02/0.03	c   pscost           :       0.00          0          0          0          0          0          0
0.02/0.03	c   inference        :       0.00          0          0          0          0          0          0
0.02/0.03	c   mostinf          :       0.00          0          0          0          0          0          0
0.02/0.03	c   leastinf         :       0.00          0          0          0          0          0          0
0.02/0.03	c   fullstrong       :       0.00          0          0          0          0          0          0
0.02/0.03	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.02/0.03	c   random           :       0.00          0          0          0          0          0          0
0.02/0.03	c   relpscost        :       0.00          0          0          0          0          0          0
0.02/0.03	c Primal Heuristics  :       Time      Calls      Found
0.02/0.03	c   LP solutions     :       0.00          -          0
0.02/0.03	c   pseudo solutions :       0.00          -          0
0.02/0.03	c   trivial          :       0.00          1          0
0.02/0.03	c   simplerounding   :       0.00          0          0
0.02/0.03	c   zirounding       :       0.00          0          0
0.02/0.03	c   rounding         :       0.00          0          0
0.02/0.03	c   shifting         :       0.00          0          0
0.02/0.03	c   intshifting      :       0.00          0          0
0.02/0.03	c   oneopt           :       0.00          0          0
0.02/0.03	c   twoopt           :       0.00          0          0
0.02/0.03	c   fixandinfer      :       0.00          0          0
0.02/0.03	c   feaspump         :       0.00          0          0
0.02/0.03	c   coefdiving       :       0.00          0          0
0.02/0.03	c   pscostdiving     :       0.00          0          0
0.02/0.03	c   fracdiving       :       0.00          0          0
0.02/0.03	c   veclendiving     :       0.00          0          0
0.02/0.03	c   intdiving        :       0.00          0          0
0.02/0.03	c   actconsdiving    :       0.00          0          0
0.02/0.03	c   objpscostdiving  :       0.00          0          0
0.02/0.03	c   rootsoldiving    :       0.00          0          0
0.02/0.03	c   linesearchdiving :       0.00          0          0
0.02/0.03	c   guideddiving     :       0.00          0          0
0.02/0.03	c   octane           :       0.00          0          0
0.02/0.03	c   rens             :       0.00          0          0
0.02/0.03	c   rins             :       0.00          0          0
0.02/0.03	c   localbranching   :       0.00          0          0
0.02/0.03	c   mutation         :       0.00          0          0
0.02/0.03	c   crossover        :       0.00          0          0
0.02/0.03	c   dins             :       0.00          0          0
0.02/0.03	c   undercover       :       0.00          0          0
0.02/0.03	c   nlp              :       0.00          0          0
0.02/0.03	c   trysol           :       0.00          0          0
0.02/0.03	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.02/0.03	c   primal LP        :       0.00          0          0       0.00          -
0.02/0.03	c   dual LP          :       0.01          1        774     774.00          -
0.02/0.03	c   lex dual LP      :       0.00          0          0       0.00          -
0.02/0.03	c   barrier LP       :       0.00          0          0       0.00          -
0.02/0.03	c   diving/probing LP:       0.00          0          0       0.00          -
0.02/0.03	c   strong branching :       0.00          0          0       0.00          -
0.02/0.03	c     (at root node) :          -          0          0       0.00          -
0.02/0.03	c   conflict analysis:       0.00          0          0       0.00          -
0.02/0.03	c B&B Tree           :
0.02/0.03	c   number of runs   :          1
0.02/0.03	c   nodes            :          1
0.02/0.03	c   nodes (total)    :          1
0.02/0.03	c   nodes left       :          0
0.02/0.03	c   max depth        :          0
0.02/0.03	c   max depth (total):          0
0.02/0.03	c   backtracks       :          0 (0.0%)
0.02/0.03	c   delayed cutoffs  :          0
0.02/0.03	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.02/0.03	c   avg switch length:       2.00
0.02/0.03	c   switching time   :       0.00
0.02/0.03	c Solution           :
0.02/0.03	c   Solutions found  :          0 (0 improvements)
0.02/0.03	c   Primal Bound     : infeasible
0.02/0.03	c   Dual Bound       :          -
0.02/0.03	c   Gap              :       0.00 %
0.02/0.03	c   Root Dual Bound  :          -
0.02/0.03	c   Root Iterations  :        774
0.02/0.04	c Time complete: 0.03.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 989)

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3730376-1338682034/watcher-3730376-1338682034 -o /tmp/evaluation-result-3730376-1338682034/solver-3730376-1338682034 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3730376-1338682034.opb -t 1800 -m 15500 

running on 4 cores: 0,2,4,6

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): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 2.01 2.00 1.91 3/176 22006
/proc/meminfo: memFree=26245368/32873844 swapFree=7628/7628
[pid=22006] ppid=22004 vsize=9972 CPUtime=0 cores=0,2,4,6
/proc/22006/stat : 22006 (pbscip.linux.x8) R 22004 22006 20882 0 -1 4202496 1554 0 0 0 0 0 0 0 20 0 1 0 334331993 10211328 1500 33554432000 4194304 8395647 140734824820704 140737132235624 7382157 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22006/statm: 2493 1500 374 1026 0 1463 0

[startup+0.0314429 s]
/proc/loadavg: 2.01 2.00 1.91 3/176 22006
/proc/meminfo: memFree=26245368/32873844 swapFree=7628/7628
[pid=22006] ppid=22004 vsize=19872 CPUtime=0.02 cores=0,2,4,6
/proc/22006/stat : 22006 (pbscip.linux.x8) R 22004 22006 20882 0 -1 4202496 4439 0 0 0 2 0 0 0 20 0 1 0 334331993 20348928 4031 33554432000 4194304 8395647 140734824820704 140737132235624 7428202 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/22006/statm: 4968 4031 550 1026 0 3938 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 19872

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

[startup+0.0314429 s]
/proc/loadavg: 2.01 2.00 1.91 3/176 22006
/proc/meminfo: memFree=26245368/32873844 swapFree=7628/7628
[pid=22006] ppid=22004 vsize=19872 CPUtime=0.02 cores=0,2,4,6
/proc/22006/stat : 22006 (pbscip.linux.x8) R 22004 22006 20882 0 -1 4202496 4439 0 0 0 2 0 0 0 20 0 1 0 334331993 20348928 4031 33554432000 4194304 8395647 140734824820704 140737132235624 7428202 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/22006/statm: 4968 4031 550 1026 0 3938 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 19872

Child status: 0
Real time (s): 0.044049
CPU time (s): 0.042992
CPU user time (s): 0.035994
CPU system time (s): 0.006998
CPU usage (%): 97.6004
Max. virtual memory (cumulated for all children) (KiB): 19872

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.035994
system time used= 0.006998
maximum resident set size= 16180
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4461
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.000999 second user time and 0.006998 second system time

The end

Launcher Data 

Begin job on node107 at 2012-06-03 02:07:14
IDJOB=3730376
IDBENCH=1417
IDSOLVER=2326
FILE ID=node107/3730376-1338682034
RUNJOBID= node107-1338678628-20901
PBS_JOBID= 14636706
Free space on /tmp= 70764 MiB

SOLVER NAME= PB10: SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-chnl30_31_pb.cnf.cr.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3730376-1338682034/watcher-3730376-1338682034 -o /tmp/evaluation-result-3730376-1338682034/solver-3730376-1338682034 -C 1800 -W 1900 -M 15500  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3730376-1338682034.opb -t 1800 -m 15500

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= 4d7adbd65e64509ef53d6e98bf824cab
RANDOM SEED=48059717

node107.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
initial apicid	: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5333.52
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
initial apicid	: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
initial apicid	: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
initial apicid	: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
initial apicid	: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
initial apicid	: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
initial apicid	: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.86
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.760
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
initial apicid	: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873844 kB
MemFree:        26245632 kB
Buffers:          468328 kB
Cached:          4432232 kB
SwapCached:           76 kB
Active:          2748832 kB
Inactive:        3000660 kB
Active(anon):     840584 kB
Inactive(anon):    11072 kB
Active(file):    1908248 kB
Inactive(file):  2989588 kB
Unevictable:        7628 kB
Mlocked:            7628 kB
SwapTotal:      67108856 kB
SwapFree:       67108780 kB
Dirty:             10648 kB
Writeback:             0 kB
AnonPages:        856104 kB
Mapped:            16628 kB
Shmem:               184 kB
Slab:             735660 kB
SReclaimable:     177280 kB
SUnreclaim:       558380 kB
KernelStack:        1480 kB
PageTables:         5716 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545776 kB
Committed_AS:    1004252 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346368 kB
VmallocChunk:   34341987984 kB
HardwareCorrupted:     0 kB
AnonHugePages:    319488 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7872 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 70752 MiB
End job on node107 at 2012-06-03 02:07:15