Name | /PARTIAL-SMALLINT-LIN/wcsp/ academics/normalized-send_wcsp.wbo |
MD5SUM | 579550ba8a4368ea911c9080981cd647 |
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 | 0 |
Best CPU time to get the best result obtained on this benchmark | 0.084986 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 84 |
Total number of constraints | 11473 |
Number of soft constraints | 11462 |
Number of constraints which are clauses | 11462 |
Number of constraints which are cardinality constraints (but not clauses) | 11 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 10 |
Top cost | 1 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 11462 |
Biggest number in a constraint | 4 |
Number of bits of the biggest number in a constraint | 3 |
Biggest sum of numbers in a constraint | 11 |
Number of bits of the biggest sum of numbers | 4 |
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: 0-x78 -x79 x80 -x81 x82 x83 -x84