Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache-ibm-q-full.all.ucl--soft-33-100-0.wbo |
MD5SUM | 4413c11303f36c44f1f66d14c139a72d |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MSAT |
Best cost obtained on this benchmark | 287 |
Best CPU time to get the best result obtained on this benchmark | 1800.38 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 81558 |
Total number of constraints | 240469 |
Number of soft constraints | 160906 |
Number of constraints which are clauses | 235865 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 4604 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 8140646 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 8140645 |
Biggest number in a constraint | 68 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 257 |
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 |
---|---|---|---|---|
PB/CT 0.1 fixed (complete) | 2698735 | MSAT (TO) | 1800.12 | 1800.08 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691551 | MSAT (TO) | 1800.3 | 1779.14 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694212 | MSAT (TO) | 1800.36 | 1779.51 |
SAT4J PB Resolution 2.2.1 (complete) | 2697994 | MSAT (TO) | 1800.38 | 1796.38 |
PB/CT 0.1 (complete) | 2694953 | Signal | 1.43678 | 1.43735 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690810 | Wrong Cert. | 1800.59 | 1781.61 |
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: 9792--too large--