Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-cache.inv12.ucl--soft-33-100-0.wbo |
MD5SUM | d2bb62ae8ab16c7fb57ef4b7c9a87326 |
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 | 155.471 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 25800 |
Total number of constraints | 76699 |
Number of soft constraints | 51382 |
Number of constraints which are clauses | 76319 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 380 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 9 |
Top cost | 2592280 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2592279 |
Biggest number in a constraint | 17 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 62 |
Number of bits of the biggest sum of numbers | 6 |
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) | 2698001 | OPTIMUM | 155.471 | 157.782 |
PB/CT 0.1 fixed (complete) | 2698742 | MSAT (TO) | 1800.11 | 1800.03 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691558 | MSAT (TO) | 1800.3 | 1771.35 |
PB/CT 0.1 (complete) | 2694960 | Signal | 0.431933 | 0.432461 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690817 | Wrong Opt. | 40.1469 | 37.7427 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694219 | Wrong Opt. | 843.264 | 810.988 |
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--