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

Result page for benchmark
SocialGolfers/SocialGolfers-cp-s1/
SocialGolfers-9-8-4-cp.xml

Jump to solvers results

General information on the benchmark

NameSocialGolfers/SocialGolfers-cp-s1/
SocialGolfers-9-8-4-cp.xml
MD5SUMbd9ca51d6afa7a7de86d4bfb05f523c8
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 benchmark138.482
Satisfiable
(Un)Satisfiability was proved
Number of variables288
Number of constraints15342
Number of domains1
Minimum domain size9
Maximum domain size9
Distribution of domain sizes[{"size":9,"count":288}]
Minimum variable degree215
Maximum variable degree216
Distribution of variable degrees[{"degree":215,"count":216},{"degree":216,"count":72}]
Minimum constraint arity4
Maximum constraint arity288
Distribution of constraint arities[{"arity":4,"count":15336},{"arity":72,"count":5},{"arity":288,"count":1}]
Number of extensional constraints0
Number of intensional constraints15336
Distribution of constraint types[{"type":"intension","count":15336},{"type":"lex","count":1},{"type":"cardinality","count":4},{"type":"instantiation","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387825SAT 138.482 121.539
PicatSAT 2019-09-12 (complete)4394968SAT 488.315 488.3
Concrete 3.12.2 (complete)4400748SAT 1483.49 1441.09
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387824SAT 2148.82 2132.2
cosoco 2.0 parallel (complete)4409308SAT 2512.14 340.619
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392688SAT 4196.9 553.468
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405548SAT 4223.34 545.262
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392388SAT 5106.46 658.062
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405248SAT 5199.83 671.172
cosoco 2.O parallel (complete)4398048SAT 15352 1945.81
choco-solver 2019-06-14 (complete)4392988? 1157.62 318.054
choco-solver 2019-09-20 (complete)4403448? 1207.91 331.143
choco-solver 2019-06-14 parallel (complete)4393588? 7479.66 1016.43
choco-solver 2019-09-24 parallel (complete)4406748? 15111.5 1997.06
choco-solver 2019-09-20 parallel (complete)4404348? 15863.9 2100.37
cosoco 2 (complete)4389488? (TO) 2516 2520
BTD 19.07.01 (complete)4386749? (TO) 2519.67 2520.01
cosoco 2.0 (complete)4408028? (TO) 2519.82 2520.01
cosoco 2.0 (complete)4396768? (TO) 2519.91 2520
choco-solver 2019-09-24 (complete)4405848? (TO) 2520.06 2456.54
AbsCon 2019-07-23 (complete)4390588? (TO) 2520.08 2496.12
Concrete 3.12.2 (complete)4395868? (TO) 2520.09 2480.74
Concrete 3.12.3 (complete)4402548? (TO) 2520.12 2459.95
Concrete 3.10 (complete)4387143? (TO) 2520.17 2456.55
choco-solver 2019-09-16 (complete)4398948? (TO) 2528.11 667.766
choco-solver 2019-09-16 parallel (complete)4399548? (TO) 19238.4 2522.11

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[0][45] x[0][46] x[0][47] x[0][48] x[0][49] x[0][50] x[0][51] x[0][52] x[0][53] x[0][54] x[0][55] x[0][56] x[0][57] x[0][58]
x[0][59] x[0][60] x[0][61] x[0][62] x[0][63] x[0][64] x[0][65] x[0][66] x[0][67] x[0][68] x[0][69] x[0][70] x[0][71] 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[1][45] x[1][46] x[1][47] x[1][48]
x[1][49] x[1][50] x[1][51] x[1][52] x[1][53] x[1][54] x[1][55] x[1][56] x[1][57] x[1][58] x[1][59] x[1][60] x[1][61] x[1][62] x[1][63]
x[1][64] x[1][65] x[1][66] x[1][67] x[1][68] x[1][69] x[1][70] x[1][71] 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] x[2][45] x[2][46] x[2][47] x[2][48] x[2][49] x[2][50] x[2][51] x[2][52]
x[2][53] x[2][54] x[2][55] x[2][56] x[2][57] x[2][58] x[2][59] x[2][60] x[2][61] x[2][62] x[2][63] x[2][64] x[2][65] x[2][66] x[2][67]
x[2][68] x[2][69] x[2][70] x[2][71] 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[3][10] x[3][11]
x[3][12] x[3][13] x[3][14] x[3][15] x[3][16] x[3][17] x[3][18] x[3][19] x[3][20] x[3][21] x[3][22] x[3][23] x[3][24] x[3][25] x[3][26]
x[3][27] x[3][28] x[3][29] x[3][30] x[3][31] x[3][32] x[3][33] x[3][34] x[3][35] x[3][36] x[3][37] x[3][38] x[3][39] x[3][40] x[3][41]
x[3][42] x[3][43] x[3][44] x[3][45] x[3][46] x[3][47] x[3][48] x[3][49] x[3][50] x[3][51] x[3][52] x[3][53] x[3][54] x[3][55] x[3][56]
x[3][57] x[3][58] x[3][59] x[3][60] x[3][61] x[3][62] x[3][63] x[3][64] x[3][65] x[3][66] x[3][67] x[3][68] x[3][69] x[3][70]
x[3][71]</list> <values>0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 7 7
7 7 7 7 7 7 8 8 8 8 8 8 8 8 0 1 3 4 5 6 7 8 1 2 3 4 5 6 7 8 0 1 2 3 4 5 7 8 0 1 2 3 4 5 6 7 0 1 2 3 5 6 7 8 0 1 2 4 5 6 7 8 0 1 2 3 4 6 7 8
0 2 3 4 5 6 7 8 0 1 2 3 4 5 6 8 1 5 0 4 7 3 2 8 6 1 4 7 8 0 5 3 6 0 4 3 1 2 8 7 3 1 0 2 5 6 8 4 2 8 5 7 3 6 1 4 4 7 6 2 1 5 3 0 7 4 3 8 6 2
0 5 8 2 5 0 4 1 7 6 5 2 8 6 3 0 7 1 6 7 3 8 5 4 0 1 3 5 2 1 4 7 6 0 1 5 0 6 7 2 8 4 8 1 4 7 2 6 3 5 5 0 1 8 7 2 4 3 7 2 8 3 0 5 1 6 0 6 3 5
4 1 2 8 2 6 4 0 1 8 3 7 3 4 7 0 5 8 6 2</values> </instantiation>