Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache.inv14.ucl--soft-33-100-0.wbo |
MD5SUM | 65b8562e8b2a6565f581ae80d9fbd0ff |
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 | 353 |
Best CPU time to get the best result obtained on this benchmark | 1800.34 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 62704 |
Total number of constraints | 187107 |
Number of soft constraints | 125731 |
Number of constraints which are clauses | 186603 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 504 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 6367889 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 6367888 |
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 |
---|---|---|---|---|
PB/CT 0.1 fixed (complete) | 2698774 | MSAT (TO) | 1800.14 | 1800.06 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694251 | MSAT (TO) | 1800.23 | 1757.02 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690849 | MSAT (TO) | 1800.27 | 1786.44 |
SAT4J PB Resolution 2.2.1 (complete) | 2698033 | MSAT (TO) | 1800.34 | 1800.85 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691590 | MSAT (TO) | 1800.36 | 1803.84 |
PB/CT 0.1 (complete) | 2694992 | Signal | 1.05284 | 1.05212 |
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: 5391--too large--