Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.unbounded.all.ucl--soft-33-100-0.wbo |
MD5SUM | 762761f72e0afbc01d50f111610b6f68 |
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 | 72 |
Best CPU time to get the best result obtained on this benchmark | 1800.4 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 84836 |
Total number of constraints | 245062 |
Number of soft constraints | 164405 |
Number of constraints which are clauses | 233598 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 11464 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 15 |
Top cost | 8303909 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 8303908 |
Biggest number in a constraint | 129 |
Number of bits of the biggest number in a constraint | 8 |
Biggest sum of numbers in a constraint | 510 |
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) | 2698784 | MSAT (TO) | 1800.15 | 1800.09 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690859 | MSAT (TO) | 1800.35 | 1781.43 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691600 | MSAT (TO) | 1800.38 | 1815.65 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694261 | MSAT (TO) | 1800.39 | 1741.39 |
SAT4J PB Resolution 2.2.1 (complete) | 2698043 | MSAT (TO) | 1800.4 | 1794.16 |
PB/CT 0.1 (complete) | 2695002 | Signal | 1.61275 | 1.61261 |
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: 12551--too large--