| Name | ColouredQueens/ ColouredQueens-07_c18.xml |
| MD5SUM | 968c6e40c1de71b17fca4670fe54f327 |
| 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.003986 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 49 |
| Number of constraints | 36 |
| Number of domains | 1 |
| Minimum domain size | 7 |
| Maximum domain size | 7 |
| Distribution of domain sizes | [{"size":7,"count":49}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":45}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":4},{"arity":7,"count":16}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":36}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4297960 | SAT | 0.003986 | 0.00474709 |
| minimacht 2018.07.27 (complete) | 4300682 | SAT | 0.004946 | 0.00585197 |
| miniBTD_12 2018.07.27_12 (complete) | 4300858 | SAT | 0.005023 | 0.00582494 |
| miniBTD 2018.07.27_3 (complete) | 4301034 | SAT | 0.013973 | 0.0146889 |
| cosoco 1.12 (complete) | 4297957 | SAT | 0.064584 | 0.065553 |
| MiniCPFever 2018-04-29 (complete) | 4297959 | SAT | 0.531757 | 0.321253 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4297962 | SAT | 0.551437 | 0.320073 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4297963 | SAT | 0.562443 | 0.332431 |
| slowpoke 2018-04-29 (incomplete) | 4297961 | SAT | 0.562843 | 0.333676 |
| GG's minicp 2018-04-29 (complete) | 4297958 | SAT | 0.619023 | 0.349605 |
| The dodo solver 2018-04-29 (complete) | 4297964 | SAT (TO) | 2520.09 | 2504.61 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <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] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] </list> <values> 4 3 2 1 0 6 5 2 1 0 6 5 4 3 0 6 5 4 3 2 1 5 4 3 2 1 0 6 3 2 1 0 6 5 4 1 0 6 5 4 3 2 6 5 4 3 2 1 0 </values> </instantiation>