| Name | /SOFT-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-11-10--soft-0-100-0.wbo |
| MD5SUM | 765d2479315862ebcb627a16e181d11d |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 0.032994 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 110 |
| Total number of constraints | 21 |
| Number of soft constraints | 21 |
| Number of constraints which are clauses | 11 |
| Number of constraints which are cardinality constraints (but not clauses) | 10 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 10 |
| Maximum length of a constraint | 11 |
| Top cost | 827 |
| Min constraint cost | 1 |
| Max constraint cost | 88 |
| Sum of constraints costs | 826 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 12 |
| Number of bits of the biggest sum of numbers | 4 |
| 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) | 3447734 | OPTIMUM | 0.032994 | 0.0331779 |
| clasp 2.0-RC2 (complete) | 3448111 | OPTIMUM | 34.7947 | 34.7945 |
| wbo 1.6 (complete) | 3446997 | OPTIMUM | 85.0161 | 85.0133 |
| Sat4j Resolution 2011-06-08 (complete) | 3492583 | OPTIMUM | 394.499 | 393.19 |
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: 1x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1