| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K03-P04.xml |
| MD5SUM | df366086143c09aabef923644f665168 |
| 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 | 51.2332 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 57 |
| Number of constraints | 23 |
| Number of domains | 2 |
| Minimum domain size | 21 |
| Maximum domain size | 22 |
| Distribution of domain sizes | [{"size":21,"count":21},{"size":22,"count":12}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":0,"count":24},{"degree":2,"count":21},{"degree":4,"count":6},{"degree":5,"count":6}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":3,"count":21},{"arity":12,"count":1},{"arity":21,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 21 |
| Distribution of constraint types | [{"type":"intension","count":21},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4251710 | SAT | 8.60709 | 8.60757 |
| miniBTD 2017-08-10 (complete) | 4264823 | SAT | 8.6945896 | 8.7327099 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251711 | SAT | 51.1653 | 51.1645 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260083 | SAT | 51.232601 | 51.318401 |
| cosoco-mini 1.12 (complete) | 4267264 | SAT | 51.2332 | 51.236301 |
| Naxos 1.1.0 (complete) | 4251712 | ? (TO) | 2400.08 | 2400.1 |
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] cn[3][0] cn[3][1] cn[3][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] ce[3][0][0] ce[3][0][1] ce[3][0][2] ce[3][1][0] ce[3][1][1] ce[3][1][2] ce[3][2][0] ce[3][2][1] ce[3][2][2] cie[0][0] cie[0][1] cie[0][2] cie[1][0] cie[1][1] cie[1][2] cie[2][0] cie[2][1] cie[2][2] </list> <values> 2 19 8 12 5 21 20 1 0 15 3 18 1 17 6 1 1 11 1 1 1 1 7 9 1 1 16 1 1 1 1 19 20 1 1 1 1 1 1 1 12 3 1 1 15 1 1 1 10 14 13 8 4 21 5 2 18 </values> </instantiation>