| Name | /PARTIAL-BIGINT-LIN/wcsp/scens/ normalized-scen06-18reduc_wcsp.wbo |
| MD5SUM | da80b320d983b4610e4558746e61248d |
| 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 | 1758 |
| Total number of constraints | 105203 |
| Number of soft constraints | 105121 |
| Number of constraints which are clauses | 105121 |
| Number of constraints which are cardinality constraints (but not clauses) | 82 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 26 |
| Top cost | 3389 |
| Min constraint cost | 1 |
| Max constraint cost | 2436 |
| Sum of constraints costs | 36645766 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 27 |
| 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 |
|---|---|---|---|---|
| NaPS 1.02 (complete) | 4094613 | ? (MO) | 192.606 | 192.645 |
| toysat 2016-05-02 (complete) | 4093227 | ? (TO) | 1800.17 | 1800.48 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090455 | Wrong Cert. | 1800.09 | 1797.85 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091841 | Wrong Cert. | 1800.19 | 899.733 |
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: