| Name | /PARTIAL-BIGINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.ex.br.mem.RobRegValid_bar.ucl--soft-33-100-0.wbo |
| MD5SUM | 60a7a7d515eacc9a7281c84a700710f3 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard 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 | 433.847 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 49621 |
| Total number of constraints | 138346 |
| Number of soft constraints | 92968 |
| Number of constraints which are clauses | 127390 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 10956 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 15 |
| Top cost | 4678577 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 4678576 |
| Biggest number in a constraint | 129 |
| Number of bits of the biggest number in a constraint | 8 |
| Biggest sum of numbers in a constraint | 510 |
| 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) | 4090306 | OPTIMUM | 24.7442 | 22.4469 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091692 | OPTIMUM | 86.4799 | 45.7445 |
| toysat 2016-05-02 (complete) | 4093078 | OPTIMUM | 433.847 | 434.009 |
| NaPS 1.02 (complete) | 4094464 | MSAT | 146.538 | 146.56 |
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--