Trace number 3453079

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.089985 0.0924069

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/web/
uclid_pb_benchmarks/normalized-blast-floppy1-6.ucl.opb
MD5SUM2eaba69c08c389fa8e7ea5af13e4aa74
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.012998
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables719
Total number of constraints593
Number of constraints which are clauses371
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints222
Minimum length of a constraint1
Maximum length of a constraint19
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 773
Number of bits of the biggest number in a constraint 10
Biggest sum of numbers in a constraint 2306
Number of bits of the biggest sum of numbers12
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.01	c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01	c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01	c 
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c reading problem <HOME/instance-3453079-1307074072.opb>
0.00/0.01	c original problem has 719 variables (719 bin, 0 int, 0 impl, 0 cont) and 593 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.01	c presolving:
0.00/0.02	c (round 1) 12 del vars, 1 del conss, 0 add conss, 1 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 2) 14 del vars, 26 del conss, 0 add conss, 3 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 3) 18 del vars, 34 del conss, 0 add conss, 7 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 4) 22 del vars, 42 del conss, 0 add conss, 11 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 5) 26 del vars, 50 del conss, 0 add conss, 15 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 6) 30 del vars, 58 del conss, 0 add conss, 19 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 7) 34 del vars, 66 del conss, 0 add conss, 23 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 8) 38 del vars, 75 del conss, 0 add conss, 27 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 9) 40 del vars, 78 del conss, 0 add conss, 29 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 10) 44 del vars, 85 del conss, 0 add conss, 33 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.02	c (round 11) 48 del vars, 95 del conss, 0 add conss, 37 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.00/0.02	c (round 12) 52 del vars, 103 del conss, 0 add conss, 41 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.00/0.02	c (round 13) 56 del vars, 111 del conss, 0 add conss, 45 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.00/0.02	c (round 14) 61 del vars, 120 del conss, 0 add conss, 49 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6192 impls, 0 clqs
0.00/0.02	c (round 15) 63 del vars, 128 del conss, 0 add conss, 51 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.02	c (round 16) 65 del vars, 131 del conss, 0 add conss, 53 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.03	c (round 17) 69 del vars, 139 del conss, 0 add conss, 57 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.03	c (round 18) 73 del vars, 147 del conss, 0 add conss, 61 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.03	c (round 19) 77 del vars, 155 del conss, 0 add conss, 65 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.03	c (round 20) 81 del vars, 163 del conss, 0 add conss, 69 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.03	c (round 21) 85 del vars, 170 del conss, 0 add conss, 73 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.03	c (round 22) 90 del vars, 180 del conss, 0 add conss, 77 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.03	c (round 23) 94 del vars, 189 del conss, 0 add conss, 81 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.03	c (round 24) 98 del vars, 198 del conss, 0 add conss, 85 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.03	c (round 25) 102 del vars, 205 del conss, 0 add conss, 89 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.03	c (round 26) 109 del vars, 215 del conss, 0 add conss, 95 chg bounds, 123 chg sides, 249 chg coeffs, 0 upgd conss, 6202 impls, 0 clqs
0.00/0.03	c (round 27) 114 del vars, 226 del conss, 0 add conss, 99 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6204 impls, 0 clqs
0.00/0.03	c (round 28) 118 del vars, 236 del conss, 0 add conss, 103 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6204 impls, 0 clqs
0.00/0.03	c (round 29) 123 del vars, 245 del conss, 0 add conss, 107 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6206 impls, 0 clqs
0.00/0.03	c (round 30) 127 del vars, 254 del conss, 0 add conss, 111 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6206 impls, 0 clqs
0.00/0.03	c (round 31) 129 del vars, 260 del conss, 0 add conss, 113 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6208 impls, 0 clqs
0.00/0.03	c (round 32) 131 del vars, 265 del conss, 0 add conss, 115 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.00/0.03	c (round 33) 135 del vars, 271 del conss, 0 add conss, 119 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.00/0.03	c (round 34) 139 del vars, 280 del conss, 0 add conss, 123 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.00/0.03	c (round 35) 145 del vars, 291 del conss, 0 add conss, 129 chg bounds, 133 chg sides, 263 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.00/0.03	c (round 36) 149 del vars, 296 del conss, 0 add conss, 133 chg bounds, 136 chg sides, 267 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.00/0.03	c (round 37) 153 del vars, 303 del conss, 0 add conss, 137 chg bounds, 137 chg sides, 269 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.00/0.04	c (round 38) 158 del vars, 311 del conss, 0 add conss, 142 chg bounds, 137 chg sides, 270 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.00/0.04	c (round 39) 162 del vars, 318 del conss, 0 add conss, 146 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.00/0.04	c (round 40) 163 del vars, 325 del conss, 0 add conss, 147 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.00/0.04	c (round 41) 165 del vars, 328 del conss, 0 add conss, 149 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.00/0.04	c (round 42) 169 del vars, 334 del conss, 0 add conss, 153 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.00/0.04	c (round 43) 173 del vars, 342 del conss, 0 add conss, 157 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.00/0.04	c (round 44) 177 del vars, 350 del conss, 0 add conss, 161 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6214 impls, 0 clqs
0.00/0.04	c (round 45) 183 del vars, 361 del conss, 0 add conss, 167 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6216 impls, 0 clqs
0.00/0.04	c (round 46) 187 del vars, 373 del conss, 0 add conss, 171 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6220 impls, 0 clqs
0.00/0.04	c (round 47) 197 del vars, 392 del conss, 0 add conss, 181 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6222 impls, 0 clqs
0.00/0.04	c (round 48) 214 del vars, 423 del conss, 0 add conss, 198 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6226 impls, 0 clqs
0.00/0.04	c (round 49) 221 del vars, 443 del conss, 0 add conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6226 impls, 0 clqs
0.00/0.04	c (round 50) 221 del vars, 448 del conss, 0 add conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 0 upgd conss, 6226 impls, 0 clqs
0.00/0.04	c (round 51) 221 del vars, 489 del conss, 0 add conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 63 upgd conss, 6226 impls, 0 clqs
0.00/0.04	c (round 52) 455 del vars, 519 del conss, 0 add conss, 205 chg bounds, 138 chg sides, 271 chg coeffs, 63 upgd conss, 6336 impls, 0 clqs
0.00/0.05	c (round 53) 513 del vars, 522 del conss, 0 add conss, 205 chg bounds, 145 chg sides, 361 chg coeffs, 63 upgd conss, 6336 impls, 0 clqs
0.00/0.05	c (round 54) 513 del vars, 522 del conss, 0 add conss, 205 chg bounds, 148 chg sides, 367 chg coeffs, 63 upgd conss, 6336 impls, 0 clqs
0.00/0.05	c presolving (55 rounds):
0.00/0.05	c  513 deleted vars, 522 deleted constraints, 0 added constraints, 205 tightened bounds, 0 added holes, 148 changed sides, 367 changed coefficients
0.00/0.05	c  6336 implications, 0 cliques
0.00/0.05	c presolved problem has 206 variables (206 bin, 0 int, 0 impl, 0 cont) and 71 constraints
0.00/0.05	c      49 constraints of type <knapsack>
0.00/0.05	c      13 constraints of type <setppc>
0.00/0.05	c       8 constraints of type <linear>
0.00/0.05	c       1 constraints of type <logicor>
0.00/0.05	c transformed objective value is always integral (scale: 1)
0.00/0.05	c Presolving Time: 0.04
0.00/0.05	c - non default parameters ----------------------------------------------------------------------
0.00/0.05	c # SCIP version 2.0.1.4
0.00/0.05	c 
0.00/0.05	c # frequency for displaying node information lines
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05	c display/freq = 10000
0.00/0.05	c 
0.00/0.05	c # maximal time in seconds to run
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05	c limits/time = 1800
0.00/0.05	c 
0.00/0.05	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05	c limits/memory = 13950
0.00/0.05	c 
0.00/0.05	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c limits/solutions = 1
0.00/0.05	c 
0.00/0.05	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05	c separating/maxrounds = 1
0.00/0.05	c 
0.00/0.05	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c separating/maxroundsroot = 5
0.00/0.05	c 
0.00/0.05	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05	c # [type: int, range: [1,2], default: 1]
0.00/0.05	c timing/clocktype = 2
0.00/0.05	c 
0.00/0.05	c # belongs reading time to solving time?
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c timing/reading = TRUE
0.00/0.05	c 
0.00/0.05	c # should presolving try to simplify inequalities
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c constraints/linear/simplifyinequalities = TRUE
0.00/0.05	c 
0.00/0.05	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c constraints/indicator/addCouplingCons = TRUE
0.00/0.05	c 
0.00/0.05	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05	c constraints/knapsack/disaggregation = FALSE
0.00/0.05	c 
0.00/0.05	c # should presolving try to simplify knapsacks
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05	c 
0.00/0.05	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c presolving/probing/maxrounds = 0
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/coefdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05	c heuristics/crossover/freq = -1
0.00/0.05	c 
0.00/0.05	c # number of nodes added to the contingent of the total nodes
0.00/0.05	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05	c heuristics/crossover/nodesofs = 750
0.00/0.05	c 
0.00/0.05	c # number of nodes without incumbent change that heuristic should wait
0.00/0.05	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05	c heuristics/crossover/nwaitingnodes = 100
0.00/0.05	c 
0.00/0.05	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05	c # [type: real, range: [0,1], default: 0.1]
0.00/0.05	c heuristics/crossover/nodesquot = 0.15
0.00/0.05	c 
0.00/0.05	c # minimum percentage of integer variables that have to be fixed 
0.00/0.05	c # [type: real, range: [0,1], default: 0.666]
0.00/0.05	c heuristics/crossover/minfixingrate = 0.5
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05	c heuristics/feaspump/freq = -1
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/fracdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/guideddiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/intshifting/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/linesearchdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05	c heuristics/objpscostdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05	c # [type: real, range: [0,1], default: 0.01]
0.00/0.05	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/oneopt/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/pscostdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/rens/freq = -1
0.00/0.05	c 
0.00/0.05	c # minimum percentage of integer variables that have to be fixable 
0.00/0.05	c # [type: real, range: [0,1], default: 0.5]
0.00/0.05	c heuristics/rens/minfixingrate = 0.3
0.00/0.05	c 
0.00/0.05	c # number of nodes added to the contingent of the total nodes
0.00/0.05	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05	c heuristics/rens/nodesofs = 2000
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05	c heuristics/rootsoldiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/rounding/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/shiftandpropagate/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/shifting/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/simplerounding/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/subnlp/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/trivial/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/trysol/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/undercover/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/veclendiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/zirounding/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c separating/cmir/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c separating/flowcover/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c separating/rapidlearning/freq = 0
0.00/0.05	c 
0.00/0.05	c -----------------------------------------------------------------------------------------------
0.00/0.05	c start solving
0.00/0.05	c 
0.00/0.05	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.05	c   0.0s|     1 |     0 |    30 |     - |1910k|   0 |  23 | 206 |  71 | 206 |  71 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.07	c   0.1s|     1 |     0 |    52 |     - |1971k|   0 |  34 | 206 | 103 | 206 |  81 |  21 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.07	c   0.1s|     1 |     0 |    74 |     - |1990k|   0 |  44 | 206 | 103 | 206 |  97 |  37 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.07	c   0.1s|     1 |     0 |   117 |     - |2003k|   0 |  50 | 206 | 103 | 206 | 116 |  56 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.08	c   0.1s|     1 |     0 |   137 |     - |2018k|   0 |  47 | 206 | 103 | 206 | 126 |  66 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.08	c   0.1s|     1 |     0 |   154 |     - |2030k|   0 |  62 | 206 | 103 | 206 | 138 |  78 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.04/0.08	c   0.1s|     1 |     0 |   154 |     - |2030k|   0 |  62 | 206 | 103 | 206 | 138 |  78 |   0 |   3 |    cutoff    |      --      |   0.00%
0.04/0.08	c 
0.04/0.08	c SCIP Status        : problem is solved [infeasible]
0.04/0.08	c Solving Time (sec) : 0.08
0.04/0.08	c Solving Nodes      : 1
0.04/0.08	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.04/0.08	c Dual Bound         : +1.00000000000000e+20
0.04/0.08	c Gap                : 0.00 %
0.04/0.08	s UNSATISFIABLE
0.04/0.08	c SCIP Status        : problem is solved [infeasible]
0.04/0.08	c Total Time         :       0.08
0.04/0.08	c   solving          :       0.08
0.04/0.08	c   presolving       :       0.04 (included in solving)
0.04/0.08	c   reading          :       0.01 (included in solving)
0.04/0.08	c Original Problem   :
0.04/0.08	c   Problem name     : HOME/instance-3453079-1307074072.opb
0.04/0.08	c   Variables        : 719 (719 binary, 0 integer, 0 implicit integer, 0 continuous)
0.04/0.08	c   Constraints      : 593 initial, 593 maximal
0.04/0.08	c Presolved Problem  :
0.04/0.08	c   Problem name     : t_HOME/instance-3453079-1307074072.opb
0.04/0.08	c   Variables        : 206 (206 binary, 0 integer, 0 implicit integer, 0 continuous)
0.04/0.08	c   Constraints      : 71 initial, 109 maximal
0.04/0.08	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.04/0.08	c   trivial          :       0.00          0          0          0          0          0          0          0          0          0
0.04/0.08	c   dualfix          :       0.00         58          0          0          0          0          0          0          0          0
0.04/0.08	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.04/0.08	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.04/0.08	c   implics          :       0.00          0         16          0          0          0          0          0          0          0
0.04/0.08	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.04/0.08	c   knapsack         :       0.00          0          0          0          0          0          0          0         10         96
0.04/0.08	c   setppc           :       0.00          0          0          0          0          0          0          0          0          0
0.04/0.08	c   linear           :       0.01        205        234          0        205          0        522          0        138        271
0.04/0.08	c   logicor          :       0.00          0          0          0          0          0          0          0          0          0
0.04/0.08	c   root node        :          -          5          -          -          5          -          -          -          -          -
0.04/0.08	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.04/0.08	c   integral         :          0          0          0          1          0          1          0          1          0          0          0          0
0.04/0.08	c   knapsack         :         49          6          3          0          0          0          0          0          0        259          0          0
0.04/0.08	c   setppc           :         13          6          3          0          0          0          0          0          1          0          0          0
0.04/0.08	c   linear           :          8+         6          3          0          0          0          0          0          0          0          0          0
0.04/0.08	c   logicor          :          1          6          1          0          0          0          0          0          0          0          0          0
0.04/0.08	c   countsols        :          0          0          0          0          0          0          0          0          0          0          0          0
0.04/0.08	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.04/0.08	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.04/0.08	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.04/0.08	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.04/0.08	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.04/0.08	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.04/0.08	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.04/0.08	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.04/0.08	c   vbounds          :          0          0          0          0
0.04/0.08	c   rootredcost      :          0          0          0          0
0.04/0.08	c   pseudoobj        :          0          0          0          0
0.04/0.08	c Propagator Timings :  TotalTime  Propagate    Resprop
0.04/0.08	c   vbounds          :       0.00       0.00       0.00
0.04/0.08	c   rootredcost      :       0.00       0.00       0.00
0.04/0.08	c   pseudoobj        :       0.00       0.00       0.00
0.04/0.08	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.04/0.08	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.04/0.08	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.04/0.08	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.04/0.08	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.04/0.08	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.04/0.08	c   applied globally :          -          -          -          0        0.0          -          -          -
0.04/0.08	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.04/0.08	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.04/0.08	c   cut pool         :       0.00          4          -          -          9          -    (maximal pool size: 51)
0.04/0.08	c   redcost          :       0.00          5          0          0          0          0
0.04/0.08	c   impliedbounds    :       0.00          5          0          0          8          0
0.04/0.08	c   intobj           :       0.00          0          0          0          0          0
0.04/0.08	c   gomory           :       0.00          5          0          0         30          0
0.04/0.08	c   cgmip            :       0.00          0          0          0          0          0
0.04/0.08	c   closecuts        :       0.00          0          0          0          0          0
0.04/0.08	c   strongcg         :       0.00          5          0          0         33          0
0.04/0.08	c   cmir             :       0.00          0          0          0          0          0
0.04/0.08	c   flowcover        :       0.00          0          0          0          0          0
0.04/0.08	c   clique           :       0.00          1          0          0          0          0
0.04/0.08	c   zerohalf         :       0.00          0          0          0          0          0
0.04/0.08	c   mcf              :       0.00          1          0          0          0          0
0.04/0.08	c   oddcycle         :       0.00          0          0          0          0          0
0.04/0.08	c   rapidlearning    :       0.02          1          0          3          0         38
0.04/0.08	c Pricers            :       Time      Calls       Vars
0.04/0.08	c   problem variables:       0.00          0          0
0.04/0.08	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.04/0.08	c   relpscost        :       0.00          1          1          0          0          0          0
0.04/0.08	c   pscost           :       0.00          0          0          0          0          0          0
0.04/0.08	c   inference        :       0.00          0          0          0          0          0          0
0.04/0.08	c   mostinf          :       0.00          0          0          0          0          0          0
0.04/0.08	c   leastinf         :       0.00          0          0          0          0          0          0
0.04/0.08	c   fullstrong       :       0.00          0          0          0          0          0          0
0.04/0.08	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.04/0.08	c   random           :       0.00          0          0          0          0          0          0
0.04/0.08	c Primal Heuristics  :       Time      Calls      Found
0.04/0.08	c   LP solutions     :       0.00          -          0
0.04/0.08	c   pseudo solutions :       0.00          -          0
0.04/0.08	c   trivial          :       0.00          1          0
0.04/0.08	c   shiftandpropagate:       0.00          0          0
0.04/0.08	c   simplerounding   :       0.00          0          0
0.04/0.08	c   zirounding       :       0.00          0          0
0.04/0.08	c   rounding         :       0.00          0          0
0.04/0.08	c   shifting         :       0.00          0          0
0.04/0.08	c   intshifting      :       0.00          0          0
0.04/0.08	c   oneopt           :       0.00          0          0
0.04/0.08	c   twoopt           :       0.00          0          0
0.04/0.08	c   fixandinfer      :       0.00          0          0
0.04/0.08	c   feaspump         :       0.00          0          0
0.04/0.08	c   clique           :       0.00          0          0
0.04/0.08	c   coefdiving       :       0.00          0          0
0.04/0.08	c   pscostdiving     :       0.00          0          0
0.04/0.08	c   fracdiving       :       0.00          0          0
0.04/0.08	c   veclendiving     :       0.00          0          0
0.04/0.08	c   intdiving        :       0.00          0          0
0.04/0.08	c   actconsdiving    :       0.00          0          0
0.04/0.08	c   objpscostdiving  :       0.00          0          0
0.04/0.08	c   rootsoldiving    :       0.00          0          0
0.04/0.08	c   linesearchdiving :       0.00          0          0
0.04/0.08	c   guideddiving     :       0.00          0          0
0.04/0.08	c   octane           :       0.00          0          0
0.04/0.08	c   rens             :       0.00          0          0
0.04/0.08	c   rins             :       0.00          0          0
0.04/0.08	c   localbranching   :       0.00          0          0
0.04/0.08	c   mutation         :       0.00          0          0
0.04/0.08	c   crossover        :       0.00          0          0
0.04/0.08	c   dins             :       0.00          0          0
0.04/0.08	c   vbounds          :       0.00          0          0
0.04/0.08	c   undercover       :       0.00          0          0
0.04/0.08	c   subnlp           :       0.00          0          0
0.04/0.08	c   trysol           :       0.00          0          0
0.04/0.08	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.04/0.08	c   primal LP        :       0.00          0          0       0.00          -
0.04/0.08	c   dual LP          :       0.00          7        154      22.00          -
0.04/0.08	c   lex dual LP      :       0.00          0          0       0.00          -
0.04/0.08	c   barrier LP       :       0.00          0          0       0.00          -
0.04/0.08	c   diving/probing LP:       0.00          0          0       0.00          -
0.04/0.08	c   strong branching :       0.00          3         87      29.00          -
0.04/0.08	c     (at root node) :          -          3         87      29.00          -
0.04/0.08	c   conflict analysis:       0.00          0          0       0.00          -
0.04/0.08	c B&B Tree           :
0.04/0.08	c   number of runs   :          1
0.04/0.08	c   nodes            :          1
0.04/0.08	c   nodes (total)    :          1
0.04/0.08	c   nodes left       :          0
0.04/0.08	c   max depth        :          0
0.04/0.08	c   max depth (total):          0
0.04/0.08	c   backtracks       :          0 (0.0%)
0.04/0.08	c   delayed cutoffs  :          0
0.04/0.08	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.04/0.08	c   avg switch length:       2.00
0.04/0.08	c   switching time   :       0.00
0.04/0.08	c Solution           :
0.04/0.08	c   Solutions found  :          0 (0 improvements)
0.04/0.08	c   Primal Bound     : infeasible
0.04/0.08	c   Dual Bound       :          -
0.04/0.08	c   Gap              :       0.00 %
0.04/0.08	c   Root Dual Bound  :          -
0.04/0.08	c   Root Iterations  :        154
0.04/0.09	c Time complete: 0.08.

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

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

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


