Download the above graph as a PDF file / as an EPS file
| Solver Name | Answer | Objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| wildcat-skc 2007-03-21 | SAT (TO) | 142 | 1800.11 | 1800.81 |
| Name | normalized-PB07/OPT-SMALLINT-LIN/submittedPB07/aksoy/ area_partials/normalized-fir08_area_partials.opb |
| MD5SUM | 7a3c9826bd8191760f7756d2d26889fa |
| Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 49 |
| Best CPU time to get the best result obtained on this benchmark | 35.7516 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | 49 |
| Optimality of the best value was proved | YES |
| Number of variables | 40727 |
| Total number of constraints | 174550 |
| Number of constraints which are clauses | 174550 |
| 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 | 1 |
| Maximum length of a constraint | 1018 |
| Number of terms in the objective function | 1821 |
| 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 | 1821 |
| Number of bits of the sum of numbers in the objective function | 11 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 1821 |
| Number of bits of the biggest sum of numbers | 11 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |