| Name | MagicSquare/ MagicSquare-06-sum_c18.xml |
| MD5SUM | a745669eea561cf8bd8f725d7a56d7c0 |
| 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.010117 |
| 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 | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":14}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299906 | SAT | 0.010117 | 0.0108391 |
| cosoco 1.12 (complete) | 4299903 | SAT | 0.168288 | 0.170471 |
| slowpoke 2018-04-29 (incomplete) | 4299907 | SAT | 0.892225 | 0.433413 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299909 | SAT | 1.56535 | 0.660043 |
| MiniCPFever 2018-04-29 (complete) | 4299905 | SAT | 2.66356 | 1.5179 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299908 | SAT | 3.37419 | 2.3605 |
| GG's minicp 2018-04-29 (complete) | 4299904 | SAT | 10.3263 | 8.81174 |
| miniBTD_12 2018.07.27_12 (complete) | 4300973 | SAT | 55.9655 | 55.9682 |
| minimacht 2018.07.27 (complete) | 4300797 | SAT | 56.064 | 56.066 |
| The dodo solver 2018-04-29 (complete) | 4299910 | SAT (TO) | 2520.06 | 2504.02 |
| miniBTD 2018.07.27_3 (complete) | 4301149 | ? (TO) | 2519.89 | 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> <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> 21 12 11 18 16 33 9 22 26 27 17 10 8 13 19 14 25 32 7 24 6 20 23 31 30 5 15 29 28 4 36 35 34 3 2 1 </values> </instantiation>