Name | Crossword/ Crossword-m18-ogd2008-vg-12-13_c18.xml |
MD5SUM | c64ae1eb34294e2d276677e97ca01970 |
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 | 156 |
Number of constraints | 25 |
Number of domains | 1 |
Minimum domain size | 26 |
Maximum domain size | 26 |
Distribution of domain sizes | [{"size":26,"count":156}] |
Minimum variable degree | 2 |
Maximum variable degree | 2 |
Distribution of variable degrees | [{"degree":2,"count":156}] |
Minimum constraint arity | 12 |
Maximum constraint arity | 13 |
Distribution of constraint arities | [{"arity":12,"count":13},{"arity":13,"count":12}] |
Number of extensional constraints | 25 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":25}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
NACRE 1.0.4 (complete) | 4299802 | ? (TO) | 2519.83 | 2520.02 |
miniBTD_12 2018.07.27_12 (complete) | 4300992 | ? (TO) | 2519.92 | 2520.01 |
cosoco 1.12 (complete) | 4299799 | ? (TO) | 2519.93 | 2520.01 |
minimacht 2018.07.27 (complete) | 4300816 | ? (TO) | 2519.97 | 2520.01 |
miniBTD 2018.07.27_3 (complete) | 4301168 | ? (TO) | 2520.04 | 2520.01 |
slowpoke 2018-04-29 (incomplete) | 4299803 | ? (TO) | 2520.04 | 2515.21 |
MiniCPFever 2018-04-29 (complete) | 4299801 | ? (TO) | 2520.09 | 2467.31 |
The dodo solver 2018-04-29 (complete) | 4299806 | ? (TO) | 2520.1 | 2500.81 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299805 | ? (TO) | 2520.1 | 2515.91 |
GG's minicp 2018-04-29 (complete) | 4299800 | ? (TO) | 2520.11 | 2487.71 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299804 | ? (TO) | 2520.11 | 2473.42 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: