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

Result page for benchmark
Langford/Langford-m1-k3/
Langford-3-45.xml

Jump to solvers results

General information on the benchmark

NameLangford/Langford-m1-k3/
Langford-3-45.xml
MD5SUMc29e6924973099ab0a0c802e448a5f67
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 benchmark185.253
Satisfiable
(Un)Satisfiability was proved
Number of variables135
Number of constraints91
Number of domains1
Minimum domain size135
Maximum domain size135
Distribution of domain sizes[{"size":135,"count":135}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":90},{"degree":3,"count":45}]
Minimum constraint arity2
Maximum constraint arity135
Distribution of constraint arities[{"arity":2,"count":90},{"arity":135,"count":1}]
Number of extensional constraints0
Number of intensional constraints90
Distribution of constraint types[{"type":"intension","count":90},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
choco-solver 2019-09-16 (complete)4399057SAT 182.519 46.2239
choco-solver 2019-09-20 (complete)4403557SAT 185.253 46.9721
choco-solver 2019-09-24 parallel (complete)4406857SAT 231.877 29.7825
choco-solver 2019-09-16 parallel (complete)4399657SAT 371.555 47.5501
choco-solver 2019-09-20 parallel (complete)4404457SAT 407.669 52.1167
AbsCon 2019-07-23 (complete)4390697SAT 433.86 431.423
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387750SAT 450.54 439.871
choco-solver 2019-06-14 (complete)4393097SAT 524.666 132.487
choco-solver 2019-06-14 parallel (complete)4393697SAT 1119.45 141.465
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405657SAT 2234.13 300.389
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392797SAT 2253.19 302.298
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392497SAT 2265.44 314.959
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405357SAT 2285.34 317.997
BTD 19.07.01 (complete)4386724? (TO) 2519.61 2520.01
PicatSAT 2019-09-12 (complete)4395077? (TO) 2519.86 2520.01
cosoco 2.0 (complete)4396877? (TO) 2520.02 2520.01
cosoco 2 (complete)4389597? (TO) 2520.03 2520
Concrete 3.12.2 (complete)4395977? (TO) 2520.07 2471.63
Concrete 3.10 (complete)4387110? (TO) 2520.08 2473.43
cosoco 2.0 (complete)4408137? (TO) 2520.08 2519.8
Concrete 3.12.2 (complete)4400857? (TO) 2520.09 2465.74
choco-solver 2019-09-24 (complete)4405957? (TO) 2520.1 2498.12
Concrete 3.12.3 (complete)4402657? (TO) 2520.11 2466.04
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387749? (TO) 2520.11 2508.43
cosoco 2.O parallel (complete)4398157? (TO) 20114.6 2520.02
cosoco 2.0 parallel (complete)4409417? (TO) 20119 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[0][6] x[0][7] x[0][8] x[0][9] x[0][10] x[0][11] x[0][12] x[0][13]
x[0][14] x[0][15] x[0][16] x[0][17] x[0][18] x[0][19] x[0][20] x[0][21] x[0][22] x[0][23] x[0][24] x[0][25] x[0][26] x[0][27] x[0][28]
x[0][29] x[0][30] x[0][31] x[0][32] x[0][33] x[0][34] x[0][35] x[0][36] x[0][37] x[0][38] x[0][39] x[0][40] x[0][41] x[0][42] x[0][43]
x[0][44] 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[1][10] x[1][11] x[1][12] x[1][13] x[1][14]
x[1][15] x[1][16] x[1][17] x[1][18] x[1][19] x[1][20] x[1][21] x[1][22] x[1][23] x[1][24] x[1][25] x[1][26] x[1][27] x[1][28] x[1][29]
x[1][30] x[1][31] x[1][32] x[1][33] x[1][34] x[1][35] x[1][36] x[1][37] x[1][38] x[1][39] x[1][40] x[1][41] x[1][42] x[1][43] x[1][44]
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[2][10] x[2][11] x[2][12] x[2][13] x[2][14] x[2][15]
x[2][16] x[2][17] x[2][18] x[2][19] x[2][20] x[2][21] x[2][22] x[2][23] x[2][24] x[2][25] x[2][26] x[2][27] x[2][28] x[2][29] x[2][30]
x[2][31] x[2][32] x[2][33] x[2][34] x[2][35] x[2][36] x[2][37] x[2][38] x[2][39] x[2][40] x[2][41] x[2][42] x[2][43] x[2][44] </list>
<values>14 96 7 3 49 106 51 17 2 9 45 6 34 86 89 43 94 85 87 0 78 4 5 83 46 63 75 10 24 64 65 25 47 1 56 37 38 41 30 52 40 23 44 28 33 16 99
11 8 55 113 59 26 12 20 57 19 48 101 105 60 112 104 107 21 100 27 29 108 72 90 103 39 54 95 97 58 81 36 92 74 76 80 70 93 82 66 88 73 79 18
102 15 13 61 120 67 35 22 31 69 32 62 116 121 77 130 123 127 42 122 50 53 133 98 117 131 68 84 126 129 91 115 71 128 111 114 119 110 134 124
109 132 118 125 </values> </instantiation>