| Name | GracefulGraph/ GracefulGraph-K04-P04_c18.xml |
| MD5SUM | bba9b3428f0c8228a4e28ff2342631fb |
| 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 | 54.1602 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 92 |
| Number of constraints | 38 |
| Number of domains | 2 |
| Minimum domain size | 36 |
| Maximum domain size | 37 |
| Distribution of domain sizes | [{"size":36,"count":36},{"size":37,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":40},{"degree":2,"count":36},{"degree":5,"count":8},{"degree":6,"count":8}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":3,"count":36},{"arity":16,"count":1},{"arity":36,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 36 |
| Distribution of constraint types | [{"type":"intension","count":36},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| minimacht 2018.07.27 (complete) | 4300745 | SAT | 54.1602 | 54.1622 |
| miniBTD_12 2018.07.27_12 (complete) | 4300921 | SAT | 425.388 | 425.417 |
| miniBTD 2018.07.27_3 (complete) | 4301097 | SAT | 2104.75 | 2104.69 |
| NACRE 1.0.4 (complete) | 4298565 | ? (TO) | 2519.85 | 2520.01 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4298568 | ? (TO) | 2520.03 | 2508.21 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4298567 | ? (TO) | 2520.04 | 2508.81 |
| MiniCPFever 2018-04-29 (complete) | 4298564 | ? (TO) | 2520.04 | 2502.21 |
| GG's minicp 2018-04-29 (complete) | 4298563 | ? (TO) | 2520.06 | 2498.71 |
| slowpoke 2018-04-29 (incomplete) | 4298566 | ? (TO) | 2520.06 | 2506.61 |
| cosoco 1.12 (complete) | 4298562 | ? (TO) | 2520.08 | 2519.9 |
| The dodo solver 2018-04-29 (complete) | 4298569 | ? (TO) | 2520.09 | 2510.31 |
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] cn[2][0] cn[2][1] cn[2][2] cn[2][3] cn[3][0] cn[3][1] cn[3][2] cn[3][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] ce[2][0][0] ce[2][0][1] ce[2][0][2] ce[2][0][3] ce[2][1][0] ce[2][1][1] ce[2][1][2] ce[2][1][3] ce[2][2][0] ce[2][2][1] ce[2][2][2] ce[2][2][3] ce[2][3][0] ce[2][3][1] ce[2][3][2] ce[2][3][3] ce[3][0][0] ce[3][0][1] ce[3][0][2] ce[3][0][3] ce[3][1][0] ce[3][1][1] ce[3][1][2] ce[3][1][3] ce[3][2][0] ce[3][2][1] ce[3][2][2] ce[3][2][3] ce[3][3][0] ce[3][3][1] ce[3][3][2] ce[3][3][3] cie[0][0] cie[0][1] cie[0][2] cie[0][3] cie[1][0] cie[1][1] cie[1][2] cie[1][3] cie[2][0] cie[2][1] cie[2][2] cie[2][3] </list> <values> 12 18 5 29 35 4 23 13 7 33 3 28 34 1 0 36 1 6 7 17 1 1 13 11 1 1 1 24 1 1 1 1 1 31 12 22 1 1 19 9 1 1 1 10 1 1 1 1 1 26 4 21 1 1 30 5 1 1 1 25 1 1 1 1 1 33 34 2 1 1 1 35 1 1 1 36 1 1 1 1 23 14 18 16 28 29 20 15 27 32 3 8 </values> </instantiation>