| Name | Crossword/Crossword-m1c-uk-vg/ Crossword-m1c-uk-vg-5-7.xml |
| MD5SUM | 052802eb17c0f57ea02db175e3fb388a |
| 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.097939 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 35 |
| Number of constraints | 12 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":35}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":35}] |
| Minimum constraint arity | 5 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":5,"count":7},{"arity":7,"count":5}] |
| 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) | 4391810 | SAT | 0.097939 | 0.0983741 |
| cosoco 2 (complete) | 4390010 | SAT | 0.353418 | 0.353887 |
| cosoco 2.0 (complete) | 4408550 | SAT | 0.355192 | 0.355164 |
| cosoco 2.0 (complete) | 4397290 | SAT | 0.355498 | 0.355626 |
| NACRE 1.0.5 (complete) | 4391610 | SAT | 0.77666 | 0.781121 |
| NACRE 1.0.5-Hybrid (complete) | 4391410 | SAT | 0.845061 | 0.845779 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407855 | SAT | 21.535 | 21.5396 |
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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] </list> <values> 0 10 21 0 21 8 19 1 0 8 13 8 19 4 0 1 4 19 19 4 17 2 0 17 8 0 12 0 0 1 18 2 4 18 18 </values> </instantiation>