Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j605_10-unsat--soft-33-100-0.wbo |
MD5SUM | 511a250f181b5f88452d86a600065d28 |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MSAT |
Best cost obtained on this benchmark | 540 |
Best CPU time to get the best result obtained on this benchmark | 1797.03 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 9638 |
Total number of constraints | 30220 |
Number of soft constraints | 20091 |
Number of constraints which are clauses | 29908 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 312 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 38 |
Top cost | 1014619 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1014618 |
Biggest number in a constraint | 20 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 254 |
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 |
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: 540x7 x6 x5 x4 x3 x2 x1