| Name | /PARTIAL-BIGINT-LIN/wcsp/ mprime/normalized-mprime01cc_wcsp.wbo |
| MD5SUM | a5b138948f5c7079c508c3bfa1ead813 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 603 |
| Best CPU time to get the best result obtained on this benchmark | 1.70174 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 733 |
| Total number of constraints | 18009 |
| Number of soft constraints | 17802 |
| Number of constraints which are clauses | 17802 |
| Number of constraints which are cardinality constraints (but not clauses) | 207 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 18 |
| Top cost | 40400 |
| Min constraint cost | 1 |
| Max constraint cost | 40400 |
| Sum of constraints costs | 709989424 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 19 |
| Number of bits of the biggest sum of numbers | 5 |
| 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) | 4093188 | OPTIMUM | 1.70174 | 1.7044 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090416 | OPTIMUM | 2.12468 | 0.904661 |
| NaPS 1.02 (complete) | 4094574 | OPTIMUM | 2.21066 | 2.21596 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091802 | OPTIMUM | 3.63245 | 3.29559 |
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: 603-x731 x732 -x733