| Name | GracefulGraph/ GracefulGraph-K05-P02_c18.xml |
| MD5SUM | 803795f7a37fd3a40686e408980b1bff |
| 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 | 15.7228 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 65 |
| Number of constraints | 27 |
| Number of domains | 2 |
| Minimum domain size | 25 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":25,"count":25},{"size":26,"count":10}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":30},{"degree":2,"count":25},{"degree":6,"count":10}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":3,"count":25},{"arity":10,"count":1},{"arity":25,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 25 |
| Distribution of constraint types | [{"type":"intension","count":25},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407893 | SAT | 15.7228 | 15.7256 |
| cosoco 2 (complete) | 4390040 | SAT | 18.5039 | 18.5043 |
| cosoco 2.0 (complete) | 4408580 | SAT | 18.5369 | 18.537 |
| cosoco 2.0 (complete) | 4397320 | SAT | 18.6145 | 18.6159 |
| miniBTD 19.06.16 (complete) | 4391840 | SAT | 32.889 | 32.8901 |
| NACRE 1.0.5-Hybrid (complete) | 4391440 | ? (TO) | 2400.05 | 2400.2 |
| NACRE 1.0.5 (complete) | 4391640 | ? (TO) | 2400.05 | 2400.01 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list> cn[][] cie[][] ce[][][] </list> <values> 7 0 25 6 21 19 24 2 22 11 12 24 23 16 10 1 7 18 1 14 1 1 25 6 21 1 1 1 19 4 1 1 1 1 15 1 1 1 1 1 1 5 17 3 8 1 1 22 2 13 1 1 1 20 9 1 1 1 1 11 1 1 1 1 1 </values> </instantiation>