Name | QRandom/QRandom-mdd-7-25-5/ mdd-7-25-5-56-01.xml |
MD5SUM | 38fbb435e56fa73fec05cbb523a31b1b |
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 | 95.0485 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 25 |
Number of constraints | 56 |
Number of domains | 1 |
Minimum domain size | 5 |
Maximum domain size | 5 |
Distribution of domain sizes | [{"size":5,"count":25}] |
Minimum variable degree | 11 |
Maximum variable degree | 24 |
Distribution of variable degrees | [{"degree":11,"count":5},{"degree":12,"count":2},{"degree":13,"count":1},{"degree":14,"count":5},{"degree":15,"count":1},{"degree":16,"count":2},{"degree":17,"count":1},{"degree":18,"count":2},{"degree":20,"count":2},{"degree":21,"count":1},{"degree":22,"count":1},{"degree":23,"count":1},{"degree":24,"count":1}] |
Minimum constraint arity | 7 |
Maximum constraint arity | 7 |
Distribution of constraint arities | [{"arity":7,"count":56}] |
Number of extensional constraints | 56 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":56}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
miniBTD 19.06.16 (complete) | 4391909 | SAT | 95.0485 | 95.0756 |
(reference) PicatSAT 2019-09-12 (complete) | 4407612 | SAT | 864.608 | 864.59 |
NACRE 1.0.5-Hybrid (complete) | 4391509 | SAT | 1845.57 | 1846 |
cosoco 2 (complete) | 4390109 | SAT | 1913.61 | 1913.74 |
cosoco 2.0 (complete) | 4397389 | SAT | 1930.23 | 1930.32 |
cosoco 2.0 (complete) | 4408649 | SAT | 2057.74 | 2057.62 |
NACRE 1.0.5 (complete) | 4391709 | ? (TO) | 2400.11 | 2399.9 |
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] </list> <values> 0 3 4 1 1 2 1 1 0 0 0 4 1 2 1 1 0 0 1 4 4 0 1 3 1 </values> </instantiation>