| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/wnqueen/ normalized-t2001.13queen13.1111218308--soft-33-100-0.wbo |
| MD5SUM | cc0c9e984fb29816b50b1482397a634f |
| 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 | 1.9617 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 169 |
| Total number of constraints | 101 |
| Number of soft constraints | 69 |
| Number of constraints which are clauses | 30 |
| Number of constraints which are cardinality constraints (but not clauses) | 70 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 169 |
| Top cost | 3204 |
| Min constraint cost | 1 |
| Max constraint cost | 97 |
| Sum of constraints costs | 3203 |
| Biggest number in a constraint | 38 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 1154 |
| 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 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447636 | OPTIMUM | 1.9617 | 1.96257 |
| clasp 2.0-RC2 (complete) | 3448480 | OPTIMUM | 2.84557 | 2.84659 |
| wbo 1.6 (complete) | 3446899 | OPTIMUM | 18.1332 | 18.1327 |
| Sat4j Resolution 2011-06-08 (complete) | 3492480 | OPTIMUM | 38.6961 | 37.4122 |
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: 2x4 -x3 -x2 -x1