| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9014_1-unsat--soft-33-100-0.wbo |
| MD5SUM | ddc90e45ab3c829416cbbd46ed39fa55 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 47 |
| Best CPU time to get the best result obtained on this benchmark | 1759.82 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 16198 |
| Total number of constraints | 50975 |
| Number of soft constraints | 34106 |
| Number of constraints which are clauses | 50623 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 352 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 90 |
| Top cost | 1723662 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1723661 |
| Biggest number in a constraint | 51 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 588 |
| Number of bits of the biggest sum of numbers | 10 |
| 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 |
|---|---|---|---|---|
| Sat4j Resolution 2011-06-08 (complete) | 3492137 | OPTIMUM | 1759.82 | 1757.92 |
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: 47--too large--