| Name | /PARTIAL-SMALLINT-LIN/wcsp/dimacs/ normalized-dubois29_ext.wbo |
| MD5SUM | 4a4f19306e34a875bfa48716b2857423 |
| 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.004999 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 174 |
| Total number of constraints | 319 |
| Number of soft constraints | 232 |
| Number of constraints which are clauses | 232 |
| Number of constraints which are cardinality constraints (but not clauses) | 87 |
| 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 | 233 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 232 |
| 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) | 3448650 | OPTIMUM | 0.004999 | 0.00574792 |
| wbo 1.6 (complete) | 3447176 | OPTIMUM | 0.007997 | 0.00792096 |
| Sat4j Resolution 2011-06-08 (complete) | 3492762 | OPTIMUM | 0.437932 | 0.271518 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447913 | OPTIMUM | 0.694894 | 0.69622 |
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: 1x164 -x165 x166 -x167 x168 -x169 x170 -x171 x172 -x173 x174