| Name | /SOFT-SMALLINT-LIN/PB06/submitted-PB06/namasivayam/wnqueen/ normalized-t2001.13queen13.1110967729--soft-0-100-0.wbo |
| MD5SUM | b3cca2fb004dc2587d09951aac05623a |
| Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 10 |
| Best CPU time to get the best result obtained on this benchmark | 2.76958 |
| 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 | 101 |
| 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 | 5034 |
| Min constraint cost | 1 |
| Max constraint cost | 98 |
| Sum of constraints costs | 5033 |
| Biggest number in a constraint | 38 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 1318 |
| 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) | 3447764 | OPTIMUM | 2.76958 | 2.77029 |
| clasp 2.0-RC2 (complete) | 3448126 | OPTIMUM | 14.8547 | 14.8545 |
| Sat4j Resolution 2011-06-08 (complete) | 3492613 | OPTIMUM | 38.5701 | 37.2537 |
| wbo 1.6 (complete) | 3447027 | OPTIMUM | 45.6231 | 45.6227 |
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: 10-x4 -x3 x2 -x1