| Name | /PARTIAL-SMALLINT-LIN/wcsp/coloring/ normalized-geom40-2_wcsp.wbo |
| MD5SUM | dc0207dd780e8486ac4fdb37fec549e2 |
| 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 | 22 |
| Best CPU time to get the best result obtained on this benchmark | 0.51592 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 80 |
| Total number of constraints | 196 |
| Number of soft constraints | 156 |
| Number of constraints which are clauses | 156 |
| Number of constraints which are cardinality constraints (but not clauses) | 40 |
| 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 | 79 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 156 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093500 | OPTIMUM | 0.51592 | 0.51642 |
| NaPS 1.02 (complete) | 4094886 | OPTIMUM | 0.639902 | 0.640023 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090728 | MSAT (TO) | 1800.04 | 1798.24 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092114 | MSAT (TO) | 1800.09 | 900.366 |
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: 22-x71 x72 -x73 x74 -x75 x76 -x77 x78 -x79 x80