[startup+0 s]
/proc/loadavg: 2.01 2.04 2.00 3/527 2431
/proc/meminfo: memFree=24131020/32951124 swapFree=56241860/67111528
[pid=2431] ppid=2429 vsize=9264 CPUtime=0 cores=0,2,4,6
/proc/2431/stat : 2431 (scip-2.0.1.4.li) R 2429 2431 32685 0 -1 4202496 1193 0 0 0 0 0 0 0 25 0 1 0 897637839 9486336 1146 33554432000 4194304 9128323 140736075943392 18446744073709551615 8009021 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/2431/statm: 2316 1160 381 1205 0 1107 0

[startup+0.058789 s]
/proc/loadavg: 2.01 2.04 2.00 3/527 2431
/proc/meminfo: memFree=24131020/32951124 swapFree=56241860/67111528
[pid=2431] ppid=2429 vsize=23068 CPUtime=0.04 cores=0,2,4,6
/proc/2431/stat : 2431 (scip-2.0.1.4.li) R 2429 2431 32685 0 -1 4202496 4974 0 0 0 4 0 0 0 18 0 1 0 897637839 23621632 4669 33554432000 4194304 9128323 140736075943392 18446744073709551615 6886064 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/2431/statm: 5767 4686 676 1205 0 4558 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 23068

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

[startup+0.058789 s]
/proc/loadavg: 2.01 2.04 2.00 3/527 2431
/proc/meminfo: memFree=24131020/32951124 swapFree=56241860/67111528
[pid=2431] ppid=2429 vsize=23068 CPUtime=0.04 cores=0,2,4,6
/proc/2431/stat : 2431 (scip-2.0.1.4.li) R 2429 2431 32685 0 -1 4202496 4974 0 0 0 4 0 0 0 18 0 1 0 897637839 23621632 4669 33554432000 4194304 9128323 140736075943392 18446744073709551615 6886064 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/2431/statm: 5767 4686 676 1205 0 4558 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 23068

Child status: 0
Real time (s): 0.0924069
CPU time (s): 0.089985
CPU user time (s): 0.078987
CPU system time (s): 0.010998
CPU usage (%): 97.3791
Max. virtual memory (cumulated for all children) (KiB): 23068

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

runsolver used 0.008998 second user time and 0.011998 second system time

The end

Launcher Data 

Begin job on node119 at 2011-06-03 06:07:52
IDJOB=3453079
IDBENCH=1483
IDSOLVER=1949
FILE ID=node119/3453079-1307074072
RUNJOBID= node119-1307067097-1328
PBS_JOBID= 13497867
Free space on /tmp= 73612 MiB

SOLVER NAME= SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/web/uclid_pb_benchmarks/normalized-blast-floppy1-6.ucl.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-3453079-1307074072/watcher-3453079-1307074072 -o /tmp/evaluation-result-3453079-1307074072/solver-3453079-1307074072 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453079-1307074072.opb -t 1800 -m 15500

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

MD5SUM BENCH= 2eaba69c08c389fa8e7ea5af13e4aa74
RANDOM SEED=1929371778

node119.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.815
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.63
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.815
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.83
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.815
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.815
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.83
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.815
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.67
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.815
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.83
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.815
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.74
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.815
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.83
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32951124 kB
MemFree:      24131300 kB
Buffers:        161420 kB
Cached:         518728 kB
SwapCached:      59076 kB
Active:        1605756 kB
Inactive:      6917276 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951124 kB
LowFree:      24131300 kB
SwapTotal:    67111528 kB
SwapFree:     56241860 kB
Dirty:           12100 kB
Writeback:           0 kB
AnonPages:     7786576 kB
Mapped:          36168 kB
Slab:           146600 kB
PageTables:      81392 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587088 kB
Committed_AS: 164850840 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= 73600 MiB
End job on node119 at 2011-06-03 06:07:52