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

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

Jump to solvers results

General information on the benchmark

NameLangford/Langford-m2-s1/
LangfordBin-24.xml
MD5SUMb01688073e480c624588c966ee77ed3a
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 benchmark5.86223
Satisfiable
(Un)Satisfiability was proved
Number of variables96
Number of constraints72
Number of domains2
Minimum domain size24
Maximum domain size48
Distribution of domain sizes[{"size":24,"count":48},{"size":48,"count":48}]
Minimum variable degree2
Maximum variable degree48
Distribution of variable degrees[{"degree":2,"count":48},{"degree":48,"count":48}]
Minimum constraint arity2
Maximum constraint arity49
Distribution of constraint arities[{"arity":2,"count":24},{"arity":49,"count":48}]
Number of extensional constraints0
Number of intensional constraints24
Distribution of constraint types[{"type":"intension","count":24},{"type":"element","count":48}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407593SAT 5.86223 5.86302
miniBTD 19.06.16 (complete)4391848? 2400.01 2400.25
cosoco 2.0 (complete)4397328? (TO) 2400.01 2399.8
cosoco 2.0 (complete)4408588? (TO) 2400.01 2399.7
NACRE 1.0.5 (complete)4391648? (TO) 2400.06 2400.01
NACRE 1.0.5-Hybrid (complete)4391448? (TO) 2400.07 2400.21
cosoco 2 (complete)4390048? (TO) 2400.07 2400.3

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> p[] v[]  </list> <values> 38 36 47 44 14 10 5 0 37 31 39 32 29 21 12 3 17 7 13 2 34 22 46 33 15 1 23 8 40 24 28 11 27
9 35 16 45 25 41 20 26 4 42 19 30 6 43 18  4 13 10 8 21 4 23 9 14 17 3 16 8 10 3 13 18 9 24 22 20 7 11 14 15 19 21 17 16 7 23 5 6 12 11 18 1
5 1 6 15 20 22 24 2 19 12 2   </values> </instantiation>