Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.tag12.ucl--soft-33-100-0.wbo |
MD5SUM | a3e55b5451bbddd3df8a322bc84b8daa |
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 | 147.183 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 20605 |
Total number of constraints | 59851 |
Number of soft constraints | 40072 |
Number of constraints which are clauses | 58675 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 1176 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 2019653 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2019652 |
Biggest number in a constraint | 41 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 134 |
Number of bits of the biggest sum of numbers | 8 |
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) | 2698040 | OPTIMUM | 147.183 | 147.847 |
PB/CT 0.1 fixed (complete) | 2698781 | MSAT (TO) | 1800.08 | 1800.03 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691597 | MSAT (TO) | 1800.35 | 1742.72 |
PB/CT 0.1 (complete) | 2694999 | Signal | 0.353945 | 0.35403 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690856 | Wrong Opt. | 199.881 | 197.173 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694258 | Wrong Opt. | 366.283 | 280.274 |
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--