| Name | Crossword/Crossword-m1c-lex-vg/ Crossword-m1c-lex-vg-5-6.xml |
| MD5SUM | c1b07a7f88496e248f54be8a150a9021 |
| 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.47668 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 11 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":30}] |
| Minimum constraint arity | 5 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":5,"count":6},{"arity":6,"count":5}] |
| Number of extensional constraints | 11 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":11}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 2 (complete) | 4390001 | SAT | 0.47668 | 0.476346 |
| cosoco 2.0 (complete) | 4408541 | SAT | 0.477487 | 0.477798 |
| cosoco 2.0 (complete) | 4397281 | SAT | 0.544561 | 0.545032 |
| NACRE 1.0.5-Hybrid (complete) | 4391401 | SAT | 1.1346 | 1.13495 |
| miniBTD 19.06.16 (complete) | 4391801 | SAT | 3.47466 | 3.47478 |
| NACRE 1.0.5 (complete) | 4391601 | SAT | 11.8492 | 11.8496 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407835 | SAT | 16.0937 | 16.0972 |
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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] </list> <values>0 18 18 8 6 13 18 19 0 3 8 0 7 0 1 4 0 18 4 17 17 0 13 19 17 4 0 11 19 24 </values> </instantiation>