| Name | Ramsey/Ramsey-int-s1/ Ramsey-int-18.xml |
| MD5SUM | 3a3404c97a3d7cefcffb7ea6a332e0fb |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 243.024 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 324 |
| Number of constraints | 816 |
| Number of domains | 1 |
| Minimum domain size | 153 |
| Maximum domain size | 153 |
| Distribution of domain sizes | [{"size":153,"count":153}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 17 |
| Distribution of variable degrees | [{"degree":0,"count":171},{"degree":17,"count":153}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":816}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 816 |
| Distribution of constraint types | [{"type":"intension","count":816}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 3<instantiation id='sol13' type='solution' cost='3'> <list> x[][] </list> <values> * 0 0 0 1 0 1 2 2 2 0 1 2 3 2 3 1 2 * * 1 1 0 3 2 2 0 0 1 1 1 2 2 0 0 1 * * * 2 0 1 1 0 1 2 3 0 2 2 1 0 1 2 * * * * 2 2 1 3 2 1 2 3 0 0 0 1 0 3 * * * * * 1 2 2 1 2 0 3 0 2 0 1 2 1 * * * * * * 2 1 0 1 1 2 0 0 2 2 0 0 * * * * * * * 1 2 3 0 0 2 1 0 0 0 2 * * * * * * * * 3 0 2 1 1 0 0 1 0 1 * * * * * * * * * 1 0 0 1 2 0 2 2 3 * * * * * * * * * * 3 0 0 1 1 2 1 0 * * * * * * * * * * * 2 3 0 1 2 1 0 * * * * * * * * * * * * 2 0 1 3 2 2 * * * * * * * * * * * * * 1 1 0 1 3 * * * * * * * * * * * * * * 3 0 3 1 * * * * * * * * * * * * * * * 1 2 0 * * * * * * * * * * * * * * * * 1 0 * * * * * * * * * * * * * * * * * 1 * * * * * * * * * * * * * * * * * * </values> </instantiation>