| Name | Crossword/ Crossword-m18-ogd2008-vg-11-12_c18.xml |
| MD5SUM | 996bcdf4a135147c7f2ba7242cc18cd5 |
| 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 | 132 |
| Number of constraints | 23 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":132}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":132}] |
| Minimum constraint arity | 11 |
| Maximum constraint arity | 12 |
| Distribution of constraint arities | [{"arity":11,"count":12},{"arity":12,"count":11}] |
| Number of extensional constraints | 23 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":23}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| NACRE 1.0.4 (complete) | 4299794 | ? (TO) | 2519.94 | 2520.02 |
| miniBTD_12 2018.07.27_12 (complete) | 4300991 | ? (TO) | 2519.98 | 2520.01 |
| miniBTD 2018.07.27_3 (complete) | 4301167 | ? (TO) | 2520.02 | 2520.01 |
| MiniCPFever 2018-04-29 (complete) | 4299793 | ? (TO) | 2520.03 | 2467.42 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299796 | ? (TO) | 2520.04 | 2475.32 |
| GG's minicp 2018-04-29 (complete) | 4299792 | ? (TO) | 2520.06 | 2478.61 |
| slowpoke 2018-04-29 (incomplete) | 4299795 | ? (TO) | 2520.09 | 2514.72 |
| cosoco 1.12 (complete) | 4299791 | ? (TO) | 2520.09 | 2520.01 |
| minimacht 2018.07.27 (complete) | 4300815 | ? (TO) | 2520.11 | 2520.01 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299797 | ? (TO) | 2520.12 | 2515.72 |
| The dodo solver 2018-04-29 (complete) | 4299798 | ? (TO) | 2520.12 | 2510.82 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: