| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j907_8-unsat--soft-66-100-0.wbo |
| MD5SUM | 8152575fe2efc1e2a3706cdbc35535cf |
| 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 | 14 |
| Best CPU time to get the best result obtained on this benchmark | 10.1685 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 10920 |
| Total number of constraints | 34033 |
| Number of soft constraints | 11497 |
| Number of constraints which are clauses | 33797 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 236 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 50 |
| Top cost | 583113 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 583112 |
| Biggest number in a constraint | 60 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 345 |
| 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) | 4090708 | OPTIMUM | 1.90271 | 0.849571 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092094 | OPTIMUM | 4.17736 | 2.06568 |
| toysat 2016-05-02 (complete) | 4093480 | OPTIMUM | 10.1685 | 10.174 |
| NaPS 1.02 (complete) | 4094866 | OPTIMUM | 68.9285 | 68.94 |
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: 14--too large--