Name | MagicSquare/ MagicSquare-07-sum_c18.xml |
MD5SUM | f508510050be764ed4250e5795e6081a |
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.020688 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 49 |
Number of constraints | 17 |
Number of domains | 1 |
Minimum domain size | 49 |
Maximum domain size | 49 |
Distribution of domain sizes | [{"size":49,"count":49}] |
Minimum variable degree | 3 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":3,"count":36},{"degree":4,"count":12},{"degree":5,"count":1}] |
Minimum constraint arity | 7 |
Maximum constraint arity | 49 |
Distribution of constraint arities | [{"arity":7,"count":16},{"arity":49,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":16}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
cosoco 1.12 (complete) | 4299983 | SAT | 0.020688 | 0.0225701 |
NACRE 1.0.4 (complete) | 4299986 | SAT | 0.069563 | 0.070845 |
slowpoke 2018-04-29 (incomplete) | 4299987 | SAT | 1.49317 | 0.633873 |
GG's minicp 2018-04-29 (complete) | 4299984 | SAT | 3.47265 | 1.78459 |
miniBTD_12 2018.07.27_12 (complete) | 4300974 | SAT | 2234.36 | 2234.31 |
minimacht 2018.07.27 (complete) | 4300798 | SAT | 2234.84 | 2234.83 |
MiniCPFever 2018-04-29 (complete) | 4299985 | ? (TO) | 2520.04 | 2502.42 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299988 | ? (TO) | 2520.05 | 2512.91 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299989 | ? (TO) | 2520.07 | 2502.71 |
The dodo solver 2018-04-29 (complete) | 4299990 | ? (TO) | 2520.08 | 2502.13 |
miniBTD 2018.07.27_3 (complete) | 4301150 | ? (TO) | 2520.1 | 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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] </list> <values>20 35 32 6 5 29 48 26 38 13 7 30 47 14 19 39 36 41 1 21 18 28 40 37 2 4 31 33 16 12 25 34 46 15 27 17 3 23 42 44 22 24 49 8 9 43 45 10 11 </values> </instantiation>