Trace number 1868178

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 5.52116 5.52174

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1110974553.opb
MD5SUMa8a51c2e735c1a05850a59dcf05a69f7
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.493924
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 1165
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-1868178-1245115902.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.03	c start solving problem
0.00/0.03	c 
0.02/0.03	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.02/0.03	c   0.0s|     1 |     0 |   110 | 593k|   0 |  43 | 169 |  73 |  73 | 169 |  73 |   0 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.02/0.05	c   0.0s|     1 |     0 |   161 | 823k|   0 |  53 | 169 |  73 |  73 | 169 |  93 |  20 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.02/0.08	c   0.1s|     1 |     0 |   236 |1093k|   0 |  53 | 169 |  73 |  73 | 169 | 101 |  28 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |   317 |1257k|   0 |  53 | 169 |  73 |  73 | 169 | 107 |  34 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.13	c   0.1s|     1 |     0 |   400 |1334k|   0 |  59 | 169 |  73 |  73 | 169 | 112 |  39 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.17	c   0.1s|     1 |     0 |   525 |1356k|   0 |  55 | 169 |  73 |  73 | 169 | 114 |  41 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.79/0.85	c   0.8s|     1 |     0 |   543 |1356k|   0 |  56 | 169 |  73 |  73 | 169 | 114 |  41 |   0 |  34 | 1.300000e+01 |      --      |    Inf 
1.20/1.23	c   1.2s|     1 |     0 |   564 |1356k|   0 |  57 | 169 |  73 |  73 | 169 | 114 |  41 |   0 |  53 | 1.300000e+01 |      --      |    Inf 
1.39/1.43	c   1.4s|     1 |     0 |   580 |1356k|   0 |  55 | 169 |  73 |  73 | 169 | 114 |  41 |   0 |  62 | 1.300000e+01 |      --      |    Inf 
1.49/1.55	c   1.5s|     1 |     0 |   613 |1355k|   0 |  56 | 169 |  73 |  73 | 169 | 114 |  41 |   0 |  68 | 1.300000e+01 |      --      |    Inf 
1.69/1.77	c   1.7s|     1 |     0 |   619 |1355k|   0 |  55 | 169 |  73 |  73 | 169 | 114 |  41 |   0 |  79 | 1.300000e+01 |      --      |    Inf 
1.79/1.85	c   1.8s|     1 |     0 |   625 |1355k|   0 |  53 | 169 |  72 |  72 | 169 | 106 |  41 |   0 |  83 | 1.300000e+01 |      --      |    Inf 
1.89/1.90	c   1.8s|     1 |     0 |   637 |1355k|   0 |  54 | 169 |  72 |  72 | 169 | 106 |  41 |   0 |  86 | 1.300000e+01 |      --      |    Inf 
1.89/1.96	c   1.9s|     1 |     0 |   638 |1355k|   0 |  53 | 169 |  72 |  72 | 169 | 106 |  41 |   0 |  90 | 1.300000e+01 |      --      |    Inf 
1.89/1.96	c   1.9s|     1 |     2 |   638 |1355k|   0 |  53 | 169 |  72 |  72 | 169 | 106 |  41 |   0 |  90 | 1.300000e+01 |      --      |    Inf 
1.89/1.96	c (run 1, node 1) restarting after 25 global fixings of integer variables
1.89/1.96	c 
1.89/1.96	(restart) converted 17 cuts from the global cut pool into linear constraints
1.89/1.96	c 
1.89/1.96	presolving:
1.89/1.97	c (round 1) 25 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 17 upgd conss, 10 impls, 80 clqs
1.89/1.97	c presolving (2 rounds):
1.89/1.97	c  25 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.89/1.97	c  10 implications, 80 cliques
1.89/1.97	c presolved problem has 144 variables (144 bin, 0 int, 0 impl, 0 cont) and 87 constraints
1.89/1.97	c       4 constraints of type <knapsack>
1.89/1.97	c      81 constraints of type <setppc>
1.89/1.97	c       2 constraints of type <logicor>
1.89/1.97	c transformed objective value is always integral (scale: 1)
1.89/1.97	c Presolving Time: 0.01
1.89/1.97	c 
1.89/1.97	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.89/1.97	c   1.9s|     1 |     0 |   718 | 633k|   0 |  42 | 144 |  87 |  87 | 144 |  87 |   0 |   0 |  90 | 1.300000e+01 |      --      |    Inf 
1.89/2.00	c   1.9s|     1 |     0 |   753 | 893k|   0 |  58 | 144 |  87 |  87 | 144 | 105 |  18 |   0 |  90 | 1.300000e+01 |      --      |    Inf 
2.79/2.84	c   2.8s|     1 |     0 |   777 | 893k|   0 |  56 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 143 | 1.300000e+01 |      --      |    Inf 
2.99/3.09	c   3.0s|     1 |     0 |   785 | 893k|   0 |  55 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 157 | 1.300000e+01 |      --      |    Inf 
3.09/3.14	c   3.1s|     1 |     0 |   787 | 893k|   0 |  55 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 160 | 1.300000e+01 |      --      |    Inf 
3.09/3.17	c   3.1s|     1 |     0 |   788 | 893k|   0 |  55 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 162 | 1.300000e+01 |      --      |    Inf 
3.09/3.19	c   3.1s|     1 |     0 |   789 | 893k|   0 |  55 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 163 | 1.300000e+01 |      --      |    Inf 
3.20/3.21	c   3.1s|     1 |     0 |   791 | 893k|   0 |  55 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 164 | 1.300000e+01 |      --      |    Inf 
3.20/3.24	c   3.2s|     1 |     0 |   792 | 893k|   0 |  55 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 166 | 1.300000e+01 |      --      |    Inf 
3.20/3.26	c   3.2s|     1 |     2 |   792 | 894k|   0 |  55 | 144 |  87 |  87 | 144 | 105 |  18 |   0 | 167 | 1.300000e+01 |      --      |    Inf 
3.20/3.26	c (run 2, node 1) restarting after 12 global fixings of integer variables
3.20/3.26	c 
3.20/3.26	(restart) converted 12 cuts from the global cut pool into linear constraints
3.20/3.26	c 
3.20/3.26	presolving:
3.20/3.27	c (round 1) 12 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 10 impls, 84 clqs
3.20/3.27	c (round 2) 12 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 10 impls, 84 clqs
3.20/3.27	c presolving (3 rounds):
3.20/3.27	c  12 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.20/3.27	c  10 implications, 84 cliques
3.20/3.27	c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 98 constraints
3.20/3.27	c      12 constraints of type <knapsack>
3.20/3.27	c      84 constraints of type <setppc>
3.20/3.27	c       2 constraints of type <logicor>
3.20/3.27	c transformed objective value is always integral (scale: 1)
3.20/3.27	c Presolving Time: 0.02
3.20/3.27	c 
3.20/3.28	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
3.20/3.28	c   3.2s|     1 |     0 |   871 | 780k|   0 |  43 | 132 |  98 |  98 | 132 |  98 |   0 |   0 | 167 | 1.300000e+01 |      --      |    Inf 
3.20/3.30	c   3.2s|     1 |     0 |   902 | 995k|   0 |  52 | 132 |  98 |  98 | 132 | 107 |   9 |   0 | 167 | 1.300000e+01 |      --      |    Inf 
3.59/3.66	c   3.6s|     1 |     0 |   923 | 995k|   0 |  52 | 132 |  98 |  98 | 132 | 107 |   9 |   0 | 206 | 1.300000e+01 |      --      |    Inf 
3.89/3.99	c   3.9s|     1 |     0 |   927 | 995k|   0 |  52 | 132 |  98 |  98 | 132 | 107 |   9 |   0 | 227 | 1.300000e+01 |      --      |    Inf 
3.99/4.05	c   3.9s|     1 |     0 |   929 | 995k|   0 |  53 | 132 |  98 |  98 | 132 | 107 |   9 |   0 | 231 | 1.300000e+01 |      --      |    Inf 
3.99/4.08	c   4.0s|     1 |     2 |   929 | 996k|   0 |  53 | 132 |  98 |  98 | 132 | 107 |   9 |   0 | 233 | 1.300000e+01 |      --      |    Inf 
5.49/5.51	c * 5.4s|    10 |     0 |  1687 |1044k|   5 |   - | 132 | 102 |  14 | 132 |  83 |   9 |   4 | 556 | 1.300000e+01 | 1.300000e+01 |   0.00%
5.49/5.51	c 
5.49/5.51	c SCIP Status        : problem is solved [optimal solution found]
5.49/5.51	c Solving Time (sec) : 5.36
5.49/5.51	c Solving Nodes      : 10 (total of 12 nodes in 3 runs)
5.49/5.51	c Primal Bound       : +1.30000000000000e+01 (1 solutions)
5.49/5.51	c Dual Bound         : +1.30000000000000e+01
5.49/5.51	c Gap                : 0.00 %
5.49/5.51	c NODE         10
5.49/5.51	c DUAL BOUND   13
5.49/5.51	c PRIMAL BOUND 13
5.49/5.51	c GAP          0
5.49/5.51	s SATISFIABLE
5.49/5.51	v -x169 -x168 -x167 -x166 -x165 -x164 -x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 x151 -x150 -x149 -x148 
5.49/5.51	v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 -x128 -x127 
5.49/5.51	v -x126 -x125 -x124 -x123 x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 
5.49/5.51	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 
5.49/5.51	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 
5.49/5.51	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 
5.49/5.51	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 
5.49/5.51	v -x4 -x3 -x2 -x1 
5.49/5.51	c SCIP Status        : problem is solved [optimal solution found]
5.49/5.51	c Solving Time       :       5.36
5.49/5.51	c Original Problem   :
5.49/5.51	c   Problem name     : HOME/instance-1868178-1245115902.opb
5.49/5.51	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
5.49/5.51	c   Constraints      : 101 initial, 101 maximal
5.49/5.51	c Presolved Problem  :
5.49/5.51	c   Problem name     : t_HOME/instance-1868178-1245115902.opb
5.49/5.51	c   Variables        : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
5.49/5.51	c   Constraints      : 98 initial, 102 maximal
5.49/5.51	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
5.49/5.51	c   trivial          :       0.00         37          0          0          0          0          0          0          0
5.49/5.51	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
5.49/5.51	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
5.49/5.51	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
5.49/5.51	c   implics          :       0.00          0          0          0          0          0          0          0          0
5.49/5.51	c   probing          :       0.00          0          0          0          0          0          0          0          0
5.49/5.51	c   knapsack         :       0.01          0          0          0          0          0          0          0          0
5.49/5.51	c   setppc           :       0.00          0          0          0          0          0          1          0          0
5.49/5.51	c   linear           :       0.00          0          0          0          0          0         28          0          0
5.49/5.51	c   logicor          :       0.01          0          0          0          0          0          2          0          0
5.49/5.51	c   root node        :          -         61          -          -         61          -          -          -          -
5.49/5.51	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
5.49/5.51	c   integral         :          0          0          0         56          0          2        155          0          0         14
5.49/5.51	c   knapsack         :         12          7         81          1          0          0          0          0          0          0
5.49/5.51	c   setppc           :         84          7         80          0          0          0        222          0          0          0
5.49/5.51	c   logicor          :          2+         7         11          1          0          0          0          0          0          0
5.49/5.51	c   countsols        :          0          0          0          1          0          0          0          0          0          0
5.49/5.51	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
5.49/5.51	c   integral         :       5.10       0.00       0.00       5.10       0.00
5.49/5.51	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
5.49/5.51	c   setppc           :       0.00       0.00       0.00       0.00       0.00
5.49/5.51	c   logicor          :       0.00       0.00       0.00       0.00       0.00
5.49/5.51	c   countsols        :       0.00       0.00       0.00       0.00       0.00
5.49/5.51	c Propagators        :       Time      Calls    Cutoffs    DomReds
5.49/5.51	c   rootredcost      :       0.00          0          0          0
5.49/5.51	c   pseudoobj        :       0.00         84          0          0
5.49/5.51	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
5.49/5.51	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
5.49/5.51	c   infeasible LP    :       0.00          2          2          4       14.8          0        0.0          0
5.49/5.51	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
5.49/5.51	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
5.49/5.51	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
5.49/5.51	c   applied globally :          -          -          -          4       14.8          -          -          -
5.49/5.51	c   applied locally  :          -          -          -          0        0.0          -          -          -
5.49/5.51	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
5.49/5.51	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 68)
5.49/5.51	c   redcost          :       0.00         16          0          0          0          0
5.49/5.51	c   impliedbounds    :       0.00          7          0          0          0          0
5.49/5.51	c   intobj           :       0.00          0          0          0          0          0
5.49/5.51	c   gomory           :       0.06          7          0          0          0          0
5.49/5.51	c   strongcg         :       0.05          7          0          0        336          0
5.49/5.51	c   cmir             :       0.00          0          0          0          0          0
5.49/5.51	c   flowcover        :       0.00          0          0          0          0          0
5.49/5.51	c   clique           :       0.01          7          0          0         35          0
5.49/5.51	c   zerohalf         :       0.00          0          0          0          0          0
5.49/5.51	c   mcf              :       0.00          3          0          0          0          0
5.49/5.51	c Pricers            :       Time      Calls       Vars
5.49/5.51	c   problem variables:       0.00          0          0
5.49/5.51	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
5.49/5.51	c   relpscost        :       5.10         55          2        155          0          0         14
5.49/5.51	c   pscost           :       0.00          0          0          0          0          0          0
5.49/5.51	c   inference        :       0.00          0          0          0          0          0          0
5.49/5.51	c   mostinf          :       0.00          0          0          0          0          0          0
5.49/5.51	c   leastinf         :       0.00          0          0          0          0          0          0
5.49/5.51	c   fullstrong       :       0.00          0          0          0          0          0          0
5.49/5.51	c   allfullstrong    :       0.00          0          0          0          0          0          0
5.49/5.51	c   random           :       0.00          0          0          0          0          0          0
5.49/5.51	c Primal Heuristics  :       Time      Calls      Found
5.49/5.51	c   LP solutions     :       0.00          -          1
5.49/5.51	c   pseudo solutions :       0.00          -          0
5.49/5.51	c   simplerounding   :       0.00          0          0
5.49/5.51	c   rounding         :       0.00          0          0
5.49/5.51	c   shifting         :       0.00          0          0
5.49/5.51	c   intshifting      :       0.00          0          0
5.49/5.51	c   oneopt           :       0.00          0          0
5.49/5.51	c   fixandinfer      :       0.00          0          0
5.49/5.51	c   feaspump         :       0.00          0          0
5.49/5.51	c   coefdiving       :       0.00          0          0
5.49/5.51	c   pscostdiving     :       0.00          0          0
5.49/5.51	c   fracdiving       :       0.00          0          0
5.49/5.51	c   veclendiving     :       0.00          0          0
5.49/5.51	c   intdiving        :       0.00          0          0
5.49/5.51	c   actconsdiving    :       0.00          0          0
5.49/5.51	c   objpscostdiving  :       0.00          0          0
5.49/5.51	c   rootsoldiving    :       0.00          0          0
5.49/5.51	c   linesearchdiving :       0.00          0          0
5.49/5.51	c   guideddiving     :       0.00          0          0
5.49/5.51	c   octane           :       0.00          0          0
5.49/5.51	c   rens             :       0.00          0          0
5.49/5.51	c   rins             :       0.00          0          0
5.49/5.51	c   localbranching   :       0.00          0          0
5.49/5.51	c   mutation         :       0.00          0          0
5.49/5.51	c   crossover        :       0.00          0          0
5.49/5.51	c   dins             :       0.00          0          0
5.49/5.51	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
5.49/5.51	c   primal LP        :       0.00          0          0       0.00          -
5.49/5.51	c   dual LP          :       0.10         65       1687      25.95   16870.00
5.49/5.51	c   barrier LP       :       0.00          0          0       0.00          -
5.49/5.51	c   diving/probing LP:       0.00          0          0       0.00          -
5.49/5.51	c   strong branching :       5.10        556      53309      95.88   10452.75
5.49/5.51	c     (at root node) :          -        233      34808     149.39          -
5.49/5.51	c   conflict analysis:       0.00          0          0       0.00          -
5.49/5.51	c B&B Tree           :
5.49/5.51	c   number of runs   :          3
5.49/5.51	c   nodes            :         10
5.49/5.51	c   nodes (total)    :         12
5.49/5.51	c   nodes left       :          0
5.49/5.51	c   max depth        :          5
5.49/5.51	c   max depth (total):          5
5.49/5.51	c   backtracks       :          0 (0.0%)
5.49/5.51	c   delayed cutoffs  :          0
5.49/5.51	c   repropagations   :          2 (0 domain reductions, 0 cutoffs)
5.49/5.51	c   avg switch length:       3.00
5.49/5.51	c   switching time   :       0.00
5.49/5.51	c Solution           :
5.49/5.51	c   Solutions found  :          1 (1 improvements)
5.49/5.51	c   Primal Bound     : +1.30000000000000e+01   (in run 3, after 10 nodes, 5.36 seconds, depth 5, found by <relaxation>)
5.49/5.51	c   Dual Bound       : +1.30000000000000e+01
5.49/5.51	c   Gap              :       0.00 %
5.49/5.51	c   Root Dual Bound  : +1.30000000000000e+01
5.49/5.52	c Time complete: 5.51.

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-1868178-1245115902/watcher-1868178-1245115902 -o /tmp/evaluation-result-1868178-1245115902/solver-1868178-1245115902 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868178-1245115902.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.07 1.02 1.08 3/64 1714
/proc/meminfo: memFree=1401576/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=4488 CPUtime=0
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 501 0 0 0 0 0 0 0 18 0 1 0 179186892 4595712 484 1992294400 4194304 7823515 548682068736 18446744073709551615 6962503 0 0 4096 0 0 0 0 17 1 0 0
/proc/1714/statm: 1082 486 321 886 0 192 0

