| Name | MagicSquare/ MagicSquare-09-sum_c18.xml |
| MD5SUM | 206eef8b0985bf3ee35d81919771d14d |
| 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 | 1038.88 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 81 |
| Number of constraints | 21 |
| Number of domains | 1 |
| Minimum domain size | 81 |
| Maximum domain size | 81 |
| Distribution of domain sizes | [{"size":81,"count":81}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":3,"count":64},{"degree":4,"count":16},{"degree":5,"count":1}] |
| Minimum constraint arity | 9 |
| Maximum constraint arity | 81 |
| Distribution of constraint arities | [{"arity":9,"count":20},{"arity":81,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":20}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299943 | SAT | 1038.88 | 1038.98 |
| NACRE 1.0.4 (complete) | 4299946 | ? (TO) | 2519.51 | 2520.02 |
| miniBTD_12 2018.07.27_12 (complete) | 4300976 | ? (TO) | 2519.92 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300800 | ? (TO) | 2520 | 2520.01 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299948 | ? (TO) | 2520.03 | 2514.41 |
| The dodo solver 2018-04-29 (complete) | 4299950 | ? (TO) | 2520.03 | 2502.41 |
| slowpoke 2018-04-29 (incomplete) | 4299947 | ? (TO) | 2520.03 | 2502.51 |
| GG's minicp 2018-04-29 (complete) | 4299944 | ? (TO) | 2520.05 | 2489.12 |
| MiniCPFever 2018-04-29 (complete) | 4299945 | ? (TO) | 2520.07 | 2501.41 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299949 | ? (TO) | 2520.07 | 2499.81 |
| miniBTD 2018.07.27_3 (complete) | 4301152 | ? (TO) | 2520.08 | 2520.01 |
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[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] </list> <values>65 55 15 39 51 1 53 56 34 47 69 12 11 13 74 70 59 14 31 37 66 40 18 75 10 43 49 22 21 44 68 20 52 72 29 41 23 27 19 25 67 77 73 28 30 42 45 16 57 35 5 71 48 50 32 46 58 33 24 76 8 38 54 81 6 78 36 79 2 3 4 80 26 63 61 60 62 7 9 64 17 </values> </instantiation>