| Name | GracefulGraph/GracefulGraph-m1-s1/ GracefulGraph-K12-P09.xml |
| MD5SUM | 32cec65ed71b36923f34d2db18851218 |
| 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 | 1500 |
| Number of constraints | 692 |
| Number of domains | 2 |
| Minimum domain size | 690 |
| Maximum domain size | 691 |
| Distribution of domain sizes | [{"size":690,"count":690},{"size":691,"count":108}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":0,"count":702},{"degree":2,"count":690},{"degree":13,"count":24},{"degree":14,"count":84}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 690 |
| Distribution of constraint arities | [{"arity":3,"count":690},{"arity":108,"count":1},{"arity":690,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 690 |
| Distribution of constraint types | [{"type":"intension","count":690},{"type":"allDifferent","count":2}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264827 | ? (TO) | 2400.02 | 2399.8999 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260087 | ? (TO) | 2400.03 | 2399.8999 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251714 | ? (TO) | 2400.05 | 2400 |
| Naxos 1.1.0 (complete) | 4251715 | ? (TO) | 2400.08 | 2402.1 |
| miniBTD 2017-06-30 (complete) | 4251713 | ? (TO) | 2400.08 | 2399.9 |
| cosoco-mini 1.12 (complete) | 4267268 | ? (TO) | 2400.0901 | 2400.3 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: