2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
QRandom/QRandom-mdd-7-25-5-p7/
mdd-7-25-5-ps05-psh07-3.xml

Jump to solvers results

General information on the benchmark

NameQRandom/QRandom-mdd-7-25-5-p7/
mdd-7-25-5-ps05-psh07-3.xml
MD5SUM740fe7811b49d7235b98ec4fc0ed8229
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark56.0776
Satisfiable
(Un)Satisfiability was proved
Number of variables25
Number of constraints58
Number of domains1
Minimum domain size5
Maximum domain size5
Distribution of domain sizes[{"size":5,"count":25}]
Minimum variable degree8
Maximum variable degree23
Distribution of variable degrees[{"degree":8,"count":1},{"degree":11,"count":1},{"degree":12,"count":1},{"degree":13,"count":3},{"degree":14,"count":1},{"degree":15,"count":4},{"degree":16,"count":1},{"degree":17,"count":4},{"degree":18,"count":2},{"degree":19,"count":3},{"degree":20,"count":1},{"degree":21,"count":2},{"degree":23,"count":1}]
Minimum constraint arity7
Maximum constraint arity7
Distribution of constraint arities[{"arity":7,"count":58}]
Number of extensional constraints58
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":58}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 19.06.16 (complete)4391830UNSAT 56.0776 56.0934
(reference) PicatSAT 2019-09-12 (complete)4407596UNSAT 1066.75 1066.8
NACRE 1.0.5-Hybrid (complete)4391430UNSAT 1754.39 1754.54
cosoco 2 (complete)4390030? (TO) 2400.06 2399.9
cosoco 2.0 (complete)4408570? (TO) 2400.07 2400.2
cosoco 2.0 (complete)4397310? (TO) 2400.09 2400.11
NACRE 1.0.5 (complete)4391630? (TO) 2400.1 2400.01

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function:
Solution found: