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

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-mps/
Pb-mps-v2-20-10-lseu.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-mps/
Pb-mps-v2-20-10-lseu.xml
MD5SUMb8e79a81cec6901ac635f2e0750bfcb6
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark1120
Best CPU time to get the best result obtained on this benchmark101.21
Satisfiable
(Un)Satisfiability was proved
Number of variables89
Number of constraints28
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":89}]
Minimum variable degree2
Maximum variable degree8
Distribution of variable degrees[{"degree":2,"count":8},{"degree":3,"count":13},{"degree":4,"count":23},{"degree":5,"count":27},{"degree":6,"count":16},{"degree":8,"count":2}]
Minimum constraint arity2
Maximum constraint arity47
Distribution of constraint arities[{"arity":2,"count":2},{"arity":3,"count":5},{"arity":4,"count":5},{"arity":5,"count":5},{"arity":7,"count":3},{"arity":10,"count":1},{"arity":11,"count":1},{"arity":22,"count":1},{"arity":24,"count":1},{"arity":30,"count":1},{"arity":33,"count":1},{"arity":47,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":28}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 2019-09-20 (complete)4403971OPT1120 98.6036 25.2314
choco-solver 2019-09-16 (complete)4400371OPT1120 101.21 25.9063
choco-solver 2019-06-14 (complete)4394111OPT1120 140.894 36.1879
choco-solver 2019-09-24 (complete)4406371OPT1120 154.646 151.09
AbsCon 2019-07-23 (complete)4391111OPT1120 160.136 157.776
PicatSAT 2019-09-12 (complete)4395491OPT1120 191.518 191.516
choco-solver 2019-09-24 parallel (complete)4407271OPT1120 230.416 29.7302
choco-solver 2019-09-16 parallel (complete)4400071OPT1120 243.535 31.4233
choco-solver 2019-09-20 parallel (complete)4404871OPT1120 300.361 38.8101
choco-solver 2019-06-14 parallel (complete)4394411OPT1120 1588.07 256.536
cosoco 2.O parallel (complete)4398571SAT (TO)1120 2012.64 252.021
cosoco 2 (complete)4390211SAT (TO)1120 2400.03 2399.7
cosoco 2.0 (complete)4397671SAT (TO)1120 2400.03 2400.2
cosoco 2.0 (complete)4408931SAT (TO)1120 2400.04 2400.01
Concrete 3.12.3 (complete)4403071SAT (TO)1120 2400.05 2361.04
Concrete 3.12.2 (complete)4401271SAT (TO)1120 2400.07 2362.33
Concrete 3.12.2 (complete)4396391SAT (TO)1120 2400.15 2364.93
cosoco 2.0 parallel (complete)4409831SAT (TO)1128 2012.68 252.02
Concrete 3.10 (complete)4392011SAT (TO)1128 2400.12 2350.53

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