| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf8.ucl--soft-66-100-0.wbo |
| MD5SUM | 321b555888f42ada31256d1d017f1ca8 |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 4.85226 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 6832 |
| Total number of constraints | 19477 |
| Number of soft constraints | 6629 |
| Number of constraints which are clauses | 18953 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 524 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 11 |
| Top cost | 330532 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 330531 |
| Biggest number in a constraint | 33 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 126 |
| 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) | 4110054 | OPTIMUM | 4.85226 | 4.85759 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110052 | OPTIMUM | 5.50216 | 4.13492 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110053 | OPTIMUM | 26.9599 | 46.0774 |
| NaPS 1.02 (complete) | 4110055 | OPTIMUM | 82.3675 | 82.3806 |
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-x6831 -x6832