Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j3046_4-unsat--soft-33-100-0.wbo |
MD5SUM | 21194a5c96fb00b1cb0d9bbfc15b0e5d |
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 | 2 |
Best CPU time to get the best result obtained on this benchmark | 0.045992 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 3968 |
Total number of constraints | 13430 |
Number of soft constraints | 8969 |
Number of constraints which are clauses | 13178 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 252 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 30 |
Top cost | 452114 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 452113 |
Biggest number in a constraint | 25 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 187 |
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: 2-x3963 -x3964 -x3965 -x3966 -x3967 x3968