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

Result page for benchmark
Langford/Langford-m1-k4/
Langford-4-16.xml

Jump to solvers results

General information on the benchmark

NameLangford/Langford-m1-k4/
Langford-4-16.xml
MD5SUMa550bb6a39ca50ab9210b9c0283e2640
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 benchmark84.7029
Satisfiable
(Un)Satisfiability was proved
Number of variables64
Number of constraints49
Number of domains1
Minimum domain size64
Maximum domain size64
Distribution of domain sizes[{"size":64,"count":64}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":32},{"degree":3,"count":32}]
Minimum constraint arity2
Maximum constraint arity64
Distribution of constraint arities[{"arity":2,"count":48},{"arity":64,"count":1}]
Number of extensional constraints0
Number of intensional constraints48
Distribution of constraint types[{"type":"intension","count":48},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407591UNSAT 84.7029 84.7139
NACRE 1.0.5 (complete)4391604UNSAT 1188.5 1188.49
cosoco 2.0 (complete)4397284UNSAT 1492.98 1493.04
cosoco 2 (complete)4390004UNSAT 1528.47 1528.65
cosoco 2.0 (complete)4408544UNSAT 1714.87 1714.72
miniBTD 19.06.16 (complete)4391804? 2400 2399.78
NACRE 1.0.5-Hybrid (complete)4391404? (TO) 2400.03 2400.4

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: