| Name | MagicSquare/MagicSquare-table-s1/ MagicSquare-6-table.xml |
| MD5SUM | cfc552cbb2ce3301e89528d2cd5bb011 |
| 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 | 476.936 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 36 |
| Number of constraints | 15 |
| Number of domains | 1 |
| Minimum domain size | 36 |
| Maximum domain size | 36 |
| Distribution of domain sizes | [{"size":36,"count":36}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":24},{"degree":4,"count":12}] |
| Minimum constraint arity | 6 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":6,"count":14},{"arity":36,"count":1}] |
| Number of extensional constraints | 14 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":14},{"type":"allDifferent","count":1}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267327 | SAT | 476.936 | 477.039 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260146 | SAT | 478.53201 | 478.659 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253051 | SAT | 482.48199 | 482.57401 |
| miniBTD 2017-06-30 (complete) | 4253050 | ? (MO) | 74.0522 | 74.0551 |
| miniBTD 2017-08-10 (complete) | 4264886 | ? (MO) | 79.356102 | 79.491096 |
| Naxos 1.1.0 (complete) | 4253052 | ? (MO) | 156.352 | 156.4 |
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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] </list> <values>1 6 17 28 29 30 18 32 24 16 8 13 27 5 9 19 26 25 15 22 7 34 12 21 14 11 23 10 33 20 36 35 31 4 3 2 </values> </instantiation>