Name | MagicSquare/ MagicSquare-16-sum_c18.xml |
MD5SUM | dc0956070aead6ed741b5a9522bbec89 |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 256 |
Number of constraints | 35 |
Number of domains | 1 |
Minimum domain size | 256 |
Maximum domain size | 256 |
Distribution of domain sizes | [{"size":256,"count":256}] |
Minimum variable degree | 3 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":3,"count":224},{"degree":4,"count":32}] |
Minimum constraint arity | 16 |
Maximum constraint arity | 256 |
Distribution of constraint arities | [{"arity":16,"count":34},{"arity":256,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":34}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
miniBTD 2018.07.27_3 (complete) | 4301159 | ? (TO) | 2519.73 | 2520.01 |
NACRE 1.0.4 (complete) | 4300002 | ? (TO) | 2519.75 | 2520.03 |
cosoco 1.12 (complete) | 4299999 | ? (TO) | 2519.93 | 2520.01 |
slowpoke 2018-04-29 (incomplete) | 4300003 | ? (TO) | 2520.02 | 2471.02 |
minimacht 2018.07.27 (complete) | 4300807 | ? (TO) | 2520.02 | 2520.01 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4300004 | ? (TO) | 2520.03 | 2516.61 |
The dodo solver 2018-04-29 (complete) | 4300006 | ? (TO) | 2520.05 | 2499.61 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4300005 | ? (TO) | 2520.08 | 2502.92 |
MiniCPFever 2018-04-29 (complete) | 4300001 | ? (TO) | 2520.08 | 2500.82 |
GG's minicp 2018-04-29 (complete) | 4300000 | ? (TO) | 2520.09 | 2478.71 |
miniBTD_12 2018.07.27_12 (complete) | 4300983 | ? (TO) | 2520.1 | 2519.9 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: