Trace number 1868305

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
SCIPclp SCIP 1.1.0.7 with CLP 1.8.2SAT 3.14252 3.14344

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/
namasivayam/tsp/normalized-t3002.11tsp11.1900670756.opb
MD5SUM11371eec29d871c470e0cb7778802319
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.065989
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables231
Total number of constraints2707
Number of constraints which are clauses2684
Number of constraints which are cardinality constraints (but not clauses)22
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint110
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 25
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 683
Number of bits of the biggest sum of numbers10
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.05	c SCIP version 1.1.0.7
0.00/0.05	c LP-Solver Clp 1.8.2
0.00/0.05	c user parameter file <scip.set> not found - using default parameters
0.00/0.05	c read problem <HOME/instance-1868305-1245120362.opb>
0.00/0.05	c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.06	c No objective function, only one solution is needed.
0.00/0.06	c start presolving problem
0.00/0.06	c presolving:
0.09/0.10	c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.11	c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.12	c presolving (3 rounds):
0.09/0.12	c  0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12	c  242 implications, 22 cliques
0.09/0.12	c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.12	c       1 constraints of type <knapsack>
0.09/0.12	c      22 constraints of type <setppc>
0.09/0.12	c    2541 constraints of type <logicor>
0.09/0.12	c transformed objective value is always integral (scale: 1)
0.09/0.12	c Presolving Time: 0.05
0.09/0.12	c SATUNSAT-LIN
0.09/0.12	c -----------------------------------------------------------------------------------------------
0.09/0.12	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12	c separating/flowcover/freq = c -1
0.09/0.12	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12	c separating/cmir/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/veclendiving/freq = c -1
0.09/0.12	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12	c heuristics/simplerounding/freq = c -1
0.09/0.12	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/shifting/freq = c -1
0.09/0.12	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12	c heuristics/rounding/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12	c heuristics/rootsoldiving/freq = c -1
0.09/0.12	c # number of nodes added to the contingent of the total nodes
0.09/0.12	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12	c heuristics/rens/nodesofs = c 2000
0.09/0.12	c # minimum percentage of integer variables that have to be fixable 
0.09/0.12	c # [type: real, range: [0,1], default: 0.5]
0.09/0.12	c heuristics/rens/minfixingrate = c 0.3
0.09/0.12	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12	c heuristics/rens/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/pscostdiving/freq = c -1
0.09/0.12	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12	c heuristics/oneopt/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12	c # [type: real, range: [0,1], default: 0.01]
0.09/0.12	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12	c heuristics/objpscostdiving/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/linesearchdiving/freq = c -1
0.09/0.12	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/intshifting/freq = c -1
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12	c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/guideddiving/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/fracdiving/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12	c heuristics/feaspump/freq = c -1
0.09/0.12	c # minimum percentage of integer variables that have to be fixed 
0.09/0.12	c # [type: real, range: [0,1], default: 0.666]
0.09/0.12	c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12	c # [type: real, range: [0,1], default: 0.1]
0.09/0.12	c heuristics/crossover/nodesquot = c 0.15
0.09/0.12	c # number of nodes without incumbent change that heuristic should wait
0.09/0.12	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12	c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12	c # number of nodes added to the contingent of the total nodes
0.09/0.12	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12	c heuristics/crossover/nodesofs = c 750
0.09/0.12	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12	c heuristics/crossover/freq = c -1
0.09/0.12	c # additional number of allowed LP iterations
0.09/0.12	c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12	c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12	c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12	c heuristics/coefdiving/freq = c -1
0.09/0.12	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12	c presolving/probing/maxrounds = c 0
0.09/0.12	c # should presolving try to simplify knapsacks
0.09/0.12	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12	c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12	c constraints/knapsack/disaggregation = c FALSE
0.09/0.12	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12	c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12	c # should presolving try to simplify inequalities
0.09/0.12	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12	c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12	c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12	c separating/maxroundsroot = c 5
0.09/0.12	c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12	c separating/maxrounds = c 1
0.09/0.12	c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12	c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12	c limits/solutions = c 1
0.09/0.12	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12	c limits/memory = c 1620
0.09/0.12	c # maximal time in seconds to run
0.09/0.12	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12	c limits/time = c 1791
0.09/0.12	c # frequency for displaying node information lines
0.09/0.12	c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12	c display/freq = c 10000
0.09/0.12	c -----------------------------------------------------------------------------------------------
0.09/0.12	c start solving problem
0.09/0.12	c 
0.09/0.14	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.09/0.14	c   0.1s|     1 |     0 |    57 |3513k|   0 |  31 | 231 |2564 |2564 | 231 |2564 |   0 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.19/0.25	c   0.2s|     1 |     0 |   126 |3625k|   0 |  49 | 231 |2564 |2564 | 231 |2572 |   8 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.29/0.39	c   0.3s|     1 |     0 |   232 |3792k|   0 |  54 | 231 |2564 |2564 | 231 |2578 |  14 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.49/0.59	c   0.5s|     1 |     0 |   490 |3935k|   0 |  54 | 231 |2564 |2564 | 231 |2584 |  20 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.69/0.75	c   0.7s|     1 |     0 |   725 |4069k|   0 |  50 | 231 |2564 |2564 | 231 |2589 |  25 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
0.89/0.91	c   0.8s|     1 |     0 |   896 |4259k|   0 |  52 | 231 |2564 |2564 | 231 |2594 |  30 |   0 |   0 | 1.100000e+01 |      --      |    Inf 
1.89/1.91	c   1.8s|     1 |     2 |   896 |4259k|   0 |  52 | 231 |2564 |2564 | 231 |2594 |  30 |   0 |  20 | 1.100000e+01 |      --      |    Inf 
3.09/3.12	c * 3.0s|     5 |     4 |  1204 |4346k|   4 |   - | 231 |2564 |1852 | 231 |2569 |  30 |   0 | 123 | 1.100000e+01 | 2.200000e+01 | 100.00%
3.09/3.12	c 
3.09/3.12	c SCIP Status        : solving was interrupted [solution limit reached]
3.09/3.12	c Solving Time (sec) : 3.03
3.09/3.12	c Solving Nodes      : 5
3.09/3.12	c Primal Bound       : +2.20000000000000e+01 (1 solutions)
3.09/3.12	c Dual Bound         : +1.10000000000000e+01
3.09/3.12	c Gap                : 100.00 %
3.09/3.12	c NODE         5
3.09/3.12	c DUAL BOUND   11
3.09/3.12	c PRIMAL BOUND 22
3.09/3.12	c GAP          1
3.09/3.12	s SATISFIABLE
3.09/3.12	v -x221 -x211 x201 -x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 x160 -x150 -x140 -x130 -x230 -x220 
3.09/3.12	v -x199 x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 x148 -x138 -x128 -x228 -x218 -x208 
3.09/3.12	v -x198 x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 -x156 -x146 x136 -x126 x226 -x216 -x206 -x196 
3.09/3.12	v -x186 -x176 -x155 -x145 -x135 -x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 -x184 
3.09/3.12	v -x174 -x164 -x154 -x133 x123 -x223 -x213 -x203 -x193 -x183 -x173 x163 -x153 -x143 -x122 -x222 x212 -x202 -x192 -x182 -x172 -x162 
3.09/3.12	v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 x109 -x108 -x107 -x106 -x105 -x104 
3.09/3.12	v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82 -x81 -x80 
3.09/3.12	v -x79 -x78 -x77 -x76 -x75 -x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 
3.09/3.12	v -x53 -x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 x33 -x32 -x31 -x30 -x29 
3.09/3.12	v -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x11 -x21 -x10 -x20 -x9 x19 -x8 -x18 -x7 -x17 -x6 -x16 -x5 -x15 -x4 -x14 x3 -x13 -x2 -x12 
3.09/3.12	v -x1 
3.09/3.12	c SCIP Status        : solving was interrupted [solution limit reached]
3.09/3.12	c Solving Time       :       3.03
3.09/3.12	c Original Problem   :
3.09/3.12	c   Problem name     : HOME/instance-1868305-1245120362.opb
3.09/3.12	c   Variables        : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.12	c   Constraints      : 2707 initial, 2707 maximal
3.09/3.12	c Presolved Problem  :
3.09/3.12	c   Problem name     : t_HOME/instance-1868305-1245120362.opb
3.09/3.12	c   Variables        : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.12	c   Constraints      : 2564 initial, 2564 maximal
3.09/3.12	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
3.09/3.12	c   trivial          :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   implics          :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   probing          :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   setppc           :       0.00          0          0          0          0          0          0          0          0
3.09/3.12	c   linear           :       0.03          0          0          0          0          0        143          0          0
3.09/3.12	c   logicor          :       0.02          0          0          0          0          0          0          0          0
3.09/3.12	c   root node        :          -          0          -          -          0          -          -          -          -
3.09/3.12	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
3.09/3.12	c   integral         :          0          0          0         10          0          0         20          0          0          8
3.09/3.12	c   knapsack         :          1          5         16          1          0          0          0          0          0          0
3.09/3.12	c   setppc           :         22          5         16          1          0          0         73          0          0          0
3.09/3.12	c   logicor          :       2541          5         15          1          0          0         25          0          0          0
3.09/3.12	c   countsols        :          0          0          0          1          0          0          0          0          0          0
3.09/3.12	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
3.09/3.12	c   integral         :       2.10       0.00       0.00       2.10       0.00
3.09/3.12	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
3.09/3.12	c   setppc           :       0.00       0.00       0.00       0.00       0.00
3.09/3.12	c   logicor          :       0.01       0.00       0.01       0.00       0.00
3.09/3.12	c   countsols        :       0.00       0.00       0.00       0.00       0.00
3.09/3.12	c Propagators        :       Time      Calls    Cutoffs    DomReds
3.09/3.12	c   rootredcost      :       0.00          0          0          0
3.09/3.12	c   pseudoobj        :       0.00         17          0          0
3.09/3.12	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
3.09/3.12	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
3.09/3.12	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
3.09/3.12	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
3.09/3.12	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
3.09/3.12	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
3.09/3.12	c   applied globally :          -          -          -          0        0.0          -          -          -
3.09/3.12	c   applied locally  :          -          -          -          0        0.0          -          -          -
3.09/3.12	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
3.09/3.12	c   cut pool         :       0.00          4          -          -          0          -    (maximal pool size: 438)
3.09/3.12	c   redcost          :       0.00          9          0          0          0          0
3.09/3.12	c   impliedbounds    :       0.00          5          0          0          0          0
3.09/3.12	c   intobj           :       0.00          0          0          0          0          0
3.09/3.12	c   gomory           :       0.25          5          0          0       2500          0
3.09/3.12	c   strongcg         :       0.22          5          0          0       2500          0
3.09/3.12	c   cmir             :       0.00          0          0          0          0          0
3.09/3.12	c   flowcover        :       0.00          0          0          0          0          0
3.09/3.12	c   clique           :       0.00          5          0          0          0          0
3.09/3.12	c   zerohalf         :       0.00          0          0          0          0          0
3.09/3.12	c   mcf              :       0.01          1          0          0          0          0
3.09/3.12	c Pricers            :       Time      Calls       Vars
3.09/3.12	c   problem variables:       0.00          0          0
3.09/3.12	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
3.09/3.12	c   relpscost        :       2.10          9          0         20          0          0          8
3.09/3.12	c   pscost           :       0.00          0          0          0          0          0          0
3.09/3.12	c   inference        :       0.00          0          0          0          0          0          0
3.09/3.12	c   mostinf          :       0.00          0          0          0          0          0          0
3.09/3.12	c   leastinf         :       0.00          0          0          0          0          0          0
3.09/3.12	c   fullstrong       :       0.00          0          0          0          0          0          0
3.09/3.12	c   allfullstrong    :       0.00          0          0          0          0          0          0
3.09/3.12	c   random           :       0.00          0          0          0          0          0          0
3.09/3.12	c Primal Heuristics  :       Time      Calls      Found
3.09/3.12	c   LP solutions     :       0.00          -          1
3.09/3.12	c   pseudo solutions :       0.00          -          0
3.09/3.12	c   simplerounding   :       0.00          0          0
3.09/3.12	c   rounding         :       0.00          0          0
3.09/3.12	c   shifting         :       0.00          0          0
3.09/3.12	c   intshifting      :       0.00          0          0
3.09/3.12	c   oneopt           :       0.00          0          0
3.09/3.12	c   fixandinfer      :       0.00          0          0
3.09/3.12	c   feaspump         :       0.00          0          0
3.09/3.12	c   coefdiving       :       0.00          0          0
3.09/3.12	c   pscostdiving     :       0.00          0          0
3.09/3.12	c   fracdiving       :       0.00          0          0
3.09/3.12	c   veclendiving     :       0.00          0          0
3.09/3.12	c   intdiving        :       0.00          0          0
3.09/3.12	c   actconsdiving    :       0.00          0          0
3.09/3.12	c   objpscostdiving  :       0.00          0          0
3.09/3.12	c   rootsoldiving    :       0.00          0          0
3.09/3.12	c   linesearchdiving :       0.00          0          0
3.09/3.12	c   guideddiving     :       0.00          0          0
3.09/3.12	c   octane           :       0.00          0          0
3.09/3.12	c   rens             :       0.00          0          0
3.09/3.12	c   rins             :       0.00          0          0
3.09/3.12	c   localbranching   :       0.00          0          0
3.09/3.12	c   mutation         :       0.00          0          0
3.09/3.12	c   crossover        :       0.00          0          0
3.09/3.12	c   dins             :       0.00          0          0
3.09/3.12	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
3.09/3.12	c   primal LP        :       0.01          0          0       0.00       0.00
3.09/3.12	c   dual LP          :       0.35         15       1204      80.27    3440.00
3.09/3.12	c   barrier LP       :       0.00          0          0       0.00          -
3.09/3.12	c   diving/probing LP:       0.00          0          0       0.00          -
3.09/3.12	c   strong branching :       2.10        123       7420      60.33    3533.33
3.09/3.12	c     (at root node) :          -         20       2952     147.60          -
3.09/3.12	c   conflict analysis:       0.00          0          0       0.00          -
3.09/3.12	c B&B Tree           :
3.09/3.12	c   number of runs   :          1
3.09/3.12	c   nodes            :          5
3.09/3.12	c   nodes (total)    :          5
3.09/3.12	c   nodes left       :          4
3.09/3.12	c   max depth        :          4
3.09/3.12	c   max depth (total):          4
3.09/3.12	c   backtracks       :          0 (0.0%)
3.09/3.12	c   delayed cutoffs  :          0
3.09/3.12	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
3.09/3.12	c   avg switch length:       1.00
3.09/3.12	c   switching time   :       0.01
3.09/3.12	c Solution           :
3.09/3.12	c   Solutions found  :          1 (1 improvements)
3.09/3.12	c   Primal Bound     : +2.20000000000000e+01   (in run 1, after 5 nodes, 3.03 seconds, depth 4, found by <relaxation>)
3.09/3.12	c   Dual Bound       : +1.10000000000000e+01
3.09/3.12	c   Gap              :     100.00 %
3.09/3.12	c   Root Dual Bound  : +1.10000000000000e+01
3.09/3.14	c Time complete: 3.13.

Verifier Data 

OK	0

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-1868305-1245120362/watcher-1868305-1245120362 -o /tmp/evaluation-result-1868305-1245120362/solver-1868305-1245120362 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1868305-1245120362.opb 

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


[startup+0 s]
/proc/loadavg: 0.95 0.98 0.99 3/64 911
/proc/meminfo: memFree=1277856/2055920 swapFree=4182564/4192956
[pid=911] ppid=909 vsize=5812 CPUtime=0
/proc/911/stat : 911 (pbscip.linux.x8) R 909 911 32622 0 -1 4194304 521 0 0 0 0 0 0 0 18 0 1 0 179636387 5951488 505 1992294400 4194304 9342243 548682068736 18446744073709551615 8143668 0 0 4096 0 0 0 0 17 1 0 0
/proc/911/statm: 1454 516 345 1256 0 193 0

[startup+0.062374 s]
/proc/loadavg: 0.95 0.98 0.99 3/64 911
/proc/meminfo: memFree=1277856/2055920 swapFree=4182564/4192956
[pid=911] ppid=909 vsize=16580 CPUtime=0.06
/proc/911/stat : 911 (pbscip.linux.x8) R 909 911 32622 0 -1 4194304 3281 0 0 0 5 1 0 0 18 0 1 0 179636387 16977920 2911 1992294400 4194304 9342243 548682068736 18446744073709551615 5062816 0 0 4096 16384 0 0 0 17 1 0 0
/proc/911/statm: 4145 2921 459 1256 0 2884 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 16580

[startup+0.101374 s]
/proc/loadavg: 0.95 0.98 0.99 3/64 911
/proc/meminfo: memFree=1277856/2055920 swapFree=4182564/4192956
[pid=911] ppid=909 vsize=18752 CPUtime=0.09
/proc/911/stat : 911 (pbscip.linux.x8) R 909 911 32622 0 -1 4194304 3847 0 0 0 8 1 0 0 18 0 1 0 179636387 19202048 3477 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/911/statm: 4688 3477 471 1256 0 3427 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 18752

[startup+0.301386 s]
/proc/loadavg: 0.95 0.98 0.99 3/64 911
/proc/meminfo: memFree=1277856/2055920 swapFree=4182564/4192956
[pid=911] ppid=909 vsize=24820 CPUtime=0.29
/proc/911/stat : 911 (pbscip.linux.x8) R 909 911 32622 0 -1 4194304 5164 0 0 0 27 2 0 0 18 0 1 0 179636387 25415680 4794 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/911/statm: 6205 4794 649 1256 0 4944 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 24820

[startup+0.701423 s]
/proc/loadavg: 0.95 0.98 0.99 3/64 911
/proc/meminfo: memFree=1277856/2055920 swapFree=4182564/4192956
[pid=911] ppid=909 vsize=27960 CPUtime=0.69
/proc/911/stat : 911 (pbscip.linux.x8) R 909 911 32622 0 -1 4194304 5938 0 0 0 66 3 0 0 21 0 1 0 179636387 28631040 5568 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/911/statm: 6990 5568 649 1256 0 5729 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 27960

[startup+1.5015 s]
/proc/loadavg: 0.95 0.98 0.99 2/65 912
/proc/meminfo: memFree=1257560/2055920 swapFree=4182564/4192956
[pid=911] ppid=909 vsize=30412 CPUtime=1.49
/proc/911/stat : 911 (pbscip.linux.x8) R 909 911 32622 0 -1 4194304 6252 0 0 0 146 3 0 0 25 0 1 0 179636387 31141888 5689 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/911/statm: 7603 5689 654 1256 0 6342 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 30412

[startup+3.10165 s]
/proc/loadavg: 0.95 0.98 0.99 2/65 912
/proc/meminfo: memFree=1257240/2055920 swapFree=4182564/4192956
[pid=911] ppid=909 vsize=30640 CPUtime=3.09
/proc/911/stat : 911 (pbscip.linux.x8) R 909 911 32622 0 -1 4194304 10849 0 0 0 305 4 0 0 25 0 1 0 179636387 31375360 5752 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/911/statm: 7660 5752 670 1256 0 6399 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 30640

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

Child status: 0
Real time (s): 3.14344
CPU time (s): 3.14252
CPU user time (s): 3.08753
CPU system time (s): 0.054991
CPU usage (%): 99.9706
Max. virtual memory (cumulated for all children) (KiB): 30664

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

runsolver used 0.005999 second user time and 0.015997 second system time

The end

Launcher Data 

Begin job on node18 at 2009-06-16 04:46:02
IDJOB=1868305
IDBENCH=1319
IDSOLVER=684
FILE ID=node18/1868305-1245120362
PBS_JOBID= 9363673
Free space on /tmp= 66172 MiB

SOLVER NAME= SCIPclp SCIP 1.1.0.7 with CLP 1.8.2
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/tsp/normalized-t3002.11tsp11.1900670756.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-1868305-1245120362/watcher-1868305-1245120362 -o /tmp/evaluation-result-1868305-1245120362/solver-1868305-1245120362 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1868305-1245120362.opb

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= 11371eec29d871c470e0cb7778802319
RANDOM SEED=1026599873

node18.alineos.net Linux 2.6.9-22.EL.rootsmp #1 SMP Mon Oct 3 08:59:52 CEST 2005

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.236
cache size	: 2048 KB
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5914.62
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.236
cache size	: 2048 KB
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5586.94
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2055920 kB
MemFree:       1278272 kB
Buffers:         77368 kB
Cached:         618024 kB
SwapCached:       4192 kB
Active:          54896 kB
Inactive:       647840 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1278272 kB
SwapTotal:     4192956 kB
SwapFree:      4182564 kB
Dirty:           12020 kB
Writeback:           0 kB
Mapped:          13052 kB
Slab:            60928 kB
Committed_AS:   135808 kB
PageTables:       1376 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264952 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66164 MiB
End job on node18 at 2009-06-16 04:46:05