2017 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
PseudoBoolean/PseudoBoolean-dec-queen/
Pb-queen-0974553.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-dec-queen/
Pb-queen-0974553.xml
MD5SUM4e023da1984a585e160fb8158e2a8b72
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 benchmark0.553191
Satisfiable
(Un)Satisfiability was proved
Number of variables169
Number of constraints101
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":169}]
Minimum variable degree7
Maximum variable degree9
Distribution of variable degrees[{"degree":7,"count":148},{"degree":8,"count":20},{"degree":9,"count":1}]
Minimum constraint arity2
Maximum constraint arity169
Distribution of constraint arities[{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":4},{"arity":7,"count":4},{"arity":8,"count":4},{"arity":9,"count":4},{"arity":10,"count":4},{"arity":11,"count":4},{"arity":12,"count":4},{"arity":13,"count":56},{"arity":169,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":101}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Naxos 1.1.0 (complete)4253420SAT 0.553191 0.554174
miniBTD 2017-08-10 (complete)4264945SAT 83.760696 83.760696
miniBTD 2017-06-30 (complete)4253418SAT 84.5383 84.5426
cosoco-mini 1.1 (2017-06-27) (complete)4253419SAT 155.544 155.547
cosoco-mini 1.1 (2017-07-29) (complete)4260205SAT 155.76199 155.853
cosoco-mini 1.12 (complete)4267386SAT 160.034 160.036

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] 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] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89]
x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[110]
x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129] x[130]
x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147] x[148] x[149] x[150]
x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[160] x[161] x[162] x[163] x[164] x[165] x[166] x[167] x[168] </list>
<values> 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0 1 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 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 </values> </instantiation>