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

Result page for benchmark
Random/Random-RB-3-24-24f/
rand-3-24-24-76-632f-04.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-RB-3-24-24f/
rand-3-24-24-76-632f-04.xml
MD5SUM8affd435144207d453aaf856f2d63137
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark74.7499
Satisfiable
(Un)Satisfiability was proved
Number of variables24
Number of constraints76
Number of domains1
Minimum domain size24
Maximum domain size24
Distribution of domain sizes[{"size":24,"count":24}]
Minimum variable degree2
Maximum variable degree20
Distribution of variable degrees[{"degree":2,"count":1},{"degree":4,"count":1},{"degree":5,"count":1},{"degree":6,"count":1},{"degree":7,"count":7},{"degree":8,"count":2},{"degree":9,"count":2},{"degree":10,"count":1},{"degree":12,"count":1},{"degree":13,"count":2},{"degree":14,"count":1},{"degree":15,"count":2},{"degree":16,"count":1},{"degree":20,"count":1}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":76}]
Number of extensional constraints76
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":76}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407560SAT 74.7499 74.7896
miniBTD 19.06.16 (complete)4391788SAT 112.408 112.42
cosoco 2 (complete)4389988SAT 1063.69 1063.61
cosoco 2.0 (complete)4408528SAT 1069.73 1069.59
cosoco 2.0 (complete)4397268SAT 1072.32 1072.38
NACRE 1.0.5-Hybrid (complete)4391388SAT 1685.52 1685.8
NACRE 1.0.5 (complete)4391588? (TO) 2400.07 2401.9

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:
<instantiation> <list> x[]  </list> <values> 0 4 15 22 15 9 7 22 6 19 20 20 8 8 2 12 13 12 11 12 11 17 22 19   </values> </instantiation>