| Name | Crossword/ Crossword-m18-ogd2008-vg-05-06_c18.xml |
| MD5SUM | 81d4059c2b76389bba6ef17dee6cb29a |
| 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.120232 |
| 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 |
|---|---|---|---|---|
| miniBTD_12 2018.07.27_12 (complete) | 4300985 | SAT | 0.120232 | 0.121373 |
| miniBTD 2018.07.27_3 (complete) | 4301161 | SAT | 0.121011 | 0.125925 |
| minimacht 2018.07.27 (complete) | 4300809 | SAT | 0.121903 | 0.123043 |
| NACRE 1.0.4 (complete) | 4299746 | SAT | 0.302692 | 0.308285 |
| cosoco 1.12 (complete) | 4299743 | SAT | 0.355465 | 0.357253 |
| slowpoke 2018-04-29 (incomplete) | 4299747 | SAT | 1.78454 | 0.734541 |
| MiniCPFever 2018-04-29 (complete) | 4299745 | SAT | 1.82971 | 0.72831 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299749 | SAT | 1.91638 | 0.745312 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299748 | SAT | 1.91772 | 0.770848 |
| GG's minicp 2018-04-29 (complete) | 4299744 | SAT | 2.01215 | 0.811262 |
| The dodo solver 2018-04-29 (complete) | 4299750 | SAT (TO) | 2520.12 | 2505.51 |
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> 17 0 0 1 0 20 0 0 1 4 4 10 0 17 3 4 17 0 2 11 14 13 0 18 7 4 18 18 8 4 </values> </instantiation>