| Name | /PARTIAL-SMALLINT-LIN/wcsp/academics/ normalized-16wqueens_wcsp.wbo |
| MD5SUM | 0eca1cee1f66f0b91a7a0aa842de562c |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.088985 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 256 |
| Total number of constraints | 4608 |
| Number of soft constraints | 4592 |
| Number of constraints which are clauses | 4592 |
| Number of constraints which are cardinality constraints (but not clauses) | 16 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 16 |
| Top cost | 17 |
| Min constraint cost | 1 |
| Max constraint cost | 17 |
| Sum of constraints costs | 74992 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 17 |
| Number of bits of the biggest sum of numbers | 5 |
| 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 | CPU time | Wall clock time |
|---|---|---|---|---|
| clasp 2.0-RC2 (complete) | 3448640 | OPTIMUM | 0.088985 | 0.0918129 |
| Sat4j Resolution 2011-06-08 (complete) | 3492752 | OPTIMUM | 5.52716 | 4.85322 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447903 | OPTIMUM | 177.006 | 177.01 |
| wbo 1.6 (complete) | 3447166 | OPTIMUM | 1218.36 | 1218.33 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
cost of falsified constraints: 2-x251 -x252 -x253 -x254 -x255 -x256