Name | /SOFT-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.burch_dill.8.accl.ucl--soft-0-100-0.wbo |
MD5SUM | a31a9948f18584eba3770008abd12676 |
Bench Category | SOFT-BIGINT-LIN (only soft constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MSAT TO |
Best cost obtained on this benchmark | 358 |
Best CPU time to get the best result obtained on this benchmark | 1800.21 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 21380 |
Total number of constraints | 60984 |
Number of soft constraints | 60984 |
Number of constraints which are clauses | 58828 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 2156 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 3073241 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 3073240 |
Biggest number in a constraint | 73 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 262 |
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 |
---|---|---|---|---|
Sat4j Resolution 2011-06-08 (complete) | 3492429 | MSAT (TO) | 1800.21 | 1797.78 |
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: 358--too large--