Download the above graph as a PDF file / as an EPS file
| Solver Name | Answer | Objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| wildcat-rnp 2007-03-21 | SAT (TO) | -139 | 1800.15 | 1800.75 |
| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/ manquinho/bsg/normalized-bsg_500_10_5.opb |
| MD5SUM | 9b75ee50c2c62e6be495e8bd0a94fa2c |
| Bench Category | OPT-SMALLINT-NLC (optimisation, small integers, non linear constraints) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | -139 |
| Best CPU time to get the best result obtained on this benchmark | 1800.15 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | -131 |
| Optimality of the best value was proved | NO |
| Number of variables | 1000 |
| Total number of constraints | 1501 |
| Number of constraints which are clauses | 500 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1001 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 1000 |
| Number of terms in the objective function | 500 |
| 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 | 500 |
| Number of bits of the sum of numbers in the objective function | 9 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 1000 |
| Number of bits of the biggest sum of numbers | 10 |
| Number of products (including duplicates) | 12540 |
| Sum of products size (including duplicates) | 25080 |
| Number of different products | 6270 |
| Sum of products size | 12540 |