| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-queen8-8.xml |
| MD5SUM | 1f0f248e074ceb8e6b1804d1246bfc68 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 2400.03 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 728 |
| Number of domains | 1 |
| Minimum domain size | 64 |
| Maximum domain size | 64 |
| Distribution of domain sizes | [{"size":64,"count":64}] |
| Minimum variable degree | 22 |
| Maximum variable degree | 28 |
| Distribution of variable degrees | [{"degree":22,"count":28},{"degree":24,"count":20},{"degree":26,"count":12},{"degree":28,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":728}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 728 |
| Distribution of constraint types | [{"type":"intension","count":728}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Naxos 1.1.0 (complete) | 4251657 | SAT (TO) | 8 | 2400.03 | 2399.8 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259875 | SAT (TO) | 8 | 2400.05 | 2399.8999 |
| cosoco-mini 1.12 (complete) | 4267056 | SAT (TO) | 8 | 2400.05 | 2400.2 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251656 | ? (TO) | 2400.01 | 2400.31 |
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> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] </list> <values> 0 1 2 3 4 5 6 7 4 3 7 5 6 0 1 2 7 5 1 4 8 2 3 0 6 8 0 2 3 1 4 5 3 2 5 6 7 8 0 1 8 7 4 0 1 6 2 3 1 0 8 7 2 3 5 6 5 6 3 1 0 4 7 8 </values> </instantiation>