| Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.burch_dill.8.accl.ucl--soft-66-100-0.wbo |
| MD5SUM | 7efdf9913882433684cdc1d0f3b36335 |
| 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 | 613.745 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 21380 |
| Total number of constraints | 60984 |
| Number of soft constraints | 20761 |
| Number of constraints which are clauses | 58828 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 2156 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 1041832 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 1041831 |
| Biggest number in a constraint | 73 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 262 |
| 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) | 4110092 | OPTIMUM | 241.94 | 239.628 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110093 | OPTIMUM | 502.599 | 256.901 |
| NaPS 1.02 (complete) | 4110095 | OPTIMUM | 613.745 | 613.878 |
| toysat 2016-05-02 (complete) | 4110094 | ? (TO) | 1800.07 | 1800.53 |
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--