| Name | /PARTIAL-SMALLINT-LIN/wcsp/coloring/ normalized-myciel5g-6_wcsp.wbo |
| MD5SUM | da787cbafe516b136b04c595f8c05f3f |
| 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 | 0 |
| 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 | 282 |
| Total number of constraints | 1463 |
| Number of soft constraints | 1416 |
| Number of constraints which are clauses | 1416 |
| Number of constraints which are cardinality constraints (but not clauses) | 47 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 6 |
| Top cost | 237 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 1416 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 7 |
| 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) | 3448719 | OPTIMUM | 0.004999 | 0.00768292 |
| Sat4j Resolution 2011-06-08 (complete) | 3492831 | OPTIMUM | 0.429934 | 0.290498 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447982 | OPTIMUM | 2.71459 | 2.71468 |
| wbo 1.6 (complete) | 3447245 | MSAT | 0.002999 | 0.005847 |
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: 0-x275 -x276 x277 -x278 -x279 -x280 -x281 -x282