| Name | Driver/ Driver-m1-s1/driverlogw-04c.xml |
| MD5SUM | 4bc1459377379f6150b2de38fe5214e8 |
| 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.095844999 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 272 |
| Number of constraints | 3876 |
| Number of domains | 9 |
| Minimum domain size | 2 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":2,"count":91},{"size":3,"count":42},{"size":4,"count":54},{"size":5,"count":52},{"size":6,"count":12},{"size":7,"count":5},{"size":8,"count":13},{"size":9,"count":1},{"size":11,"count":2}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 75 |
| Distribution of variable degrees | [{"degree":1,"count":2},{"degree":3,"count":5},{"degree":4,"count":2},{"degree":5,"count":3},{"degree":6,"count":6},{"degree":7,"count":8},{"degree":9,"count":6},{"degree":10,"count":6},{"degree":11,"count":7},{"degree":12,"count":10},{"degree":13,"count":10},{"degree":14,"count":8},{"degree":15,"count":4},{"degree":17,"count":6},{"degree":18,"count":4},{"degree":19,"count":9},{"degree":20,"count":5},{"degree":21,"count":6},{"degree":22,"count":10},{"degree":23,"count":4},{"degree":24,"count":6},{"degree":25,"count":10},{"degree":27,"count":7},{"degree":28,"count":3},{"degree":29,"count":3},"...",{"degree":40,"count":1}, {"degree":41,"count":2}, {"degree":42,"count":2}, {"degree":43,"count":1}, {"degree":44,"count":3}, {"degree":45,"count":2}, {"degree":46,"count":6}, {"degree":47,"count":5}, {"degree":48,"count":4}, {"degree":49,"count":3}, {"degree":50,"count":4}, {"degree":51,"count":4}, {"degree":52,"count":2}, {"degree":53,"count":3}, {"degree":54,"count":1}, {"degree":55,"count":3}, {"degree":56,"count":1}, {"degree":58,"count":1}, {"degree":60,"count":3}, {"degree":61,"count":2}, {"degree":65,"count":1}, {"degree":67,"count":1}, {"degree":72,"count":2}, {"degree":73,"count":2}, {"degree":75,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":3876}] |
| Number of extensional constraints | 3876 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":3876}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260073 | SAT | 0.094074003 | 0.16759101 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252663 | SAT | 0.094989 | 0.095957 |
| cosoco-mini 1.12 (complete) | 4267254 | SAT | 0.095844999 | 0.096541896 |
| miniBTD 2017-06-30 (complete) | 4252662 | SAT | 0.15343 | 0.154627 |
| miniBTD 2017-08-10 (complete) | 4264813 | SAT | 0.158296 | 0.159273 |
| Naxos 1.1.0 (complete) | 4252664 | SAT | 1.29221 | 1.29292 |
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>x8 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] x1[0] x1[1] x1[2] x1[3] x1[4] 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] 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] x3[52] x3[53] x4[0] x4[1] x4[2] x4[3] x4[4] x4[5] x4[6] x4[7] x4[8] x4[9] x4[10] x4[11] x4[12] x5[0] x5[1] x5[2] x5[3] x5[4] x5[5] x5[6] x5[7] x5[8] x5[9] x5[10] x5[11] x6[0] x6[1] x7[0] x7[1] x7[2] x7[3] x7[4] x7[5] x7[6] x7[7] x7[8] x7[9] x7[10] x7[11] x7[12] x7[13] x7[14] x7[15] x7[16] x7[17] x7[18] x7[19] x7[20] x7[21] x7[22] x7[23] x7[24] x7[25] x7[26] x7[27] x7[28] x7[29] x7[30] x7[31] x7[32] x7[33] x7[34] x7[35] x7[36] x7[37] x7[38] x7[39] x7[40] x7[41] x7[42] x7[43] x7[44] x7[45] x7[46] x7[47] x7[48] x7[49] x7[50] x7[51] x7[52] x7[53] x7[54] x7[55] x7[56] x7[57] x7[58] x7[59] x7[60] x7[61] x7[62] x7[63] x7[64] x7[65] x7[66] x7[67] x7[68] x7[69] x7[70] x7[71] x7[72] x7[73] x7[74] x7[75] x7[76] x7[77] x7[78] x7[79] x7[80] x7[81] x7[82] x7[83] x7[84] x7[85] x7[86] x7[87] x7[88] x7[89] x7[90] </list> <values>0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 1 0 0 1 0 0 0 0 2 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 4 0 0 0 1 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 1 0 2 0 1 0 0 0 0 0 0 0 1 0 3 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 5 0 1 1 0 0 0 0 1 0 5 0 0 0 1 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 1 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 1 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 0 1 1 0 1 0 1 0 0 0 </values> </instantiation>