Name | /PARTIAL-SMALLINT-LIN/PB06/submitted-PB05/aloul/FPGA_SAT05/ normalized-chnl40_41_pb.cnf.cr--soft-33-100-0.wbo |
MD5SUM | f511ebc8ef7d333a60d28a0c67ab699d |
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 | 2.06669 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 3280 |
Total number of constraints | 162 |
Number of soft constraints | 117 |
Number of constraints which are clauses | 82 |
Number of constraints which are cardinality constraints (but not clauses) | 80 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 40 |
Maximum length of a constraint | 41 |
Top cost | 5670 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 5669 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 42 |
Number of bits of the biggest sum of numbers | 6 |
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: 4-x4 -x3 -x2 -x1