| Name | Primes/ Primes-m1-p10/Primes-10-20-3-3.xml |
| MD5SUM | c75dc7691cc0d241760bec76a0a96dfe |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 3.1317301 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 20 |
| Number of domains | 1 |
| Minimum domain size | 28 |
| Maximum domain size | 28 |
| Distribution of domain sizes | [{"size":28,"count":60}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":0,"count":40},{"degree":1,"count":35},{"degree":2,"count":17},{"degree":3,"count":8}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":3,"count":3},{"arity":4,"count":7},{"arity":5,"count":4},{"arity":6,"count":6}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":20}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267372 | SAT | 0.005566 | 0.109626 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253096 | SAT | 0.005595 | 0.00604308 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260191 | SAT | 0.0056830002 | 0.062006101 |
| Naxos 1.1.0 (complete) | 4253097 | SAT | 0.006617 | 0.00712709 |
| miniBTD 2017-06-30 (complete) | 4253095 | SAT | 3.13071 | 3.13147 |
| miniBTD 2017-08-10 (complete) | 4264931 | SAT | 3.1317301 | 3.2186 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type='solution'> <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] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] </list> <values>* * 20 3 5 29 * 8 * 6 * * 2 21 2 29 * 28 * 14 2 * * * * 2 4 23 27 4 21 2 * 23 * * 5 3 * 2 26 * * * 15 * 28 * 29 29 2 27 * 2 * 2 18 * * 23 21 21 * * 13 2 * 23 4 12 4 5 5 * 29 19 16 12 * 2 2 * 26 20 8 * * * 12 * 6 * 29 3 * 3 * * * 19 </values> </instantiation>