Name | QRandom/ QRandom-bdd-15-21-2/bdd-15-21-2-2713-79-16.xml |
MD5SUM | 2a6706ebf1a04474da396dd8277f6c47 |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 193.246 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 21 |
Number of constraints | 2713 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":21}] |
Minimum variable degree | 1854 |
Maximum variable degree | 1979 |
Distribution of variable degrees | [{"degree":1854,"count":1},{"degree":1899,"count":1},{"degree":1906,"count":1},{"degree":1917,"count":1},{"degree":1920,"count":1},{"degree":1924,"count":2},{"degree":1928,"count":1},{"degree":1938,"count":1},{"degree":1941,"count":1},{"degree":1943,"count":1},{"degree":1945,"count":1},{"degree":1948,"count":1},{"degree":1950,"count":1},{"degree":1955,"count":1},{"degree":1961,"count":2},{"degree":1962,"count":2},{"degree":1978,"count":1},{"degree":1979,"count":1}] |
Minimum constraint arity | 15 |
Maximum constraint arity | 15 |
Distribution of constraint arities | [{"arity":15,"count":2713}] |
Number of extensional constraints | 2713 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":2713}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
cosoco-mini 1.1 (2017-06-27) (complete) | 4252326 | UNSAT | 192.837 | 192.847 |
cosoco-mini 1.12 (complete) | 4267391 | UNSAT | 193.246 | 193.252 |
cosoco-mini 1.1 (2017-07-29) (complete) | 4260210 | UNSAT | 193.57401 | 193.69501 |
miniBTD 2017-08-10 (complete) | 4264950 | UNSAT | 751.245 | 751.39001 |
miniBTD 2017-06-30 (complete) | 4252325 | UNSAT | 866.059 | 866.238 |
Naxos 1.1.0 (complete) | 4252327 | UNSAT | 1208.25 | 1208.23 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: