| Name | RoomMate/ RoomMate-int-s1/RoomMate-sr1000c-int.xml |
| MD5SUM | 2ff4403728a82746813109e0b9ab6660 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 495.64 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 1000 |
| Number of constraints | 1998000 |
| Number of domains | 1 |
| Minimum domain size | 999 |
| Maximum domain size | 999 |
| Distribution of domain sizes | [{"size":999,"count":1000}] |
| Minimum variable degree | 3996 |
| Maximum variable degree | 3996 |
| Distribution of variable degrees | [{"degree":3996,"count":1000}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":1998000}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1998000 |
| Distribution of constraint types | [{"type":"intension","count":1998000}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: