Trace number 1868135

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 1.19982 1.20045

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111222248.opb
MD5SUMa1b7d9ff85f22909961574d8ed062292
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.165974
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables169
Total number of constraints101
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1127
Number of bits of the biggest sum of numbers11
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.01	c SCIP version 1.1.0.7
0.00/0.01	c LP-Solver Clp 1.8.2
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c read problem <HOME/instance-1868135-1245115803.opb>
0.00/0.01	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c start presolving problem
0.00/0.01	c presolving:
0.00/0.02	c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02	c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02	c presolving (3 rounds):
0.00/0.02	c  0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02	c  8 implications, 68 cliques
0.00/0.02	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02	c       1 constraints of type <knapsack>
0.00/0.02	c      68 constraints of type <setppc>
0.00/0.02	c       4 constraints of type <logicor>
0.00/0.02	c transformed objective value is always integral (scale: 1)
0.00/0.02	c Presolving Time: 0.01
0.00/0.02	c SATUNSAT-LIN
0.00/0.02	c -----------------------------------------------------------------------------------------------
0.00/0.02	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/flowcover/freq = c -1
0.00/0.02	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/cmir/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/veclendiving/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/simplerounding/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/shifting/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/rounding/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/rootsoldiving/freq = c -1
0.00/0.02	c # number of nodes added to the contingent of the total nodes
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02	c heuristics/rens/nodesofs = c 2000
0.00/0.02	c # minimum percentage of integer variables that have to be fixable 
0.00/0.02	c # [type: real, range: [0,1], default: 0.5]
0.00/0.02	c heuristics/rens/minfixingrate = c 0.3
0.00/0.02	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/rens/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/pscostdiving/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/oneopt/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02	c # [type: real, range: [0,1], default: 0.01]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/objpscostdiving/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/linesearchdiving/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/intshifting/freq = c -1
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/guideddiving/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/fracdiving/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/feaspump/freq = c -1
0.00/0.02	c # minimum percentage of integer variables that have to be fixed 
0.00/0.02	c # [type: real, range: [0,1], default: 0.666]
0.00/0.02	c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02	c # [type: real, range: [0,1], default: 0.1]
0.00/0.02	c heuristics/crossover/nodesquot = c 0.15
0.00/0.02	c # number of nodes without incumbent change that heuristic should wait
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02	c heuristics/crossover/nwaitingnodes = c 100
0.00/0.02	c # number of nodes added to the contingent of the total nodes
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02	c heuristics/crossover/nodesofs = c 750
0.00/0.02	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02	c heuristics/crossover/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/coefdiving/freq = c -1
0.00/0.02	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c presolving/probing/maxrounds = c 0
0.00/0.02	c # should presolving try to simplify knapsacks
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.02	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02	c constraints/knapsack/disaggregation = c FALSE
0.00/0.02	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c constraints/knapsack/maxnumcardlift = c 0
0.00/0.02	c # should presolving try to simplify inequalities
0.00/0.02	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02	c constraints/linear/simplifyinequalities = c TRUE
0.00/0.02	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c separating/maxroundsroot = c 5
0.00/0.02	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02	c separating/maxrounds = c 1
0.00/0.02	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02	c limits/solutions = c 1
0.00/0.02	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02	c limits/memory = c 1620
0.00/0.02	c # maximal time in seconds to run
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02	c limits/time = c 1791
0.00/0.02	c # frequency for displaying node information lines
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02	c display/freq = c 10000
0.00/0.02	c -----------------------------------------------------------------------------------------------
0.00/0.02	c start solving problem
0.00/0.02	c 
0.00/0.03	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.03	c   0.0s|     1 |     0 |    47 | 593k|   0 |  39 | 169 |  73 |  73 | 169 |  73 |   0 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.03/0.05	c   0.0s|     1 |     0 |    79 | 821k|   0 |  58 | 169 |  73 |  73 | 169 |  99 |  26 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.03/0.07	c   0.1s|     1 |     0 |   159 | 830k|   0 |  68 | 169 |  73 |  73 | 169 | 106 |  33 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |   191 | 833k|   0 |  71 | 169 |  73 |  73 | 169 | 109 |  36 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.12	c   0.1s|     1 |     0 |   196 | 834k|   0 |  72 | 169 |  73 |  73 | 169 | 110 |  37 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.15	c   0.1s|     1 |     0 |   199 | 835k|   0 |  73 | 169 |  73 |  73 | 169 | 111 |  38 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.49/0.53	c   0.5s|     1 |     2 |   199 | 835k|   0 |  73 | 169 |  73 |  73 | 169 | 111 |  38 |   0 |  33 | 1.300000e+01 |      --      |    Inf 
1.09/1.19	c * 1.2s|     5 |     0 |   531 | 878k|   3 |   - | 169 |  73 |  54 | 169 | 103 |  38 |   0 | 149 | 1.300000e+01 | 1.300000e+01 |   0.00%
1.09/1.19	c 
1.09/1.19	c SCIP Status        : problem is solved [optimal solution found]
1.09/1.19	c Solving Time (sec) : 1.16
1.09/1.19	c Solving Nodes      : 5
1.09/1.19	c Primal Bound       : +1.30000000000000e+01 (1 solutions)
1.09/1.19	c Dual Bound         : +1.30000000000000e+01
1.09/1.19	c Gap                : 0.00 %
1.09/1.19	c NODE         5
1.09/1.19	c DUAL BOUND   13
1.09/1.19	c PRIMAL BOUND 13
1.09/1.19	c GAP          0
1.09/1.19	s SATISFIABLE
1.09/1.19	v -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148 
1.09/1.19	v -x147 -x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 
1.09/1.19	v -x126 -x125 -x124 -x123 -x122 x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 
1.09/1.19	v x105 -x104 -x103 -x102 -x101 -x100 x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 
1.09/1.19	v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 x58 -x57 -x56 
1.09/1.19	v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 
1.09/1.19	v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 
1.09/1.19	v -x4 -x3 -x2 -x1 
1.09/1.19	c SCIP Status        : problem is solved [optimal solution found]
1.09/1.19	c Solving Time       :       1.16
1.09/1.19	c Original Problem   :
1.09/1.19	c   Problem name     : HOME/instance-1868135-1245115803.opb
1.09/1.19	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.19	c   Constraints      : 101 initial, 101 maximal
1.09/1.19	c Presolved Problem  :
1.09/1.19	c   Problem name     : t_HOME/instance-1868135-1245115803.opb
1.09/1.19	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.09/1.19	c   Constraints      : 73 initial, 73 maximal
1.09/1.19	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.09/1.19	c   trivial          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   setppc           :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   linear           :       0.01          0          0          0          0          0         28          0          0
1.09/1.19	c   logicor          :       0.00          0          0          0          0          0          0          0          0
1.09/1.19	c   root node        :          -          0          -          -          0          -          -          -          -
1.09/1.19	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.09/1.19	c   integral         :          0          0          0          9          0          1         16          0          0          6
1.09/1.19	c   knapsack         :          1          5         13          1          0          0          0          0          0          0
1.09/1.19	c   setppc           :         68          5         13          1          0          0        129          0          0          0
1.09/1.19	c   logicor          :          4          5          2          1          0          0          0          0          0          0
1.09/1.19	c   countsols        :          0          0          0          1          0          0          0          0          0          0
1.09/1.19	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.09/1.19	c   integral         :       1.01       0.00       0.00       1.01       0.00
1.09/1.19	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
1.09/1.19	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.09/1.19	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.09/1.19	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.09/1.19	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.09/1.19	c   rootredcost      :       0.00          0          0          0
1.09/1.19	c   pseudoobj        :       0.00         14          0          0
1.09/1.19	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.09/1.19	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.09/1.19	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.09/1.19	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.09/1.19	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.09/1.19	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.09/1.19	c   applied globally :          -          -          -          0        0.0          -          -          -
1.09/1.19	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.09/1.19	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.09/1.19	c   cut pool         :       0.00          4          -          -          6          -    (maximal pool size: 78)
1.09/1.19	c   redcost          :       0.00          9          0          0          0          0
1.09/1.19	c   impliedbounds    :       0.00          5          0          0          0          0
1.09/1.19	c   intobj           :       0.00          0          0          0          0          0
1.09/1.19	c   gomory           :       0.05          5          0          0         18          0
1.09/1.19	c   strongcg         :       0.04          5          0          0         56          0
1.09/1.19	c   cmir             :       0.00          0          0          0          0          0
1.09/1.19	c   flowcover        :       0.00          0          0          0          0          0
1.09/1.19	c   clique           :       0.01          5          0          0         12          0
1.09/1.19	c   zerohalf         :       0.00          0          0          0          0          0
1.09/1.19	c   mcf              :       0.00          1          0          0          0          0
1.09/1.19	c Pricers            :       Time      Calls       Vars
1.09/1.19	c   problem variables:       0.00          0          0
1.09/1.19	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.09/1.19	c   relpscost        :       1.01          8          1         16          0          0          6
1.09/1.19	c   pscost           :       0.00          0          0          0          0          0          0
1.09/1.19	c   inference        :       0.00          0          0          0          0          0          0
1.09/1.19	c   mostinf          :       0.00          0          0          0          0          0          0
1.09/1.19	c   leastinf         :       0.00          0          0          0          0          0          0
1.09/1.19	c   fullstrong       :       0.00          0          0          0          0          0          0
1.09/1.19	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.09/1.19	c   random           :       0.00          0          0          0          0          0          0
1.09/1.19	c Primal Heuristics  :       Time      Calls      Found
1.09/1.19	c   LP solutions     :       0.00          -          1
1.09/1.19	c   pseudo solutions :       0.00          -          0
1.09/1.19	c   simplerounding   :       0.00          0          0
1.09/1.19	c   rounding         :       0.00          0          0
1.09/1.19	c   shifting         :       0.00          0          0
1.09/1.19	c   intshifting      :       0.00          0          0
1.09/1.19	c   oneopt           :       0.00          0          0
1.09/1.19	c   fixandinfer      :       0.00          0          0
1.09/1.19	c   feaspump         :       0.00          0          0
1.09/1.19	c   coefdiving       :       0.00          0          0
1.09/1.19	c   pscostdiving     :       0.00          0          0
1.09/1.19	c   fracdiving       :       0.00          0          0
1.09/1.19	c   veclendiving     :       0.00          0          0
1.09/1.19	c   intdiving        :       0.00          0          0
1.09/1.19	c   actconsdiving    :       0.00          0          0
1.09/1.19	c   objpscostdiving  :       0.00          0          0
1.09/1.19	c   rootsoldiving    :       0.00          0          0
1.09/1.19	c   linesearchdiving :       0.00          0          0
1.09/1.19	c   guideddiving     :       0.00          0          0
1.09/1.19	c   octane           :       0.00          0          0
1.09/1.19	c   rens             :       0.00          0          0
1.09/1.19	c   rins             :       0.00          0          0
1.09/1.19	c   localbranching   :       0.00          0          0
1.09/1.19	c   mutation         :       0.00          0          0
1.09/1.19	c   crossover        :       0.00          0          0
1.09/1.19	c   dins             :       0.00          0          0
1.09/1.19	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.09/1.19	c   primal LP        :       0.00          0          0       0.00          -
1.09/1.19	c   dual LP          :       0.04         14        531      37.93   13275.00
1.09/1.19	c   barrier LP       :       0.00          0          0       0.00          -
1.09/1.19	c   diving/probing LP:       0.00          0          0       0.00          -
1.09/1.19	c   strong branching :       1.01        149      15228     102.20   15077.23
1.09/1.19	c     (at root node) :          -         33       4900     148.48          -
1.09/1.19	c   conflict analysis:       0.00          0          0       0.00          -
1.09/1.19	c B&B Tree           :
1.09/1.19	c   number of runs   :          1
1.09/1.19	c   nodes            :          5
1.09/1.19	c   nodes (total)    :          5
1.09/1.19	c   nodes left       :          0
1.09/1.19	c   max depth        :          3
1.09/1.19	c   max depth (total):          3
1.09/1.19	c   backtracks       :          0 (0.0%)
1.09/1.19	c   delayed cutoffs  :          0
1.09/1.19	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.09/1.19	c   avg switch length:       2.00
1.09/1.19	c   switching time   :       0.00
1.09/1.19	c Solution           :
1.09/1.19	c   Solutions found  :          1 (1 improvements)
1.09/1.19	c   Primal Bound     : +1.30000000000000e+01   (in run 1, after 5 nodes, 1.16 seconds, depth 3, found by <relaxation>)
1.09/1.19	c   Dual Bound       : +1.30000000000000e+01
1.09/1.19	c   Gap              :       0.00 %
1.09/1.19	c   Root Dual Bound  : +1.30000000000000e+01
1.09/1.19	c Time complete: 1.19.

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-1868135-1245115803/watcher-1868135-1245115803 -o /tmp/evaluation-result-1868135-1245115803/solver-1868135-1245115803 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1868135-1245115803.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: 1.06 1.02 1.03 3/64 32528
/proc/meminfo: memFree=1077232/2055920 swapFree=4192812/4192956
[pid=32528] ppid=32526 vsize=5812 CPUtime=0
/proc/32528/stat : 32528 (pbscip.linux.x8) R 32526 32528 31844 0 -1 4194304 515 0 0 0 0 0 0 0 18 0 1 0 179177669 5951488 500 1992294400 4194304 9342243 548682068736 18446744073709551615 8223232 0 0 4096 0 0 0 0 17 1 0 0
/proc/32528/statm: 1453 501 332 1256 0 192 0

[startup+0.0332501 s]
/proc/loadavg: 1.06 1.02 1.03 3/64 32528
/proc/meminfo: memFree=1077232/2055920 swapFree=4192812/4192956
[pid=32528] ppid=32526 vsize=14852 CPUtime=0.03
/proc/32528/stat : 32528 (pbscip.linux.x8) R 32526 32528 31844 0 -1 4194304 2974 0 0 0 2 1 0 0 16 0 1 0 179177669 15208448 2604 1992294400 4194304 9342243 548682068736 18446744073709551615 8300202 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32528/statm: 3713 2604 636 1256 0 2452 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 14852

[startup+0.101256 s]
/proc/loadavg: 1.06 1.02 1.03 3/64 32528
/proc/meminfo: memFree=1077232/2055920 swapFree=4192812/4192956
[pid=32528] ppid=32526 vsize=15944 CPUtime=0.09
/proc/32528/stat : 32528 (pbscip.linux.x8) R 32526 32528 31844 0 -1 4194304 3222 0 0 0 8 1 0 0 17 0 1 0 179177669 16326656 2851 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32528/statm: 3986 2851 650 1256 0 2725 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 15944

[startup+0.301275 s]
/proc/loadavg: 1.06 1.02 1.03 3/64 32528
/proc/meminfo: memFree=1077232/2055920 swapFree=4192812/4192956
[pid=32528] ppid=32526 vsize=17252 CPUtime=0.29
/proc/32528/stat : 32528 (pbscip.linux.x8) R 32526 32528 31844 0 -1 4194304 3287 0 0 0 28 1 0 0 18 0 1 0 179177669 17666048 2915 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32528/statm: 4313 2915 655 1256 0 3052 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 17252

[startup+0.701315 s]
/proc/loadavg: 1.06 1.02 1.03 3/64 32528
/proc/meminfo: memFree=1077232/2055920 swapFree=4192812/4192956
[pid=32528] ppid=32526 vsize=17252 CPUtime=0.69
/proc/32528/stat : 32528 (pbscip.linux.x8) R 32526 32528 31844 0 -1 4194304 3329 0 0 0 67 2 0 0 21 0 1 0 179177669 17666048 2957 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32528/statm: 4313 2957 671 1256 0 3052 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 17252

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

[startup+1.10536 s]
/proc/loadavg: 1.06 1.01 1.03 2/65 32529
/proc/meminfo: memFree=1067880/2055920 swapFree=4192812/4192956
[pid=32528] ppid=32526 vsize=17420 CPUtime=1.09
/proc/32528/stat : 32528 (pbscip.linux.x8) R 32526 32528 31844 0 -1 4194304 3359 0 0 0 107 2 0 0 25 0 1 0 179177669 17838080 2987 1992294400 4194304 9342243 548682068736 18446744073709551615 8308455 0 0 4096 16384 0 0 0 17 1 0 0
/proc/32528/statm: 4355 2987 671 1256 0 3094 0
Current children cumulated CPU time (s) 1.09
Current children cumulated vsize (KiB) 17420

Child status: 0
Real time (s): 1.20045
CPU time (s): 1.19982
CPU user time (s): 1.16882
CPU system time (s): 0.030995
CPU usage (%): 99.9473
Max. virtual memory (cumulated for all children) (KiB): 17420

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

runsolver used 0.002999 second user time and 0.013997 second system time

The end

Launcher Data 

Begin job on node36 at 2009-06-16 03:30:04
IDJOB=1868135
IDBENCH=1234
IDSOLVER=684
FILE ID=node36/1868135-1245115803
PBS_JOBID= 9363652
Free space on /tmp= 66200 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/wnqueen/normalized-t2001.13queen13.1111222248.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-1868135-1245115803/watcher-1868135-1245115803 -o /tmp/evaluation-result-1868135-1245115803/solver-1868135-1245115803 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t 1800 -m 1800 -f HOME/instance-1868135-1245115803.opb

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

MD5SUM BENCH= a1b7d9ff85f22909961574d8ed062292
RANDOM SEED=1645577564

node36.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.230
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.230
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:       1077648 kB
Buffers:         32676 kB
Cached:         880632 kB
SwapCached:          0 kB
Active:          78584 kB
Inactive:       848544 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1077648 kB
SwapTotal:     4192956 kB
SwapFree:      4192812 kB
Dirty:           11892 kB
Writeback:           0 kB
Mapped:          23700 kB
Slab:            37176 kB
Committed_AS:   157116 kB
PageTables:       1360 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= 66188 MiB
End job on node36 at 2009-06-16 03:30:05