| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-dsjr-500-1.xml |
| MD5SUM | 63617ebb940b75a46f0f1a167a7b759f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 11 |
| Best CPU time to get the best result obtained on this benchmark | 29.7811 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 500 |
| Number of constraints | 3555 |
| Number of domains | 1 |
| Minimum domain size | 500 |
| Maximum domain size | 500 |
| Distribution of domain sizes | [{"size":500,"count":500}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 26 |
| Distribution of variable degrees | [{"degree":5,"count":1},{"degree":6,"count":4},{"degree":7,"count":14},{"degree":8,"count":14},{"degree":9,"count":22},{"degree":10,"count":28},{"degree":11,"count":27},{"degree":12,"count":40},{"degree":13,"count":28},{"degree":14,"count":44},{"degree":15,"count":39},{"degree":16,"count":32},{"degree":17,"count":44},{"degree":18,"count":41},{"degree":19,"count":29},{"degree":20,"count":29},{"degree":21,"count":30},{"degree":22,"count":11},{"degree":23,"count":14},{"degree":24,"count":1},{"degree":25,"count":4},{"degree":26,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":3555}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 3555 |
| Distribution of constraint types | [{"type":"intension","count":3555}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407543 | OPT | 11 | 29.7811 | 29.7974 |
| cosoco 2 (complete) | 4394676 | OPT | 11 | 1014.26 | 1014.32 |
| cosoco 2.0 (complete) | 4408780 | OPT | 11 | 1096.03 | 1095.94 |
| cosoco 2.0 (complete) | 4397520 | OPT | 11 | 1401.47 | 1401.57 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 11<instantiation> <list> x[] </list> <values> 2 10 6 10 3 1 11 2 1 2 7 2 6 7 1 4 4 5 7 8 6 7 11 4 6 0 0 9 2 11 10 11 11 1 7 8 1 7 5 7 9 10 10 10 2 5 0 6 8 5 0 3 0 2 3 2 4 7 0 0 9 7 11 11 1 8 11 10 0 2 1 6 3 8 5 5 11 2 4 8 1 10 5 7 2 3 10 3 8 10 0 10 2 5 8 8 9 10 4 9 8 8 6 2 9 10 6 0 2 2 5 3 10 7 8 9 5 11 0 8 1 3 4 1 10 2 5 5 10 4 11 10 5 8 1 11 3 6 7 5 7 6 3 8 4 3 9 3 3 5 3 9 2 9 6 6 8 10 4 5 9 2 9 0 8 11 2 8 7 3 8 2 2 2 9 0 2 4 2 4 3 9 3 10 4 9 8 7 0 1 7 5 1 11 2 9 8 6 0 4 1 4 2 8 6 3 10 3 2 7 8 9 9 2 7 7 6 0 1 7 10 7 0 4 9 5 11 11 7 8 10 6 1 5 4 2 0 4 10 7 3 6 3 11 2 1 0 9 10 1 2 0 8 11 5 9 5 5 8 5 6 7 1 8 1 9 9 10 3 8 8 3 10 9 4 9 1 9 0 7 8 6 4 0 4 5 7 2 10 8 7 10 9 5 7 11 9 0 8 2 9 8 10 2 0 10 3 4 1 4 7 11 1 4 3 3 5 0 0 3 5 5 4 7 0 6 8 1 11 9 7 6 1 5 11 5 10 1 5 9 6 6 1 4 0 8 8 11 4 2 3 3 9 4 1 6 4 6 11 10 8 0 3 7 7 6 2 6 2 4 6 6 10 1 3 3 0 11 4 7 11 4 2 7 0 10 5 2 3 1 5 9 8 4 4 8 11 1 8 5 2 11 0 2 3 0 10 4 1 8 5 11 6 5 1 10 5 7 11 10 7 3 11 4 0 6 10 10 7 6 0 3 6 1 9 3 9 7 2 0 6 1 9 1 9 4 10 1 3 6 4 4 11 10 2 4 11 0 2 11 6 3 11 7 0 10 5 4 7 9 0 7 4 5 1 3 7 11 1 0 10 1 1 4 9 3 7 3 3 0 4 4 1 2 8 3 9 3 9 9 </values> </instantiation>