| Name | /PARTIAL-SMALLINT-LIN/wcsp/coloring/ normalized-le450-5a-2_wcsp.wbo |
| MD5SUM | f22a0f0686559d8ded0c30a6073a8ba7 |
| 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 | 2637 |
| Best CPU time to get the best result obtained on this benchmark | 1800.17 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 900 |
| Total number of constraints | 11878 |
| Number of soft constraints | 11428 |
| Number of constraints which are clauses | 11428 |
| 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 | 2 |
| Top cost | 5715 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 11428 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 3 |
| Number of bits of the biggest sum of numbers | 2 |
| 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) | 3448724 | MSAT (TO) | 1800.06 | 1800.02 |
| Sat4j Resolution 2011-06-08 (complete) | 3492836 | MSAT (TO) | 1800.17 | 1794.85 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447987 | MSAT (TO) | 1800.31 | 1800.26 |
| wbo 1.6 (complete) | 3447250 | ? (TO) | 1800.07 | 1800.03 |
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: 2725-x893 x894 x895 -x896 -x897 x898 x899 -x900