Trace number 3452842

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.4SAT 1.05284 1.05335

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111223696.opb
MD5SUM35d859ff8d89aabca90bcfc52829307f
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.312952
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables169
Total number of constraints101
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
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 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1220
Number of bits of the biggest sum of numbers11
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-3452842-1307067404.opb>
0.00/0.00	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 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, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01	c (round 2) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01	c presolving (3 rounds):
0.00/0.01	c  0 deleted vars, 28 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01	c  8 implications, 68 cliques
0.00/0.01	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01	c       1 constraints of type <knapsack>
0.00/0.01	c      72 constraints of type <setppc>
0.00/0.01	c transformed objective value is always integral (scale: 1)
0.00/0.01	c Presolving Time: 0.01
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 |   137 |     - | 762k|   0 |  44 | 169 |  73 | 169 |  73 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.04	c   0.0s|     1 |     0 |   175 |     - |1152k|   0 |  55 | 169 | 113 | 169 |  87 |  14 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.05	c   0.1s|     1 |     0 |   217 |     - |1285k|   0 |  58 | 169 | 113 | 169 |  98 |  25 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.06	c   0.1s|     1 |     0 |   227 |     - |1288k|   0 |  62 | 169 | 113 | 169 | 102 |  29 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.07	c   0.1s|     1 |     0 |   256 |     - |1300k|   0 |  63 | 169 | 113 | 169 | 104 |  31 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.00/0.08	c   0.1s|     1 |     0 |   267 |     - |1304k|   0 |  61 | 169 | 113 | 169 | 108 |  35 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.19/0.20	c   0.2s|     1 |     0 |   291 |     - |1301k|   0 |  60 | 169 | 110 | 169 | 108 |  35 |   0 |  13 | 0.000000e+00 |      --      |    Inf 
0.29/0.34	c   0.3s|     1 |     0 |   316 |     - |1289k|   0 |  62 | 169 |  99 | 169 | 108 |  35 |   0 |  27 | 0.000000e+00 |      --      |    Inf 
0.39/0.44	c   0.4s|     1 |     0 |   336 |     - |1289k|   0 |  62 | 169 |  99 | 169 | 108 |  35 |   0 |  38 | 0.000000e+00 |      --      |    Inf 
0.49/0.50	c   0.5s|     1 |     0 |   356 |     - |1289k|   0 |  61 | 169 |  99 | 169 | 108 |  35 |   0 |  44 | 0.000000e+00 |      --      |    Inf 
0.59/0.60	c   0.6s|     1 |     0 |   380 |     - |1289k|   0 |  59 | 169 |  99 | 169 | 108 |  35 |   0 |  54 | 0.000000e+00 |      --      |    Inf 
0.59/0.65	c   0.6s|     1 |     0 |   408 |     - |1285k|   0 |  55 | 169 |  96 | 169 | 102 |  35 |   0 |  60 | 0.000000e+00 |      --      |    Inf 
0.69/0.73	c   0.7s|     1 |     0 |   408 |     - |1285k|   0 |   - | 169 |  96 | 169 | 102 |  35 |   0 |  71 | 0.000000e+00 |      --      |    Inf 
0.69/0.73	c (run 1, node 1) restarting after 35 global fixings of integer variables
0.69/0.73	c 
0.69/0.73	c (restart) converted 29 cuts from the global cut pool into linear constraints
0.69/0.73	c 
0.69/0.73	c presolving:
0.69/0.73	c (round 1) 35 del vars, 3 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 16 impls, 83 clqs
0.69/0.73	c (round 2) 35 del vars, 3 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 50 upgd conss, 16 impls, 83 clqs
0.69/0.74	c (round 3) 35 del vars, 5 del conss, 0 add conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 50 upgd conss, 16 impls, 83 clqs
0.69/0.74	c presolving (4 rounds):
0.69/0.74	c  35 deleted vars, 5 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.69/0.74	c  16 implications, 83 cliques
0.69/0.74	c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 120 constraints
0.69/0.74	c      10 constraints of type <knapsack>
0.69/0.74	c      87 constraints of type <setppc>
0.69/0.74	c      23 constraints of type <logicor>
0.69/0.74	c transformed objective value is always integral (scale: 1)
0.69/0.74	c Presolving Time: 0.01
0.69/0.74	c 
0.69/0.74	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.69/0.74	c   0.7s|     1 |     0 |   507 |     - | 916k|   0 |  49 | 134 | 120 | 134 |  97 |   0 |   0 |  71 | 0.000000e+00 |      --      |    Inf 
0.69/0.75	c   0.8s|     1 |     0 |   534 |     - |1146k|   0 |  47 | 134 | 120 | 134 | 104 |   7 |   0 |  71 | 0.000000e+00 |      --      |    Inf 
0.78/0.81	c   0.8s|     1 |     0 |   548 |     - |1146k|   0 |  49 | 134 | 120 | 134 | 104 |   7 |   0 |  92 | 0.000000e+00 |      --      |    Inf 
0.78/0.83	c   0.8s|     1 |     0 |   621 |     - |1146k|   0 |  42 | 134 | 120 | 134 | 104 |   7 |   0 | 100 | 0.000000e+00 |      --      |    Inf 
0.78/0.86	c   0.9s|     1 |     0 |   641 |     - |1146k|   0 |  44 | 134 | 120 | 134 | 104 |   7 |   0 | 113 | 0.000000e+00 |      --      |    Inf 
0.78/0.87	c   0.9s|     1 |     0 |   655 |     - |1145k|   0 |  42 | 134 | 118 | 134 | 104 |   7 |   0 | 119 | 0.000000e+00 |      --      |    Inf 
0.78/0.88	c   0.9s|     1 |     0 |   660 |     - |1145k|   0 |  42 | 134 | 117 | 134 | 104 |   7 |   0 | 125 | 0.000000e+00 |      --      |    Inf 
0.78/0.89	c   0.9s|     1 |     0 |   660 |     - |1145k|   0 |   - | 134 | 117 | 134 | 104 |   7 |   0 | 130 | 0.000000e+00 |      --      |    Inf 
0.78/0.89	c (run 2, node 1) restarting after 30 global fixings of integer variables
0.78/0.89	c 
0.78/0.89	c (restart) converted 7 cuts from the global cut pool into linear constraints
0.78/0.89	c 
0.78/0.89	c presolving:
0.78/0.89	c (round 1) 32 del vars, 26 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 7 upgd conss, 28 impls, 77 clqs
0.78/0.89	c (round 2) 32 del vars, 27 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 7 upgd conss, 28 impls, 77 clqs
0.78/0.89	c presolving (3 rounds):
0.78/0.89	c  32 deleted vars, 27 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.78/0.89	c  28 implications, 77 cliques
0.78/0.89	c presolved problem has 102 variables (102 bin, 0 int, 0 impl, 0 cont) and 97 constraints
0.78/0.89	c      14 constraints of type <knapsack>
0.78/0.89	c      83 constraints of type <setppc>
0.78/0.89	c transformed objective value is always integral (scale: 1)
0.78/0.89	c Presolving Time: 0.02
0.78/0.90	c 
0.89/0.90	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.89/0.90	c   0.9s|     1 |     0 |   717 |     - | 905k|   0 |  39 | 102 |  97 | 102 |  97 |   0 |   0 | 130 | 0.000000e+00 |      --      |    Inf 
0.89/0.91	c   0.9s|     1 |     0 |   752 |     - |1189k|   0 |  52 | 102 |  97 | 102 | 110 |  13 |   0 | 130 | 0.000000e+00 |      --      |    Inf 
0.89/0.96	c   1.0s|     1 |     0 |   785 |     - |1186k|   0 |  42 | 102 |  90 | 102 | 110 |  13 |   0 | 138 | 0.000000e+00 |      --      |    Inf 
0.99/1.00	c   1.0s|     1 |     0 |   785 |     - |1186k|   0 |   - | 102 |  90 | 102 | 110 |  13 |   0 | 150 | 0.000000e+00 |      --      |    Inf 
0.99/1.00	c (run 3, node 1) restarting after 27 global fixings of integer variables
0.99/1.00	c 
0.99/1.00	c (restart) converted 13 cuts from the global cut pool into linear constraints
0.99/1.00	c 
0.99/1.00	c presolving:
0.99/1.01	c (round 1) 28 del vars, 3 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 upgd conss, 50 impls, 62 clqs
0.99/1.01	c (round 2) 28 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 13 upgd conss, 50 impls, 62 clqs
0.99/1.01	c (round 3) 28 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 13 upgd conss, 50 impls, 62 clqs
0.99/1.01	c presolving (4 rounds):
0.99/1.01	c  28 deleted vars, 8 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
0.99/1.01	c  50 implications, 62 cliques
0.99/1.01	c presolved problem has 74 variables (74 bin, 0 int, 0 impl, 0 cont) and 95 constraints
0.99/1.01	c      24 constraints of type <knapsack>
0.99/1.01	c      71 constraints of type <setppc>
0.99/1.01	c transformed objective value is always integral (scale: 1)
0.99/1.01	c Presolving Time: 0.03
0.99/1.01	c 
0.99/1.01	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.99/1.01	c   1.0s|     1 |     0 |   841 |     - | 925k|   0 |  32 |  74 |  95 |  74 |  95 |   0 |   0 | 150 | 0.000000e+00 |      --      |    Inf 
0.99/1.02	c   1.0s|     1 |     0 |   870 |     - |1180k|   0 |  42 |  74 |  95 |  74 | 107 |  12 |   0 | 150 | 0.000000e+00 |      --      |    Inf 
0.99/1.04	c   1.0s|     1 |     0 |   890 |     - |1170k|   0 |  24 |  74 |  70 |  74 | 107 |  12 |   0 | 156 | 0.000000e+00 |      --      |    Inf 
0.99/1.04	c   1.0s|     1 |     0 |   890 |     - |1170k|   0 |   - |  74 |  70 |  74 | 107 |  12 |   0 | 161 | 0.000000e+00 |      --      |    Inf 
0.99/1.04	c (run 4, node 1) restarting after 45 global fixings of integer variables
0.99/1.04	c 
0.99/1.04	c (restart) converted 12 cuts from the global cut pool into linear constraints
0.99/1.04	c 
0.99/1.04	c presolving:
0.99/1.04	c (round 1) 74 del vars, 45 del conss, 0 add conss, 2 chg bounds, 93 chg sides, 112 chg coeffs, 0 upgd conss, 56 impls, 0 clqs
0.99/1.04	c presolving (2 rounds):
0.99/1.04	c  74 deleted vars, 82 deleted constraints, 0 added constraints, 2 tightened bounds, 0 added holes, 93 changed sides, 112 changed coefficients
0.99/1.04	c  56 implications, 0 cliques
0.99/1.04	c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.99/1.04	c transformed objective value is always integral (scale: 1)
0.99/1.04	c Presolving Time: 0.03
0.99/1.04	c 
0.99/1.04	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.99/1.04	c * 1.0s|     1 |     0 |   890 |     - | 655k|   0 |   - |   0 |   0 |   0 |   0 |   0 |   0 | 161 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.99/1.04	c   1.0s|     1 |     0 |   890 |     - | 655k|   0 |   - |   0 |   0 |   0 |   0 |   0 |   0 | 161 | 0.000000e+00 | 0.000000e+00 |   0.00%
0.99/1.04	c 
0.99/1.04	c SCIP Status        : problem is solved [optimal solution found]
0.99/1.04	c Solving Time (sec) : 1.04
0.99/1.04	c Solving Nodes      : 1 (total of 5 nodes in 5 runs)
0.99/1.04	c Primal Bound       : +0.00000000000000e+00 (1 solutions)
0.99/1.04	c Dual Bound         : +0.00000000000000e+00
0.99/1.04	c Gap                : 0.00 %
0.99/1.04	s SATISFIABLE
0.99/1.04	v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 
0.99/1.04	v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 
0.99/1.04	v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 
0.99/1.04	v x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 x97 -x96 -x95 -x94 -x93 -x92 x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 
0.99/1.04	v -x81 -x80 -x79 -x78 -x77 x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 
0.99/1.04	v x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 x31 
0.99/1.04	v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 
0.99/1.04	v -x4 -x3 x2 -x1 
0.99/1.04	c SCIP Status        : problem is solved [optimal solution found]
0.99/1.04	c Total Time         :       1.04
0.99/1.04	c   solving          :       1.04
0.99/1.04	c   presolving       :       0.03 (included in solving)
0.99/1.04	c   reading          :       0.00 (included in solving)
0.99/1.04	c Original Problem   :
0.99/1.04	c   Problem name     : HOME/instance-3452842-1307067404.opb
0.99/1.04	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.04	c   Constraints      : 101 initial, 101 maximal
0.99/1.04	c Presolved Problem  :
0.99/1.04	c   Problem name     : t_HOME/instance-3452842-1307067404.opb
0.99/1.04	c   Variables        : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.04	c   Constraints      : 0 initial, 0 maximal
0.99/1.04	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.99/1.04	c   trivial          :       0.00        137          0          0          0          0          0          0          0          0
0.99/1.04	c   dualfix          :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.04	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.04	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.04	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.04	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.04	c   knapsack         :       0.02          0          0          0          0          0         24          0         93        114
0.99/1.04	c   setppc           :       0.00         25          5          0          0          0         62          0          0          0
0.99/1.04	c   linear           :       0.00          2          0          0          2          0         42          0          2          0
0.99/1.04	c   logicor          :       0.00          0          0          0          0          0         22          0          0          0
0.99/1.04	c   root node        :          -        137          -          -        137          -          -          -          -          -
0.99/1.04	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.99/1.04	c   integral         :          0          0          0         17          0          7          0          0         85          0          0          0
0.99/1.04	c   countsols        :          0          0          0          0          0          3          0          0          0          0          0          0
0.99/1.04	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.99/1.04	c   integral         :       0.88       0.00       0.00       0.88       0.00       0.00       0.00
0.99/1.04	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.99/1.04	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.99/1.04	c   vbounds          :          0          0          0          0
0.99/1.04	c   rootredcost      :          0          0          0          0
0.99/1.04	c   pseudoobj        :          0          0          0          0
0.99/1.04	c Propagator Timings :  TotalTime  Propagate    Resprop
0.99/1.04	c   vbounds          :       0.00       0.00       0.00
0.99/1.04	c   rootredcost      :       0.00       0.00       0.00
0.99/1.04	c   pseudoobj        :       0.00       0.00       0.00
0.99/1.04	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.99/1.04	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.99/1.04	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.99/1.04	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.99/1.04	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.99/1.04	c   pseudo solution  :       0.00          1          0          0        0.0          0        0.0          -
0.99/1.04	c   applied globally :          -          -          -          0        0.0          -          -          -
0.99/1.04	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.99/1.04	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.99/1.04	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.99/1.04	c   redcost          :       0.00          8          0          0          0          0
0.99/1.04	c   impliedbounds    :       0.00          8          0          0          0          0
0.99/1.04	c   intobj           :       0.00          0          0          0          0          0
0.99/1.04	c   gomory           :       0.03          8          0          0        147          0
0.99/1.04	c   cgmip            :       0.00          0          0          0          0          0
0.99/1.04	c   closecuts        :       0.00          0          0          0          0          0
0.99/1.04	c   strongcg         :       0.03          8          0          0        314          0
0.99/1.04	c   cmir             :       0.00          0          0          0          0          0
0.99/1.04	c   flowcover        :       0.00          0          0          0          0          0
0.99/1.04	c   clique           :       0.00          8          0          0         34          0
0.99/1.04	c   zerohalf         :       0.00          0          0          0          0          0
0.99/1.04	c   mcf              :       0.00          4          0          0          0          0
0.99/1.04	c   oddcycle         :       0.00          0          0          0          0          0
0.99/1.04	c   rapidlearning    :       0.02          1          0          0          0         40
0.99/1.04	c Pricers            :       Time      Calls       Vars
0.99/1.04	c   problem variables:       0.00          0          0
0.99/1.04	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.99/1.04	c   relpscost        :       0.88         17          0         85          0          0          0
0.99/1.04	c   pscost           :       0.00          0          0          0          0          0          0
0.99/1.04	c   inference        :       0.00          0          0          0          0          0          0
0.99/1.04	c   mostinf          :       0.00          0          0          0          0          0          0
0.99/1.04	c   leastinf         :       0.00          0          0          0          0          0          0
0.99/1.04	c   fullstrong       :       0.00          0          0          0          0          0          0
0.99/1.04	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.99/1.04	c   random           :       0.00          0          0          0          0          0          0
0.99/1.04	c Primal Heuristics  :       Time      Calls      Found
0.99/1.04	c   LP solutions     :       0.00          -          0
0.99/1.04	c   pseudo solutions :       0.00          -          0
0.99/1.04	c   trivial          :       0.00          1          0
0.99/1.04	c   shiftandpropagate:       0.00          0          0
0.99/1.04	c   simplerounding   :       0.00          0          0
0.99/1.04	c   zirounding       :       0.00          0          0
0.99/1.04	c   rounding         :       0.00          0          0
0.99/1.04	c   shifting         :       0.00          0          0
0.99/1.04	c   intshifting      :       0.00          0          0
0.99/1.04	c   oneopt           :       0.00          0          0
0.99/1.04	c   twoopt           :       0.00          0          0
0.99/1.04	c   fixandinfer      :       0.00          0          0
0.99/1.04	c   feaspump         :       0.00          0          0
0.99/1.04	c   clique           :       0.00          0          0
0.99/1.04	c   coefdiving       :       0.00          0          0
0.99/1.04	c   pscostdiving     :       0.00          0          0
0.99/1.04	c   fracdiving       :       0.00          0          0
0.99/1.04	c   veclendiving     :       0.00          0          0
0.99/1.04	c   intdiving        :       0.00          0          0
0.99/1.04	c   actconsdiving    :       0.00          0          0
0.99/1.04	c   objpscostdiving  :       0.00          0          0
0.99/1.04	c   rootsoldiving    :       0.00          0          0
0.99/1.04	c   linesearchdiving :       0.00          0          0
0.99/1.04	c   guideddiving     :       0.00          0          0
0.99/1.04	c   octane           :       0.00          0          0
0.99/1.04	c   rens             :       0.00          0          0
0.99/1.04	c   rins             :       0.00          0          0
0.99/1.04	c   localbranching   :       0.00          0          0
0.99/1.04	c   mutation         :       0.00          0          0
0.99/1.04	c   crossover        :       0.00          0          0
0.99/1.04	c   dins             :       0.00          0          0
0.99/1.04	c   vbounds          :       0.00          0          0
0.99/1.04	c   undercover       :       0.00          0          0
0.99/1.04	c   subnlp           :       0.00          0          0
0.99/1.04	c   trysol           :       0.00          0          0
0.99/1.04	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.99/1.04	c   primal LP        :       0.00          0          0       0.00          -
0.99/1.04	c   dual LP          :       0.03         25        890      35.60   32314.28
0.99/1.04	c   lex dual LP      :       0.00          0          0       0.00          -
0.99/1.04	c   barrier LP       :       0.00          0          0       0.00          -
0.99/1.04	c   diving/probing LP:       0.00          0          0       0.00          -
0.99/1.04	c   strong branching :       0.88        161      26261     163.11   29832.21
0.99/1.04	c     (at root node) :          -        161      26261     163.11          -
0.99/1.04	c   conflict analysis:       0.00          0          0       0.00          -
0.99/1.04	c B&B Tree           :
0.99/1.04	c   number of runs   :          5
0.99/1.04	c   nodes            :          1
0.99/1.04	c   nodes (total)    :          5
0.99/1.04	c   nodes left       :          0
0.99/1.04	c   max depth        :          0
0.99/1.04	c   max depth (total):          0
0.99/1.04	c   backtracks       :          0 (0.0%)
0.99/1.04	c   delayed cutoffs  :          0
0.99/1.04	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.99/1.04	c   avg switch length:       2.00
0.99/1.04	c   switching time   :       0.00
0.99/1.04	c Solution           :
0.99/1.04	c   Solutions found  :          1 (1 improvements)
0.99/1.04	c   First Solution   : +0.00000000000000e+00   (in run 5, after 1 nodes, 1.04 seconds, depth 0, found by <relaxation>)
0.99/1.04	c   Primal Bound     : +0.00000000000000e+00   (in run 5, after 1 nodes, 1.04 seconds, depth 0, found by <relaxation>)
0.99/1.04	c   Dual Bound       : +0.00000000000000e+00
0.99/1.04	c   Gap              :       0.00 %
0.99/1.04	c   Root Dual Bound  : +0.00000000000000e+00
0.99/1.04	c   Root Iterations  :        890
0.99/1.05	c Time complete: 1.04.

Verifier Data 

OK	0

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-3452842-1307067404/watcher-3452842-1307067404 -o /tmp/evaluation-result-3452842-1307067404/solver-3452842-1307067404 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452842-1307067404.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: 1.43 1.11 1.03 2/515 4083
/proc/meminfo: memFree=23239364/32950928 swapFree=58671692/67111528
[pid=4083] ppid=4081 vsize=15440 CPUtime=0 cores=0,2,4,6
/proc/4083/stat : 4083 (scip-2.0.1.4.li) R 4081 4083 1417 0 -1 4202496 2605 0 0 0 0 0 0 0 25 0 1 0 896971105 15810560 2558 33554432000 4194304 9128323 140734290696848 18446744073709551615 7980987 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/4083/statm: 3860 2565 471 1205 0 2651 0

[startup+0.103485 s]
/proc/loadavg: 1.43 1.11 1.03 2/515 4083
/proc/meminfo: memFree=23239364/32950928 swapFree=58671692/67111528
[pid=4083] ppid=4081 vsize=27672 CPUtime=0.09 cores=0,2,4,6
/proc/4083/stat : 4083 (scip-2.0.1.4.li) R 4081 4083 1417 0 -1 4202496 6248 0 0 0 9 0 0 0 25 0 1 0 896971105 28336128 5591 33554432000 4194304 9128323 140734290696848 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/4083/statm: 6918 5591 713 1205 0 5709 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 27672

[startup+0.20047 s]
/proc/loadavg: 1.43 1.11 1.03 2/515 4083
/proc/meminfo: memFree=23239364/32950928 swapFree=58671692/67111528
[pid=4083] ppid=4081 vsize=27672 CPUtime=0.19 cores=0,2,4,6
/proc/4083/stat : 4083 (scip-2.0.1.4.li) R 4081 4083 1417 0 -1 4202496 6258 0 0 0 18 1 0 0 25 0 1 0 896971105 28336128 5601 33554432000 4194304 9128323 140734290696848 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/4083/statm: 6918 5601 713 1205 0 5709 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 27672

[startup+0.300443 s]
/proc/loadavg: 1.43 1.11 1.03 2/515 4083
/proc/meminfo: memFree=23239364/32950928 swapFree=58671692/67111528
[pid=4083] ppid=4081 vsize=27672 CPUtime=0.29 cores=0,2,4,6
/proc/4083/stat : 4083 (scip-2.0.1.4.li) R 4081 4083 1417 0 -1 4202496 6258 0 0 0 28 1 0 0 25 0 1 0 896971105 28336128 5601 33554432000 4194304 9128323 140734290696848 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/4083/statm: 6918 5601 713 1205 0 5709 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 27672

[startup+0.700366 s]
/proc/loadavg: 1.43 1.11 1.03 2/515 4083
/proc/meminfo: memFree=23239364/32950928 swapFree=58671692/67111528
[pid=4083] ppid=4081 vsize=27672 CPUtime=0.69 cores=0,2,4,6
/proc/4083/stat : 4083 (scip-2.0.1.4.li) R 4081 4083 1417 0 -1 4202496 6259 0 0 0 67 2 0 0 25 0 1 0 896971105 28336128 5602 33554432000 4194304 9128323 140734290696848 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/4083/statm: 6918 5602 713 1205 0 5709 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 27672

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

[startup+0.80034 s]
/proc/loadavg: 1.43 1.11 1.03 2/515 4083
/proc/meminfo: memFree=23239364/32950928 swapFree=58671692/67111528
[pid=4083] ppid=4081 vsize=27512 CPUtime=0.78 cores=0,2,4,6
/proc/4083/stat : 4083 (scip-2.0.1.4.li) R 4081 4083 1417 0 -1 4202496 6494 0 0 0 76 2 0 0 25 0 1 0 896971105 28172288 5801 33554432000 4194304 9128323 140734290696848 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/4083/statm: 6878 5801 717 1205 0 5669 0
Current children cumulated CPU time (s) 0.78
Current children cumulated vsize (KiB) 27512

[startup+1.00031 s]
/proc/loadavg: 1.43 1.11 1.03 2/515 4083
/proc/meminfo: memFree=23239364/32950928 swapFree=58671692/67111528
[pid=4083] ppid=4081 vsize=27352 CPUtime=0.99 cores=0,2,4,6
/proc/4083/stat : 4083 (scip-2.0.1.4.li) R 4081 4083 1417 0 -1 4202496 6500 0 0 0 95 4 0 0 25 0 1 0 896971105 28008448 5781 33554432000 4194304 9128323 140734290696848 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/4083/statm: 6838 5781 717 1205 0 5629 0
Current children cumulated CPU time (s) 0.99
Current children cumulated vsize (KiB) 27352

Child status: 0
Real time (s): 1.05335
CPU time (s): 1.05284
CPU user time (s): 1.00885
CPU system time (s): 0.043993
CPU usage (%): 99.9514
Max. virtual memory (cumulated for all children) (KiB): 27672

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.00885
system time used= 0.043993
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6508
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 3

runsolver used 0.008998 second user time and 0.030995 second system time

The end

Launcher Data 

Begin job on node115 at 2011-06-03 04:16:44
IDJOB=3452842
IDBENCH=1225
IDSOLVER=1949
FILE ID=node115/3452842-1307067404
RUNJOBID= node115-1307067367-2467
PBS_JOBID= 13497873
Free space on /tmp= 73820 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-PB06/namasivayam/wnqueen/normalized-t2001.13queen13.1111223696.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-3452842-1307067404/watcher-3452842-1307067404 -o /tmp/evaluation-result-3452842-1307067404/solver-3452842-1307067404 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452842-1307067404.opb -t 1800 -m 15500

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

MD5SUM BENCH= 35d859ff8d89aabca90bcfc52829307f
RANDOM SEED=2130452001

node115.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.811
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.62
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.811
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	: 5226.15
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.811
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.75
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.811
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.811
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.77
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.811
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.74
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.811
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.75
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.811
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:      23239644 kB
Buffers:        100348 kB
Cached:         239436 kB
SwapCached:      65764 kB
Active:        1085128 kB
Inactive:      8382080 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32950928 kB
LowFree:      23239644 kB
SwapTotal:    67111528 kB
SwapFree:     58671692 kB
Dirty:           16400 kB
Writeback:           0 kB
AnonPages:     9064936 kB
Mapped:          30544 kB
Slab:            99360 kB
PageTables:      75444 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83586992 kB
Committed_AS: 151868528 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= 73808 MiB
End job on node115 at 2011-06-03 04:16:46