| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9039_3-unsat--soft-33-100-0.wbo |
| MD5SUM | 6cc35be76a92b4bf23f7bdaafc76a3c9 |
| 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 | 10 |
| Best CPU time to get the best result obtained on this benchmark | 11.8692 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 15106 |
| Total number of constraints | 51849 |
| Number of soft constraints | 34948 |
| Number of constraints which are clauses | 51521 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 328 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 50 |
| Top cost | 1769987 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1769986 |
| Biggest number in a constraint | 42 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 335 |
| 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) | 4090342 | OPTIMUM | 2.6026 | 1.177 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091728 | OPTIMUM | 5.11222 | 2.34684 |
| toysat 2016-05-02 (complete) | 4093114 | OPTIMUM | 11.8692 | 11.873 |
| NaPS 1.02 (complete) | 4094500 | OPTIMUM | 260.587 | 260.633 |
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: 10--too large--