| Name | /PARTIAL-BIGINT-LIN/wcsp/pedigree/ normalized-sheep4r-4-2_wcsp.wbo |
| MD5SUM | 4279ee44886a475273bf158c4a05b4f8 |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 47.8277 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 22540 |
| Total number of constraints | 1101088 |
| Number of soft constraints | 1098834 |
| Number of constraints which are clauses | 1098834 |
| Number of constraints which are cardinality constraints (but not clauses) | 2254 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 10 |
| Top cost | 899 |
| Min constraint cost | 1 |
| Max constraint cost | 899 |
| Sum of constraints costs | 980594130 |
| Biggest number in a constraint | 2 |
| Number of bits of the biggest number in a constraint | 2 |
| Biggest sum of numbers in a constraint | 11 |
| Number of bits of the biggest sum of numbers | 4 |
| 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) | 4090437 | OPTIMUM | 15.7336 | 11.9134 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091823 | OPTIMUM | 37.1584 | 23.9042 |
| NaPS 1.02 (complete) | 4094595 | OPTIMUM | 47.8277 | 47.8345 |
| toysat 2016-05-02 (complete) | 4093209 | ? (TO) | 1800.38 | 1800.66 |
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: 1--too large--