| Name | QRandom/ QRandom-geometric-rw/geometric-50-20-d4-75-03.xml |
| MD5SUM | 0bd583d6f4358c2dd06e2f7c5666e2c0 |
| 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.113607 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 394 |
| Number of domains | 1 |
| Minimum domain size | 20 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":20,"count":50}] |
| Minimum variable degree | 6 |
| Maximum variable degree | 27 |
| Distribution of variable degrees | [{"degree":6,"count":2},{"degree":7,"count":1},{"degree":8,"count":1},{"degree":10,"count":5},{"degree":11,"count":2},{"degree":12,"count":3},{"degree":13,"count":3},{"degree":14,"count":4},{"degree":15,"count":1},{"degree":16,"count":5},{"degree":17,"count":6},{"degree":18,"count":5},{"degree":19,"count":3},{"degree":21,"count":2},{"degree":22,"count":2},{"degree":24,"count":1},{"degree":25,"count":1},{"degree":26,"count":2},{"degree":27,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":394}] |
| Number of extensional constraints | 394 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":394}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| miniBTD 2017-08-10 (complete) | 4264961 | SAT | 0.037581 | 0.038171899 |
| miniBTD 2017-06-30 (complete) | 4252358 | SAT | 0.038506 | 0.052754 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4252359 | SAT | 0.112721 | 0.114354 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260221 | SAT | 0.113438 | 0.19171 |
| cosoco-mini 1.12 (complete) | 4267402 | SAT | 0.113607 | 0.114331 |
| Naxos 1.1.0 (complete) | 4252360 | SAT | 0.136338 | 0.137359 |
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> 3 11 20 2 3 4 15 1 1 19 16 1 1 13 9 12 5 20 15 15 12 1 3 2 18 15 2 3 18 17 3 9 17 3 10 2 19 3 19 4 10 7 1 5 2 1 5 4 3 18 </values> </instantiation>