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

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

Jump to solvers results

General information on the benchmark

NameLangford/Langford-m2-s1/
LangfordBin-19.xml
MD5SUM13382dc3b02e119e78eeacc23771b1ff
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 variables76
Number of constraints57
Number of domains2
Minimum domain size19
Maximum domain size38
Distribution of domain sizes[{"size":19,"count":38},{"size":38,"count":38}]
Minimum variable degree2
Maximum variable degree38
Distribution of variable degrees[{"degree":2,"count":38},{"degree":38,"count":38}]
Minimum constraint arity2
Maximum constraint arity39
Distribution of constraint arities[{"arity":2,"count":19},{"arity":39,"count":38}]
Number of extensional constraints0
Number of intensional constraints19
Distribution of constraint types[{"type":"intension","count":19},{"type":"element","count":38}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-06-30 (complete)4252183? 2400 2399.79
miniBTD 2017-08-10 (complete)4264855? 2400.01 2400.0601
cosoco-mini 1.12 (complete)4267296? (TO) 2400.02 2399.8999
cosoco-mini 1.1 (2017-07-29) (complete)4260115? (TO) 2400.0601 2400.1001
cosoco-mini 1.1 (2017-06-27) (complete)4252184? (TO) 2400.07 2400.31
Naxos 1.1.0 (complete)4252185? (TO) 2400.1 2400

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: