| Name | normalized-PB06/OPT-BIGINT/mps-v2-20-10/ftp.netlib.org/ lp/data/normalized-mps-v2-20-10-etamacro.opb |
| MD5SUM | f7cd52c219cc6e0fc4b5401699d735d9 |
| Bench Category | OPT-BIGINT (optimisation, big integers) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 2.47862 |
| Has Objective Function | YES |
| Satisfiable | NO |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 15742 |
| Total number of constraints | 530 |
| Number of constraints which are clauses | 0 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 530 |
| Minimum length of a constraint | 10 |
| Maximum length of a constraint | 522 |
| Number of terms in the objective function | 1442 |
| Biggest coefficient in the objective function | 25807666597068800000 |
| Number of bits for the biggest coefficient in the objective function | 65 |
| Sum of the numbers in the objective function | 217111455784720206333 |
| Number of bits of the sum of numbers in the objective function | 68 |
| Biggest number in a constraint | 25807666597068800000 |
| Number of bits of the biggest number in a constraint | 65 |
| Biggest sum of numbers in a constraint | 217111455784720206333 |
| Number of bits of the biggest sum of numbers | 68 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1856211 | UNSAT | 2.47862 | 1.56268 | |
| SAT4J Pseudo CP 2.1.1 (complete) | 1856210 | UNSAT | 2.6096 | 1.56786 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: