| Name | /PARTIAL-SMALLINT-LIN/PB06/web/ uclid_pb_benchmarks/normalized-blast-floppy1-2.ucl--soft-66-100-0.wbo |
| MD5SUM | a607111f042ada22bfc64331fa1ae9a2 |
| 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 | 0.089986 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 152 |
| Total number of constraints | 127 |
| Number of soft constraints | 41 |
| Number of constraints which are clauses | 77 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 50 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 19 |
| Top cost | 1893 |
| Min constraint cost | 1 |
| Max constraint cost | 92 |
| Sum of constraints costs | 1892 |
| Biggest number in a constraint | 772 |
| Number of bits of the biggest number in a constraint | 10 |
| Biggest sum of numbers in a constraint | 2305 |
| Number of bits of the biggest sum of numbers | 12 |
| 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) | 4093426 | OPTIMUM | 0.089986 | 0.090401 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090654 | OPTIMUM | 0.52292 | 0.287211 |
| NaPS 1.02 (complete) | 4094812 | OPTIMUM | 0.739887 | 0.740112 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092040 | OPTIMUM | 2.94355 | 1.40396 |
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: 1x151 x152