| Name | CoveringArray/CoveringArray-elt-s1/ CoveringArray-elt-3-04-2-08.xml |
| MD5SUM | 17db91fb5ac5a139b323ef8c05694434 |
| 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.005628 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 44 |
| Number of domains | 1 |
| Minimum domain size | 8 |
| Maximum domain size | 8 |
| Distribution of domain sizes | [{"size":8,"count":64}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":2,"count":32},{"degree":9,"count":32}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":4,"count":8},{"arity":8,"count":4},{"arity":9,"count":32}] |
| Number of extensional constraints | 8 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":8},{"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.1 (2017-06-27) (complete) | 4252907 | SAT | 0.0051839999 | 0.107572 |
| cosoco-mini 1.12 (complete) | 4267337 | SAT | 0.0054210001 | 0.109918 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260156 | SAT | 0.0055419998 | 0.0589981 |
| miniBTD 2017-08-10 (complete) | 4264896 | SAT | 0.005628 | 0.0059449198 |
| Naxos 1.1.0 (complete) | 4252908 | ? (TO) | 2400.05 | 2400.2 |
| miniBTD 2017-06-30 (complete) | 4252906 | Wrong UNSAT | 0.0045699999 | 0.106576 |
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[1][0] v[1][1] v[1][2] v[1][3] v[1][4] v[1][5] v[1][6] v[1][7] 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[3][0] v[3][1] v[3][2] v[3][3] v[3][4] v[3][5] v[3][6] v[3][7] </list> <values>0 1 2 3 4 6 7 5 0 1 3 2 6 4 7 5 0 2 3 1 7 4 6 5 0 4 6 1 7 2 3 5 0 1 2 3 4 7 5 6 0 1 3 2 5 7 4 6 0 3 1 2 5 7 6 4 0 3 5 6 1 7 2 4 </values> </instantiation>