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

Result page for benchmark
QueenAttacking/QueenAttacking-m1-s1/
QueenAttacking-09.xml

Jump to solvers results

General information on the benchmark

NameQueenAttacking/QueenAttacking-m1-s1/
QueenAttacking-09.xml
MD5SUM5a1f15825b762c0b5b9d8df1deed9cb9
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark7
Best CPU time to get the best result obtained on this benchmark1980.86
Satisfiable
(Un)Satisfiability was proved
Number of variables104
Number of constraints103
Number of domains2
Minimum domain size2
Maximum domain size81
Distribution of domain sizes[{"size":2,"count":22},{"size":81,"count":82}]
Minimum variable degree2
Maximum variable degree22
Distribution of variable degrees[{"degree":2,"count":24},{"degree":3,"count":57},{"degree":4,"count":22},{"degree":22,"count":1}]
Minimum constraint arity2
Maximum constraint arity81
Distribution of constraint arities[{"arity":2,"count":80},{"arity":3,"count":22},{"arity":81,"count":1}]
Number of extensional constraints0
Number of intensional constraints102
Distribution of constraint types[{"type":"intension","count":102},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 4.0.5 par (2017-07-26) (complete)4254699SAT (TO)7 1920.38 244.34
choco-solver 4.0.5 par (2017-08-18) (complete)4281481SAT (TO)7 1980.86 252.105
choco-solver 4.0.5 par (2017-08-09) (complete)4271671SAT (TO)7 1981.12 252.10899
AbsCon-basic 2017-06-11 (complete)4257681SAT (TO)12 244.875 240.01401
cosoco 1.12 (complete)4268731? (TO) 240.007 240.00999
cosoco-sat 1.12 (complete)4266800? (TO) 240.021 240.00999
OscaR - ALNS 2017-07-26 (complete)4255693? (TO) 243.282 240.017
OscaR - Conflict Ordering 2017-07-26 (complete)4256190? (TO) 243.612 240.01199
OscaR - Hybrid 2017-07-26 (complete)4256687? (TO) 243.91499 240.01199
sat4j-CSP 2017-07-05 (complete)4258178? (TO) 245.52499 240.265
choco-solver 4.0.5 seq (2017-07-26) (complete)4254202? (TO) 246 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4282951? (TO) 246.15601 240.02299
choco-solver 4.0.5 seq (2017-08-09) (complete)4270201? (TO) 246.48599 240.02299
cosoco 1.1 (complete)4258675? (TO) 251.895 252.00999
Mistral-2.0 2017-07-28 (complete)4259172? (TO) 251.924 252.00999
choco-solver 5a (2017-07-26) (complete)4255196? (TO) 253.46001 240.00999
choco-solver 5a (2017-08-18) (complete)4284421? (TO) 253.827 240.02499
Concrete 3.4 (complete)4259669? (TO) 254.80901 240.261
OscaR - Parallel with EPS 2017-07-26 (complete)4257184? (TO) 1920.72 242.821
OscaR - Parallel with EPS 2017-08-22 (complete)4285891? (TO) 1989.6899 252.13699

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