| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j6033_2-unsat--soft-66-100-0.wbo |
| MD5SUM | 88bd8107cec9b448bb9d4a61d3b4c661 |
| 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 | 51 |
| Best CPU time to get the best result obtained on this benchmark | 2.08868 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 12200 |
| Total number of constraints | 42056 |
| Number of soft constraints | 14390 |
| Number of constraints which are clauses | 41660 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 396 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 18 |
| Top cost | 725721 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 725720 |
| Biggest number in a constraint | 13 |
| Number of bits of the biggest number in a constraint | 4 |
| Biggest sum of numbers in a constraint | 116 |
| Number of bits of the biggest sum of numbers | 7 |
| 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) | 4090695 | OPTIMUM | 1.83372 | 0.89098 |
| toysat 2016-05-02 (complete) | 4093467 | OPTIMUM | 2.08868 | 2.09907 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092081 | OPTIMUM | 3.78342 | 2.15424 |
| NaPS 1.02 (complete) | 4094853 | OPTIMUM | 92.4819 | 92.496 |
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: 51--too large--