2018 XCSP3 competition: mini-solvers track: solvers results per benchmarks

Result page for benchmark
Langford/
LangfordBin-09_c18.xml

Jump to solvers results

General information on the benchmark

NameLangford/
LangfordBin-09_c18.xml
MD5SUMaf6539439e5a66b9d4cb5cb754e7ed18
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 benchmark0.557709
Satisfiable
(Un)Satisfiability was proved
Number of variables36
Number of constraints27
Number of domains2
Minimum domain size9
Maximum domain size18
Distribution of domain sizes[{"size":9,"count":18},{"size":18,"count":18}]
Minimum variable degree2
Maximum variable degree18
Distribution of variable degrees[{"degree":2,"count":18},{"degree":18,"count":18}]
Minimum constraint arity2
Maximum constraint arity19
Distribution of constraint arities[{"arity":2,"count":9},{"arity":19,"count":18}]
Number of extensional constraints0
Number of intensional constraints9
Distribution of constraint types[{"type":"intension","count":9},{"type":"element","count":18}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4299343UNSAT 0.557709 0.32734
The dodo solver 2018-04-29 (complete)4299345UNSAT 2.88119 1.403
MiniCPFever 2018-04-29 (complete)4299340UNSAT 6.08991 3.52143
GG's minicp 2018-04-29 (complete)4299339UNSAT 42.0914 39.3357
miniBTD_12 2018.07.27_12 (complete)4300871? 2520 2520.01
minimacht 2018.07.27 (complete)4300695? 2520.01 2519.71
NACRE 1.0.4 (complete)4299341? (TO) 2519.8 2520.01
miniBTD 2018.07.27_3 (complete)4301047? (TO) 2519.96 2520.01
slowpoke 2018-04-29 (incomplete)4299342? (TO) 2520.07 2461.14
cosoco 1.12 (complete)4299338? (TO) 2520.07 2519.9
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4299344Wrong Cert. 1.54989 0.659991

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: