Name | MagicSquare/ MagicSquare-12-sum_c18.xml |
MD5SUM | 72f076078db8222856487e1257170ccd |
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 | 144 |
Number of constraints | 27 |
Number of domains | 1 |
Minimum domain size | 144 |
Maximum domain size | 144 |
Distribution of domain sizes | [{"size":144,"count":144}] |
Minimum variable degree | 3 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":3,"count":120},{"degree":4,"count":24}] |
Minimum constraint arity | 12 |
Maximum constraint arity | 144 |
Distribution of constraint arities | [{"arity":12,"count":26},{"arity":144,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"allDifferent","count":1},{"type":"sum","count":26}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
NACRE 1.0.4 (complete) | 4299938 | ? (TO) | 2519.81 | 2520.01 |
cosoco 1.12 (complete) | 4299935 | ? (TO) | 2520 | 2520.01 |
minimacht 2018.07.27 (complete) | 4300803 | ? (TO) | 2520.01 | 2520.01 |
GG's minicp 2018-04-29 (complete) | 4299936 | ? (TO) | 2520.03 | 2479.91 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299940 | ? (TO) | 2520.04 | 2516.21 |
The dodo solver 2018-04-29 (complete) | 4299942 | ? (TO) | 2520.05 | 2492.21 |
miniBTD 2018.07.27_3 (complete) | 4301155 | ? (TO) | 2520.07 | 2520.01 |
slowpoke 2018-04-29 (incomplete) | 4299939 | ? (TO) | 2520.07 | 2481.52 |
MiniCPFever 2018-04-29 (complete) | 4299937 | ? (TO) | 2520.07 | 2496.21 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299941 | ? (TO) | 2520.08 | 2501.22 |
miniBTD_12 2018.07.27_12 (complete) | 4300979 | ? (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: