| Name | /PARTIAL-BIGINT-LIN/wcsp/driver/ normalized-driverlog01bc_wcsp.wbo |
| MD5SUM | db320813b29b4bcbd96c3dac35125a5b |
| 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 | 2413 |
| Best CPU time to get the best result obtained on this benchmark | 0.070989 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 195 |
| Total number of constraints | 808 |
| Number of soft constraints | 737 |
| Number of constraints which are clauses | 737 |
| Number of constraints which are cardinality constraints (but not clauses) | 71 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 4 |
| Top cost | 12087 |
| Min constraint cost | 1 |
| Max constraint cost | 12087 |
| Sum of constraints costs | 8049657 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 5 |
| Number of bits of the biggest sum of numbers | 3 |
| 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) | 4093149 | OPTIMUM | 0.070989 | 0.0716361 |
| NaPS 1.02 (complete) | 4094535 | OPTIMUM | 0.142978 | 0.143406 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090377 | OPTIMUM | 0.362944 | 0.263639 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091763 | OPTIMUM | 0.862868 | 1.77654 |
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: 2413x191 -x192 x193 -x194 x195