| Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB06/roussel/ normalized-pigeon-cardinality-15-10--soft-66-100-0.wbo |
| MD5SUM | 9acc4a01e291192ca8cd72bb114b6c35 |
| 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 | 35 |
| Best CPU time to get the best result obtained on this benchmark | 0.033994 |
| 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 | 5 |
| 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 | 239 |
| Min constraint cost | 1 |
| Max constraint cost | 93 |
| Sum of constraints costs | 238 |
| 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) | 3447441 | OPTIMUM | 0.033994 | 0.0347881 |
| clasp 2.0-RC2 (complete) | 3448316 | OPTIMUM | 58.1092 | 58.1095 |
| Sat4j Resolution 2011-06-08 (complete) | 3492244 | OPTIMUM | 641.408 | 640.019 |
| wbo 1.6 (complete) | 3446704 | OPTIMUM | 1523.27 | 1523.24 |
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: 35-x4 -x3 -x2 x1