| Name | /SOFT-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.tag14.ucl--soft-0-100-0.wbo |
| MD5SUM | 5b4315c5a5371447c07276a6635f9ec4 |
| 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 | 46.4279 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 40605 |
| Total number of constraints | 118930 |
| Number of soft constraints | 118930 |
| Number of constraints which are clauses | 117190 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1740 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 13 |
| Top cost | 6022485 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 6022484 |
| Biggest number in a constraint | 65 |
| Number of bits of the biggest number in a constraint | 7 |
| Biggest sum of numbers in a constraint | 254 |
| Number of bits of the biggest sum of numbers | 8 |
| 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) | 4090824 | OPTIMUM | 46.4279 | 42.9288 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092210 | OPTIMUM | 266.276 | 139.155 |
| toysat 2016-05-02 (complete) | 4093596 | OPTIMUM | 1526.29 | 1526.53 |
| NaPS 1.02 (complete) | 4094982 | MSAT (MO) | 113.499 | 113.525 |
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--