| Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache-ibm-q-unbounded.Ic22arity.ucl--soft-66-100-0.wbo |
| MD5SUM | 44da2318c701d2d09f85776a05066743 |
| 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 | 573.152 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 87751 |
| Total number of constraints | 254772 |
| Number of soft constraints | 87185 |
| Number of constraints which are clauses | 247060 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 7712 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 15 |
| Top cost | 4415279 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 4415278 |
| Biggest number in a constraint | 130 |
| Number of bits of the biggest number in a constraint | 8 |
| Biggest sum of numbers in a constraint | 512 |
| Number of bits of the biggest sum of numbers | 10 |
| 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 Resolution 2.2.1 (complete) | 2697999 | OPTIMUM | 573.152 | 570.211 |
| PB/CT 0.1 fixed (complete) | 2698740 | MSAT (TO) | 1800.17 | 1800.08 |
| SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691556 | MSAT (TO) | 1800.25 | 1784.31 |
| SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694217 | MSAT (TO) | 1800.38 | 1744.18 |
| PB/CT 0.1 (complete) | 2694958 | Signal | 1.60176 | 1.60109 |
| SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690815 | Wrong Opt. | 534.045 | 524.489 |
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--