Trace number 1868036

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
SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)SAT 3.58446 3.58736

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1111226241.opb
MD5SUMb7b312369c912d9a28d0c332b741ce41
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 benchmark1.21781
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 1163
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 SoPlex 1.4.1
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c read problem <HOME/instance-1868036-1245115441.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.03	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/coefdiving/freq = c -1
0.00/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c presolving/probing/maxrounds = c 0
0.00/0.03	c # should presolving try to simplify knapsacks
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03	c constraints/knapsack/disaggregation = c FALSE
0.00/0.03	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c constraints/knapsack/maxnumcardlift = c 0
0.00/0.03	c # should presolving try to simplify inequalities
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/linear/simplifyinequalities = c TRUE
0.00/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/maxroundsroot = c 5
0.00/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03	c separating/maxrounds = c 1
0.00/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c limits/solutions = c 1
0.00/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/memory = c 1620
0.00/0.03	c # maximal time in seconds to run
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/time = c 1791
0.00/0.03	c # frequency for displaying node information lines
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03	c display/freq = c 10000
0.00/0.03	c -----------------------------------------------------------------------------------------------
0.00/0.03	c start solving problem
0.00/0.03	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 |   121 | 593k|   0 |  43 | 169 |  73 |  73 | 169 |  73 |   0 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.05	c   0.0s|     1 |     0 |   149 | 818k|   0 |  52 | 169 |  73 |  73 | 169 |  83 |  10 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.07	c   0.1s|     1 |     0 |   174 |1071k|   0 |  54 | 169 |  73 |  73 | 169 |  88 |  15 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.09	c   0.1s|     1 |     0 |   184 |1306k|   0 |  54 | 169 |  73 |  73 | 169 |  92 |  19 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.11	c   0.1s|     1 |     0 |   221 |1514k|   0 |  54 | 169 |  73 |  73 | 169 |  93 |  20 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.13	c   0.1s|     1 |     0 |   230 |1674k|   0 |  57 | 169 |  73 |  73 | 169 |  98 |  25 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.49/0.56	c   0.5s|     1 |     0 |   236 |1674k|   0 |  57 | 169 |  73 |  73 | 169 |  98 |  25 |   0 |  34 | 1.300000e+01 |      --      |    Inf 
0.69/0.74	c   0.7s|     1 |     0 |   249 |1674k|   0 |  57 | 169 |  73 |  73 | 169 |  98 |  25 |   0 |  46 | 1.300000e+01 |      --      |    Inf 
0.89/0.92	c   0.9s|     1 |     0 |   258 |1674k|   0 |  58 | 169 |  73 |  73 | 169 |  98 |  25 |   0 |  59 | 1.300000e+01 |      --      |    Inf 
0.89/0.99	c   0.9s|     1 |     0 |   266 |1674k|   0 |  56 | 169 |  73 |  73 | 169 |  98 |  25 |   0 |  64 | 1.300000e+01 |      --      |    Inf 
1.00/1.08	c   1.0s|     1 |     0 |   274 |1674k|   0 |  54 | 169 |  72 |  72 | 169 |  98 |  25 |   0 |  70 | 1.300000e+01 |      --      |    Inf 
1.10/1.16	c   1.1s|     1 |     0 |   283 |1673k|   0 |  54 | 169 |  72 |  72 | 169 |  97 |  25 |   0 |  76 | 1.300000e+01 |      --      |    Inf 
1.19/1.23	c   1.2s|     1 |     0 |   291 |1673k|   0 |  54 | 169 |  72 |  72 | 169 |  97 |  25 |   0 |  81 | 1.300000e+01 |      --      |    Inf 
1.29/1.32	c   1.3s|     1 |     0 |   291 |1673k|   0 |   - | 169 |  72 |  72 | 169 |  97 |  25 |   0 |  89 | 1.300000e+01 |      --      |    Inf 
1.29/1.32	c (run 1, node 1) restarting after 36 global fixings of integer variables
1.29/1.32	c 
1.29/1.32	(restart) converted 24 cuts from the global cut pool into linear constraints
1.29/1.32	c 
1.29/1.32	presolving:
1.29/1.33	c (round 1) 36 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 24 upgd conss, 14 impls, 80 clqs
1.29/1.33	c presolving (2 rounds):
1.29/1.33	c  36 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.29/1.33	c  14 implications, 80 cliques
1.29/1.33	c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 95 constraints
1.29/1.33	c       9 constraints of type <knapsack>
1.29/1.33	c      83 constraints of type <setppc>
1.29/1.33	c       3 constraints of type <logicor>
1.29/1.33	c transformed objective value is always integral (scale: 1)
1.29/1.33	c Presolving Time: 0.02
1.29/1.33	c 
1.29/1.34	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.29/1.34	c   1.3s|     1 |     0 |   382 | 724k|   0 |  45 | 133 |  95 |  95 | 133 |  95 |   0 |   0 |  89 | 1.300000e+01 |      --      |    Inf 
1.29/1.36	c   1.3s|     1 |     0 |   408 | 960k|   0 |  52 | 133 |  95 |  95 | 133 | 106 |  11 |   0 |  89 | 1.300000e+01 |      --      |    Inf 
1.59/1.65	c   1.6s|     1 |     0 |   431 | 960k|   0 |  49 | 133 |  95 |  95 | 133 | 106 |  11 |   0 | 127 | 1.300000e+01 |      --      |    Inf 
1.79/1.80	c   1.7s|     1 |     0 |   465 | 959k|   0 |  51 | 133 |  94 |  94 | 133 | 106 |  11 |   0 | 142 | 1.300000e+01 |      --      |    Inf 
1.89/1.92	c   1.9s|     1 |     0 |   483 | 959k|   0 |  53 | 133 |  93 |  93 | 133 | 106 |  11 |   0 | 153 | 1.300000e+01 |      --      |    Inf 
1.89/1.99	c   1.9s|     1 |     0 |   503 | 959k|   0 |  51 | 133 |  93 |  93 | 133 | 106 |  11 |   0 | 160 | 1.300000e+01 |      --      |    Inf 
1.99/2.07	c   2.0s|     1 |     0 |   511 | 959k|   0 |  49 | 133 |  93 |  93 | 133 | 106 |  11 |   0 | 166 | 1.300000e+01 |      --      |    Inf 
2.09/2.15	c   2.1s|     1 |     0 |   511 | 959k|   0 |   - | 133 |  93 |  93 | 133 | 106 |  11 |   0 | 173 | 1.300000e+01 |      --      |    Inf 
2.09/2.15	c (run 2, node 1) restarting after 30 global fixings of integer variables
2.09/2.15	c 
2.09/2.15	(restart) converted 11 cuts from the global cut pool into linear constraints
2.09/2.15	c 
2.09/2.15	presolving:
2.09/2.16	c (round 1) 30 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 22 impls, 79 clqs
2.09/2.16	c (round 2) 30 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 22 impls, 79 clqs
2.09/2.17	c (round 3) 30 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 22 impls, 79 clqs
2.09/2.17	c presolving (4 rounds):
2.09/2.17	c  30 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.09/2.17	c  22 implications, 79 cliques
2.09/2.17	c presolved problem has 103 variables (103 bin, 0 int, 0 impl, 0 cont) and 99 constraints
2.09/2.17	c      15 constraints of type <knapsack>
2.09/2.17	c      82 constraints of type <setppc>
2.09/2.17	c       2 constraints of type <logicor>
2.09/2.17	c transformed objective value is always integral (scale: 1)
2.09/2.17	c Presolving Time: 0.03
2.09/2.17	c 
2.09/2.17	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
2.09/2.17	c   2.1s|     1 |     0 |   590 | 749k|   0 |  46 | 103 |  99 |  99 | 103 |  99 |   0 |   0 | 173 | 1.300000e+01 |      --      |    Inf 
2.09/2.19	c   2.1s|     1 |     0 |   621 | 953k|   0 |  48 | 103 |  99 |  99 | 103 | 110 |  11 |   0 | 173 | 1.300000e+01 |      --      |    Inf 
2.49/2.58	c   2.5s|     1 |     0 |   640 | 953k|   0 |  50 | 103 |  99 |  99 | 103 | 110 |  11 |   0 | 220 | 1.300000e+01 |      --      |    Inf 
2.59/2.66	c   2.6s|     1 |     0 |   656 | 953k|   0 |  48 | 103 |  99 |  99 | 103 | 110 |  11 |   0 | 230 | 1.300000e+01 |      --      |    Inf 
2.69/2.74	c   2.6s|     1 |     0 |   674 | 953k|   0 |  47 | 103 |  99 |  99 | 103 | 110 |  11 |   0 | 237 | 1.300000e+01 |      --      |    Inf 
2.79/2.81	c   2.7s|     1 |     0 |   685 | 953k|   0 |  45 | 103 |  99 |  99 | 103 | 110 |  11 |   0 | 244 | 1.300000e+01 |      --      |    Inf 
2.79/2.83	c   2.8s|     1 |     0 |   685 | 953k|   0 |   - | 103 |  99 |  99 | 103 | 110 |  11 |   0 | 248 | 1.300000e+01 |      --      |    Inf 
2.79/2.83	c (run 3, node 1) restarting after 22 global fixings of integer variables
2.79/2.83	c 
2.79/2.83	(restart) converted 11 cuts from the global cut pool into linear constraints
2.79/2.84	c 
2.79/2.84	presolving:
2.79/2.84	c (round 1) 22 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 11 upgd conss, 34 impls, 77 clqs
2.79/2.84	c presolving (2 rounds):
2.79/2.84	c  22 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.79/2.84	c  34 implications, 77 cliques
2.79/2.84	c presolved problem has 81 variables (81 bin, 0 int, 0 impl, 0 cont) and 105 constraints
2.79/2.84	c      21 constraints of type <knapsack>
2.79/2.84	c      83 constraints of type <setppc>
2.79/2.84	c       1 constraints of type <logicor>
2.79/2.84	c transformed objective value is always integral (scale: 1)
2.79/2.84	c Presolving Time: 0.04
2.79/2.84	c 
2.79/2.85	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
2.79/2.85	c   2.8s|     1 |     0 |   739 | 771k|   0 |  44 |  81 | 105 | 105 |  81 | 105 |   0 |   0 | 248 | 1.300000e+01 |      --      |    Inf 
2.79/2.86	c   2.8s|     1 |     0 |   769 | 947k|   0 |  45 |  81 | 105 | 105 |  81 | 114 |   9 |   0 | 248 | 1.300000e+01 |      --      |    Inf 
2.99/3.05	c   3.0s|     1 |     0 |   792 | 947k|   0 |  49 |  81 | 105 | 105 |  81 | 114 |   9 |   0 | 275 | 1.300000e+01 |      --      |    Inf 
3.09/3.16	c   3.1s|     1 |     0 |   816 | 946k|   0 |  47 |  81 | 103 | 103 |  81 | 114 |   9 |   0 | 294 | 1.300000e+01 |      --      |    Inf 
3.19/3.25	c   3.1s|     1 |     0 |   828 | 944k|   0 |  39 |  81 | 100 | 100 |  81 | 114 |   9 |   0 | 304 | 1.300000e+01 |      --      |    Inf 
3.19/3.27	c   3.2s|     1 |     0 |   828 | 944k|   0 |   - |  81 | 100 | 100 |  81 | 114 |   9 |   0 | 309 | 1.300000e+01 |      --      |    Inf 
3.19/3.27	c (run 4, node 1) restarting after 19 global fixings of integer variables
3.19/3.27	c 
3.19/3.27	(restart) converted 9 cuts from the global cut pool into linear constraints
3.19/3.28	c 
3.19/3.28	presolving:
3.19/3.28	c (round 1) 20 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 52 impls, 68 clqs
3.19/3.28	c (round 2) 20 del vars, 11 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 52 impls, 68 clqs
3.19/3.28	c presolving (3 rounds):
3.19/3.28	c  20 deleted vars, 11 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.19/3.28	c  52 implications, 68 cliques
3.19/3.28	c presolved problem has 61 variables (61 bin, 0 int, 0 impl, 0 cont) and 98 constraints
3.19/3.28	c      26 constraints of type <knapsack>
3.19/3.28	c      70 constraints of type <setppc>
3.19/3.28	c       2 constraints of type <logicor>
3.19/3.28	c transformed objective value is always integral (scale: 1)
3.19/3.28	c Presolving Time: 0.05
3.19/3.28	c 
3.19/3.29	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
3.19/3.29	c   3.2s|     1 |     0 |   878 | 762k|   0 |  38 |  61 |  98 |  98 |  61 |  98 |   0 |   0 | 309 | 1.300000e+01 |      --      |    Inf 
3.29/3.30	c   3.2s|     1 |     0 |   895 | 987k|   0 |  45 |  61 |  98 |  98 |  61 | 109 |  11 |   0 | 309 | 1.300000e+01 |      --      |    Inf 
3.39/3.43	c   3.3s|     1 |     0 |   941 | 987k|   0 |  33 |  61 |  98 |  98 |  61 | 109 |  11 |   0 | 329 | 1.300000e+01 |      --      |    Inf 
3.48/3.52	c   3.4s|     1 |     0 |   949 | 986k|   0 |  34 |  61 |  96 |  96 |  61 | 109 |  11 |   0 | 347 | 1.300000e+01 |      --      |    Inf 
3.48/3.56	c   3.5s|     1 |     0 |   949 | 985k|   0 |   - |  61 |  96 |  96 |  61 | 109 |  11 |   0 | 354 | 1.300000e+01 |      --      |    Inf 
3.48/3.56	c (run 5, node 1) restarting after 13 global fixings of integer variables
3.48/3.56	c 
3.48/3.56	(restart) converted 11 cuts from the global cut pool into linear constraints
3.48/3.56	c 
3.48/3.56	presolving:
3.48/3.56	c (round 1) 18 del vars, 6 del conss, 0 chg bounds, 1 chg sides, 36 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 2) 19 del vars, 9 del conss, 0 chg bounds, 1 chg sides, 50 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 3) 19 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 58 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 4) 19 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 61 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 5) 19 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 64 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 6) 19 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 66 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 7) 19 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 67 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 8) 19 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 68 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c (round 9) 19 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 69 chg coeffs, 11 upgd conss, 93 impls, 49 clqs
3.48/3.57	c presolving (10 rounds):
3.48/3.57	c  19 deleted vars, 18 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 69 changed coefficients
3.48/3.57	c  93 implications, 49 cliques
3.48/3.57	c presolved problem has 42 variables (42 bin, 0 int, 0 impl, 0 cont) and 89 constraints
3.48/3.57	c      34 constraints of type <knapsack>
3.48/3.57	c      52 constraints of type <setppc>
3.48/3.57	c       3 constraints of type <logicor>
3.48/3.57	c transformed objective value is always integral (scale: 1)
3.48/3.57	c Presolving Time: 0.07
3.48/3.57	c 
3.48/3.57	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
3.48/3.57	c   3.5s|     1 |     0 |   972 | 756k|   0 |   0 |  42 |  89 |  89 |  42 |  88 |   0 |   0 | 354 | 1.300000e+01 |      --      |    Inf 
3.48/3.57	c * 3.5s|     1 |     0 |   972 | 758k|   0 |   - |  42 |  89 |  89 |  42 |  88 |   0 |   0 | 354 | 1.300000e+01 | 1.300000e+01 |   0.00%
3.48/3.57	c 
3.48/3.57	c SCIP Status        : problem is solved [optimal solution found]
3.48/3.57	c Solving Time (sec) : 3.47
3.48/3.57	c Solving Nodes      : 1 (total of 6 nodes in 6 runs)
3.48/3.57	c Primal Bound       : +1.30000000000000e+01 (1 solutions)
3.48/3.57	c Dual Bound         : +1.30000000000000e+01
3.48/3.57	c Gap                : 0.00 %
3.48/3.57	c NODE         1
3.48/3.57	c DUAL BOUND   13
3.48/3.57	c PRIMAL BOUND 13
3.48/3.57	c GAP          0
3.48/3.57	s SATISFIABLE
3.48/3.57	v -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 x149 -x148 
3.48/3.57	v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 
3.48/3.57	v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 
3.48/3.57	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 
3.48/3.57	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 
3.48/3.57	v -x56 x55 -x54 -x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 
3.48/3.57	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 
3.48/3.57	v x4 -x3 -x2 -x1 
3.48/3.57	c SCIP Status        : problem is solved [optimal solution found]
3.48/3.57	c Solving Time       :       3.47
3.48/3.57	c Original Problem   :
3.48/3.57	c   Problem name     : HOME/instance-1868036-1245115441.opb
3.48/3.57	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
3.48/3.57	c   Constraints      : 101 initial, 101 maximal
3.48/3.57	c Presolved Problem  :
3.48/3.57	c   Problem name     : t_HOME/instance-1868036-1245115441.opb
3.48/3.57	c   Variables        : 42 (42 binary, 0 integer, 0 implicit integer, 0 continuous)
3.48/3.57	c   Constraints      : 89 initial, 89 maximal
3.48/3.57	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
3.48/3.57	c   trivial          :       0.00        121          0          0          0          0          0          0          0
3.48/3.57	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
3.48/3.57	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
3.48/3.57	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
3.48/3.57	c   implics          :       0.00          0          0          0          0          0          0          0          0
3.48/3.57	c   probing          :       0.00          0          0          0          0          0          0          0          0
3.48/3.57	c   knapsack         :       0.05          0          0          0          0          0          0          1         69
3.48/3.57	c   setppc           :       0.00          0          6          0          0          0         36          0          0
3.48/3.57	c   linear           :       0.01          0          0          0          0          0         29          0          0
3.48/3.57	c   logicor          :       0.00          0          0          0          0          0          3          0          0
3.48/3.57	c   root node        :          -        120          -          -        120          -          -          -          -
3.48/3.57	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
3.48/3.57	c   integral         :          0          0          0         27          0          0        120          0          0          0
3.48/3.57	c   knapsack         :         34         10         27          1          0          0          0          0          0          0
3.48/3.57	c   setppc           :         52         10         27          1          0          0          0          0          0          0
3.48/3.57	c   logicor          :          3         10          6          1          0          0          0          0          0          0
3.48/3.57	c   countsols        :          0          0          0          1          0          0          0          0          0          0
3.48/3.57	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
3.48/3.57	c   integral         :       3.18       0.00       0.00       3.18       0.00
3.48/3.57	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
3.48/3.57	c   setppc           :       0.00       0.00       0.00       0.00       0.00
3.48/3.57	c   logicor          :       0.00       0.00       0.00       0.00       0.00
3.48/3.57	c   countsols        :       0.00       0.00       0.00       0.00       0.00
3.48/3.57	c Propagators        :       Time      Calls    Cutoffs    DomReds
3.48/3.57	c   rootredcost      :       0.00          0          0          0
3.48/3.57	c   pseudoobj        :       0.00         33          0          0
3.48/3.57	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
3.48/3.57	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
3.48/3.57	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
3.48/3.57	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
3.48/3.57	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
3.48/3.57	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
3.48/3.57	c   applied globally :          -          -          -          0        0.0          -          -          -
3.48/3.57	c   applied locally  :          -          -          -          0        0.0          -          -          -
3.48/3.57	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
3.48/3.57	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
3.48/3.57	c   redcost          :       0.00         10          0          0          0          0
3.48/3.57	c   impliedbounds    :       0.00          9          0          0          0          0
3.48/3.57	c   intobj           :       0.00          0          0          0          0          0
3.48/3.57	c   gomory           :       0.08         10          0          0         74          0
3.48/3.57	c   strongcg         :       0.06         10          0          0        582          0
3.48/3.57	c   cmir             :       0.00          0          0          0          0          0
3.48/3.57	c   flowcover        :       0.00          0          0          0          0          0
3.48/3.57	c   clique           :       0.00         10          0          0         35          0
3.48/3.57	c   zerohalf         :       0.00          0          0          0          0          0
3.48/3.57	c   mcf              :       0.00          6          0          0          0          0
3.48/3.57	c Pricers            :       Time      Calls       Vars
3.48/3.57	c   problem variables:       0.00          0          0
3.48/3.57	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
3.48/3.57	c   relpscost        :       3.18         26          0        120          0          0          0
3.48/3.57	c   pscost           :       0.00          0          0          0          0          0          0
3.48/3.57	c   inference        :       0.00          0          0          0          0          0          0
3.48/3.57	c   mostinf          :       0.00          0          0          0          0          0          0
3.48/3.57	c   leastinf         :       0.00          0          0          0          0          0          0
3.48/3.57	c   fullstrong       :       0.00          0          0          0          0          0          0
3.48/3.57	c   allfullstrong    :       0.00          0          0          0          0          0          0
3.48/3.57	c   random           :       0.00          0          0          0          0          0          0
3.48/3.57	c Primal Heuristics  :       Time      Calls      Found
3.48/3.57	c   LP solutions     :       0.00          -          1
3.48/3.57	c   pseudo solutions :       0.00          -          0
3.48/3.57	c   simplerounding   :       0.00          0          0
3.48/3.57	c   rounding         :       0.00          0          0
3.48/3.57	c   shifting         :       0.00          0          0
3.48/3.57	c   intshifting      :       0.00          0          0
3.48/3.57	c   oneopt           :       0.00          0          0
3.48/3.57	c   fixandinfer      :       0.00          0          0
3.48/3.57	c   feaspump         :       0.00          0          0
3.48/3.57	c   coefdiving       :       0.00          0          0
3.48/3.57	c   pscostdiving     :       0.00          0          0
3.48/3.57	c   fracdiving       :       0.00          0          0
3.48/3.57	c   veclendiving     :       0.00          0          0
3.48/3.57	c   intdiving        :       0.00          0          0
3.48/3.57	c   actconsdiving    :       0.00          0          0
3.48/3.57	c   objpscostdiving  :       0.00          0          0
3.48/3.57	c   rootsoldiving    :       0.00          0          0
3.48/3.57	c   linesearchdiving :       0.00          0          0
3.48/3.57	c   guideddiving     :       0.00          0          0
3.48/3.57	c   octane           :       0.00          0          0
3.48/3.57	c   rens             :       0.00          0          0
3.48/3.57	c   rins             :       0.00          0          0
3.48/3.57	c   localbranching   :       0.00          0          0
3.48/3.57	c   mutation         :       0.00          0          0
3.48/3.57	c   crossover        :       0.00          0          0
3.48/3.57	c   dins             :       0.00          0          0
3.48/3.57	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
3.48/3.57	c   primal LP        :       0.00          0          0       0.00          -
3.48/3.57	c   dual LP          :       0.06         36        972      27.00   16200.00
3.48/3.57	c   barrier LP       :       0.00          0          0       0.00          -
3.48/3.57	c   diving/probing LP:       0.00          0          0       0.00          -
3.48/3.57	c   strong branching :       3.17        354      34882      98.54   11003.79
3.48/3.57	c     (at root node) :          -        354      34882      98.54          -
3.48/3.57	c   conflict analysis:       0.00          0          0       0.00          -
3.48/3.57	c B&B Tree           :
3.48/3.57	c   number of runs   :          6
3.48/3.57	c   nodes            :          1
3.48/3.57	c   nodes (total)    :          6
3.48/3.57	c   nodes left       :          0
3.48/3.57	c   max depth        :          0
3.48/3.57	c   max depth (total):          0
3.48/3.57	c   backtracks       :          0 (0.0%)
3.48/3.57	c   delayed cutoffs  :          0
3.48/3.57	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
3.48/3.57	c   avg switch length:       2.00
3.48/3.57	c   switching time   :       0.00
3.48/3.57	c Solution           :
3.48/3.57	c   Solutions found  :          1 (1 improvements)
3.48/3.57	c   Primal Bound     : +1.30000000000000e+01   (in run 6, after 1 nodes, 3.47 seconds, depth 0, found by <relaxation>)
3.48/3.57	c   Dual Bound       : +1.30000000000000e+01
3.48/3.57	c   Gap              :       0.00 %
3.48/3.57	c   Root Dual Bound  : +1.30000000000000e+01
3.48/3.58	c Time complete: 3.57.

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-1868036-1245115441/watcher-1868036-1245115441 -o /tmp/evaluation-result-1868036-1245115441/solver-1868036-1245115441 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868036-1245115441.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.97 1.06 3/64 1515
/proc/meminfo: memFree=1681840/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=4324 CPUtime=0
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 476 0 0 0 0 0 0 0 18 0 1 0 179145011 4427776 460 1992294400 4194304 7823515 548682068736 18446744073709551615 4493352 0 0 4096 0 0 0 0 17 1 0 0
/proc/1515/statm: 1082 465 301 886 0 192 0

[startup+0.015888 s]
/proc/loadavg: 0.95 0.97 1.06 3/64 1515
/proc/meminfo: memFree=1681840/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=9660 CPUtime=0
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 2023 0 0 0 0 0 0 0 18 0 1 0 179145011 9891840 1651 1992294400 4194304 7823515 548682068736 18446744073709551615 5878822 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1515/statm: 2415 1656 367 886 0 1525 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 9660

[startup+0.101896 s]
/proc/loadavg: 0.95 0.97 1.06 3/64 1515
/proc/meminfo: memFree=1681840/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=14016 CPUtime=0.09
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 3092 0 0 0 8 1 0 0 17 0 1 0 179145011 14352384 2720 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1515/statm: 3504 2720 547 886 0 2614 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 14016

[startup+0.301913 s]
/proc/loadavg: 0.95 0.97 1.06 3/64 1515
/proc/meminfo: memFree=1681840/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=14160 CPUtime=0.29
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 3131 0 0 0 27 2 0 0 18 0 1 0 179145011 14499840 2758 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1515/statm: 3540 2758 551 886 0 2650 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 14160

[startup+0.70195 s]
/proc/loadavg: 0.95 0.97 1.06 3/64 1515
/proc/meminfo: memFree=1681840/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=14160 CPUtime=0.69
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 3150 0 0 0 66 3 0 0 21 0 1 0 179145011 14499840 2777 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1515/statm: 3540 2777 553 886 0 2650 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 14160

