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-20-10/MIPLIB/miplib2003/normalized-mps-v2-20-10-momentum2.opb
MD5SUM46da43c96f006f296bc8287cf17c977a
Bench Categoryoptimization, big integers (OPTBIGINT)
Has Objective FunctionYES
SatisfiableNO
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of terms in the objective function 24130
Biggest coefficient in the objective function 655360000
Number of bits for the biggest coefficient in the objective function 30
Sum of the numbers in the objective function 3638660312
Number of bits of the sum of numbers in the objective function 32
Biggest number in a constraint 1024000000000000013606456393728
Number of bits of the biggest number in a constraint 100
Biggest sum of numbers in a constraint 3743132712137090149495810818048
Number of bits of the biggest sum of numbers102
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.233964
Number of variables25930
Total number of constraints27909
Number of constraints which are clauses10362
Number of constraints which are cardinality constraints (but not clauses)1921
Number of constraints which are nor clauses,nor cardinality constraints15626
Minimum length of a constraint1
Maximum length of a constraint913

Trace number 16671 

4281