| Name | /SOFT-BIGINT-LIN/PB06/web/ uclid_pb_benchmarks/normalized-blast-tlan3.ucl--soft-0-100-0.wbo |
| MD5SUM | 878bbda538d22bb5879b300c70eb591d |
| Bench Category | SOFT-BIGINT-LIN (only soft constraints, big 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 | 9.1806 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 19944 |
| Total number of constraints | 50842 |
| Number of soft constraints | 50842 |
| Number of constraints which are clauses | 43898 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 6944 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 19 |
| Top cost | 2571036 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 2571035 |
| Biggest number in a constraint | 641 |
| Number of bits of the biggest number in a constraint | 10 |
| Biggest sum of numbers in a constraint | 2174 |
| 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 |
|---|---|---|---|---|
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090805 | OPTIMUM | 9.1806 | 7.06196 |
| toysat 2016-05-02 (complete) | 4093577 | OPTIMUM | 11.0293 | 11.0306 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092191 | OPTIMUM | 49.1265 | 41.6315 |
| NaPS 1.02 (complete) | 4094963 | MSAT (MO) | 196.927 | 196.966 |
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--too large--