2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
PseudoBoolean-opt/
Pb-garden-15x15_c18.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean-opt/
Pb-garden-15x15_c18.xml
MD5SUM3febb05d57a4106fdf30b8e2d6c3cfc0
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark57
Best CPU time to get the best result obtained on this benchmark252.027
Satisfiable
(Un)Satisfiability was proved
Number of variables225
Number of constraints225
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":225}]
Minimum variable degree4
Maximum variable degree6
Distribution of variable degrees[{"degree":4,"count":4},{"degree":5,"count":52},{"degree":6,"count":169}]
Minimum constraint arity3
Maximum constraint arity5
Distribution of constraint arities[{"arity":3,"count":4},{"arity":4,"count":52},{"arity":5,"count":169}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":225}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Hybrid 2018-08-14 (complete)4310368SAT (TO)57 252.027 243.52
Mistral-2.0 2018-08-01 (complete)4312489SAT (TO)62 252.008 252.01
Concrete 3.9.2 (complete)4302392SAT (TO)63 252.071 235.241
Choco-solver 4.0.7b seq (e747e1e) (complete)4301357SAT (TO)63 252.081 247.915
cosoco 1.12 (complete)4301359SAT (TO)66 252.013 252.01
Concrete 3.9.2-SuperNG (complete)4302742SAT (TO)67 252.132 233.941
Sat4j-CSP 2018-07-11 (complete)4301358SAT (TO)78 252.344 250.348
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310018SAT90 249.504 247.363
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312228SAT91 249.689 247.37

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: 57
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] x[169] x[170]
x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] x[180] x[181] x[182] x[183] x[184] x[185] x[186] x[187] x[188] x[189] x[190]
x[191] x[192] x[193] x[194] x[195] x[196] x[197] x[198] x[199] x[200] x[201] x[202] x[203] x[204] x[205] x[206] x[207] x[208] x[209] x[210]
x[211] x[212] x[213] x[214] x[215] x[216] x[217] x[218] x[219] x[220] x[221] x[222] x[223] x[224] </list> <values> 1 0 0 1 0 0 1 0 0 0 1 0 0
1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 1 0 0
0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 1 0 0
1 0 </values> </instantiation>