| Name | csp/primes-10/ normalized-primes-10-40-3-1.xml |
| MD5SUM | 4d0a352e6db252e31dbc9ee4f2cdc652 |
| Bench Category | N-ARY-INT (n-ary constraints in intension) |
| Best result obtained on this benchmark | SAT |
| Best CPU time to get the best result obtained on this benchmark | 0.021995 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 40 |
| Maximum constraint arity | 4 |
| Maximum domain size | 28 |
| Number of constraints which are defined in extension | 0 |
| Number of constraints which are defined in intension | 40 |
| Global constraints used (with number of constraints) |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
Solution found:2 18 19 13 7 13 17 12 2 2 5 2 2 27 7 17 16 17 5 17 2 23 23 2 5 2 5 2 19 13 29 5 2 23 29 2 2 17 20 3 2 2 3 29 4 19 2 11 13 2 7 17 13 2 2 7 2 2 17 3 2 13 2 2 2 13 2 29 7 19 2 13 2 13 11 19 3 11 7 2 9 23 17 23 23 2 7 3 2 29 5 2 17 23 2 2 17 2 11 29