| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K14-P07.xml |
| MD5SUM | 539390230adc3c5191c5e54bc0e1cdf0 |
| 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 | 1554 |
| Number of constraints | 723 |
| Number of domains | 2 |
| Minimum domain size | 721 |
| Maximum domain size | 722 |
| Distribution of domain sizes | [{"size":721,"count":721},{"size":722,"count":98}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 16 |
| Distribution of variable degrees | [{"degree":0,"count":735},{"degree":2,"count":721},{"degree":15,"count":28},{"degree":16,"count":70}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 721 |
| Distribution of constraint arities | [{"arity":3,"count":721},{"arity":98,"count":1},{"arity":721,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 721 |
| Distribution of constraint types | [{"type":"intension","count":721},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Naxos 1.1.0 (complete) | 4251718 | ? (TO) | 2400.01 | 2401.7 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251717 | ? (TO) | 2400.06 | 2400.31 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260088 | ? (TO) | 2400.0701 | 2400.1001 |
| cosoco-mini 1.12 (complete) | 4267269 | ? (TO) | 2400.0701 | 2400.2 |
| miniBTD 2017-08-10 (complete) | 4264828 | ? (TO) | 2400.0801 | 2400.2 |
| miniBTD 2017-06-30 (complete) | 4251716 | ? (TO) | 2400.11 | 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: