| 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 | MSAT |
| Best cost obtained on this benchmark | 3506826 |
| Best CPU time to get the best result obtained on this benchmark | 1800.27 |
| 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 |
|---|---|---|---|---|
| PB/CT 0.1 fixed (complete) | 2700969 | MSAT (TO) | 1800.13 | 1800.09 |
| SAT4J PB Resolution 2.2.1 (complete) | 2700968 | MSAT (TO) | 1800.27 | 1796.5 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2700965 | Wrong UNSAT | 3.76643 | 1.99319 |
| PB/CT 0.1 (complete) | 2700967 | Wrong UNSAT | 36.2955 | 36.2945 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2700964 | Wrong UNSAT | 39.607 | 32.1636 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2700966 | Wrong UNSAT | 45.1971 | 34.5341 |
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: 4314475--too large--