| Name | GracefulGraph/ GracefulGraph-K05-P03_c18.xml |
| MD5SUM | f4fa601a34b34009a5b9ea58e60241da |
| 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 | 546.471 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 42 |
| Number of domains | 2 |
| Minimum domain size | 40 |
| Maximum domain size | 41 |
| Distribution of domain sizes | [{"size":40,"count":40},{"size":41,"count":15}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":0,"count":45},{"degree":2,"count":40},{"degree":6,"count":10},{"degree":7,"count":5}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":3,"count":40},{"arity":15,"count":1},{"arity":40,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 40 |
| Distribution of constraint types | [{"type":"intension","count":40},{"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) | 4297714 | SAT | 546.471 | 69.3611 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309070 | SAT | 1846.6 | 234.513 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291301 | SAT (TO) | 6451.43 | 2520.03 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307163 | ? (TO) | 20075 | 2520.07 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307399 | ? (TO) | 20078.7 | 2520.05 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296979 | ? (TO) | 20083.3 | 2520.07 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297215 | ? (TO) | 20085.3 | 2520.06 |
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[0][4] cn[1][0] cn[1][1] cn[1][2] cn[1][3] cn[1][4] cn[2][0] cn[2][1] cn[2][2] cn[2][3] cn[2][4] ce[0][0][1] ce[0][0][2] ce[0][0][3] ce[0][0][4] ce[0][1][2] ce[0][1][3] ce[0][1][4] ce[0][2][3] ce[0][2][4] ce[0][3][4] ce[1][0][1] ce[1][0][2] ce[1][0][3] ce[1][0][4] ce[1][1][2] ce[1][1][3] ce[1][1][4] ce[1][2][3] ce[1][2][4] ce[1][3][4] ce[2][0][1] ce[2][0][2] ce[2][0][3] ce[2][0][4] ce[2][1][2] ce[2][1][3] ce[2][1][4] ce[2][2][3] ce[2][2][4] ce[2][3][4] cie[0][0] cie[0][1] cie[0][2] cie[0][3] cie[0][4] cie[1][0] cie[1][1] cie[1][2] cie[1][3] cie[1][4] </list> <values>40 0 39 2 25 6 18 9 37 1 27 31 38 5 11 40 1 38 15 39 2 25 37 14 23 12 3 31 5 9 19 17 28 8 36 4 11 22 16 7 26 20 33 27 6 34 18 30 35 24 21 13 29 32 10 </values> </instantiation>