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

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-marketSplit/
Pb-msplit-opt-4-30-1.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-marketSplit/
Pb-msplit-opt-4-30-1.xml
MD5SUM0b293698762add7ba6ae5db7003c937f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark2
Best CPU time to get the best result obtained on this benchmark82.7391
Satisfiable
(Un)Satisfiability was proved
Number of variables94
Number of constraints8
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":94}]
Minimum variable degree3
Maximum variable degree8
Distribution of variable degrees[{"degree":3,"count":64},{"degree":6,"count":2},{"degree":8,"count":28}]
Minimum constraint arity45
Maximum constraint arity46
Distribution of constraint arities[{"arity":45,"count":4},{"arity":46,"count":4}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":8}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 2019-06-14 (complete)4394243OPT2 82.7391 21.335
AbsCon 2019-07-23 (complete)4391243OPT2 86.6801 84.4678
choco-solver 2019-09-16 (complete)4400503OPT2 88.8121 22.9559
choco-solver 2019-09-20 (complete)4404103OPT2 92.3863 23.8255
choco-solver 2019-09-24 (complete)4406503OPT2 163.587 160.378
choco-solver 2019-09-20 parallel (complete)4405003OPT2 175.955 22.8509
choco-solver 2019-09-24 parallel (complete)4407403OPT2 187.988 24.3508
choco-solver 2019-09-16 parallel (complete)4400203OPT2 197.495 25.7486
choco-solver 2019-06-14 parallel (complete)4394543OPT2 225.99 51.5226
Concrete 3.12.3 (complete)4403203OPT2 255.106 246.952
Concrete 3.10 (complete)4392143OPT2 292.708 273.841
Concrete 3.12.2 (complete)4401403OPT2 298.233 288.178
cosoco 2.0 (complete)4397803OPT2 855.161 855.054
cosoco 2 (complete)4390343OPT2 860.848 860.836
cosoco 2.0 (complete)4409063OPT2 986.427 986.417
PicatSAT 2019-09-12 (complete)4395623OPT2 1220.45 1220.69
Concrete 3.12.2 (complete)4396523OPT2 1338.63 1319.08
cosoco 2.O parallel (complete)4398703SAT (TO)2 2012.67 252.021
cosoco 2.0 parallel (complete)4409963SAT (TO)2 2012.71 252.019

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