| Name | MagicSquare/ MagicSquare-05-sum_c18.xml |
| MD5SUM | e5f64c3945c2a3284413cd2472acb6fe |
| 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.014225 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 13 |
| Number of domains | 1 |
| Minimum domain size | 25 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":25,"count":25}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":3,"count":16},{"degree":4,"count":8},{"degree":5,"count":1}] |
| Minimum constraint arity | 5 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":5,"count":12},{"arity":25,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":12}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299919 | SAT | 0.014225 | 0.0150989 |
| NACRE 1.0.4 (complete) | 4299922 | SAT | 0.014767 | 0.0153289 |
| minimacht 2018.07.27 (complete) | 4300796 | SAT | 0.294973 | 0.297452 |
| miniBTD_12 2018.07.27_12 (complete) | 4300972 | SAT | 0.295931 | 0.297233 |
| MiniCPFever 2018-04-29 (complete) | 4299921 | SAT | 0.704103 | 0.370127 |
| GG's minicp 2018-04-29 (complete) | 4299920 | SAT | 0.730198 | 0.379259 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299925 | SAT | 0.730371 | 0.385397 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299924 | SAT | 0.748529 | 0.391892 |
| slowpoke 2018-04-29 (incomplete) | 4299923 | SAT | 0.781443 | 0.389605 |
| miniBTD 2018.07.27_3 (complete) | 4301148 | SAT | 0.970351 | 1.00832 |
| The dodo solver 2018-04-29 (complete) | 4299926 | SAT (TO) | 2520.08 | 2508.41 |
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[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>17 16 1 18 13 10 6 25 5 19 14 21 12 11 7 9 20 24 8 4 15 2 3 23 22 </values> </instantiation>