| Name | /PARTIAL-BIGINT-LIN/wcsp/driver/ normalized-driverlog04cc_wcsp.wbo |
| MD5SUM | cfb64da96a3d79dc0d59d6750e90f7b5 |
| 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 | 2842 |
| Best CPU time to get the best result obtained on this benchmark | 4.01439 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1026 |
| Total number of constraints | 22742 |
| Number of soft constraints | 22470 |
| Number of constraints which are clauses | 22470 |
| Number of constraints which are cardinality constraints (but not clauses) | 272 |
| 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 | 83979 |
| Min constraint cost | 1 |
| Max constraint cost | 83979 |
| Sum of constraints costs | 1846191905 |
| 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) | 4093159 | OPTIMUM | 4.01439 | 4.01623 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090387 | OPTIMUM | 4.33234 | 2.75391 |
| NaPS 1.02 (complete) | 4094545 | OPTIMUM | 5.70613 | 5.70719 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091773 | OPTIMUM | 13.6209 | 12.3698 |
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: 2842x1021 -x1022 x1023 -x1024 x1025 -x1026