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

Result page for benchmark
MagicSquare/MagicSquare-table-s1/
MagicSquare-5-table.xml

Jump to solvers results

General information on the benchmark

NameMagicSquare/MagicSquare-table-s1/
MagicSquare-5-table.xml
MD5SUM61ed6ce3ae3f811d4d1b54502d982bfc
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 benchmark19.9119
Satisfiable
(Un)Satisfiability was proved
Number of variables25
Number of constraints13
Number of domains1
Minimum domain size25
Maximum domain size25
Distribution of domain sizes[{"size":25,"count":25}]
Minimum variable degree3
Maximum variable degree5
Distribution of variable degrees[{"degree":3,"count":16},{"degree":4,"count":8},{"degree":5,"count":1}]
Minimum constraint arity5
Maximum constraint arity25
Distribution of constraint arities[{"arity":5,"count":12},{"arity":25,"count":1}]
Number of extensional constraints12
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":12},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.1 (2017-07-29) (complete)4260145SAT 2.96662 3.0590999
cosoco-mini 1.12 (complete)4267326SAT 2.97367 2.97455
cosoco-mini 1.1 (2017-06-27) (complete)4253057SAT 2.98457 2.98584
miniBTD 2017-08-10 (complete)4264885SAT 19.9119 19.913099
miniBTD 2017-06-30 (complete)4253056SAT 20.2779 20.2799
Naxos 1.1.0 (complete)4253058SAT 41.62 41.6215

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 type='solution'> <list>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1]
x[2][2] x[2][3] x[2][4] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] </list> <values>11 4 22 8 20 16 10
15 18 6 19 14 2 21 9 7 13 23 17 5 12 24 3 1 25 </values> </instantiation>