| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf6.ucl--soft-66-100-0.wbo |
| MD5SUM | 229cdc62bd8923cf935a8d792017a43b |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.575911 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1804 |
| Total number of constraints | 4931 |
| Number of soft constraints | 1692 |
| Number of constraints which are clauses | 4707 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 224 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 9 |
| Top cost | 86670 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 86669 |
| Biggest number in a constraint | 19 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 64 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4110030 | OPTIMUM | 0.575911 | 0.576598 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110028 | OPTIMUM | 1.53277 | 0.666363 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110029 | OPTIMUM | 2.6446 | 3.46474 |
| NaPS 1.02 (complete) | 4110031 | OPTIMUM | 8.62969 | 8.63295 |
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: 2-x1801 x1802 x1803 x1804