| Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j120/ normalized-j12041_4-unsat--soft-33-100-0.wbo |
| MD5SUM | ffeb8ff8321cb24b27dd0634c49d54e3 |
| 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 | 3 |
| Best CPU time to get the best result obtained on this benchmark | 160.768 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 28072 |
| Total number of constraints | 97590 |
| Number of soft constraints | 65496 |
| Number of constraints which are clauses | 97130 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 460 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 36 |
| Top cost | 3299469 |
| Min constraint cost | 1 |
| Max constraint cost | 100 |
| Sum of constraints costs | 3299468 |
| Biggest number in a constraint | 13 |
| Number of bits of the biggest number in a constraint | 4 |
| 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) | 4093101 | OPTIMUM | 160.768 | 160.796 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090329 | OPTIMUM | 749.62 | 746.73 |
| NaPS 1.02 (complete) | 4094487 | MSAT (MO) | 81.5476 | 81.5601 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091715 | MSAT (TO) | 1800.63 | 936.678 |
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: 3-x28071 x28072