[startup+0.031198 s]
/proc/loadavg: 1.07 1.02 1.08 3/64 1714
/proc/meminfo: memFree=1401576/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=13324 CPUtime=0.02
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 2844 0 0 0 1 1 0 0 16 0 1 0 179186892 13643776 2472 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3331 2472 510 886 0 2441 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 13324

[startup+0.101212 s]
/proc/loadavg: 1.07 1.02 1.08 3/64 1714
/proc/meminfo: memFree=1401576/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=13652 CPUtime=0.09
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 2988 0 0 0 8 1 0 0 17 0 1 0 179186892 13979648 2617 1992294400 4194304 7823515 548682068736 18446744073709551615 6257628 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3413 2620 547 886 0 2523 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 13652

[startup+0.301247 s]
/proc/loadavg: 1.07 1.02 1.08 3/64 1714
/proc/meminfo: memFree=1401576/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=14456 CPUtime=0.29
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 3223 0 0 0 28 1 0 0 18 0 1 0 179186892 14802944 2851 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3614 2851 551 886 0 2724 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 14456

[startup+0.70132 s]
/proc/loadavg: 1.07 1.02 1.08 3/64 1714
/proc/meminfo: memFree=1401576/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=14456 CPUtime=0.69
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 3234 0 0 0 67 2 0 0 21 0 1 0 179186892 14802944 2862 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3614 2862 551 886 0 2724 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 14456

[startup+1.50147 s]
/proc/loadavg: 1.07 1.02 1.08 2/65 1715
/proc/meminfo: memFree=1392288/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=14456 CPUtime=1.49
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 3240 0 0 0 145 4 0 0 25 0 1 0 179186892 14802944 2868 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3614 2868 553 886 0 2724 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 14456

[startup+3.10176 s]
/proc/loadavg: 1.07 1.02 1.08 2/65 1715
/proc/meminfo: memFree=1391904/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=14844 CPUtime=3.09
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 3331 0 0 0 301 8 0 0 25 0 1 0 179186892 15200256 2941 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3711 2941 559 886 0 2821 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 14844

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

[startup+4.70105 s]
/proc/loadavg: 1.07 1.02 1.08 2/65 1715
/proc/meminfo: memFree=1391080/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=15376 CPUtime=4.69
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 3478 0 0 0 457 12 0 0 25 0 1 0 179186892 15745024 3073 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3844 3073 559 886 0 2954 0
Current children cumulated CPU time (s) 4.69
Current children cumulated vsize (KiB) 15376

[startup+5.10112 s]
/proc/loadavg: 1.07 1.02 1.08 2/65 1715
/proc/meminfo: memFree=1391080/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=15376 CPUtime=5.09
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 3484 0 0 0 496 13 0 0 25 0 1 0 179186892 15745024 3079 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3844 3079 565 886 0 2954 0
Current children cumulated CPU time (s) 5.09
Current children cumulated vsize (KiB) 15376

[startup+5.5052 s]
/proc/loadavg: 1.23 1.05 1.09 2/65 1715
/proc/meminfo: memFree=1391080/2055920 swapFree=4191900/4192956
[pid=1714] ppid=1712 vsize=15376 CPUtime=5.49
/proc/1714/stat : 1714 (pbscip.linux.x8) R 1712 1714 1150 0 -1 4194304 3484 0 0 0 535 14 0 0 25 0 1 0 179186892 15745024 3079 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/1714/statm: 3844 3079 565 886 0 2954 0
Current children cumulated CPU time (s) 5.49
Current children cumulated vsize (KiB) 15376

Child status: 0
Real time (s): 5.52174
CPU time (s): 5.52116
CPU user time (s): 5.37218
CPU system time (s): 0.148977
CPU usage (%): 99.9895
Max. virtual memory (cumulated for all children) (KiB): 15376

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

runsolver used 0.009998 second user time and 0.020996 second system time

The end

Launcher Data 

Begin job on node44 at 2009-06-16 03:31:42
IDJOB=1868178
IDBENCH=1256
IDSOLVER=683
FILE ID=node44/1868178-1245115902
PBS_JOBID= 9363664
Free space on /tmp= 65924 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.1110974553.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-1868178-1245115902/watcher-1868178-1245115902 -o /tmp/evaluation-result-1868178-1245115902/solver-1868178-1245115902 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868178-1245115902.opb

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

MD5SUM BENCH= a8a51c2e735c1a05850a59dcf05a69f7
RANDOM SEED=1967942348

node44.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.263
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.263
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:       1402056 kB
Buffers:         39756 kB
Cached:         532272 kB
SwapCached:        260 kB
Active:          64492 kB
Inactive:       520768 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1402056 kB
SwapTotal:     4192956 kB
SwapFree:      4191900 kB
Dirty:           10136 kB
Writeback:           0 kB
Mapped:          21748 kB
Slab:            54600 kB
Committed_AS:   156572 kB
PageTables:       1384 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= 65912 MiB
End job on node44 at 2009-06-16 03:31:48