| Name | ColouredQueens/ ColouredQueens-05_c18.xml |
| MD5SUM | 776f6c8909d7db26eed6858afed1e777 |
| 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.003788 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 24 |
| Number of domains | 1 |
| Minimum domain size | 5 |
| Maximum domain size | 5 |
| Distribution of domain sizes | [{"size":5,"count":25}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":21}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":12}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":24}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4298016 | SAT | 0.003788 | 0.00435989 |
| miniBTD 2018.07.27_3 (complete) | 4301032 | SAT | 0.003844 | 0.0047789 |
| miniBTD_12 2018.07.27_12 (complete) | 4300856 | SAT | 0.00403 | 0.00504996 |
| minimacht 2018.07.27 (complete) | 4300680 | SAT | 0.004879 | 0.0970609 |
| cosoco 1.12 (complete) | 4298013 | SAT | 0.005358 | 0.00527795 |
| GG's minicp 2018-04-29 (complete) | 4298014 | SAT | 0.505554 | 0.319661 |
| MiniCPFever 2018-04-29 (complete) | 4298015 | SAT | 0.512538 | 0.30517 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298018 | SAT | 0.514919 | 0.305685 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298019 | SAT | 0.528218 | 0.325109 |
| slowpoke 2018-04-29 (incomplete) | 4298017 | SAT | 0.529592 | 0.320577 |
| The dodo solver 2018-04-29 (complete) | 4298020 | SAT (TO) | 2520.1 | 2502.32 |
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[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> 2 1 0 4 3 0 4 3 2 1 3 2 1 0 4 1 0 4 3 2 4 3 2 1 0 </values> </instantiation>