| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j6030_9-unsat--soft-66-100-0.wbo |
| MD5SUM | 1889fba1555b8697309aed0b2b80cc12 |
| 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 | 8 |
| Best CPU time to get the best result obtained on this benchmark | 13.9599 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 11956 |
| Total number of constraints | 39426 |
| Number of soft constraints | 13393 |
| Number of constraints which are clauses | 39038 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 388 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 60 |
| Top cost | 678604 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 678603 |
| Biggest number in a constraint | 33 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 416 |
| 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) | 4090694 | OPTIMUM | 2.18267 | 0.965304 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092080 | OPTIMUM | 4.77427 | 2.16615 |
| toysat 2016-05-02 (complete) | 4093466 | OPTIMUM | 13.9599 | 13.9622 |
| NaPS 1.02 (complete) | 4094852 | OPTIMUM | 79.6209 | 79.6345 |
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--