| Name | /SOFT-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9028_2-unsat--soft-0-100-0.wbo |
| MD5SUM | 4d1c58660c75ed95d3f2b5267338b439 |
| Bench Category | SOFT-BIGINT-LIN (only soft constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 2.38364 |
| 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 | 45398 |
| 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 | 2287724 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 2287723 |
| 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) | 4090845 | OPTIMUM | 2.38364 | 1.12731 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092231 | OPTIMUM | 4.39533 | 2.38656 |
| toysat 2016-05-02 (complete) | 4093617 | OPTIMUM | 35.4436 | 35.4565 |
| NaPS 1.02 (complete) | 4095003 | MSAT (MO) | 100.209 | 101.885 |
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: 8--too large--