| Name | Crossword/Crossword-m1c-words-herald/ Crossword-m1c-words-h0509.xml |
| MD5SUM | 795b0853e1a411d51b5742a039f740d0 |
| 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.013154 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 10 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":19}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":0,"count":6},{"degree":2,"count":19}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":2}] |
| Number of extensional constraints | 10 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":10}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391762 | SAT | 0.013154 | 0.013658 |
| NACRE 1.0.5-Hybrid (complete) | 4391362 | SAT | 0.022213 | 0.0228421 |
| NACRE 1.0.5 (complete) | 4391562 | SAT | 0.022602 | 0.0231171 |
| cosoco 2 (complete) | 4389962 | SAT | 0.040101 | 0.041758 |
| cosoco 2.0 (complete) | 4397242 | SAT | 0.040457 | 0.0420871 |
| cosoco 2.0 (complete) | 4408502 | SAT | 0.045592 | 0.0476369 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407857 | SAT | 0.145351 | 0.145828 |
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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] </list> <values> 0 0 0 1 4 0 0 1 4 11 18 2 0 17 5 15 4 18 19 0 0 18 7 0 0 </values> </instantiation>