| Name | RenaultMod/RenaultMod-m1-s1/ RenaultMod-09.xml |
| MD5SUM | f0d0955751f72d87c4f1a675afbf7856 |
| 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.3736 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 111 |
| Number of constraints | 258 |
| Number of domains | 1 |
| Minimum domain size | 42 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":42,"count":111}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 81 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":3,"count":14},{"degree":4,"count":21},{"degree":5,"count":8},{"degree":6,"count":5},{"degree":7,"count":3},{"degree":11,"count":2},{"degree":20,"count":1},{"degree":32,"count":1},{"degree":39,"count":1},{"degree":56,"count":2},{"degree":59,"count":1},{"degree":73,"count":1},{"degree":81,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":1,"count":111},{"arity":2,"count":42},{"arity":3,"count":18},{"arity":4,"count":19},{"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 | 147 |
| Number of intensional constraints | 111 |
| Distribution of constraint types | [{"type":"extension","count":147},{"type":"intension","count":111}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264999 | SAT | 0.70077401 | 0.70143098 |
| miniBTD 2017-06-30 (complete) | 4253846 | SAT | 0.704406 | 0.705614 |
| cosoco-mini 1.12 (complete) | 4267440 | SAT | 1.3736 | 1.3741699 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260259 | SAT | 1.38946 | 1.46787 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253847 | SAT | 1.4042 | 1.40494 |
| Naxos 1.1.0 (complete) | 4253848 | SAT | 507.484 | 507.45 |
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> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[110] </list> <values> 0 1 6 9 0 0 1 3 1 0 1 0 0 2 1 0 0 0 1 2 2 1 1 1 10 0 3 0 0 0 1 0 0 0 0 1 2 0 1 2 0 0 0 1 2 0 1 0 0 0 1 1 1 1 1 8 1 1 0 0 0 1 2 0 0 2 2 0 1 2 0 4 2 2 3 0 0 0 0 1 4 0 2 0 0 0 1 0 0 0 0 0 0 0 0 3 2 4 0 0 0 1 5 2 3 7 1 9 9 4 6 </values> </instantiation>