| Name | Renault/Renault-m1-s1/ Renault-mgd.xml |
| MD5SUM | e938dbb865153b6f638b91b21d0a191f |
| 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 | 1.23066 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 101 |
| Number of constraints | 113 |
| Number of domains | 14 |
| Minimum domain size | 2 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":2,"count":58},{"size":3,"count":16},{"size":4,"count":4},{"size":5,"count":8},{"size":6,"count":3},{"size":7,"count":1},{"size":9,"count":1},{"size":10,"count":2},{"size":11,"count":1},{"size":12,"count":1},{"size":13,"count":1},{"size":25,"count":1},{"size":29,"count":1},{"size":42,"count":1}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 80 |
| Distribution of variable degrees | [{"degree":0,"count":2},{"degree":1,"count":58},{"degree":2,"count":17},{"degree":3,"count":8},{"degree":4,"count":5},{"degree":5,"count":1},{"degree":7,"count":1},{"degree":10,"count":1},{"degree":18,"count":1},{"degree":28,"count":1},{"degree":31,"count":1},{"degree":55,"count":2},{"degree":58,"count":1},{"degree":72,"count":1},{"degree":80,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":2,"count":21},{"arity":3,"count":13},{"arity":4,"count":11},{"arity":5,"count":9},{"arity":6,"count":38},{"arity":7,"count":14},{"arity":8,"count":5},{"arity":9,"count":1},{"arity":10,"count":1}] |
| Number of extensional constraints | 113 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":113}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4251915 | SAT | 0.371944 | 0.372533 |
| miniBTD 2017-08-10 (complete) | 4264995 | SAT | 0.376652 | 0.37748101 |
| cosoco-mini 1.12 (complete) | 4267436 | SAT | 1.21552 | 1.21639 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260255 | SAT | 1.23066 | 1.2767299 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251916 | SAT | 1.2361 | 1.23756 |
| Naxos 1.1.0 (complete) | 4251917 | SAT | 1.81999 | 1.82002 |
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 x2 x8 x10 x11 x12 x13 x14 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] x1[46] x1[47] x1[48] x1[49] x1[50] x1[51] x1[52] x1[53] x1[54] x1[55] x1[56] x1[57] x3[0] x3[1] x4[0] x4[1] x4[2] x5[0] x5[1] x5[2] x5[3] x5[4] x5[5] x5[6] x5[7] x6[0] x6[1] x6[2] x6[3] x6[4] x6[5] x6[6] x6[7] x6[8] x6[9] x6[10] x6[11] x6[12] x6[13] x6[14] x6[15] x7[0] x7[1] x9[0] x9[1] x9[2] x9[3] </list> <values> 0 0 0 0 1 9 5 4 1 1 0 0 1 1 1 0 1 0 1 0 0 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 1 0 1 1 0 1 0 1 0 0 0 1 0 1 1 1 0 1 0 0 0 0 0 0 5 1 3 3 4 1 1 1 1 1 0 3 2 2 2 0 0 0 1 2 0 2 1 1 2 2 0 0 0 20 0 2 0 0 2 </values> </instantiation>