Trace number 3730831

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
PB10: SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solverUNSAT 0.18797 0.189925

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/web/
uclid_pb_benchmarks/normalized-blast-floppy1-6.ucl.opb
MD5SUM2eaba69c08c389fa8e7ea5af13e4aa74
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.003998
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.00	c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00	c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00	c 
0.00/0.00	c user parameter file <scip.set> not found - using default parameters
0.00/0.00	c reading problem <HOME/instance-3730831-1338682839.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.02	c presolving:
0.00/0.02	c (round 1) 12 del vars, 1 del 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, 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, 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, 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, 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, 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, 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, 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, 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, 33 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6188 impls, 0 clqs
0.00/0.03	c (round 11) 48 del vars, 95 del conss, 37 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.00/0.03	c (round 12) 52 del vars, 103 del conss, 41 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.00/0.03	c (round 13) 56 del vars, 111 del conss, 45 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6190 impls, 0 clqs
0.00/0.03	c (round 14) 61 del vars, 120 del conss, 49 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6192 impls, 0 clqs
0.00/0.03	c (round 15) 63 del vars, 128 del conss, 51 chg bounds, 115 chg sides, 230 chg coeffs, 0 upgd conss, 6198 impls, 0 clqs
0.00/0.03	c (round 16) 65 del vars, 131 del 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 119 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.00/0.04	c (round 34) 139 del vars, 280 del conss, 123 chg bounds, 130 chg sides, 259 chg coeffs, 0 upgd conss, 6210 impls, 0 clqs
0.00/0.04	c (round 35) 145 del vars, 291 del conss, 129 chg bounds, 133 chg sides, 263 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.00/0.04	c (round 36) 149 del vars, 296 del conss, 133 chg bounds, 136 chg sides, 267 chg coeffs, 0 upgd conss, 6212 impls, 0 clqs
0.00/0.04	c (round 37) 153 del vars, 303 del 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 205 chg bounds, 138 chg sides, 271 chg coeffs, 63 upgd conss, 6226 impls, 0 clqs
0.00/0.05	c (round 52) 455 del vars, 519 del 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, 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, 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, 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.03
0.00/0.05	c - non default parameters ----------------------------------------------------------------------
0.00/0.05	c # SCIP version 1.2.1.3
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 = 1789.99
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 # 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 <nlp> (-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/nlp/freq = -1
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 <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 <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 <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 |    32 |     - |1913k|   0 |  29 | 206 |  71 | 206 |  71 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.06/0.09	c   0.1s|     1 |     0 |    53 |     - |2081k|   0 |  40 | 206 | 199 | 206 |  90 |  24 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.06/0.09	c   0.1s|     1 |     0 |    78 |     - |2100k|   0 |  43 | 206 | 199 | 206 | 111 |  45 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |   103 |     - |2108k|   0 |  53 | 206 | 199 | 206 | 124 |  58 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |   122 |     - |2115k|   0 |  53 | 206 | 199 | 206 | 131 |  65 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |   141 |     - |2124k|   0 |  67 | 206 | 199 | 206 | 140 |  74 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.12	c   0.1s|     1 |     0 |   144 |     - |2120k|   0 |  66 | 206 | 194 | 206 | 140 |  74 |   0 |  17 | 0.000000e+00 |      --      |    Inf 
0.09/0.13	c   0.1s|     1 |     0 |   216 |     - |2118k|   0 |  48 | 206 | 189 | 206 | 140 |  74 |   0 |  26 | 0.000000e+00 |      --      |    Inf 
0.09/0.13	c   0.1s|     1 |     2 |   216 |     - |2119k|   0 |  48 | 206 | 189 | 206 | 140 |  74 |   0 |  41 | 0.000000e+00 |      --      |    Inf 
0.09/0.13	c (run 1, node 1) restarting after 12 global fixings of integer variables
0.09/0.13	c 
0.09/0.13	c (restart) converted 13 cuts from the global cut pool into linear constraints
0.09/0.13	c 
0.09/0.14	c presolving:
0.09/0.14	c (round 1) 13 del vars, 8 del conss, 0 chg bounds, 1 chg sides, 21 chg coeffs, 0 upgd conss, 6342 impls, 0 clqs
0.09/0.14	c (round 2) 13 del vars, 10 del conss, 0 chg bounds, 1 chg sides, 21 chg coeffs, 0 upgd conss, 6342 impls, 0 clqs
0.09/0.14	c (round 3) 13 del vars, 35 del conss, 0 chg bounds, 25 chg sides, 21 chg coeffs, 0 upgd conss, 6342 impls, 0 clqs
0.09/0.14	c (round 4) 13 del vars, 58 del conss, 0 chg bounds, 25 chg sides, 21 chg coeffs, 113 upgd conss, 6342 impls, 0 clqs
0.09/0.14	c presolving (5 rounds):
0.09/0.14	c  13 deleted vars, 58 deleted constraints, 0 tightened bounds, 0 added holes, 25 changed sides, 21 changed coefficients
0.09/0.14	c  6342 implications, 0 cliques
0.09/0.14	c presolved problem has 193 variables (193 bin, 0 int, 0 impl, 0 cont) and 144 constraints
0.09/0.14	c      45 constraints of type <knapsack>
0.09/0.14	c      11 constraints of type <setppc>
0.09/0.14	c       8 constraints of type <linear>
0.09/0.14	c      80 constraints of type <logicor>
0.09/0.14	c transformed objective value is always integral (scale: 1)
0.09/0.14	c Presolving Time: 0.04
0.09/0.14	c 
0.09/0.14	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.09/0.14	c   0.1s|     1 |     0 |   246 |     - |1963k|   0 |  22 | 193 | 144 | 193 |  66 |   0 |   0 |  41 | 0.000000e+00 |      --      |    Inf 
0.09/0.14	c   0.1s|     1 |     0 |   261 |     - |1980k|   0 |  27 | 193 | 144 | 193 |  79 |  13 |   0 |  41 | 0.000000e+00 |      --      |    Inf 
0.09/0.15	c   0.1s|     1 |     2 |   261 |     - |1980k|   0 |  27 | 193 | 144 | 193 |  79 |  13 |   0 |  62 | 0.000000e+00 |      --      |    Inf 
0.09/0.18	c 
0.09/0.18	c SCIP Status        : problem is solved [infeasible]
0.09/0.18	c Solving Time (sec) : 0.17
0.09/0.18	c Solving Nodes      : 15 (total of 16 nodes in 2 runs)
0.09/0.18	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.09/0.18	c Dual Bound         : +1.00000000000000e+20
0.09/0.18	c Gap                : 0.00 %
0.09/0.18	s UNSATISFIABLE
0.09/0.18	c SCIP Status        : problem is solved [infeasible]
0.09/0.18	c Solving Time       :       0.17
0.09/0.18	c Original Problem   :
0.09/0.18	c   Problem name     : HOME/instance-3730831-1338682839.opb
0.09/0.18	c   Variables        : 719 (719 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.18	c   Constraints      : 593 initial, 593 maximal
0.09/0.18	c Presolved Problem  :
0.09/0.18	c   Problem name     : t_HOME/instance-3730831-1338682839.opb
0.09/0.18	c   Variables        : 193 (193 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.18	c   Constraints      : 144 initial, 144 maximal
0.09/0.18	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
0.09/0.18	c   trivial          :       0.00         12          0          0          0          0          0          0          0
0.09/0.18	c   dualfix          :       0.00         58          0          0          0          0          0          0          0
0.09/0.18	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
0.09/0.18	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
0.09/0.18	c   implics          :       0.00          0         17          0          0          0          0          0          0
0.09/0.18	c   probing          :       0.00          0          0          0          0          0          0          0          0
0.09/0.18	c   knapsack         :       0.00          0          0          0          0          0          8         11        113
0.09/0.18	c   setppc           :       0.00          0          0          0          0          0          1          0          0
0.09/0.18	c   linear           :       0.01        205        234          0        205          0        548        162        275
0.09/0.18	c   logicor          :       0.00          0          0          0          0          0         23          0          0
0.09/0.18	c   root node        :          -         15          -          -         15          -          -          -          -
0.09/0.18	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
0.09/0.18	c   integral         :          0          0          0         17          0          7          7          0          0         16
0.09/0.18	c   knapsack         :         45          6         30          0          0          0         22        215          0          0
0.09/0.18	c   setppc           :         11          6         30          0          0          1          2          0          0          0
0.09/0.18	c   linear           :          8          7         29          0          0          0         58         22          0          0
0.09/0.18	c   logicor          :         80          6         16          0          0          0          0          2          0          0
0.09/0.18	c   countsols        :          0          0          0          0          0          0          0          0          0          0
0.09/0.18	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
0.09/0.18	c   integral         :       0.06       0.00       0.00       0.06       0.00
0.09/0.18	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
0.09/0.18	c   setppc           :       0.00       0.00       0.00       0.00       0.00
0.09/0.18	c   linear           :       0.00       0.00       0.00       0.00       0.00
0.09/0.18	c   logicor          :       0.00       0.00       0.00       0.00       0.00
0.09/0.18	c   countsols        :       0.00       0.00       0.00       0.00       0.00
0.09/0.18	c Propagators        :       Time      Calls    Cutoffs    DomReds
0.09/0.18	c   vbounds          :       0.00          2          0          0
0.09/0.18	c   rootredcost      :       0.00          0          0          0
0.09/0.18	c   pseudoobj        :       0.00          0          0          0
0.09/0.18	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.09/0.18	c   propagation      :       0.00          1          0          0        0.0          0        0.0          -
0.09/0.18	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.18	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.18	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.09/0.18	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.09/0.18	c   applied globally :          -          -          -          0        0.0          -          -          -
0.09/0.18	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.09/0.18	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.09/0.18	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 11)
0.09/0.18	c   redcost          :       0.00         19          0          0          0          0
0.09/0.18	c   impliedbounds    :       0.00          6          0          0          8          0
0.09/0.18	c   intobj           :       0.00          0          0          0          0          0
0.09/0.18	c   cgmip            :       0.00          0          0          0          0          0
0.09/0.18	c   gomory           :       0.00          6          0          0         32          0
0.09/0.18	c   strongcg         :       0.00          6          0          0         23          0
0.09/0.18	c   cmir             :       0.00          0          0          0          0          0
0.09/0.18	c   flowcover        :       0.00          0          0          0          0          0
0.09/0.18	c   clique           :       0.00          2          0          0          0          0
0.09/0.18	c   zerohalf         :       0.00          0          0          0          0          0
0.09/0.18	c   mcf              :       0.00          2          0          0          0          0
0.09/0.18	c   rapidlearning    :       0.04          1          0          0          0        143
0.09/0.18	c Pricers            :       Time      Calls       Vars
0.09/0.18	c   problem variables:       0.00          0          0
0.09/0.18	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.09/0.18	c   relpscost        :       0.06         17          7          7          0          0         16
0.09/0.18	c   pscost           :       0.00          0          0          0          0          0          0
0.09/0.18	c   inference        :       0.00          0          0          0          0          0          0
0.09/0.18	c   mostinf          :       0.00          0          0          0          0          0          0
0.09/0.18	c   leastinf         :       0.00          0          0          0          0          0          0
0.09/0.18	c   fullstrong       :       0.00          0          0          0          0          0          0
0.09/0.18	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.09/0.18	c   random           :       0.00          0          0          0          0          0          0
0.09/0.18	c Primal Heuristics  :       Time      Calls      Found
0.09/0.18	c   LP solutions     :       0.00          -          0
0.09/0.18	c   pseudo solutions :       0.00          -          0
0.09/0.18	c   trivial          :       0.00          1          0
0.09/0.18	c   simplerounding   :       0.00          0          0
0.09/0.18	c   zirounding       :       0.00          0          0
0.09/0.18	c   rounding         :       0.00          0          0
0.09/0.18	c   shifting         :       0.00          0          0
0.09/0.18	c   intshifting      :       0.00          0          0
0.09/0.18	c   oneopt           :       0.00          0          0
0.09/0.18	c   twoopt           :       0.00          0          0
0.09/0.18	c   fixandinfer      :       0.00          0          0
0.09/0.18	c   feaspump         :       0.00          0          0
0.09/0.18	c   coefdiving       :       0.00          0          0
0.09/0.18	c   pscostdiving     :       0.00          0          0
0.09/0.18	c   fracdiving       :       0.00          0          0
0.09/0.18	c   veclendiving     :       0.00          0          0
0.09/0.18	c   intdiving        :       0.00          0          0
0.09/0.18	c   actconsdiving    :       0.00          0          0
0.09/0.18	c   objpscostdiving  :       0.00          0          0
0.09/0.18	c   rootsoldiving    :       0.00          0          0
0.09/0.18	c   linesearchdiving :       0.00          0          0
0.09/0.18	c   guideddiving     :       0.00          0          0
0.09/0.18	c   octane           :       0.00          0          0
0.09/0.18	c   rens             :       0.00          0          0
0.09/0.18	c   rins             :       0.00          0          0
0.09/0.18	c   localbranching   :       0.00          0          0
0.09/0.18	c   mutation         :       0.00          0          0
0.09/0.18	c   crossover        :       0.00          0          0
0.09/0.18	c   dins             :       0.00          0          0
0.09/0.18	c   undercover       :       0.00          0          0
0.09/0.18	c   nlp              :       0.00          0          0
0.09/0.18	c   trysol           :       0.00          0          0
0.09/0.18	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.09/0.18	c   primal LP        :       0.00          0          0       0.00          -
0.09/0.18	c   dual LP          :       0.01         23        331      14.39          -
0.09/0.18	c   lex dual LP      :       0.00          0          0       0.00          -
0.09/0.18	c   barrier LP       :       0.00          0          0       0.00          -
0.09/0.18	c   diving/probing LP:       0.00          0          0       0.00          -
0.09/0.18	c   strong branching :       0.06        168       2005      11.93   32309.53
0.09/0.18	c     (at root node) :          -         62        995      16.05          -
0.09/0.18	c   conflict analysis:       0.00          0          0       0.00          -
0.09/0.18	c B&B Tree           :
0.09/0.18	c   number of runs   :          2
0.09/0.18	c   nodes            :         15
0.09/0.18	c   nodes (total)    :         16
0.09/0.18	c   nodes left       :          0
0.09/0.18	c   max depth        :          7
0.09/0.18	c   max depth (total):          7
0.09/0.18	c   backtracks       :          6 (40.0%)
0.09/0.18	c   delayed cutoffs  :          0
0.09/0.18	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.09/0.18	c   avg switch length:       2.93
0.09/0.18	c   switching time   :       0.00
0.09/0.18	c Solution           :
0.09/0.18	c   Solutions found  :          0 (0 improvements)
0.09/0.18	c   Primal Bound     : infeasible
0.09/0.18	c   Dual Bound       :          -
0.09/0.18	c   Gap              :       0.00 %
0.09/0.18	c   Root Dual Bound  : +0.00000000000000e+00
0.09/0.18	c   Root Iterations  :        261
0.09/0.18	c Time complete: 0.17.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 989)

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

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

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

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


[startup+0 s]
/proc/loadavg: 2.01 2.00 1.92 3/177 27251
/proc/meminfo: memFree=29091488/32873844 swapFree=8656/8656
[pid=27251] ppid=27249 vsize=7912 CPUtime=0 cores=0,2,4,6
/proc/27251/stat : 27251 (pbscip.linux.x8) R 27249 27251 18061 0 -1 4202496 1050 0 0 0 0 0 0 0 20 0 1 0 334412443 8101888 996 33554432000 4194304 8395647 140734693715968 140736781487448 7382157 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/27251/statm: 1978 1007 365 1026 0 948 0

[startup+0.0724379 s]
/proc/loadavg: 2.01 2.00 1.92 3/177 27251
/proc/meminfo: memFree=29091488/32873844 swapFree=8656/8656
[pid=27251] ppid=27249 vsize=26496 CPUtime=0.06 cores=0,2,4,6
/proc/27251/stat : 27251 (pbscip.linux.x8) R 27249 27251 18061 0 -1 4202496 5794 0 0 0 5 1 0 0 20 0 1 0 334412443 27131904 5386 33554432000 4194304 8395647 140734693715968 140736781487448 7428202 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/27251/statm: 6624 5386 612 1026 0 5594 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 26496

[startup+0.100257 s]
/proc/loadavg: 2.01 2.00 1.92 3/177 27251
/proc/meminfo: memFree=29091488/32873844 swapFree=8656/8656
[pid=27251] ppid=27249 vsize=26496 CPUtime=0.09 cores=0,2,4,6
/proc/27251/stat : 27251 (pbscip.linux.x8) R 27249 27251 18061 0 -1 4202496 5816 0 0 0 8 1 0 0 20 0 1 0 334412443 27131904 5408 33554432000 4194304 8395647 140734693715968 140736781487448 4921191 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/27251/statm: 6624 5408 623 1026 0 5594 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26496

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

Child status: 0
Real time (s): 0.189925
CPU time (s): 0.18797
CPU user time (s): 0.166974
CPU system time (s): 0.020996
CPU usage (%): 98.9706
Max. virtual memory (cumulated for all children) (KiB): 26496

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

runsolver used 0.001999 second user time and 0.004999 second system time

The end

Launcher Data 

Begin job on node102 at 2012-06-03 02:20:39
IDJOB=3730831
IDBENCH=1483
IDSOLVER=2326
FILE ID=node102/3730831-1338682839
RUNJOBID= node102-1338679212-26560
PBS_JOBID= 14636711
Free space on /tmp= 71132 MiB

SOLVER NAME= PB10: SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/web/uclid_pb_benchmarks/normalized-blast-floppy1-6.ucl.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3730831-1338682839/watcher-3730831-1338682839 -o /tmp/evaluation-result-3730831-1338682839/solver-3730831-1338682839 -C 1800 -W 1900 -M 15500  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3730831-1338682839.opb -t 1800 -m 15500

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

MD5SUM BENCH= 2eaba69c08c389fa8e7ea5af13e4aa74
RANDOM SEED=1559528013

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

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

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

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

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

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

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

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

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


/proc/meminfo:
MemTotal:       32873844 kB
MemFree:        29091488 kB
Buffers:          142444 kB
Cached:           592696 kB
SwapCached:         5544 kB
Active:          2433332 kB
Inactive:         585940 kB
Active(anon):    2264636 kB
Inactive(anon):    21876 kB
Active(file):     168696 kB
Inactive(file):   564064 kB
Unevictable:        8656 kB
Mlocked:            8656 kB
SwapTotal:      67108856 kB
SwapFree:       67097164 kB
Dirty:             10104 kB
Writeback:             0 kB
AnonPages:       2285196 kB
Mapped:            11424 kB
Shmem:                 0 kB
Slab:             614540 kB
SReclaimable:      55748 kB
SUnreclaim:       558792 kB
KernelStack:        1480 kB
PageTables:         8372 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545776 kB
Committed_AS:    2524068 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346368 kB
VmallocChunk:   34341987984 kB
HardwareCorrupted:     0 kB
AnonHugePages:   1560576 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7872 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 71124 MiB
End job on node102 at 2012-06-03 02:20:39