| Name | Renault/Renault-m1-s1/ Renault-megane-pos.xml |
| MD5SUM | 21b1bfe08dea0128787163580c257a28 |
| 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.22465 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 99 |
| Number of constraints | 113 |
| Number of domains | 15 |
| Minimum domain size | 1 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":1,"count":6},{"size":2,"count":54},{"size":3,"count":15},{"size":4,"count":3},{"size":5,"count":9},{"size":6,"count":2},{"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 | 1 |
| Maximum variable degree | 80 |
| Distribution of variable degrees | [{"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) | 4251906 | SAT | 0.372299 | 0.372864 |
| miniBTD 2017-08-10 (complete) | 4264994 | SAT | 0.374513 | 0.37525401 |
| cosoco-mini 1.12 (complete) | 4267435 | SAT | 1.22465 | 1.22533 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260254 | SAT | 1.22992 | 1.3213 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251907 | SAT | 1.23928 | 1.24001 |
| Naxos 1.1.0 (complete) | 4251908 | SAT | 1.59763 | 1.59785 |
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 x4 x9 x10 x11 x12 x14 x1[0] x1[1] x1[2] x1[3] x1[4] x1[5] x1[6] x1[7] x1[8] 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] x5[0] x5[1] x5[2] x5[3] x5[4] x5[5] 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] x8[0] x8[1] x8[2] x13[0] x13[1] </list> <values> 0 20 0 1 9 5 4 0 1 1 1 1 1 4 0 3 2 0 0 1 1 0 1 0 0 1 1 0 1 0 1 0 0 1 1 1 0 0 1 0 0 0 0 1 0 1 1 1 1 1 1 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 3 3 2 2 0 0 0 1 2 0 1 1 2 2 0 0 1 0 0 2 1 5 </values> </instantiation>