| Name | /PARTIAL-BIGINT-LIN/wcsp/scens/ normalized-scen06-30reduc_wcsp.wbo |
| MD5SUM | 83352c08e9e644ee4de360a67fac8960 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | |
| Best cost obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 771 |
| Total number of constraints | 19461 |
| Number of soft constraints | 19380 |
| Number of constraints which are clauses | 19380 |
| Number of constraints which are cardinality constraints (but not clauses) | 81 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 14 |
| Top cost | 2088 |
| Min constraint cost | 1 |
| Max constraint cost | 2088 |
| Sum of constraints costs | 5475303 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 15 |
| 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 |
|---|---|---|---|---|
| Sat4j Resolution 2011-06-08 (complete) | 3492963 | ? (TO) | 1800.07 | 1798.75 |
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: