| Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capmq3_wcsp.wbo |
| MD5SUM | a37652ece280d7ba5cfd0ed956989365 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | |
| Best cost obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 90600 |
| Total number of constraints | 180900 |
| Number of soft constraints | 180300 |
| Number of constraints which are clauses | 180300 |
| Number of constraints which are cardinality constraints (but not clauses) | 600 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 300 |
| Top cost | 156989569 |
| Min constraint cost | 1 |
| Max constraint cost | 156989569 |
| Sum of constraints costs | 14130358978021 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 301 |
| Number of bits of the biggest sum of numbers | 9 |
| 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 |
|---|---|---|---|---|
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110512 | MSAT (TO) | 1800.03 | 1797.59 |
| NaPS 1.02 (complete) | 4110515 | ? (TO) | 1800.02 | 1800.3 |
| toysat 2016-05-02 (complete) | 4110514 | ? (TO) | 1800.06 | 1800.35 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110513 | ? (TO) | 1803.36 | 901.515 |
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: 4310083--too large--