Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-blast-tlan3.ucl--soft-66-100-0.wbo |
MD5SUM | b00997dbe8c129e1e2409a2ca7003a2b |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 4 |
Best CPU time to get the best result obtained on this benchmark | 0.224965 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 19944 |
Total number of constraints | 50842 |
Number of soft constraints | 17258 |
Number of constraints which are clauses | 43898 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 6944 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 19 |
Top cost | 865635 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 865634 |
Biggest number in a constraint | 641 |
Number of bits of the biggest number in a constraint | 10 |
Biggest sum of numbers in a constraint | 2174 |
Number of bits of the biggest sum of numbers | 12 |
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 |
---|---|---|---|---|
wbo 1.6 (complete) | 3446671 | OPTIMUM | 0.224965 | 0.227209 |
Sat4j Resolution 2011-06-08 (complete) | 3492211 | OPTIMUM | 2.93255 | 1.5758 |
clasp 2.0-RC2 (complete) | 3448287 | OPTIMUM | 26.6969 | 26.6964 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447408 | MSAT (TO) | 1800.51 | 1800.48 |
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: 4--too large--