| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j309_10-unsat--soft-66-100-0.wbo |
| MD5SUM | f8e585aed580dee910146256b9cb9d64 |
| 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 | 1 |
| Best CPU time to get the best result obtained on this benchmark | 4.72128 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 5456 |
| Total number of constraints | 17015 |
| Number of soft constraints | 5692 |
| Number of constraints which are clauses | 16667 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 348 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 26 |
| Top cost | 285936 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 285935 |
| Biggest number in a constraint | 16 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 177 |
| Number of bits of the biggest sum of numbers | 8 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093459 | OPTIMUM | 4.72128 | 4.72391 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090687 | OPTIMUM | 8.48171 | 6.95925 |
| NaPS 1.02 (complete) | 4094845 | OPTIMUM | 100.198 | 100.216 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092073 | OPTIMUM | 196.116 | 202.882 |
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: 1-x5451 -x5452 -x5453 -x5454 -x5455 x5456