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

Result page for benchmark
Langford/Langford-m2-s1/
LangfordBin-18.xml

Jump to solvers results

General information on the benchmark

NameLangford/Langford-m2-s1/
LangfordBin-18.xml
MD5SUM2eb0e4a14086f4f78b25f1ea6eeffb68
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 variables72
Number of constraints54
Number of domains2
Minimum domain size18
Maximum domain size36
Distribution of domain sizes[{"size":18,"count":36},{"size":36,"count":36}]
Minimum variable degree2
Maximum variable degree36
Distribution of variable degrees[{"degree":2,"count":36},{"degree":36,"count":36}]
Minimum constraint arity2
Maximum constraint arity37
Distribution of constraint arities[{"arity":2,"count":18},{"arity":37,"count":36}]
Number of extensional constraints0
Number of intensional constraints18
Distribution of constraint types[{"type":"intension","count":18},{"type":"element","count":36}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-06-30 (complete)4252195? 2400.01 2399.83
miniBTD 2017-08-10 (complete)4264854? 2400.01 2399.8999
cosoco-mini 1.1 (2017-06-27) (complete)4252196? (TO) 2400.02 2400.31
cosoco-mini 1.1 (2017-07-29) (complete)4260114? (TO) 2400.02 2399.8999
Naxos 1.1.0 (complete)4252197? (TO) 2400.05 2400
cosoco-mini 1.12 (complete)4267295? (TO) 2400.0901 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: