Download the above graph as a PDF file / as an EPS file
| Solver Name | Answer | Objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| wildcat-rnp 0.8.0 | SAT (TO) | -40 | 1800.71 | 1801.22 |
| Name | normalized-PB06/OPT-SMALLINT/web/www.nlsde.buaa.edu.cn/ ~kexu/benchmarks/frb40-19-opb/normalized-frb40-19-3.opb |
| MD5SUM | c9380923d34e254cfa512f89027f1d42 |
| Bench Category | OPT-SMALLINT (optimisation, small integers) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | -40 |
| Best CPU time to get the best result obtained on this benchmark | 1800.59 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | -40 |
| Optimality of the best value was proved | NO |
| Number of variables | 760 |
| Total number of constraints | 41095 |
| Number of constraints which are clauses | 41095 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 2 |
| Number of terms in the objective function | 760 |
| Biggest coefficient in the objective function | 1 |
| Number of bits for the biggest coefficient in the objective function | 1 |
| Sum of the numbers in the objective function | 760 |
| Number of bits of the sum of numbers in the objective function | 10 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 760 |
| Number of bits of the biggest sum of numbers | 10 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |