| Name | /PARTIAL-BIGINT-LIN/wcsp/driver/ normalized-driverlog08bc_wcsp.wbo |
| MD5SUM | 7606a259cb7f676549ec962f9f596d4d |
| 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 | 2257 |
| Best CPU time to get the best result obtained on this benchmark | 7.34888 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1583 |
| Total number of constraints | 57898 |
| Number of soft constraints | 57490 |
| Number of constraints which are clauses | 57490 |
| Number of constraints which are cardinality constraints (but not clauses) | 408 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 11 |
| Top cost | 71841 |
| Min constraint cost | 1 |
| Max constraint cost | 71841 |
| Sum of constraints costs | 4073527593 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 12 |
| Number of bits of the biggest sum of numbers | 4 |
| 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) | 4093165 | OPTIMUM | 7.34888 | 7.35128 |
| NaPS 1.02 (complete) | 4094551 | OPTIMUM | 8.24975 | 8.25355 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090393 | OPTIMUM | 56.2055 | 54.285 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091779 | OPTIMUM | 291.129 | 233.411 |
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: 2257-x1581 x1582 -x1583