| Name | GracefulGraph/ GracefulGraph-K04-P03_c18.xml |
| MD5SUM | 76f2570dac1ecc86f40824dfede26263 |
| 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 | 2.78628 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 68 |
| Number of constraints | 28 |
| Number of domains | 2 |
| Minimum domain size | 26 |
| Maximum domain size | 27 |
| Distribution of domain sizes | [{"size":26,"count":26},{"size":27,"count":12}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":30},{"degree":2,"count":26},{"degree":5,"count":8},{"degree":6,"count":4}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 26 |
| Distribution of constraint arities | [{"arity":3,"count":26},{"arity":12,"count":1},{"arity":26,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 26 |
| Distribution of constraint types | [{"type":"intension","count":26},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297711 | SAT | 2.78628 | 0.849263 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297212 | SAT | 8.09293 | 2.46595 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307160 | SAT | 8.73913 | 3.19681 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291298 | SAT | 9.46674 | 2.85069 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309067 | SAT | 11.089 | 3.43878 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307396 | SAT | 19.9522 | 4.67392 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296976 | SAT | 27.4944 | 4.87351 |
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[0][0] cn[0][1] cn[0][2] cn[0][3] cn[1][0] cn[1][1] cn[1][2] cn[1][3] cn[2][0] cn[2][1] cn[2][2] cn[2][3] ce[0][0][1] ce[0][0][2] ce[0][0][3] ce[0][1][2] ce[0][1][3] ce[0][2][3] ce[1][0][1] ce[1][0][2] ce[1][0][3] ce[1][1][2] ce[1][1][3] ce[1][2][3] ce[2][0][1] ce[2][0][2] ce[2][0][3] ce[2][1][2] ce[2][1][3] ce[2][2][3] cie[0][0] cie[0][1] cie[0][2] cie[0][3] cie[1][0] cie[1][1] cie[1][2] cie[1][3] </list> <values>26 0 25 2 7 22 4 14 21 5 10 1 26 1 24 25 2 23 15 3 7 18 8 10 16 11 20 5 4 9 19 22 21 12 14 17 6 13 </values> </instantiation>