| Name | Renault/Renault-m1-s1/ Renault-small.xml |
| MD5SUM | 5e55bfc7b30a0175fda5de0f90de1236 |
| 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.016663 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 139 |
| Number of constraints | 147 |
| Number of domains | 8 |
| Minimum domain size | 2 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":2,"count":120},{"size":3,"count":10},{"size":4,"count":6},{"size":14,"count":1},{"size":16,"count":2}] |
| Minimum variable degree | 1 |
| Maximum variable degree | 132 |
| Distribution of variable degrees | [{"degree":1,"count":105},{"degree":2,"count":22},{"degree":3,"count":8},{"degree":4,"count":1},{"degree":5,"count":1},{"degree":11,"count":1},{"degree":132,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 8 |
| Distribution of constraint arities | [{"arity":2,"count":133},{"arity":3,"count":7},{"arity":4,"count":3},{"arity":6,"count":3},{"arity":8,"count":1}] |
| Number of extensional constraints | 147 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":147}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4251903 | SAT | 0.008915 | 0.0100901 |
| miniBTD 2017-08-10 (complete) | 4264996 | SAT | 0.0090229996 | 0.00964408 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251904 | SAT | 0.013114 | 0.0182471 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260256 | SAT | 0.014334 | 0.114412 |
| cosoco-mini 1.12 (complete) | 4267437 | SAT | 0.014494 | 0.0151521 |
| Naxos 1.1.0 (complete) | 4251905 | SAT | 0.016663 | 0.0169751 |
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> x4 x0[0] x0[1] x1[0] x1[1] x1[2] x1[3] x1[4] x1[5] x1[6] x1[7] x2[0] x2[1] x2[2] x2[3] x2[4] x2[5] 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] x5[0] x5[1] x6[0] x6[1] x6[2] x6[3] x6[4] 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] </list> <values> 0 0 0 0 0 0 0 0 0 0 2 2 0 2 1 1 1 0 0 1 1 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 1 1 0 0 99 1 99 0 0 0 99 99 1 99 1 1 99 99 1 99 1 99 1 1 99 1 99 1 99 1 99 1 99 99 1 99 1 99 99 1 99 99 1 99 99 1 99 99 1 1 99 99 1 1 99 99 1 99 1 1 99 1 99 99 1 99 99 1 99 99 1 99 1 1 99 99 1 1 1 99 99 1 99 1 1 99 1 1 99 99 99 1 </values> </instantiation>