| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-dsjc-250-1.xml |
| MD5SUM | 4a78676e15c4a516bf0316b10322151a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 242.198 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 250 |
| Number of constraints | 3218 |
| Number of domains | 1 |
| Minimum domain size | 250 |
| Maximum domain size | 250 |
| Distribution of domain sizes | [{"size":250,"count":250}] |
| Minimum variable degree | 14 |
| Maximum variable degree | 39 |
| Distribution of variable degrees | [{"degree":14,"count":1},{"degree":15,"count":1},{"degree":16,"count":3},{"degree":17,"count":5},{"degree":18,"count":6},{"degree":19,"count":5},{"degree":20,"count":6},{"degree":21,"count":11},{"degree":22,"count":14},{"degree":23,"count":16},{"degree":24,"count":14},{"degree":25,"count":25},{"degree":26,"count":17},{"degree":27,"count":14},{"degree":28,"count":12},{"degree":29,"count":25},{"degree":30,"count":21},{"degree":31,"count":11},{"degree":32,"count":9},{"degree":33,"count":9},{"degree":34,"count":4},{"degree":35,"count":6},{"degree":36,"count":9},{"degree":37,"count":3},{"degree":38,"count":2},{"degree":39,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":3218}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3218 |
| Distribution of constraint types | [{"type":"intension","count":3218}] |
| 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: 8<instantiation id='sol3' type='solution' cost='8'> <list> x[] </list> <values> 1 8 3 3 0 5 6 3 5 5 5 1 4 7 5 8 7 3 2 4 4 3 4 7 6 0 3 2 7 3 5 0 4 7 1 8 3 5 8 8 2 7 1 0 5 3 1 5 2 7 7 4 6 8 6 8 2 3 7 8 0 0 6 6 2 2 0 7 1 3 0 2 5 6 5 1 1 0 7 8 1 2 1 5 7 0 2 7 0 5 1 5 3 2 3 4 8 1 3 1 8 5 6 3 8 3 7 3 4 2 1 8 4 6 1 2 0 4 1 2 1 4 4 3 5 0 7 5 0 6 5 7 6 6 6 2 4 8 6 6 0 1 3 7 7 1 7 4 7 5 2 0 2 0 8 0 1 7 2 4 2 2 6 3 2 5 5 6 1 1 5 0 5 2 4 7 6 0 1 5 6 0 2 6 1 6 5 5 4 2 2 5 7 8 5 5 4 4 2 1 4 5 3 8 4 4 0 6 5 8 7 3 2 7 0 5 4 7 3 5 7 8 0 5 4 2 6 5 7 2 3 1 7 3 4 4 1 1 7 1 0 6 2 6 0 5 3 3 4 3 </values> </instantiation>