| Name | /PARTIAL-SMALLINT-LIN/wcsp/academics/ normalized-langford-3-11_wcsp.wbo |
| MD5SUM | 69dbc7406636817ba2a44752a9d60525 |
| Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
| Best result obtained on this benchmark | UNSAT |
| Best cost obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 11.1363 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 1089 |
| Total number of constraints | 40843 |
| Number of soft constraints | 40810 |
| Number of constraints which are clauses | 40810 |
| Number of constraints which are cardinality constraints (but not clauses) | 33 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 33 |
| Top cost | 1 |
| Min constraint cost | 1 |
| Max constraint cost | 1 |
| Sum of constraints costs | 40810 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 34 |
| Number of bits of the biggest sum of numbers | 6 |
| 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 |
|---|---|---|---|---|
| clasp 2.0-RC2 (complete) | 3448641 | UNSAT | 11.1363 | 11.1471 |
| Sat4j Resolution 2011-06-08 (complete) | 3492753 | UNSAT | 75.2236 | 74.2311 |
| SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447904 | UNSAT | 126.925 | 126.922 |
| wbo 1.6 (complete) | 3447167 | UNSAT | 334.699 | 334.69 |
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: