| Name | GracefulGraph/ GracefulGraph-K04-P02_c18.xml |
| MD5SUM | df122225b0586fd0ab127ca5658303c8 |
| 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.027223 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 44 |
| Number of constraints | 18 |
| Number of domains | 2 |
| Minimum domain size | 16 |
| Maximum domain size | 17 |
| Distribution of domain sizes | [{"size":16,"count":16},{"size":17,"count":8}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":0,"count":20},{"degree":2,"count":16},{"degree":5,"count":8}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 16 |
| Distribution of constraint arities | [{"arity":3,"count":16},{"arity":8,"count":1},{"arity":16,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 16 |
| Distribution of constraint types | [{"type":"intension","count":16},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| minimacht 2018.07.27 (complete) | 4300743 | SAT | 0.027223 | 0.027664 |
| miniBTD_12 2018.07.27_12 (complete) | 4300919 | SAT | 0.059962 | 0.0604059 |
| miniBTD 2018.07.27_3 (complete) | 4301095 | SAT | 0.399637 | 0.400553 |
| NACRE 1.0.4 (complete) | 4298549 | SAT | 0.526656 | 0.527822 |
| slowpoke 2018-04-29 (incomplete) | 4298550 | SAT | 1.45156 | 0.617426 |
| cosoco 1.12 (complete) | 4298546 | SAT | 2.54015 | 2.54574 |
| GG's minicp 2018-04-29 (complete) | 4298547 | SAT | 7.56901 | 5.28083 |
| The dodo solver 2018-04-29 (complete) | 4298553 | SAT (TO) | 2520.1 | 2513.71 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298552 | ? (TO) | 2520.02 | 2502.71 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298551 | ? (TO) | 2520.04 | 2505.21 |
| MiniCPFever 2018-04-29 (complete) | 4298548 | ? (TO) | 2520.06 | 2498.41 |
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[0][3] cn[1][0] cn[1][1] cn[1][2] cn[1][3] ce[0][0][0] ce[0][0][1] ce[0][0][2] ce[0][0][3] ce[0][1][0] ce[0][1][1] ce[0][1][2] ce[0][1][3] ce[0][2][0] ce[0][2][1] ce[0][2][2] ce[0][2][3] ce[0][3][0] ce[0][3][1] ce[0][3][2] ce[0][3][3] ce[1][0][0] ce[1][0][1] ce[1][0][2] ce[1][0][3] ce[1][1][0] ce[1][1][1] ce[1][1][2] ce[1][1][3] ce[1][2][0] ce[1][2][1] ce[1][2][2] ce[1][2][3] ce[1][3][0] ce[1][3][1] ce[1][3][2] ce[1][3][3] cie[0][0] cie[0][1] cie[0][2] cie[0][3] </list> <values> 1 0 16 13 9 14 7 3 1 1 15 12 1 1 16 13 1 1 1 3 1 1 1 1 1 5 2 6 1 1 7 11 1 1 1 4 1 1 1 1 8 14 9 10 </values> </instantiation>