| Name | Primes/ Primes-m1-p10/Primes-10-60-3-3.xml |
| MD5SUM | a24e7222a5a2ec30919d0297100f43ac |
| 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 | 0.028294999 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 60 |
| Number of domains | 1 |
| Minimum domain size | 28 |
| Maximum domain size | 28 |
| Distribution of domain sizes | [{"size":28,"count":95}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":0,"count":5},{"degree":1,"count":23},{"degree":2,"count":17},{"degree":3,"count":23},{"degree":4,"count":15},{"degree":5,"count":8},{"degree":6,"count":6},{"degree":7,"count":2},{"degree":8,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":3,"count":8},{"arity":4,"count":19},{"arity":5,"count":14},{"arity":6,"count":19}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":60}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267373 | SAT | 0.026865 | 0.088450901 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253093 | SAT | 0.027834 | 0.027604 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260192 | SAT | 0.028294999 | 0.082929999 |
| miniBTD 2017-08-10 (complete) | 4264932 | SAT | 6.7435398 | 6.85605 |
| miniBTD 2017-06-30 (complete) | 4253092 | SAT | 6.74797 | 6.74953 |
| Naxos 1.1.0 (complete) | 4253094 | SAT | 276.301 | 276.318 |
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>26 17 19 13 7 13 17 5 24 3 5 19 2 29 7 12 2 17 5 17 3 * 19 29 * 2 5 7 19 13 29 5 5 23 29 19 7 17 3 5 29 7 3 29 11 19 23 * 13 2 7 17 3 2 17 7 5 2 17 3 13 13 * 19 17 13 17 29 7 19 11 13 5 18 16 19 11 11 * 2 19 23 17 23 23 11 7 20 11 29 5 2 17 23 29 5 12 17 11 29 </values> </instantiation>