| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-15-10--soft-33-100-0.wbo |
| MD5SUM | f8d5ed276152247cc0d8dd0253710bfc |
| 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.034994 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 150 |
| Total number of constraints | 25 |
| Number of soft constraints | 21 |
| Number of constraints which are clauses | 15 |
| 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 | 15 |
| Top cost | 877 |
| Min constraint cost | 1 |
| Max constraint cost | 83 |
| Sum of constraints costs | 876 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 16 |
| 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 |
|---|---|---|---|---|
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447455 | OPTIMUM | 0.034994 | 0.035636 |
| clasp 2.0-RC2 (complete) | 3448327 | OPTIMUM | 76.5104 | 76.5151 |
| Sat4j Resolution 2011-06-08 (complete) | 3492258 | OPTIMUM | 1069.1 | 1066.88 |
| wbo 1.6 (complete) | 3446718 | OPTIMUM | 1099.85 | 1099.85 |
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-x6 -x5 -x4 -x3 x2 -x1