| Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-elf.rf9.ucl--soft-33-100-0.wbo |
| MD5SUM | 77b6d97d3956f909997161d03ad8f07d |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 1 |
| Best CPU time to get the best result obtained on this benchmark | 33.119 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 20445 |
| Total number of constraints | 58444 |
| Number of soft constraints | 38856 |
| Number of constraints which are clauses | 56420 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 2024 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 1963811 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1963810 |
| Biggest number in a constraint | 65 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 254 |
| Number of bits of the biggest sum of numbers | 8 |
| 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) | 2691581 | OPTIMUM | 14.0459 | 11.7077 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690840 | OPTIMUM | 18.2122 | 16.5868 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694242 | OPTIMUM | 22.4406 | 21.5092 |
| SAT4J PB Resolution 2.2.1 (complete) | 2698024 | OPTIMUM | 33.119 | 37.0339 |
| PB/CT 0.1 fixed (complete) | 2698765 | MSAT (TO) | 1800.08 | 1800.03 |
| PB/CT 0.1 (complete) | 2694983 | Signal | 0.359944 | 0.360708 |
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: 1--too large--