| Name | Quasigroups_mini/ QuasiGroup-v7-09_mini_c18.xml |
| MD5SUM | 8801b133309e0658be4f3ec628f0c8e3 |
| 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.114057 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 162 |
| Number of constraints | 171 |
| Number of domains | 1 |
| Minimum domain size | 9 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":9,"count":153}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":0,"count":9},{"degree":2,"count":72},{"degree":19,"count":9},{"degree":20,"count":72}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":1,"count":9},{"arity":9,"count":18},{"arity":11,"count":144}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 9 |
| Distribution of constraint types | [{"type":"intension","count":9},{"type":"allDifferent","count":18},{"type":"element","count":144}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299098 | SAT | 0.114057 | 0.114727 |
| cosoco 1.12 (complete) | 4299095 | SAT | 0.290066 | 0.29077 |
| GG's minicp 2018-04-29 (complete) | 4299096 | SAT | 1.04529 | 0.490846 |
| MiniCPFever 2018-04-29 (complete) | 4299097 | SAT | 1.23512 | 0.616155 |
| miniBTD_12 2018.07.27_12 (complete) | 4300938 | SAT | 1.478 | 1.47908 |
| slowpoke 2018-04-29 (incomplete) | 4299099 | SAT | 2.1572 | 0.859692 |
| minimacht 2018.07.27 (complete) | 4300762 | SAT | 5.75845 | 5.75951 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299101 | SAT | 11.7951 | 10.5821 |
| miniBTD 2018.07.27_3 (complete) | 4301114 | SAT | 12.2612 | 12.2619 |
| The dodo solver 2018-04-29 (complete) | 4299102 | SAT (TO) | 2520.06 | 2484.23 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299100 | Wrong UNSAT | 0.735196 | 0.391248 |
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[0][7] x[0][8] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[0][7] y[0][8] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[3][0] y[3][1] y[3][2] y[3][3] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[4][7] y[4][8] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[5][7] y[5][8] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] y[6][7] y[6][8] y[7][0] y[7][1] y[7][2] y[7][3] y[7][4] y[7][5] y[7][6] y[7][7] y[7][8] y[8][0] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] </list> <values> 0 5 4 1 3 7 8 6 2 6 1 5 4 0 8 2 3 7 1 7 2 8 5 3 0 4 6 7 6 0 3 2 4 5 8 1 5 2 8 7 4 6 3 1 0 8 3 6 0 7 5 1 2 4 4 8 7 2 1 0 6 5 3 2 0 3 6 8 1 4 7 5 3 4 1 5 6 2 7 0 8 0 8 5 6 7 2 3 4 1 8 0 3 2 5 4 7 6 0 5 3 0 1 6 0 4 8 7 6 2 1 0 8 7 0 5 4 7 5 6 8 0 1 2 0 3 2 4 0 7 1 0 8 3 6 3 7 4 0 2 8 0 1 5 4 6 8 5 0 3 1 0 2 1 0 7 4 3 6 5 2 0 </values> </instantiation>