| Name | /PARTIAL-BIGINT-LIN/wcsp/pedigree/ normalized-sheep4r_wcsp.wbo |
| MD5SUM | 6de6e540477f7e35d5e4504631857538 |
| 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 | 89200 |
| Total number of constraints | 5870368 |
| Number of soft constraints | 5861448 |
| Number of constraints which are clauses | 5861448 |
| Number of constraints which are cardinality constraints (but not clauses) | 8920 |
| 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 | 2447 |
| Min constraint cost | 1 |
| Max constraint cost | 2447 |
| Sum of constraints costs | 14289117012 |
| 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 CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701739 | ? | 150.51 | 126.064 |
| SAT4J PB Resolution 2.2.1 (complete) | 2701742 | ? | 219.038 | 162.81 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701740 | ? | 346.173 | 313.139 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701738 | ? | 1338.45 | 1294.65 |
| PB/CT 0.1 fixed (complete) | 2701743 | ? (MO) | 55.4316 | 57.4312 |
| PB/CT 0.1 (complete) | 2701741 | ? (TO) | 1800.08 | 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: