| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9015_10-unsat--soft-33-100-0.wbo |
| MD5SUM | 3402b4987c79c2ab9cecc3296840b6e6 |
| 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 | 33 |
| Best CPU time to get the best result obtained on this benchmark | 44.5992 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 14196 |
| Total number of constraints | 44553 |
| Number of soft constraints | 29847 |
| Number of constraints which are clauses | 44245 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 308 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 90 |
| Top cost | 1501276 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1501275 |
| Biggest number in a constraint | 66 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 565 |
| 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 PB 2.3.6 Resolution PB16 (complete) | 4090338 | OPTIMUM | 2.45363 | 1.12583 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091724 | OPTIMUM | 4.91325 | 2.34386 |
| toysat 2016-05-02 (complete) | 4093110 | OPTIMUM | 44.5992 | 44.6057 |
| NaPS 1.02 (complete) | 4094496 | MSAT | 228.59 | 228.664 |
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: 33--too large--