| Name | /PARTIAL-SMALLINT-LIN/wcsp/spot5/ normalized-spot5-8_wcsp.wbo |
| MD5SUM | 620647ab5d08c7ea7dd9c7b0da45f6e8 |
| 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.000999 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 24 |
| Total number of constraints | 33 |
| Number of soft constraints | 25 |
| Number of constraints which are clauses | 25 |
| Number of constraints which are cardinality constraints (but not clauses) | 8 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 4 |
| Top cost | 13 |
| Min constraint cost | 1 |
| Max constraint cost | 13 |
| Sum of constraints costs | 233 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 5 |
| Number of bits of the biggest sum of numbers | 3 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
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-x1 -x2 x3 -x4 -x5 x6 -x7 -x8 x9 -x10 -x11 -x12 x13 -x14 -x15 -x16 x17 -x18 -x19 x20 x21 -x22 x23 -x24