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

Result page for benchmark
CoveringArray/CoveringArray-elt-s1/
CoveringArray-elt-3-06-2-12.xml

Jump to solvers results

General information on the benchmark

NameCoveringArray/CoveringArray-elt-s1/
CoveringArray-elt-3-06-2-12.xml
MD5SUM6a2428e0ea9e56c54fb162011650005e
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 variables400
Number of constraints192
Number of domains2
Minimum domain size8
Maximum domain size12
Distribution of domain sizes[{"size":8,"count":240},{"size":12,"count":160}]
Minimum variable degree2
Maximum variable degree9
Distribution of variable degrees[{"degree":2,"count":160},{"degree":9,"count":240}]
Minimum constraint arity8
Maximum constraint arity20
Distribution of constraint arities[{"arity":8,"count":20},{"arity":13,"count":160},{"arity":20,"count":12}]
Number of extensional constraints12
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":12},{"type":"allDifferent","count":20},{"type":"element","count":160}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-06-30 (complete)4252918? 2400.01 2400.0701
miniBTD 2017-08-10 (complete)4264898? 2400.01 2399.97
Naxos 1.1.0 (complete)4252920? (TO) 2400.05 2400.21
cosoco-mini 1.1 (2017-07-29) (complete)4260158? (TO) 2400.05 2400.3101
cosoco-mini 1.1 (2017-06-27) (complete)4252919? (TO) 2400.0601 2399.8999
cosoco-mini 1.12 (complete)4267339? (TO) 2400.0601 2400.1101

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: