| Name | /PARTIAL-BIGINT-LIN/wcsp/scens/ normalized-scen08reduc_wcsp.wbo |
| MD5SUM | a57c8a6c45b3bda1a2096d1102135404 |
| 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 | 14194 |
| Total number of constraints | 1450105 |
| Number of soft constraints | 1449740 |
| Number of constraints which are clauses | 1449740 |
| Number of constraints which are cardinality constraints (but not clauses) | 365 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 44 |
| Top cost | 262 |
| Min constraint cost | 1 |
| Max constraint cost | 30 |
| Sum of constraints costs | 6361774 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 45 |
| Number of bits of the biggest sum of numbers | 6 |
| 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) | 2701325 | UNSAT | 36.1705 | 15.2221 |
| PB/CT 0.1 fixed (complete) | 2701329 | ? (MO) | 25.6421 | 25.6412 |
| PB/CT 0.1 (complete) | 2701327 | ? (TO) | 1800.04 | 1800.01 |
| SAT4J PB Resolution 2.2.1 (complete) | 2701328 | ? (TO) | 1800.16 | 1779.97 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701324 | ? (TO) | 1800.29 | 1225.39 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701326 | ? (TO) | 1800.32 | 1120.19 |
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: