| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9028_2-unsat--soft-33-100-0.wbo |
| MD5SUM | 1096a1113afd2ce4c9ae102562d2176b |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 34.1688 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 13832 |
| Total number of constraints | 45398 |
| Number of soft constraints | 30404 |
| Number of constraints which are clauses | 45098 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 300 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 73 |
| Top cost | 1539905 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1539904 |
| Biggest number in a constraint | 68 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 479 |
| Number of bits of the biggest sum of numbers | 9 |
| 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 PB 2.3.6 Resolution PB16 (complete) | 4090339 | OPTIMUM | 2.35364 | 1.07117 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091725 | OPTIMUM | 4.74228 | 2.33562 |
| toysat 2016-05-02 (complete) | 4093111 | OPTIMUM | 34.1688 | 34.1743 |
| NaPS 1.02 (complete) | 4094497 | OPTIMUM | 190.411 | 190.446 |
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: 1--too large--