| Name | Primes/ Primes-m1-p30/Primes-30-60-3-1.xml |
| MD5SUM | 6306de3e407159e9ecd102c48acf4c13 |
| 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.0095469998 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 60 |
| Number of domains | 1 |
| Minimum domain size | 112 |
| Maximum domain size | 112 |
| Distribution of domain sizes | [{"size":112,"count":87}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":13},{"degree":1,"count":23},{"degree":2,"count":26},{"degree":3,"count":21},{"degree":4,"count":10},{"degree":5,"count":5},{"degree":6,"count":2}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 4 |
| Distribution of constraint arities | [{"arity":3,"count":25},{"arity":4,"count":35}] |
| 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) | 4267377 | SAT | 0.0087200003 | 0.0096309902 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253084 | SAT | 0.008827 | 0.00942089 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260196 | SAT | 0.0095469998 | 0.066528901 |
| Naxos 1.1.0 (complete) | 4253085 | SAT | 0.100227 | 0.100674 |
| miniBTD 2017-08-10 (complete) | 4264936 | SAT | 12.5631 | 12.5644 |
| miniBTD 2017-06-30 (complete) | 4253083 | SAT | 12.6974 | 12.7002 |
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>* 111 107 101 89 101 59 41 * * 5 19 * 71 89 59 2 17 83 59 37 23 95 * 5 73 5 * 19 101 113 41 2 67 113 * 43 59 3 83 * 7 79 113 47 19 * 47 98 2 89 59 3 73 103 7 5 73 59 3 53 53 * 107 * 13 59 19 43 61 97 53 * 53 47 107 47 47 7 73 19 67 17 23 23 97 7 37 * 71 41 2 103 67 32 83 59 17 97 113 </values> </instantiation>