| Name | Crossword/Crossword-m1c-lex-vg/ Crossword-m1c-lex-vg-4-8.xml |
| MD5SUM | c10dd5dec070ff1211512088bfd197f2 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.313646 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 32 |
| Number of constraints | 12 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":32}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":32}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 8 |
| Distribution of constraint arities | [{"arity":4,"count":8},{"arity":8,"count":4}] |
| Number of extensional constraints | 12 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":12}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391846 | SAT | 0.313646 | 0.314336 |
| cosoco 2 (complete) | 4390046 | SAT | 8.61244 | 8.61212 |
| cosoco 2.0 (complete) | 4408586 | SAT | 8.73474 | 8.73648 |
| cosoco 2.0 (complete) | 4397326 | SAT | 9.88427 | 9.88314 |
| NACRE 1.0.5-Hybrid (complete) | 4391446 | SAT | 25.9178 | 25.9203 |
| NACRE 1.0.5 (complete) | 4391646 | SAT | 27.9208 | 27.9295 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407834 | SAT | 66.2702 | 66.2686 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] </list> <values> 17 14 0 3 18 19 4 17 4 18 2 0 15 0 3 4 0 11 8 25 0 17 8 13 12 14 3 4 17 0 19 4 </values> </instantiation>