| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K12-P08.xml |
| MD5SUM | 9611f8ac50407bec4b89a807890af998 |
| 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 | 1332 |
| Number of constraints | 614 |
| Number of domains | 2 |
| Minimum domain size | 612 |
| Maximum domain size | 613 |
| Distribution of domain sizes | [{"size":612,"count":612},{"size":613,"count":96}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":0,"count":624},{"degree":2,"count":612},{"degree":13,"count":24},{"degree":14,"count":72}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 612 |
| Distribution of constraint arities | [{"arity":3,"count":612},{"arity":96,"count":1},{"arity":612,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 612 |
| Distribution of constraint types | [{"type":"intension","count":612},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 19.06.16 (complete) | 4391956 | ? (TO) | 2400.01 | 2399.8 |
| cosoco 2.0 (complete) | 4408696 | ? (TO) | 2400.02 | 2399.7 |
| NACRE 1.0.5 (complete) | 4391756 | ? (TO) | 2400.02 | 2400.01 |
| cosoco 2.0 (complete) | 4397436 | ? (TO) | 2400.04 | 2400.3 |
| NACRE 1.0.5-Hybrid (complete) | 4391556 | ? (TO) | 2400.05 | 2400.3 |
| cosoco 2 (complete) | 4390156 | ? (TO) | 2400.08 | 2400.4 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407550 | ? (TO) | 2400.1 | 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: