| Name | Random/Random-D-t050/ rand-2-40-25-180-050-28.xml |
| MD5SUM | 560bf5e5a0850b7fa95b0714462f69a3 |
| 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.87022 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 180 |
| Number of domains | 1 |
| Minimum domain size | 25 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":25,"count":40}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 15 |
| Distribution of variable degrees | [{"degree":4,"count":1},{"degree":5,"count":3},{"degree":6,"count":3},{"degree":7,"count":10},{"degree":8,"count":2},{"degree":9,"count":3},{"degree":10,"count":4},{"degree":11,"count":4},{"degree":12,"count":7},{"degree":13,"count":1},{"degree":14,"count":1},{"degree":15,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":180}] |
| Number of extensional constraints | 180 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":180}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| cosoco 2.0 (complete) | 4397248 | SAT | 1.87022 | 1.87179 |
| cosoco 2 (complete) | 4389968 | SAT | 1.8798 | 1.8819 |
| cosoco 2.0 (complete) | 4408508 | SAT | 1.88224 | 1.88513 |
| NACRE 1.0.5 (complete) | 4391568 | SAT | 2.62304 | 2.62333 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407563 | SAT | 11.5937 | 11.5952 |
| NACRE 1.0.5-Hybrid (complete) | 4391368 | SAT | 12.8367 | 12.8494 |
| miniBTD 19.06.16 (complete) | 4391768 | SAT | 36.3013 | 36.3034 |
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] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] </list> <values>20 17 3 13 22 13 19 21 16 24 2 18 24 23 9 14 17 9 11 2 8 6 20 23 11 17 20 9 14 16 7 15 6 10 19 2 9 4 3 22 </values> </instantiation>