| Name | GracefulGraph/ GracefulGraph-K04-P04_c18.xml |
| MD5SUM | bba9b3428f0c8228a4e28ff2342631fb |
| 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 | 32.09 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 92 |
| Number of constraints | 38 |
| Number of domains | 2 |
| Minimum domain size | 36 |
| Maximum domain size | 37 |
| Distribution of domain sizes | [{"size":36,"count":36},{"size":37,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":40},{"degree":2,"count":36},{"degree":5,"count":8},{"degree":6,"count":8}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":3,"count":36},{"arity":16,"count":1},{"arity":36,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 36 |
| Distribution of constraint types | [{"type":"intension","count":36},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291299 | SAT | 32.09 | 5.75198 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309068 | SAT | 35.223 | 6.43791 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297712 | SAT | 39.3064 | 5.45447 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307397 | SAT | 257.186 | 34.8491 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297213 | SAT | 295.609 | 38.9899 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296977 | SAT | 1295.77 | 164.383 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307161 | SAT | 1824.41 | 231.352 |
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] cn[3][0] cn[3][1] cn[3][2] cn[3][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] ce[3][0][1] ce[3][0][2] ce[3][0][3] ce[3][1][2] ce[3][1][3] ce[3][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] cie[2][0] cie[2][1] cie[2][2] cie[2][3] </list> <values> 36 0 1 34 5 32 25 13 35 7 12 29 6 17 21 3 36 35 2 1 34 33 27 20 8 7 19 12 28 23 6 5 22 17 11 15 3 4 14 18 31 32 24 21 30 25 13 16 29 10 9 26 </values> </instantiation>