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

Result page for benchmark
MagicSquare/
MagicSquare-10-sum_c18.xml

Jump to solvers results

General information on the benchmark

NameMagicSquare/
MagicSquare-10-sum_c18.xml
MD5SUM9b613e70bdeb54a559e13aaa64a0062e
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 benchmark29.5201
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints23
Number of domains1
Minimum domain size100
Maximum domain size100
Distribution of domain sizes[{"size":100,"count":100}]
Minimum variable degree3
Maximum variable degree4
Distribution of variable degrees[{"degree":3,"count":80},{"degree":4,"count":20}]
Minimum constraint arity10
Maximum constraint arity100
Distribution of constraint arities[{"arity":10,"count":22},{"arity":100,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"allDifferent","count":1},{"type":"sum","count":22}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.4 (complete)4299962SAT 29.5201 29.5217
cosoco 1.12 (complete)4299959? (TO) 2519.83 2520.01
minimacht 2018.07.27 (complete)4300801? (TO) 2519.93 2520.01
The dodo solver 2018-04-29 (complete)4299966? (TO) 2520.02 2505.61
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4299964? (TO) 2520.03 2515.31
slowpoke 2018-04-29 (incomplete)4299963? (TO) 2520.05 2505.61
MiniCPFever 2018-04-29 (complete)4299961? (TO) 2520.05 2492.71
miniBTD 2018.07.27_3 (complete)4301153? (TO) 2520.06 2520.01
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4299965? (TO) 2520.07 2493.52
miniBTD_12 2018.07.27_12 (complete)4300977? (TO) 2520.08 2519.9
GG's minicp 2018-04-29 (complete)4299960? (TO) 2520.12 2485.81

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[0][7] x[0][8] x[0][9] x[1][0] x[1][1] x[1][2] x[1][3]
x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[3][0]
x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7]
x[4][8] x[4][9] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[5][9] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4]
x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[8][0] x[8][1]
x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] x[8][9] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8]
x[9][9] </list> <values> 87 63 84 25 24 18 93 26 28 57 33 88 85 32 29 17 95 31 58 37 66 16 7 64 65 41 96 15 67 68 45 59 82 40 46 20 94 30 53
36 44 60 81 34 89 55 13 39 42 48 51 61 62 43 38 90 12 49 52 47 71 73 11 72 14 69 1 50 70 74 23 54 86 35 22 19 92 91 27 56 76 21 5 77 80 79 6
75 8 78 9 10 2 83 98 97 3 99 100 4 </values> </instantiation>