| Name | Random/Random-RB-2-30-15f/ rand-2-30-15-306-230f-09.xml |
| MD5SUM | 23c17749bea612774e78a3a072e2ad10 |
| 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.28650799 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 227 |
| Number of domains | 1 |
| Minimum domain size | 15 |
| Maximum domain size | 15 |
| Distribution of domain sizes | [{"size":15,"count":30}] |
| Minimum variable degree | 11 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":11,"count":2},{"degree":12,"count":5},{"degree":13,"count":2},{"degree":14,"count":4},{"degree":15,"count":4},{"degree":16,"count":3},{"degree":17,"count":2},{"degree":18,"count":5},{"degree":19,"count":2},{"degree":20,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":227}] |
| Number of extensional constraints | 227 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":227}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251801 | SAT | 0.283422 | 0.284964 |
| cosoco-mini 1.12 (complete) | 4267426 | SAT | 0.28650799 | 0.28819299 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260245 | SAT | 0.28800699 | 0.35624 |
| miniBTD 2017-06-30 (complete) | 4251800 | SAT | 0.432999 | 0.433811 |
| miniBTD 2017-08-10 (complete) | 4264985 | SAT | 0.43371099 | 0.486669 |
| Naxos 1.1.0 (complete) | 4251802 | SAT | 4.05949 | 4.06052 |
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] </list> <values>4 1 13 10 14 12 1 6 13 13 11 1 2 13 5 1 11 3 14 9 1 10 11 6 11 9 12 0 3 7 </values> </instantiation>