| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-105-100--soft-66-100-0.wbo |
| MD5SUM | 877b894215c8e906897b9f5c7b76fab3 |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MSAT |
| Best cost obtained on this benchmark | 4 |
| Best CPU time to get the best result obtained on this benchmark | 1800.12 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 10500 |
| Total number of constraints | 205 |
| Number of soft constraints | 74 |
| Number of constraints which are clauses | 105 |
| Number of constraints which are cardinality constraints (but not clauses) | 100 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 100 |
| Maximum length of a constraint | 105 |
| Top cost | 3754 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 3753 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 106 |
| Number of bits of the biggest sum of numbers | 7 |
| 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 |
|---|---|---|---|---|
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092007 | OPTIMUM | 2.76258 | 1.899 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090621 | MSAT (TO) | 1800.08 | 1775.87 |
| NaPS 1.02 (complete) | 4094779 | MSAT (TO) | 1800.12 | 1800.43 |
| toysat 2016-05-02 (complete) | 4093393 | ? (TO) | 1800.07 | 1800.54 |
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: 4--too large--