| Name | /PARTIAL-SMALLINT-LIN/wcsp/coloring/ normalized-le450-5a-4_wcsp.wbo |
| MD5SUM | 2fe66c717d74f1b0f598aebf3623bd17 |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MSAT TO |
| Best cost obtained on this benchmark | 969 |
| Best CPU time to get the best result obtained on this benchmark | 1800.37 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1800 |
| Total number of constraints | 23306 |
| Number of soft constraints | 22856 |
| Number of constraints which are clauses | 22856 |
| Number of constraints which are cardinality constraints (but not clauses) | 450 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 4 |
| Top cost | 5715 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 22856 |
| 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 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| clasp 2.0-RC2 (complete) | 3448725 | MSAT (TO) | 1800.09 | 1800.03 |
| Sat4j Resolution 2011-06-08 (complete) | 3493006 | MSAT (TO) | 1800.13 | 1797.27 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447988 | MSAT (TO) | 1800.37 | 1800.32 |
| wbo 1.6 (complete) | 3447251 | ? (TO) | 1800.08 | 1800.02 |
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: 1421-x1795 -x1796 -x1797 x1798 -x1799 -x1800