Trace number 3452992

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
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4UNSAT 0.021996 0.0218639

General information on the benchmark

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

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.0 (svn: 977)

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-3452992-1307071509/watcher-3452992-1307071509 -o /tmp/evaluation-result-3452992-1307071509/solver-3452992-1307071509 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452992-1307071509.opb -t 1800 -m 15500 

running on 4 cores: 1,3,5,7

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.13 2.09 2.02 2/498 10685
/proc/meminfo: memFree=24504848/32950928 swapFree=34421304/67111528
[pid=10685] ppid=10683 vsize=16376 CPUtime=0 cores=1,3,5,7
/proc/10685/stat : 10685 (scip-2.0.1.4.li) R 10683 10685 8661 0 -1 4202496 2832 0 0 0 0 0 0 0 19 0 1 0 897381541 16769024 2785 33554432000 4194304 9128323 140734629003344 18446744073709551615 7980987 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10685/statm: 4094 2785 466 1205 0 2885 0

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

Child status: 0
Real time (s): 0.0218639
CPU time (s): 0.021996
CPU user time (s): 0.012998
CPU system time (s): 0.008998
CPU usage (%): 100.604
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.012998
system time used= 0.008998
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3893
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 2
involuntary context switches= 1

runsolver used 0.004999 second user time and 0.015997 second system time

The end

Launcher Data 

Begin job on node113 at 2011-06-03 05:25:09
IDJOB=3452992
IDBENCH=1389
IDSOLVER=1949
FILE ID=node113/3452992-1307071509
RUNJOBID= node113-1307065768-9213
PBS_JOBID= 13497875
Free space on /tmp= 73732 MiB

SOLVER NAME= SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB05/aloul/FPGA_SAT05/normalized-chnl15_20_pb.cnf.cr.opb
COMMAND LINE= HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3452992-1307071509/watcher-3452992-1307071509 -o /tmp/evaluation-result-3452992-1307071509/solver-3452992-1307071509 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452992-1307071509.opb -t 1800 -m 15500

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

MD5SUM BENCH= d9b1351aa6c01bb5c883e4233663f5e0
RANDOM SEED=1466734268

node113.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	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.846
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5333.69
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.846
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.76
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.846
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.846
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.846
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.846
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.846
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.83
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.846
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
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 rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32950928 kB
MemFree:      24505128 kB
Buffers:        202072 kB
Cached:         679504 kB
SwapCached:      13476 kB
Active:        7568600 kB
Inactive:       553792 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      24505128 kB
SwapTotal:    67111528 kB
SwapFree:     34421304 kB
Dirty:           33800 kB
Writeback:           0 kB
AnonPages:     7238624 kB
Mapped:          23804 kB
Slab:           132416 kB
PageTables:     121212 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS: 157065860 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296008 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 73720 MiB
End job on node113 at 2011-06-03 05:25:09