| Name | Random/Random-D-t020/ rand-2-40-11-414-020-35.xml |
| MD5SUM | a2d920503104dc914fda533712712f08 |
| 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.88864 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 414 |
| Number of domains | 1 |
| Minimum domain size | 11 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":11,"count":40}] |
| Minimum variable degree | 16 |
| Maximum variable degree | 26 |
| Distribution of variable degrees | [{"degree":16,"count":2},{"degree":17,"count":5},{"degree":18,"count":2},{"degree":19,"count":3},{"degree":20,"count":3},{"degree":21,"count":9},{"degree":22,"count":4},{"degree":23,"count":9},{"degree":24,"count":2},{"degree":26,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":414}] |
| Number of extensional constraints | 414 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":414}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Naxos 1.1.0 (complete) | 4251805 | SAT | 1.88864 | 1.88986 |
| miniBTD 2017-08-10 (complete) | 4264982 | SAT | 6.8393302 | 6.91749 |
| miniBTD 2017-06-30 (complete) | 4251803 | SAT | 6.85178 | 6.85295 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260242 | SAT | 12.2955 | 12.3538 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251804 | SAT | 12.3566 | 12.3561 |
| cosoco-mini 1.12 (complete) | 4267423 | SAT | 12.4293 | 12.4295 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <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] </list> <values> 0 1 4 10 0 10 8 4 1 5 10 4 8 4 5 10 3 2 7 2 8 0 4 1 0 0 0 1 7 1 8 2 0 7 8 4 2 3 8 5 </values> </instantiation>