| Name | /PARTIAL-BIGINT-LIN/wcsp/pedigree/ normalized-sheep4r-4-0_wcsp.wbo |
| MD5SUM | 77d086fe6e58286424d14a47ccc7717b |
| 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 | 19440 |
| Total number of constraints | 986724 |
| Number of soft constraints | 984780 |
| Number of constraints which are clauses | 984780 |
| Number of constraints which are cardinality constraints (but not clauses) | 1944 |
| 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 | 245 |
| Min constraint cost | 1 |
| Max constraint cost | 245 |
| Sum of constraints costs | 240735276 |
| 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.0 2010-05-26 (complete) | 2701744 | OPTIMUM | 1239.3 | 976.696 |
| PB/CT 0.1 fixed (complete) | 2701749 | ? (MO) | 23.1305 | 23.1378 |
| PB/CT 0.1 (complete) | 2701747 | ? (MO) | 119.636 | 120.96 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701746 | ? (TO) | 144.641 | 2002.08 |
| SAT4J PB Resolution 2.2.1 (complete) | 2701748 | ? (TO) | 1800.18 | 1786.19 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701745 | ? (TO) | 1800.23 | 1030.34 |
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: 0--too large--