| Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j605_1-unsat--soft-66-100-0.wbo |
| MD5SUM | 3da4f5c3e5e38abb2c08bf92ba94a43a |
| 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 | 44.1173 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 9272 |
| Total number of constraints | 29174 |
| Number of soft constraints | 9967 |
| Number of constraints which are clauses | 28874 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 300 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 35 |
| Top cost | 504083 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 504082 |
| Biggest number in a constraint | 18 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 231 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093471 | OPTIMUM | 44.1173 | 44.1337 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090699 | OPTIMUM | 121 | 118.117 |
| NaPS 1.02 (complete) | 4094857 | OPTIMUM | 166.498 | 166.539 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092085 | MSAT (TO) | 1800.43 | 1593.25 |
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-x9271 x9272