| Name | /PARTIAL-BIGINT-LIN/wcsp/ rover/normalized-rovers02c_wcsp.wbo |
| MD5SUM | 3f23aa3ca1a467f99a1444f18e90dfdd |
| 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 | 1579 |
| Best CPU time to get the best result obtained on this benchmark | 0.538917 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 517 |
| Total number of constraints | 5630 |
| Number of soft constraints | 5478 |
| Number of constraints which are clauses | 5478 |
| Number of constraints which are cardinality constraints (but not clauses) | 152 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 24 |
| Top cost | 36256 |
| Min constraint cost | 1 |
| Max constraint cost | 36256 |
| Sum of constraints costs | 193061822 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 25 |
| Number of bits of the biggest sum of numbers | 5 |
| 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) | 4093215 | OPTIMUM | 0.538917 | 0.540033 |
| NaPS 1.02 (complete) | 4094601 | OPTIMUM | 1.13483 | 1.13757 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090443 | OPTIMUM | 1.36279 | 0.62717 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091829 | OPTIMUM | 2.42463 | 2.01194 |
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: 1579-x511 -x512 x513 x514 -x515 -x516 x517