| Name | QRandom/ QRandom-geometric-rw/geometric-50-20-d4-75-54.xml |
| MD5SUM | a4dbf7a89b77d3d2fc660abfcd1a3804 |
| 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.119554 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 412 |
| Number of domains | 1 |
| Minimum domain size | 20 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":20,"count":50}] |
| Minimum variable degree | 7 |
| Maximum variable degree | 25 |
| Distribution of variable degrees | [{"degree":7,"count":1},{"degree":8,"count":1},{"degree":9,"count":1},{"degree":11,"count":4},{"degree":12,"count":1},{"degree":13,"count":2},{"degree":14,"count":10},{"degree":15,"count":2},{"degree":16,"count":5},{"degree":17,"count":3},{"degree":18,"count":3},{"degree":19,"count":4},{"degree":20,"count":3},{"degree":21,"count":3},{"degree":22,"count":1},{"degree":23,"count":3},{"degree":24,"count":2},{"degree":25,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":412}] |
| Number of extensional constraints | 412 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":412}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-06-30 (complete) | 4252367 | SAT | 0.033456 | 0.0342791 |
| miniBTD 2017-08-10 (complete) | 4264964 | SAT | 0.033891 | 0.034598101 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252368 | SAT | 0.118816 | 0.119704 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260224 | SAT | 0.118845 | 0.226009 |
| cosoco-mini 1.12 (complete) | 4267405 | SAT | 0.119554 | 0.119568 |
| Naxos 1.1.0 (complete) | 4252369 | SAT | 0.152606 | 0.153547 |
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] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] </list> <values> 19 1 5 1 4 20 8 3 1 19 1 16 3 17 10 1 2 15 6 6 7 7 11 5 7 18 13 1 3 11 2 6 10 8 11 14 9 2 16 4 6 2 9 5 10 16 16 5 16 4 </values> </instantiation>