| Name | /SOFT-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf7.ucl--soft-0-100-0.wbo |
| MD5SUM | 97204d9d3071460ca4d6ce46ec0d7b5a |
| Bench Category | SOFT-SMALLINT-LIN (only soft 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 | 2.11968 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 3736 |
| Total number of constraints | 10457 |
| Number of soft constraints | 10457 |
| Number of constraints which are clauses | 10089 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 368 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 11 |
| Top cost | 528640 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 528639 |
| 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) | 4093053 | OPTIMUM | 2.11968 | 2.12648 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090281 | OPTIMUM | 2.76358 | 1.19753 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091667 | OPTIMUM | 7.99079 | 13.544 |
| NaPS 1.02 (complete) | 4094439 | OPTIMUM | 76.7043 | 76.7165 |
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-x3731 -x3732 -x3733 x3734 -x3735 -x3736