2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
MagicHexagon/MagicHexagon-m1-s1/
MagicHexagon-06-0021.xml

Jump to solvers results

General information on the benchmark

NameMagicHexagon/MagicHexagon-m1-s1/
MagicHexagon-06-0021.xml
MD5SUM5b025fdb2af725278bd5449402283f43
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 benchmark50.8929
Satisfiable
(Un)Satisfiability was proved
Number of variables121
Number of constraints40
Number of domains1
Minimum domain size91
Maximum domain size91
Distribution of domain sizes[{"size":91,"count":91}]
Minimum variable degree0
Maximum variable degree9
Distribution of variable degrees[{"degree":0,"count":30},{"degree":4,"count":85},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}]
Minimum constraint arity2
Maximum constraint arity91
Distribution of constraint arities[{"arity":2,"count":6},{"arity":6,"count":6},{"arity":7,"count":6},{"arity":8,"count":6},{"arity":9,"count":6},{"arity":10,"count":6},{"arity":11,"count":3},{"arity":91,"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":33}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
choco-solver 2019-09-16 parallel (complete)4399677SAT 49.3851 6.73958
choco-solver 2019-09-20 parallel (complete)4404477SAT 50.8929 7.15177
choco-solver 2019-09-24 parallel (complete)4406877SAT 53.072 7.23934
BTD 19.07.01 (complete)4386828? (TO) 2519.5 2520.01
PicatSAT 2019-09-12 (complete)4395097? (TO) 2519.65 2520.01
cosoco 2.0 (complete)4408157? (TO) 2519.8 2520.01
cosoco 2 (complete)4389617? (TO) 2519.86 2520.01
choco-solver 2019-09-24 (complete)4405977? (TO) 2520.04 2496.61
AbsCon 2019-07-23 (complete)4390717? (TO) 2520.05 2515.02
Concrete 3.12.2 (complete)4395997? (TO) 2520.05 2468.13
cosoco 2.0 (complete)4396897? (TO) 2520.07 2520.01
Concrete 3.12.3 (complete)4402677? (TO) 2520.08 2467.63
Concrete 3.12.2 (complete)4400877? (TO) 2520.13 2462.63
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388062? (TO) 2520.13 2510.05
Concrete 3.10 (complete)4387309? (TO) 2520.15 2467.63
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388061? (TO) 2520.15 2511.76
choco-solver 2019-09-16 (complete)4399077? (TO) 2520.52 636.191
choco-solver 2019-09-20 (complete)4403577? (TO) 2520.62 636.119
choco-solver 2019-06-14 (complete)4393117? (TO) 2520.72 636.107
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405677? (TO) 18085.7 2520.14
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392817? (TO) 18318.4 2520.14
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405377? (TO) 19103.7 2520.49
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392517? (TO) 19129.3 2520.49
choco-solver 2019-06-14 parallel (complete)4393717? (TO) 20033.3 2520.1
cosoco 2.0 parallel (complete)4409437? (TO) 20113.2 2520.03
cosoco 2.O parallel (complete)4398177? (TO) 20113.4 2520.02

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