| Name | /PARTIAL-SMALLINT-LIN/wcsp/dimacs/ normalized-dubois100_ext.wbo |
| MD5SUM | f32f9fbbe8d0be7126e44da0da47de41 |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 0.016997 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 600 |
| Total number of constraints | 1100 |
| Number of soft constraints | 800 |
| Number of constraints which are clauses | 800 |
| Number of constraints which are cardinality constraints (but not clauses) | 300 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 3 |
| Top cost | 801 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 800 |
| Biggest number in a constraint | 2 |
| Number of bits of the biggest number in a constraint | 2 |
| 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: 1-x593 x594 -x595 x596 -x597 x598 -x599 x600