| Name | MagicSquare/ MagicSquare-08-sum_c18.xml |
| MD5SUM | f34b6b0b58aef27f9d15b3acca2bf726 |
| 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 | 2.45697 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 19 |
| Number of domains | 1 |
| Minimum domain size | 64 |
| Maximum domain size | 64 |
| Distribution of domain sizes | [{"size":64,"count":64}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":48},{"degree":4,"count":16}] |
| Minimum constraint arity | 8 |
| Maximum constraint arity | 64 |
| Distribution of constraint arities | [{"arity":8,"count":18},{"arity":64,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":18}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299911 | SAT | 2.45697 | 2.45821 |
| slowpoke 2018-04-29 (incomplete) | 4299915 | SAT | 5.82159 | 4.5319 |
| NACRE 1.0.4 (complete) | 4299914 | ? (TO) | 2519.54 | 2520.03 |
| minimacht 2018.07.27 (complete) | 4300799 | ? (TO) | 2519.96 | 2520.01 |
| miniBTD_12 2018.07.27_12 (complete) | 4300975 | ? (TO) | 2520.01 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299916 | ? (TO) | 2520.05 | 2513.02 |
| The dodo solver 2018-04-29 (complete) | 4299918 | ? (TO) | 2520.05 | 2502.82 |
| MiniCPFever 2018-04-29 (complete) | 4299913 | ? (TO) | 2520.05 | 2502.91 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299917 | ? (TO) | 2520.07 | 2498.31 |
| miniBTD 2018.07.27_3 (complete) | 4301151 | ? (TO) | 2520.1 | 2519.9 |
| GG's minicp 2018-04-29 (complete) | 4299912 | ? (TO) | 2520.11 | 2489.22 |
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[0][6] x[0][7] 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[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] 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[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] 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[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] </list> <values>57 11 12 19 61 10 39 51 42 53 18 16 59 23 8 41 35 21 54 14 58 40 9 29 24 44 20 55 4 28 47 38 22 45 26 52 2 33 48 32 43 36 50 15 13 27 46 30 31 49 17 25 60 37 7 34 6 1 63 64 3 62 56 5 </values> </instantiation>