| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-3-fullins-3.xml |
| MD5SUM | 82134059a152e9a81bd5479c14cdc8eb |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 5 |
| Best CPU time to get the best result obtained on this benchmark | 0.303179 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 80 |
| Number of constraints | 346 |
| Number of domains | 1 |
| Minimum domain size | 80 |
| Maximum domain size | 80 |
| Distribution of domain sizes | [{"size":80,"count":80}] |
| Minimum variable degree | 5 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":5,"count":4},{"degree":6,"count":14},{"degree":7,"count":8},{"degree":8,"count":24},{"degree":9,"count":5},{"degree":13,"count":5},{"degree":14,"count":15},{"degree":20,"count":5}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":346}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 346 |
| Distribution of constraint types | [{"type":"intension","count":346}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259865 | OPT | 5 | 0.303179 | 0.38170499 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251680 | OPT | 5 | 0.306077 | 0.307239 |
| cosoco-mini 1.12 (complete) | 4267046 | OPT | 5 | 0.32696199 | 0.40555999 |
| Naxos 1.1.0 (complete) | 4251681 | SAT (TO) | 5 | 2400.02 | 2400 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 5<instantiation type='solution' cost='5'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[3] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[5] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[6] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[7] x[8] x[9] </list> <values>0 0 2 1 4 5 0 1 0 1 3 1 3 0 0 1 1 0 3 1 3 3 0 2 2 0 2 2 2 0 0 2 2 1 0 2 2 2 2 0 1 0 0 1 2 1 0 0 1 1 0 1 1 1 1 2 2 1 2 2 2 2 2 2 2 2 0 2 2 2 2 2 4 2 1 3 0 0 1 1 </values> </instantiation>