2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
ChessboardColoration/ChessboardColoration-int-s2/
ChessboardColoration-int-15-17.xml

Jump to solvers results

General information on the benchmark

NameChessboardColoration/ChessboardColoration-int-s2/
ChessboardColoration-int-15-17.xml
MD5SUM5342dff7930c7d1c2bbf0c6436545580
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark240.009
Satisfiable
(Un)Satisfiability was proved
Number of variables255
Number of constraints14281
Number of domains1
Minimum domain size255
Maximum domain size255
Distribution of domain sizes[{"size":255,"count":255}]
Minimum variable degree226
Maximum variable degree226
Distribution of variable degrees[{"degree":226,"count":255}]
Minimum constraint arity4
Maximum constraint arity255
Distribution of constraint arities[{"arity":4,"count":14280},{"arity":255,"count":1}]
Number of extensional constraints0
Number of intensional constraints14280
Distribution of constraint types[{"type":"intension","count":14280},{"type":"lex","count":1}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4268947SAT (TO)4 240.009 240.01601
cosoco 1.1 (complete)4258444SAT (TO)4 251.914 252.01401
cosoco-sat 1.12 (complete)4267016SAT (TO)4 251.92101 252.03
AbsCon-basic 2017-06-11 (complete)4257450SAT (TO)4 252.15401 240.01801
OscaR - Parallel with EPS 2017-08-22 (complete)4286107SAT (TO)4 1538.5699 252.058
OscaR - Conflict Ordering 2017-07-26 (complete)4255959SAT (TO)5 254.703 240.036
OscaR - Parallel with EPS 2017-07-26 (complete)4256953SAT (TO)5 1658.34 252.086
OscaR - Hybrid 2017-07-26 (complete)4256456SAT (TO)7 260.64999 240.04601
choco-solver 4.0.5 par (2017-08-18) (complete)4281697SAT (TO)13 276.979 252.033
choco-solver 4.0.5 par (2017-08-09) (complete)4271887SAT (TO)13 277.879 252.033
choco-solver 4.0.5 par (2017-07-26) (complete)4254468SAT (TO)13 278.354 252.035
OscaR - ALNS 2017-07-26 (complete)4255462SAT (TO)254 252.09801 231.442
Concrete 3.4 (complete)4259438SAT (TO)254 252.117 215.457
choco-solver 4.0.5 seq (2017-08-09) (complete)4270417? (TO) 244.907 240.033
choco-solver 4.0.5 seq (2017-07-26) (complete)4253971? (TO) 245.06 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4283167? (TO) 245.38 240.034
choco-solver 5a (2017-07-26) (complete)4254965? (TO) 245.39 240.00999
choco-solver 5a (2017-08-18) (complete)4284637? (TO) 245.61099 240.035
Mistral-2.0 2017-07-28 (complete)4258941? (TO) 251.89799 252.011
sat4j-CSP 2017-07-05 (complete)4257947? (TO) 260.13901 88.642899

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: 4
Solution found:
<instantiation type='solution' cost='4'> <list>x[0][0] x[0][10] x[0][11] x[0][12] x[0][13] x[0][14] x[0][15] x[0][16] 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[10][0] x[10][10] x[10][11] x[10][12] x[10][13] x[10][14] x[10][15] x[10][16]
x[10][1] x[10][2] x[10][3] x[10][4] x[10][5] x[10][6] x[10][7] x[10][8] x[10][9] x[11][0] x[11][10] x[11][11] x[11][12] x[11][13] x[11][14]
x[11][15] x[11][16] x[11][1] x[11][2] x[11][3] x[11][4] x[11][5] x[11][6] x[11][7] x[11][8] x[11][9] x[12][0] x[12][10] x[12][11] x[12][12]
x[12][13] x[12][14] x[12][15] x[12][16] x[12][1] x[12][2] x[12][3] x[12][4] x[12][5] x[12][6] x[12][7] x[12][8] x[12][9] x[13][0] x[13][10]
x[13][11] x[13][12] x[13][13] x[13][14] x[13][15] x[13][16] x[13][1] x[13][2] x[13][3] x[13][4] x[13][5] x[13][6] x[13][7] x[13][8] x[13][9]
x[14][0] x[14][10] x[14][11] x[14][12] x[14][13] x[14][14] x[14][15] x[14][16] x[14][1] x[14][2] x[14][3] x[14][4] x[14][5] x[14][6]
x[14][7] x[14][8] x[14][9] x[1][0] x[1][10] x[1][11] x[1][12] x[1][13] x[1][14] x[1][15] x[1][16] 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][10] x[2][11] x[2][12] x[2][13] x[2][14] x[2][15] x[2][16] 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][10] x[3][11] x[3][12] x[3][13] x[3][14] x[3][15] x[3][16] 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][10] x[4][11] x[4][12] x[4][13] x[4][14] x[4][15] x[4][16] 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][10] x[5][11] x[5][12] x[5][13] x[5][14] x[5][15] x[5][16] 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][10] x[6][11] x[6][12] x[6][13] x[6][14] x[6][15] x[6][16]
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][10] x[7][11] x[7][12] x[7][13] x[7][14] x[7][15]
x[7][16] 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][10] x[8][11] x[8][12] x[8][13] x[8][14]
x[8][15] x[8][16] 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][10] x[9][11] x[9][12] x[9][13]
x[9][14] x[9][15] x[9][16] 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>0 4 4 4 4 4 4 4 0 0 1 2 2
2 2 2 3 4 1 2 1 3 4 1 0 2 3 3 3 0 2 3 0 4 4 4 0 3 0 3 2 0 3 0 4 4 1 1 2 4 2 4 2 2 1 4 0 2 0 3 1 0 1 3 4 0 2 3 4 2 3 2 0 2 4 3 3 1 0 3 4 0 1
1 2 4 3 0 2 2 3 2 4 4 4 3 1 2 0 1 0 1 0 0 0 0 1 1 1 1 1 1 0 0 0 1 2 3 1 1 0 1 2 3 3 3 3 0 4 2 2 3 3 0 0 1 2 1 1 0 1 2 2 2 2 0 1 1 1 0 0 1 0
2 2 1 1 0 0 3 4 3 2 2 0 2 1 1 0 0 3 3 2 1 2 2 0 0 0 3 2 0 3 0 2 1 1 3 1 2 0 0 1 0 2 3 2 3 2 4 3 1 3 2 3 2 3 1 3 1 4 2 4 0 0 4 1 4 2 0 4 3 0
4 1 2 0 0 2 4 0 1 3 4 2 4 4 3 4 2 3 3 2 0 3 1 2 3 1 2 0 0 1 3 3 </values> </instantiation>