| Name | MagicSquare/ MagicSquare-04-sum_c18.xml |
| MD5SUM | ea01e087ff104d0d01fcf01592300f04 |
| 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.003844 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 16 |
| Number of constraints | 11 |
| Number of domains | 1 |
| Minimum domain size | 16 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":16,"count":16}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":8},{"degree":4,"count":8}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":4,"count":10},{"arity":16,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":10}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299930 | SAT | 0.003844 | 0.00484889 |
| cosoco 1.12 (complete) | 4299927 | SAT | 0.005297 | 0.00609706 |
| minimacht 2018.07.27 (complete) | 4300795 | SAT | 0.006339 | 0.00735692 |
| miniBTD_12 2018.07.27_12 (complete) | 4300971 | SAT | 0.007112 | 0.00737108 |
| miniBTD 2018.07.27_3 (complete) | 4301147 | SAT | 0.009964 | 0.0107151 |
| MiniCPFever 2018-04-29 (complete) | 4299929 | SAT | 0.511863 | 0.300828 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299932 | SAT | 0.519623 | 0.31011 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299933 | SAT | 0.528897 | 0.322394 |
| GG's minicp 2018-04-29 (complete) | 4299928 | SAT | 0.551303 | 0.316403 |
| slowpoke 2018-04-29 (incomplete) | 4299931 | SAT | 0.557937 | 0.325361 |
| The dodo solver 2018-04-29 (complete) | 4299934 | SAT (TO) | 2520.04 | 2508.71 |
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[1][0] x[1][1] x[1][2] x[1][3] x[2][0] x[2][1] x[2][2] x[2][3] x[3][0] x[3][1] x[3][2] x[3][3] </list> <values> 9 6 11 8 5 10 7 12 4 3 14 13 16 15 2 1 </values> </instantiation>