| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j9028_2-unsat--soft-66-100-0.wbo |
| MD5SUM | c93ff145655ec29711075f2ee972c9ae |
| 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 | 20 |
| Best CPU time to get the best result obtained on this benchmark | 34.3008 |
| 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 | 15436 |
| 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 | 781630 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 781629 |
| 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) | 4090705 | OPTIMUM | 2.06469 | 0.942467 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092091 | OPTIMUM | 4.44332 | 2.25397 |
| toysat 2016-05-02 (complete) | 4093477 | OPTIMUM | 34.3008 | 34.3079 |
| NaPS 1.02 (complete) | 4094863 | OPTIMUM | 96.6203 | 96.6414 |
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: 20--too large--