| Name | /PARTIAL-SMALLINT-LIN/wcsp/dimacs/ normalized-dubois22_ext.wbo |
| MD5SUM | b5562b63e22c825abae2b216b18049c8 |
| 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.003998 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 132 |
| Total number of constraints | 242 |
| Number of soft constraints | 176 |
| Number of constraints which are clauses | 176 |
| Number of constraints which are cardinality constraints (but not clauses) | 66 |
| 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 | 177 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 176 |
| 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 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| clasp 2.0-RC2 (complete) | 3448649 | OPTIMUM | 0.003998 | 0.00583798 |
| wbo 1.6 (complete) | 3447175 | OPTIMUM | 0.004998 | 0.00580308 |
| Sat4j Resolution 2011-06-08 (complete) | 3492761 | OPTIMUM | 0.347946 | 0.235513 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447912 | OPTIMUM | 0.566913 | 0.56736 |
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-x125 x126 -x127 x128 -x129 x130 -x131 x132