| Name | CoveringArray/CoveringArray-elt-s1/ CoveringArray-elt-3-04-2-09.xml |
| MD5SUM | 2324a6ffb08ebf271119fd35f5319f57 |
| 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.0057819998 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 68 |
| Number of constraints | 45 |
| Number of domains | 2 |
| Minimum domain size | 8 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":8,"count":36},{"size":9,"count":32}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":2,"count":32},{"degree":9,"count":36}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":4,"count":9},{"arity":8,"count":4},{"arity":10,"count":32}] |
| Number of extensional constraints | 9 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":9},{"type":"allDifferent","count":4},{"type":"element","count":32}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267338 | SAT | 0.0048949998 | 0.080279 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252916 | SAT | 0.0050920001 | 0.096941002 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260157 | SAT | 0.0053730002 | 0.052979998 |
| miniBTD 2017-08-10 (complete) | 4264897 | SAT | 0.0057819998 | 0.0063899402 |
| miniBTD 2017-06-30 (complete) | 4252915 | SAT | 0.0062870001 | 0.108191 |
| Naxos 1.1.0 (complete) | 4252917 | ? (TO) | 2400.03 | 2400.21 |
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>p[0][0] p[0][1] p[0][2] p[0][3] p[0][4] p[0][5] p[0][6] p[0][7] p[1][0] p[1][1] p[1][2] p[1][3] p[1][4] p[1][5] p[1][6] p[1][7] p[2][0] p[2][1] p[2][2] p[2][3] p[2][4] p[2][5] p[2][6] p[2][7] p[3][0] p[3][1] p[3][2] p[3][3] p[3][4] p[3][5] p[3][6] p[3][7] v[0][0] v[0][1] v[0][2] v[0][3] v[0][4] v[0][5] v[0][6] v[0][7] v[0][8] v[1][0] v[1][1] v[1][2] v[1][3] v[1][4] v[1][5] v[1][6] v[1][7] v[1][8] v[2][0] v[2][1] v[2][2] v[2][3] v[2][4] v[2][5] v[2][6] v[2][7] v[2][8] v[3][0] v[3][1] v[3][2] v[3][3] v[3][4] v[3][5] v[3][6] v[3][7] v[3][8] </list> <values>0 1 2 3 4 5 7 6 0 8 2 3 4 5 6 7 0 8 1 3 4 7 6 5 0 8 1 5 2 7 6 3 0 1 2 3 4 5 7 6 0 0 0 2 3 4 5 6 7 1 0 2 0 3 4 7 6 5 1 0 2 4 7 0 3 6 5 1 </values> </instantiation>