| Name | Renault/Renault-m1-s1/ Renault-medium-pos.xml |
| MD5SUM | 19655dcffa751868797b607ef2267cd6 |
| 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.055865001 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 148 |
| Number of constraints | 174 |
| Number of domains | 15 |
| Minimum domain size | 2 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":2,"count":122},{"size":3,"count":5},{"size":4,"count":6},{"size":5,"count":2},{"size":6,"count":1},{"size":7,"count":2},{"size":8,"count":2},{"size":9,"count":1},{"size":13,"count":1},{"size":14,"count":1},{"size":17,"count":1},{"size":20,"count":2}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 139 |
| Distribution of variable degrees | [{"degree":0,"count":2},{"degree":1,"count":81},{"degree":2,"count":33},{"degree":3,"count":15},{"degree":4,"count":6},{"degree":5,"count":6},{"degree":6,"count":2},{"degree":8,"count":1},{"degree":22,"count":1},{"degree":139,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":2,"count":143},{"arity":3,"count":14},{"arity":4,"count":7},{"arity":5,"count":1},{"arity":6,"count":4},{"arity":7,"count":2},{"arity":8,"count":1},{"arity":10,"count":2}] |
| Number of extensional constraints | 174 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":174}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4251912 | SAT | 0.01925 | 0.019787 |
| miniBTD 2017-08-10 (complete) | 4264993 | SAT | 0.019942001 | 0.095903002 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251913 | SAT | 0.05465 | 0.055562 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260253 | SAT | 0.055865001 | 0.12928 |
| cosoco-mini 1.12 (complete) | 4267434 | SAT | 0.056212001 | 0.056272902 |
| Naxos 1.1.0 (complete) | 4251914 | SAT | 0.062942 | 0.063639 |
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> x2 x8 x9 x11 x13 x14 x0[0] x0[1] x1[0] x1[1] x1[2] x1[3] x1[4] x1[5] x3[0] x3[1] x3[2] x3[3] 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] x4[13] x4[14] x4[15] x4[16] x4[17] x4[18] x4[19] x4[20] x4[21] x4[22] x4[23] x4[24] x5[0] x5[1] x5[2] x5[3] x5[4] x5[5] x5[6] x5[7] x6[0] x6[1] x7[0] x7[1] x10[0] x10[1] x12[0] x12[1] x15[0] x15[1] x15[2] x15[3] x15[4] x15[5] x15[6] x15[7] x15[8] x15[9] x15[10] x15[11] x15[12] x15[13] x15[14] x15[15] x15[16] x15[17] x15[18] x15[19] x15[20] x15[21] x15[22] x15[23] x15[24] x15[25] x15[26] x15[27] x15[28] x15[29] x15[30] x15[31] x15[32] x15[33] x15[34] x15[35] x15[36] x15[37] x15[38] x15[39] x15[40] x15[41] x15[42] x15[43] x15[44] x15[45] x15[46] x15[47] x15[48] x15[49] x15[50] x15[51] x15[52] x15[53] x15[54] x15[55] x15[56] x15[57] x15[58] x15[59] x15[60] x15[61] x15[62] x15[63] x15[64] x15[65] x15[66] x15[67] x15[68] x15[69] x15[70] x15[71] x15[72] x15[73] x15[74] x15[75] x15[76] x15[77] x15[78] x15[79] x15[80] x15[81] x15[82] x15[83] x15[84] x15[85] x15[86] x15[87] x15[88] </list> <values> 12 1 99 4 8 8 0 0 2 2 2 1 2 1 1 2 2 0 1 1 0 0 1 0 1 1 0 0 0 0 1 0 1 0 0 0 1 1 0 1 1 0 0 99 99 99 99 99 99 99 0 4 0 5 3 0 0 5 2 99 1 99 1 99 99 1 99 1 99 99 99 99 1 99 1 99 1 99 1 99 1 99 99 1 1 99 99 1 99 99 99 99 99 1 99 1 99 1 99 1 99 1 99 99 99 99 1 99 1 1 99 99 99 1 99 1 99 99 99 99 1 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 99 </values> </instantiation>