| Name | GracefulGraph/ GracefulGraph-K03-P03_c18.xml |
| MD5SUM | 48ac26f734f5e9f96f30a0090c6e98b4 |
| 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.008964 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 42 |
| Number of constraints | 17 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":15,"count":15},{"size":16,"count":9}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":0,"count":18},{"degree":2,"count":15},{"degree":4,"count":6},{"degree":5,"count":3}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":3,"count":15},{"arity":9,"count":1},{"arity":15,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 15 |
| Distribution of constraint types | [{"type":"intension","count":15},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| minimacht 2018.07.27 (complete) | 4300742 | SAT | 0.008964 | 0.00968698 |
| miniBTD_12 2018.07.27_12 (complete) | 4300918 | SAT | 0.009483 | 0.00984789 |
| miniBTD 2018.07.27_3 (complete) | 4301094 | SAT | 0.014443 | 0.0149169 |
| NACRE 1.0.4 (complete) | 4298581 | SAT | 0.217265 | 0.218566 |
| cosoco 1.12 (complete) | 4298578 | SAT | 0.575014 | 0.577078 |
| GG's minicp 2018-04-29 (complete) | 4298579 | SAT | 0.765278 | 0.389289 |
| slowpoke 2018-04-29 (incomplete) | 4298582 | SAT | 0.792489 | 0.404278 |
| The dodo solver 2018-04-29 (complete) | 4298585 | SAT (TO) | 2520.1 | 2513.71 |
| MiniCPFever 2018-04-29 (complete) | 4298580 | ? (TO) | 2520.04 | 2497.51 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298583 | ? (TO) | 2520.05 | 2504.31 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298584 | ? (TO) | 2520.05 | 2502.02 |
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> cn[0][0] cn[0][1] cn[0][2] cn[1][0] cn[1][1] cn[1][2] cn[2][0] cn[2][1] cn[2][2] ce[0][0][0] ce[0][0][1] ce[0][0][2] ce[0][1][0] ce[0][1][1] ce[0][1][2] ce[0][2][0] ce[0][2][1] ce[0][2][2] ce[1][0][0] ce[1][0][1] ce[1][0][2] ce[1][1][0] ce[1][1][1] ce[1][1][2] ce[1][2][0] ce[1][2][1] ce[1][2][2] ce[2][0][0] ce[2][0][1] ce[2][0][2] ce[2][1][0] ce[2][1][1] ce[2][1][2] ce[2][2][0] ce[2][2][1] ce[2][2][2] cie[0][0] cie[0][1] cie[0][2] cie[1][0] cie[1][1] cie[1][2] </list> <values> 0 1 14 15 6 3 5 13 7 1 1 14 1 1 13 1 1 1 1 9 12 1 1 3 1 1 1 1 8 2 1 1 6 1 1 1 15 5 11 10 7 4 </values> </instantiation>