| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K11-P04.xml |
| MD5SUM | 83a9e5860e8605726185e9821b8e29ef |
| 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 | 561 |
| Number of constraints | 255 |
| Number of domains | 2 |
| Minimum domain size | 253 |
| Maximum domain size | 254 |
| Distribution of domain sizes | [{"size":253,"count":253},{"size":254,"count":44}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 13 |
| Distribution of variable degrees | [{"degree":0,"count":264},{"degree":2,"count":253},{"degree":12,"count":22},{"degree":13,"count":22}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 253 |
| Distribution of constraint arities | [{"arity":3,"count":253},{"arity":44,"count":1},{"arity":253,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 253 |
| Distribution of constraint types | [{"type":"intension","count":253},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4251707 | ? (TO) | 2400.01 | 2400.1 |
| cosoco-mini 1.12 (complete) | 4267267 | ? (TO) | 2400.02 | 2400.01 |
| Naxos 1.1.0 (complete) | 4251709 | ? (TO) | 2400.05 | 2402 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251708 | ? (TO) | 2400.07 | 2400 |
| miniBTD 2017-08-10 (complete) | 4264826 | ? (TO) | 2400.0801 | 2400.2 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260086 | ? (TO) | 2400.1101 | 2400.21 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: