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

Result page for benchmark
QRandom/QRandom-bdd-18-21-2/
bdd-18-21-2-133-78-15.xml

Jump to solvers results

General information on the benchmark

NameQRandom/QRandom-bdd-18-21-2/
bdd-18-21-2-133-78-15.xml
MD5SUMaa6334ae19a32d8ab21efe8cea133e1a
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 benchmark8.39409
Satisfiable
(Un)Satisfiability was proved
Number of variables21
Number of constraints133
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":21}]
Minimum variable degree109
Maximum variable degree120
Distribution of variable degrees[{"degree":109,"count":4},{"degree":110,"count":1},{"degree":111,"count":1},{"degree":112,"count":2},{"degree":113,"count":2},{"degree":114,"count":2},{"degree":115,"count":1},{"degree":116,"count":1},{"degree":117,"count":1},{"degree":118,"count":4},{"degree":119,"count":1},{"degree":120,"count":1}]
Minimum constraint arity18
Maximum constraint arity18
Distribution of constraint arities[{"arity":18,"count":133}]
Number of extensional constraints133
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":133}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 19.06.16 (complete)4391889UNSAT 8.39409 8.40005
NACRE 1.0.5-Hybrid (complete)4391489UNSAT 107.705 107.721
cosoco 2.0 (complete)4397369UNSAT 128.152 128.176
cosoco 2.0 (complete)4408629UNSAT 132.053 132.095
cosoco 2 (complete)4390089UNSAT 132.877 132.906
NACRE 1.0.5 (complete)4391689UNSAT 532.053 532.187
(reference) PicatSAT 2019-09-12 (complete)4407602? (TO) 2400.07 2400.12

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: