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 in four parts:
  1. 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 provide some useful information on the computer.
  2. SOLVER DATA
    This is the output of the solver (stdout and stderr).
  3. 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 1200 seconds. 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 1230 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (900Mb).
    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.
  4. 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.

General information on the benchmark

Namenormalized-opb/mps-v2-13-7/MIPLIB/miplib3/normalized-mps-v2-13-7-mas74.opb
MD5SUM9c7d72c45dbce1d941583a2319e4f34b
Bench Categoryoptimization, big integers (OPTBIGINT)
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 2147483647
Optimality of the best value was proved NO
Number of terms in the objective function 237
Biggest coefficient in the objective function 241785163922925834941235200000
Number of bits for the biggest coefficient in the objective function 98
Sum of the numbers in the objective function 483570327845851669882470400000
Number of bits of the sum of numbers in the objective function 99
Biggest number in a constraint 604462909807314587353088000000000
Number of bits of the biggest number in a constraint 109
Biggest sum of numbers in a constraint 1208925819614629174706176000000000
Number of bits of the biggest sum of numbers110
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark1217.59
Number of variables237
Total number of constraints164
Number of constraints which are clauses0
Number of constraints which are cardinality constraints (but not clauses)151
Number of constraints which are nor clauses,nor cardinality constraints13
Minimum length of a constraint1
Maximum length of a constraint236

Trace number 15131 

28420