2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-dimacs/
Pb-jnh210.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-dimacs/
Pb-jnh210.xml
MD5SUMf39a9bf5a44612488abba91009ee18af
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark88
Best CPU time to get the best result obtained on this benchmark3.7457
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints900
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":200}]
Minimum variable degree11
Maximum variable degree33
Distribution of variable degrees[{"degree":11,"count":1},{"degree":12,"count":3},{"degree":13,"count":4},{"degree":14,"count":4},{"degree":15,"count":4},{"degree":16,"count":4},{"degree":17,"count":7},{"degree":18,"count":15},{"degree":19,"count":23},{"degree":20,"count":16},{"degree":21,"count":17},{"degree":22,"count":24},{"degree":23,"count":17},{"degree":24,"count":15},{"degree":25,"count":11},{"degree":26,"count":10},{"degree":27,"count":7},{"degree":28,"count":6},{"degree":29,"count":4},{"degree":30,"count":5},{"degree":31,"count":1},{"degree":32,"count":1},{"degree":33,"count":1}]
Minimum constraint arity2
Maximum constraint arity10
Distribution of constraint arities[{"arity":2,"count":166},{"arity":3,"count":151},{"arity":4,"count":149},{"arity":5,"count":163},{"arity":6,"count":111},{"arity":7,"count":78},{"arity":8,"count":41},{"arity":9,"count":31},{"arity":10,"count":10}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":900}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 2019-09-24 (complete)4406036OPT88 3.7457 1.63866
AbsCon 2019-07-23 (complete)4390776OPT88 5.85187 3.53174
choco-solver 2019-09-16 (complete)4399136OPT88 6.59503 2.01736
choco-solver 2019-09-20 (complete)4403636OPT88 6.82596 2.07234
choco-solver 2019-06-14 (complete)4393176OPT88 8.07396 2.40778
choco-solver 2019-09-20 parallel (complete)4404536OPT88 10.0742 1.94924
choco-solver 2019-09-16 parallel (complete)4399736OPT88 10.8945 2.03485
choco-solver 2019-09-24 parallel (complete)4406936OPT88 10.9554 2.06147
choco-solver 2019-06-14 parallel (complete)4393776OPT88 11.6196 2.14241
Concrete 3.10 (complete)4387359OPT88 22.2953 10.1689
Concrete 3.12.2 (complete)4400936OPT88 24.3417 14.1798
Concrete 3.12.3 (complete)4402736OPT88 24.5798 15.3534
PicatSAT 2019-09-12 (complete)4395156OPT88 27.2861 27.2928
cosoco 2.0 parallel (complete)4409496OPT88 32.741 4.19374
cosoco 2.O parallel (complete)4398236OPT88 40.4199 5.15005
cosoco 2 (complete)4389676OPT88 50.5269 50.54
cosoco 2.0 (complete)4408216OPT88 51.1419 51.1386
cosoco 2.0 (complete)4396956OPT88 51.8451 51.8542
Concrete 3.12.2 (complete)4396056OPT88 215.768 203.611

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: 88
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] </list> <values>0 1 0 1 0 1 0 1 1 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 0 1 0 0 1 0 0
1 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 0 0
1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 0 0 1 1 0 1 0 0 1 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 1 0 0 1 1
0 0 1 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 1 1 0 1 0 </values> </instantiation>