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

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-routing/
Pb-routing-s3-3-3-5.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-routing/
Pb-routing-s3-3-3-5.xml
MD5SUM4027cbc08519a891dc4b49e9e1c39c5c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark34
Best CPU time to get the best result obtained on this benchmark2.88775
Satisfiable
(Un)Satisfiability was proved
Number of variables240
Number of constraints646
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":240}]
Minimum variable degree7
Maximum variable degree13
Distribution of variable degrees[{"degree":7,"count":32},{"degree":8,"count":128},{"degree":9,"count":3},{"degree":10,"count":21},{"degree":12,"count":13},{"degree":13,"count":43}]
Minimum constraint arity2
Maximum constraint arity20
Distribution of constraint arities[{"arity":2,"count":244},{"arity":3,"count":328},{"arity":4,"count":62},{"arity":20,"count":12}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":646}]
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)4406046OPT34 2.88775 1.18254
PicatSAT 2019-09-12 (complete)4395166OPT34 4.17198 4.17264
choco-solver 2019-06-14 (complete)4393186OPT34 4.68094 1.52219
choco-solver 2019-09-16 (complete)4399146OPT34 4.99495 1.59094
AbsCon 2019-07-23 (complete)4390786OPT34 5.17686 3.1455
choco-solver 2019-09-20 (complete)4403646OPT34 6.85303 2.45701
choco-solver 2019-09-24 parallel (complete)4406946OPT34 7.90462 1.62835
choco-solver 2019-09-16 parallel (complete)4399746OPT34 8.03688 1.65062
cosoco 2 (complete)4389686OPT34 8.23963 8.24301
choco-solver 2019-09-20 parallel (complete)4404546OPT34 8.28858 1.76531
cosoco 2.0 (complete)4408226OPT34 8.32646 8.3273
cosoco 2.0 (complete)4396966OPT34 8.4257 8.42684
choco-solver 2019-06-14 parallel (complete)4393786OPT34 9.16125 1.80714
cosoco 2.O parallel (complete)4398246OPT34 10.5482 1.38845
cosoco 2.0 parallel (complete)4409506OPT34 11.638 1.52582
Concrete 3.12.2 (complete)4400946OPT34 26.6836 17.5202
Concrete 3.12.3 (complete)4402746OPT34 30.8548 21.9381
Concrete 3.10 (complete)4387348OPT34 96.8566 78.5903
Concrete 3.12.2 (complete)4396066OPT34 105.138 93.8968

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: 34
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] x[225] x[226] x[227] x[228] x[229] x[230]
x[231] x[232] x[233] x[234] x[235] x[236] x[237] x[238] x[239] </list> <values>0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 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 1 0 0 0 1 0 0 0 1 1 0 0 0 0
0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0
0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 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 1 0 0 0 0 0 0 0 0 0 0
</values> </instantiation>