| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K10-P09.xml |
| MD5SUM | 132dbb92a73ed64c3de106a7d099dd2d |
| 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 | 1070 |
| Number of constraints | 487 |
| Number of domains | 2 |
| Minimum domain size | 485 |
| Maximum domain size | 486 |
| Distribution of domain sizes | [{"size":485,"count":485},{"size":486,"count":90}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":0,"count":495},{"degree":2,"count":485},{"degree":11,"count":20},{"degree":12,"count":70}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 485 |
| Distribution of constraint arities | [{"arity":3,"count":485},{"arity":90,"count":1},{"arity":485,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 485 |
| Distribution of constraint types | [{"type":"intension","count":485},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Naxos 1.1.0 (complete) | 4251721 | ? (TO) | 2400.01 | 2402 |
| cosoco-mini 1.12 (complete) | 4267266 | ? (TO) | 2400.02 | 2400.2 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260085 | ? (TO) | 2400.0701 | 2400.1001 |
| miniBTD 2017-08-10 (complete) | 4264825 | ? (TO) | 2400.0701 | 2400.2 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251720 | ? (TO) | 2400.08 | 2400.21 |
| miniBTD 2017-06-30 (complete) | 4251719 | ? (TO) | 2400.1 | 2399.9 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: