| Name | Driver/ Driver-m1-s1/driverlogw-02c.xml |
| MD5SUM | c8fd18e75f0cc97e5aebd901dbc03ce8 |
| 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.37911299 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 301 |
| Number of constraints | 4055 |
| Number of domains | 6 |
| Minimum domain size | 2 |
| Maximum domain size | 8 |
| Distribution of domain sizes | [{"size":2,"count":89},{"size":3,"count":47},{"size":4,"count":59},{"size":5,"count":46},{"size":6,"count":52},{"size":8,"count":8}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 64 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":3,"count":5},{"degree":4,"count":2},{"degree":5,"count":2},{"degree":6,"count":7},{"degree":7,"count":7},{"degree":8,"count":3},{"degree":9,"count":3},{"degree":10,"count":9},{"degree":11,"count":5},{"degree":12,"count":4},{"degree":13,"count":14},{"degree":14,"count":9},{"degree":15,"count":1},{"degree":16,"count":4},{"degree":17,"count":15},{"degree":18,"count":3},{"degree":19,"count":4},{"degree":20,"count":10},{"degree":21,"count":11},{"degree":22,"count":4},{"degree":23,"count":10},{"degree":24,"count":12},{"degree":25,"count":8},{"degree":26,"count":12},"...",{"degree":37,"count":6}, {"degree":38,"count":11}, {"degree":39,"count":4}, {"degree":40,"count":2}, {"degree":41,"count":5}, {"degree":42,"count":2}, {"degree":43,"count":5}, {"degree":44,"count":2}, {"degree":45,"count":3}, {"degree":46,"count":3}, {"degree":47,"count":1}, {"degree":48,"count":3}, {"degree":49,"count":2}, {"degree":50,"count":2}, {"degree":51,"count":2}, {"degree":52,"count":4}, {"degree":53,"count":3}, {"degree":54,"count":1}, {"degree":55,"count":3}, {"degree":56,"count":4}, {"degree":57,"count":3}, {"degree":58,"count":1}, {"degree":62,"count":1}, {"degree":63,"count":3}, {"degree":64,"count":2}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":4055}] |
| Number of extensional constraints | 4055 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":4055}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260072 | SAT | 0.086221002 | 0.167815 |
| cosoco-mini 1.12 (complete) | 4267253 | SAT | 0.08636 | 0.087090001 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252678 | SAT | 0.087273 | 0.0876181 |
| miniBTD 2017-06-30 (complete) | 4252677 | SAT | 0.370648 | 0.371256 |
| miniBTD 2017-08-10 (complete) | 4264812 | SAT | 0.37911299 | 0.38013399 |
| Naxos 1.1.0 (complete) | 4252679 | SAT | 50.5943 | 50.5899 |
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>x0[0] x0[1] x0[2] x0[3] x0[4] x0[5] x0[6] x0[7] x0[8] x0[9] x0[10] x0[11] x0[12] x0[13] x0[14] x0[15] x0[16] x0[17] x0[18] x0[19] x0[20] x0[21] x0[22] x0[23] x0[24] x0[25] x0[26] x0[27] x0[28] x0[29] x0[30] x0[31] x0[32] x0[33] x0[34] x0[35] x0[36] x0[37] x0[38] x0[39] x0[40] x0[41] x0[42] x0[43] x0[44] x0[45] x0[46] x1[0] x1[1] x1[2] x1[3] x1[4] x1[5] x1[6] x1[7] x1[8] x1[9] x1[10] x1[11] x1[12] x1[13] x1[14] x1[15] x1[16] x1[17] x1[18] x1[19] x1[20] x1[21] x1[22] x1[23] x1[24] x1[25] x1[26] x1[27] x1[28] x1[29] x1[30] x1[31] x1[32] x1[33] x1[34] x1[35] x1[36] x1[37] x1[38] x1[39] x1[40] x1[41] x1[42] x1[43] x1[44] x1[45] x2[0] x2[1] x2[2] x2[3] x2[4] x2[5] x2[6] x2[7] x2[8] x2[9] x2[10] x2[11] x2[12] x2[13] x2[14] x2[15] x2[16] x2[17] x2[18] x2[19] x2[20] x2[21] x2[22] x2[23] x2[24] x2[25] x2[26] x2[27] x2[28] x2[29] x2[30] x2[31] x2[32] x2[33] x2[34] x2[35] x2[36] x2[37] x2[38] x2[39] x2[40] x2[41] x2[42] x2[43] x2[44] x2[45] x2[46] x2[47] x2[48] x2[49] x2[50] x2[51] x2[52] x2[53] x2[54] x2[55] x2[56] x2[57] x2[58] x3[0] x3[1] x3[2] x3[3] x3[4] x3[5] x3[6] x3[7] x3[8] x3[9] x3[10] x3[11] x3[12] x3[13] x3[14] x3[15] x3[16] x3[17] x3[18] x3[19] x3[20] x3[21] x3[22] x3[23] x3[24] x3[25] x3[26] x3[27] x3[28] x3[29] x3[30] x3[31] x3[32] x3[33] x3[34] x3[35] x3[36] x3[37] x3[38] x3[39] x3[40] x3[41] x3[42] x3[43] x3[44] x3[45] x3[46] x3[47] x3[48] x3[49] x3[50] x3[51] x4[0] x4[1] x4[2] x4[3] x4[4] x4[5] x4[6] x4[7] x5[0] x5[1] x5[2] x5[3] x5[4] x5[5] x5[6] x5[7] x5[8] x5[9] x5[10] x5[11] x5[12] x5[13] x5[14] x5[15] x5[16] x5[17] x5[18] x5[19] x5[20] x5[21] x5[22] x5[23] x5[24] x5[25] x5[26] x5[27] x5[28] x5[29] x5[30] x5[31] x5[32] x5[33] x5[34] x5[35] x5[36] x5[37] x5[38] x5[39] x5[40] x5[41] x5[42] x5[43] x5[44] x5[45] x5[46] x5[47] x5[48] x5[49] x5[50] x5[51] x5[52] x5[53] x5[54] x5[55] x5[56] x5[57] x5[58] x5[59] x5[60] x5[61] x5[62] x5[63] x5[64] x5[65] x5[66] x5[67] x5[68] x5[69] x5[70] x5[71] x5[72] x5[73] x5[74] x5[75] x5[76] x5[77] x5[78] x5[79] x5[80] x5[81] x5[82] x5[83] x5[84] x5[85] x5[86] x5[87] x5[88] </list> <values>0 0 0 1 0 0 2 0 0 0 0 0 0 1 0 1 0 0 1 0 1 0 0 1 1 1 0 0 0 1 0 1 2 0 0 0 2 0 0 1 0 0 0 2 0 1 0 0 1 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 1 1 1 3 0 0 2 1 0 0 1 3 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 2 0 0 0 3 0 5 0 0 0 0 3 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 2 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1 1 0 0 0 0 1 1 1 1 1 0 1 0 0 </values> </instantiation>