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

Result page for benchmark
MagicHexagon/MagicHexagon-m1-s1/
MagicHexagon-04-0003.xml

Jump to solvers results

General information on the benchmark

NameMagicHexagon/MagicHexagon-m1-s1/
MagicHexagon-04-0003.xml
MD5SUMdd4ed178c47046d12ce38b3d0d17c272
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.555504
Satisfiable
(Un)Satisfiability was proved
Number of variables49
Number of constraints28
Number of domains1
Minimum domain size37
Maximum domain size37
Distribution of domain sizes[{"size":37,"count":37}]
Minimum variable degree0
Maximum variable degree9
Distribution of variable degrees[{"degree":0,"count":12},{"degree":4,"count":31},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}]
Minimum constraint arity2
Maximum constraint arity37
Distribution of constraint arities[{"arity":2,"count":6},{"arity":4,"count":6},{"arity":5,"count":6},{"arity":6,"count":6},{"arity":7,"count":3},{"arity":37,"count":1}]
Number of extensional constraints0
Number of intensional constraints6
Distribution of constraint types[{"type":"intension","count":6},{"type":"allDifferent","count":1},{"type":"sum","count":21}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.5-Hybrid (complete)4391371SAT 0.555504 0.555527
cosoco 2.0 (complete)4397251SAT 1.54357 1.54923
cosoco 2.0 (complete)4408511SAT 1.54567 1.55066
cosoco 2 (complete)4389971SAT 1.54628 1.55223
NACRE 1.0.5 (complete)4391571SAT 2.03937 2.04087
miniBTD 19.06.16 (complete)4391771SAT 3.16747 3.16835
(reference) PicatSAT 2019-09-12 (complete)4407730SAT 119.281 119.292

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