[startup+1.50102 s]
/proc/loadavg: 0.96 0.97 1.06 2/65 1516
/proc/meminfo: memFree=1672872/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=14624 CPUtime=1.49
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 3254 0 0 0 144 5 0 0 25 0 1 0 179145011 14974976 2881 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1515/statm: 3656 2881 559 886 0 2766 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 14624

[startup+3.10117 s]
/proc/loadavg: 0.96 0.97 1.06 2/65 1516
/proc/meminfo: memFree=1672296/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=15656 CPUtime=3.09
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 3556 0 0 0 300 9 0 0 25 0 1 0 179145011 16031744 3165 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1515/statm: 3914 3165 559 886 0 3024 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 15656

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

[startup+3.50121 s]
/proc/loadavg: 0.96 0.97 1.06 2/65 1516
/proc/meminfo: memFree=1671144/2055920 swapFree=4192812/4192956
[pid=1515] ppid=1513 vsize=17352 CPUtime=3.48
/proc/1515/stat : 1515 (pbscip.linux.x8) R 1513 1515 1126 0 -1 4194304 3958 0 0 0 339 9 0 0 25 0 1 0 179145011 17768448 3567 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1515/statm: 4338 3567 563 886 0 3448 0
Current children cumulated CPU time (s) 3.48
Current children cumulated vsize (KiB) 17352

Child status: 0
Real time (s): 3.58736
CPU time (s): 3.58446
CPU user time (s): 3.47947
CPU system time (s): 0.104984
CPU usage (%): 99.9191
Max. virtual memory (cumulated for all children) (KiB): 17352

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 3.47947
system time used= 0.104984
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4049
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= 6

runsolver used 0.007998 second user time and 0.015997 second system time

The end

Launcher Data 

Begin job on node14 at 2009-06-16 03:24:01
IDJOB=1868036
IDBENCH=1185
IDSOLVER=683
FILE ID=node14/1868036-1245115441
PBS_JOBID= 9363651
Free space on /tmp= 66376 MiB

SOLVER NAME= SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/wnqueen/normalized-t2001.13queen13.1111226241.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-1868036-1245115441/watcher-1868036-1245115441 -o /tmp/evaluation-result-1868036-1245115441/solver-1868036-1245115441 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868036-1245115441.opb

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

MD5SUM BENCH= b7b312369c912d9a28d0c332b741ce41
RANDOM SEED=1157852936

node14.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.234
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.234
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:       1682256 kB
Buffers:         23672 kB
Cached:         276072 kB
SwapCached:          0 kB
Active:          60176 kB
Inactive:       253440 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1682256 kB
SwapTotal:     4192956 kB
SwapFree:      4192812 kB
Dirty:           10056 kB
Writeback:           0 kB
Mapped:          23720 kB
Slab:            46032 kB
Committed_AS:   160812 kB
PageTables:       1452 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= 66364 MiB
End job on node14 at 2009-06-16 03:24:05