Name | Primes/ Primes-m1-p15/Primes-15-20-2-5.xml |
MD5SUM | 5c2f9b3786fd2492c99150ec9cf810b1 |
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.0087789996 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 100 |
Number of constraints | 20 |
Number of domains | 1 |
Minimum domain size | 46 |
Maximum domain size | 46 |
Distribution of domain sizes | [{"size":46,"count":63}] |
Minimum variable degree | 0 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":0,"count":37},{"degree":1,"count":34},{"degree":2,"count":23},{"degree":3,"count":5},{"degree":4,"count":1}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 7 |
Distribution of constraint arities | [{"arity":3,"count":4},{"arity":4,"count":5},{"arity":5,"count":3},{"arity":6,"count":4},{"arity":7,"count":4}] |
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) | 4267374 | SAT | 0.007675 | 0.0086750695 |
cosoco-mini 1.1 (2017-06-27) (complete) | 4253087 | SAT | 0.008068 | 0.00911908 |
cosoco-mini 1.1 (2017-07-29) (complete) | 4260193 | SAT | 0.0087789996 | 0.065856002 |
Naxos 1.1.0 (complete) | 4253088 | SAT | 0.026491 | 0.0269319 |
miniBTD 2017-08-10 (complete) | 4264933 | ? (TO) | 2400.02 | 2400.1101 |
miniBTD 2017-06-30 (complete) | 4253086 | ? (TO) | 2400.08 | 2400.1 |
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>27 44 * * * 2 5 45 11 * * * 5 42 2 2 3 8 * * 45 46 2 * * 47 * 41 34 12 47 47 * 4 * * 33 * 3 28 21 * 11 43 46 * 4 * 46 30 14 2 * 46 * * 30 * 38 * * * 45 * 47 * * * 46 2 46 * 46 * 44 * 36 * 45 2 * 2 * * 18 13 44 37 42 47 40 6 22 12 21 20 2 6 * 46 </values> </instantiation>