| Name | /PARTIAL-BIGINT-LIN/wcsp/pedigree/ normalized-sheep4nr_wcsp.wbo |
| MD5SUM | 838792388aba1cb33fb875c1c7fc5e90 |
| 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 | 89900 |
| Total number of constraints | 5924003 |
| Number of soft constraints | 5915013 |
| Number of constraints which are clauses | 5915013 |
| Number of constraints which are cardinality constraints (but not clauses) | 8990 |
| 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 | 2482 |
| Min constraint cost | 1 |
| Max constraint cost | 2482 |
| Sum of constraints costs | 14625664017 |
| 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 Resolution 2.2.1 (complete) | 2701658 | ? | 230.598 | 163.651 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701656 | ? | 322.503 | 290.522 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701654 | ? | 599.759 | 556.681 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701655 | ? (exit code) | 165.281 | 146.43 |
| PB/CT 0.1 fixed (complete) | 2701659 | ? (MO) | 59.9729 | 60.0425 |
| PB/CT 0.1 (complete) | 2701657 | ? (TO) | 1800.06 | 1800.02 |
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: