| Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capa_wcsp.wbo |
| MD5SUM | 143d76bff22b6cbc85097a85314f53ce |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MSAT |
| Best cost obtained on this benchmark | 25941163 |
| Best CPU time to get the best result obtained on this benchmark | 1800.32 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 100200 |
| Total number of constraints | 201200 |
| Number of soft constraints | 200100 |
| Number of constraints which are clauses | 200100 |
| Number of constraints which are cardinality constraints (but not clauses) | 1100 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 100 |
| Top cost | 238092768 |
| Min constraint cost | 1 |
| Max constraint cost | 238092768 |
| Sum of constraints costs | 23812436850104 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 101 |
| Number of bits of the biggest sum of numbers | 7 |
| 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 |
|---|---|---|---|---|
| PB/CT 0.1 fixed (complete) | 2701161 | MSAT (TO) | 1800.11 | 1800.09 |
| SAT4J PB Resolution 2.2.1 (complete) | 2701160 | MSAT (TO) | 1800.32 | 1796.43 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701157 | Wrong UNSAT | 3.85241 | 2.11144 |
| PB/CT 0.1 (complete) | 2701159 | Wrong UNSAT | 45.1851 | 45.1878 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701156 | Wrong UNSAT | 48.4726 | 40.4318 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701158 | Wrong UNSAT | 58.0632 | 43.3766 |
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: 26676340--too large--