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

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

Jump to solvers results

General information on the benchmark

NameLangford/
LangfordBin-08_c18.xml
MD5SUM6540e056641e8d5f1a9996bec92d89db
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.005749
Satisfiable
(Un)Satisfiability was proved
Number of variables32
Number of constraints24
Number of domains2
Minimum domain size8
Maximum domain size16
Distribution of domain sizes[{"size":8,"count":16},{"size":16,"count":16}]
Minimum variable degree2
Maximum variable degree16
Distribution of variable degrees[{"degree":2,"count":16},{"degree":16,"count":16}]
Minimum constraint arity2
Maximum constraint arity17
Distribution of constraint arities[{"arity":2,"count":8},{"arity":17,"count":16}]
Number of extensional constraints0
Number of intensional constraints8
Distribution of constraint types[{"type":"intension","count":8},{"type":"element","count":16}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.4 (complete)4299293SAT 0.005749 0.00586505
cosoco 1.12 (complete)4299290SAT 0.00847 0.00919296
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4299296SAT 0.608587 0.335878
GG's minicp 2018-04-29 (complete)4299291SAT 0.618021 0.349142
MiniCPFever 2018-04-29 (complete)4299292SAT 0.658621 0.380579
slowpoke 2018-04-29 (incomplete)4299294SAT 0.70059 0.375409
miniBTD_12 2018.07.27_12 (complete)4300870SAT 2.58914 2.59038
minimacht 2018.07.27 (complete)4300694SAT 2.94925 2.95059
miniBTD 2018.07.27_3 (complete)4301046SAT 3.32349 3.32448
The dodo solver 2018-04-29 (complete)4299297SAT (TO) 2520.1 2512.12
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4299295Wrong UNSAT 0.548832 0.32986

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:
<instantiation> <list> v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] v[15] p[0] p[1] p[2] p[3] p[4] p[5]
p[6] p[7] p[8] p[9] p[10] p[11] p[12] p[13] p[14] p[15] </list> <values> 8 2 7 3 2 6 4 3 5 8 7 4 6 1 5 1 15 13 4 1 7 3 11 6 14 8 12 5 10 2 9
0 </values> </instantiation>