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

Result page for benchmark
Opd/Opd-sum-large/
Opd-13-035-010.xml

Jump to solvers results

General information on the benchmark

NameOpd/Opd-sum-large/
Opd-13-035-010.xml
MD5SUMeedf33181a2d8e8283e3d80861c8066a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark3
Best CPU time to get the best result obtained on this benchmark0.78873998
Satisfiable
(Un)Satisfiability was proved
Number of variables456
Number of constraints92
Number of domains2
Minimum domain size2
Maximum domain size33
Distribution of domain sizes[{"size":2,"count":455},{"size":33,"count":1}]
Minimum variable degree14
Maximum variable degree79
Distribution of variable degrees[{"degree":14,"count":455},{"degree":79,"count":1}]
Minimum constraint arity35
Maximum constraint arity455
Distribution of constraint arities[{"arity":35,"count":13},{"arity":71,"count":78},{"arity":455,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"lex","count":1},{"type":"sum","count":91}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2017-07-28 (complete)4259072OPT3 0.78873998 0.89271998
OscaR - Conflict Ordering 2017-07-26 (complete)4256090OPT3 3.56213 1.65343
OscaR - Hybrid 2017-07-26 (complete)4256587OPT3 3.7133601 1.64726
AbsCon-basic 2017-06-11 (complete)4257581OPT3 3.91465 1.97021
choco-solver 4.0.5 seq (2017-08-09) (complete)4270151OPT3 4.74298 2.4726501
choco-solver 4.0.5 seq (2017-08-18) (complete)4282901OPT3 4.7467198 2.3801899
choco-solver 4.0.5 seq (2017-07-26) (complete)4254102OPT3 4.9135399 2.4409299
OscaR - Parallel with EPS 2017-07-26 (complete)4257084OPT3 13.703 3.0627301
OscaR - Parallel with EPS 2017-08-22 (complete)4285841OPT3 16.0341 3.2992699
choco-solver 4.0.5 par (2017-08-18) (complete)4281431OPT3 16.8482 2.72487
choco-solver 5a (2017-08-18) (complete)4284371OPT3 20.6313 14.3035
choco-solver 5a (2017-07-26) (complete)4255096OPT3 22.249901 14.9835
choco-solver 4.0.5 par (2017-08-09) (complete)4271621OPT3 26.908001 3.9948201
choco-solver 4.0.5 par (2017-07-26) (complete)4254599OPT3 34.490002 5.09515
sat4j-CSP 2017-07-05 (complete)4258078OPT3 121.313 116.701
OscaR - ALNS 2017-07-26 (complete)4255593SAT (TO)4 249.84801 240.02
Concrete 3.4 (complete)4259569SAT (TO)4 252.12601 220.536
cosoco 1.12 (complete)4268681SAT (TO)10 251.946 252.009
cosoco 1.1 (complete)4258575SAT (TO)10 252.045 252.00999
cosoco-sat 1.12 (complete)4266750? (TO) 240.024 240.00999

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: 3
Solution found:
<instantiation type="optimum" cost="3"> <list> z 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[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[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[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[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[4][10] x[4][11]
x[4][12] x[4][13] x[4][14] x[4][15] x[4][16] x[4][17] x[4][18] x[4][19] x[4][20] x[4][21] x[4][22] x[4][23] x[4][24] x[4][25] x[4][26]
x[4][27] x[4][28] x[4][29] x[4][30] x[4][31] x[4][32] x[4][33] x[4][34] 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[5][11] x[5][12] x[5][13] x[5][14] x[5][15] x[5][16] x[5][17] x[5][18] x[5][19] x[5][20] x[5][21] x[5][22]
x[5][23] x[5][24] x[5][25] x[5][26] x[5][27] x[5][28] x[5][29] x[5][30] x[5][31] x[5][32] x[5][33] x[5][34] 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[6][10] x[6][11] x[6][12] x[6][13] x[6][14] x[6][15] x[6][16] x[6][17] x[6][18] x[6][19]
x[6][20] x[6][21] x[6][22] x[6][23] x[6][24] x[6][25] x[6][26] x[6][27] x[6][28] x[6][29] x[6][30] x[6][31] x[6][32] x[6][33] x[6][34]
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[7][10] x[7][11] x[7][12] x[7][13] x[7][14] x[7][15]
x[7][16] x[7][17] x[7][18] x[7][19] x[7][20] x[7][21] x[7][22] x[7][23] x[7][24] x[7][25] x[7][26] x[7][27] x[7][28] x[7][29] x[7][30]
x[7][31] x[7][32] x[7][33] x[7][34] 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[8][10] x[8][11]
x[8][12] x[8][13] x[8][14] x[8][15] x[8][16] x[8][17] x[8][18] x[8][19] x[8][20] x[8][21] x[8][22] x[8][23] x[8][24] x[8][25] x[8][26]
x[8][27] x[8][28] x[8][29] x[8][30] x[8][31] x[8][32] x[8][33] x[8][34] 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] x[9][10] x[9][11] x[9][12] x[9][13] x[9][14] x[9][15] x[9][16] x[9][17] x[9][18] x[9][19] x[9][20] x[9][21] x[9][22]
x[9][23] x[9][24] x[9][25] x[9][26] x[9][27] x[9][28] x[9][29] x[9][30] x[9][31] x[9][32] x[9][33] x[9][34] x[10][0] 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[10][10] x[10][11] x[10][12] x[10][13] x[10][14] x[10][15] x[10][16]
x[10][17] x[10][18] x[10][19] x[10][20] x[10][21] x[10][22] x[10][23] x[10][24] x[10][25] x[10][26] x[10][27] x[10][28] x[10][29] x[10][30]
x[10][31] x[10][32] x[10][33] x[10][34] x[11][0] 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[11][10]
x[11][11] x[11][12] x[11][13] x[11][14] x[11][15] x[11][16] x[11][17] x[11][18] x[11][19] x[11][20] x[11][21] x[11][22] x[11][23] x[11][24]
x[11][25] x[11][26] x[11][27] x[11][28] x[11][29] x[11][30] x[11][31] x[11][32] x[11][33] x[11][34] x[12][0] 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[12][10] x[12][11] x[12][12] x[12][13] x[12][14] x[12][15] x[12][16] x[12][17]
x[12][18] x[12][19] x[12][20] x[12][21] x[12][22] x[12][23] x[12][24] x[12][25] x[12][26] x[12][27] x[12][28] x[12][29] x[12][30] x[12][31]
x[12][32] x[12][33] x[12][34] </list> <values> 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1
1 0 0 0 0 1 0 0 0 0 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 1
1 0 0 1 0 1 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 0
0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 1 1 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 1 1 0 0 0 1 1 0 1 0
0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 1 0 1 0 0 0 0 0 1 0 1 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0
0 0 0 1 1 1 0 0 1 0 0 1 0 0 1 1 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 </values>
</instantiation>