| Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache-ibm-q-unbounded.Icl2arity.ucl--soft-66-100-0.wbo |
| MD5SUM | 1e3632de9e14ff29039922783c5be740 |
| 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 | 17.6733 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 23837 |
| Total number of constraints | 67568 |
| Number of soft constraints | 22831 |
| Number of constraints which are clauses | 64398 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 3170 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 1153610 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1153609 |
| Biggest number in a constraint | 66 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 256 |
| Number of bits of the biggest sum of numbers | 9 |
| 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 2.3.6 Resolution PB16 (complete) | 4090297 | OPTIMUM | 5.41618 | 3.93946 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091683 | OPTIMUM | 11.1143 | 6.65069 |
| toysat 2016-05-02 (complete) | 4093069 | OPTIMUM | 17.6733 | 17.6766 |
| NaPS 1.02 (complete) | 4094455 | MSAT | 1063.58 | 1063.75 |
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--