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

Result page for benchmark
CoveringArray/CoveringArray-elt-s1/
CoveringArray-elt-3-10-2-11.xml

Jump to solvers results

General information on the benchmark

NameCoveringArray/CoveringArray-elt-s1/
CoveringArray-elt-3-10-2-11.xml
MD5SUMc5b4e9c2e16defa9f5099964bd118207
Bench CategoryCSP (decision problem)
Best result obtained on this benchmark
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables2280
Number of constraints1091
Number of domains2
Minimum domain size8
Maximum domain size11
Distribution of domain sizes[{"size":8,"count":1320},{"size":11,"count":960}]
Minimum variable degree2
Maximum variable degree9
Distribution of variable degrees[{"degree":2,"count":960},{"degree":9,"count":1320}]
Minimum constraint arity8
Maximum constraint arity120
Distribution of constraint arities[{"arity":8,"count":120},{"arity":12,"count":960},{"arity":120,"count":11}]
Number of extensional constraints11
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":11},{"type":"allDifferent","count":120},{"type":"element","count":960}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.5-Hybrid (complete)4391543? (TO) 2400.01 2400.41
cosoco 2.0 (complete)4408683? (TO) 2400.02 2400.01
cosoco 2 (complete)4390143? (TO) 2400.05 2399.8
cosoco 2.0 (complete)4397423? (TO) 2400.05 2400.11
NACRE 1.0.5 (complete)4391743? (TO) 2400.06 2400.01
(reference) PicatSAT 2019-09-12 (complete)4407825? (TO) 2400.07 2400.02
miniBTD 19.06.16 (complete)4391943? (TO) 2400.1 2400.11

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: