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

Result page for benchmark
PseudoBoolean-opt/
Pb-circ4-3_c18.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean-opt/
Pb-circ4-3_c18.xml
MD5SUM49cd334f61ed4e195aeb645067fd2083
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark20
Best CPU time to get the best result obtained on this benchmark4.28114
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints704
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":144}]
Minimum variable degree8
Maximum variable degree27
Distribution of variable degrees[{"degree":8,"count":8},{"degree":9,"count":24},{"degree":12,"count":8},{"degree":13,"count":8},{"degree":14,"count":12},{"degree":16,"count":24},{"degree":18,"count":12},{"degree":23,"count":12},{"degree":26,"count":24},{"degree":27,"count":12}]
Minimum constraint arity2
Maximum constraint arity12
Distribution of constraint arities[{"arity":2,"count":156},{"arity":3,"count":344},{"arity":4,"count":84},{"arity":5,"count":48},{"arity":6,"count":60},{"arity":12,"count":12}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":704}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2018-08-01 (complete)4312492OPT20 3.22781 3.22931
OscaR - Hybrid 2018-08-14 (complete)4310364OPT20 4.28114 2.37412
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312224OPT20 4.3834 2.42411
Sat4j-CSP 2018-07-11 (complete)4301367OPT20 4.68499 2.75353
Choco-solver 4.0.7b seq (e747e1e) (complete)4301366OPT20 6.02372 3.25661
cosoco 1.12 (complete)4301368OPT20 13.0497 13.0761
Concrete 3.9.2-SuperNG (complete)4302738OPT20 20.2401 8.79957
Concrete 3.9.2 (complete)4302388OPT20 22.057 11.6438
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310014SAT (TO)20 252.028 246.828

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: 20
Solution found:
<instantiation type="optimum" cost="20"> <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] </list> <values> 1 0 0 0 0 1
0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0
0 0 0 1 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0 1 1 0 0 0 1 0 0 0 1 0 0 1 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 1 1 0 1
</values> </instantiation>