| Name | /PARTIAL-SMALLINT-LIN/PB06/web/ uclid_pb_benchmarks/normalized-blast-floppy1-3.ucl--soft-33-100-0.wbo |
| MD5SUM | e0a386232805af8ddb0c67f40a0a75f2 |
| 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 | 0.068989 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 274 |
| Total number of constraints | 259 |
| Number of soft constraints | 167 |
| Number of constraints which are clauses | 159 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 100 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 9191 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 9190 |
| Biggest number in a constraint | 68 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 257 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093427 | OPTIMUM | 0.068989 | 0.069814 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090655 | OPTIMUM | 0.292955 | 0.209142 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092041 | OPTIMUM | 0.373942 | 1.22139 |
| NaPS 1.02 (complete) | 4094813 | OPTIMUM | 0.787879 | 0.788287 |
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: 8x271 x272 x273 x274