2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-logicSynthesis/
Pb-logic-m050-100-30-30-r.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-logicSynthesis/
Pb-logic-m050-100-30-30-r.xml
MD5SUM825977a0e50b6eafe15407d946435b7c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark7.97837
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints50
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":100}]
Minimum variable degree6
Maximum variable degree24
Distribution of variable degrees[{"degree":6,"count":1},{"degree":10,"count":1},{"degree":11,"count":5},{"degree":12,"count":5},{"degree":13,"count":6},{"degree":14,"count":13},{"degree":15,"count":12},{"degree":16,"count":15},{"degree":17,"count":11},{"degree":18,"count":12},{"degree":19,"count":7},{"degree":20,"count":6},{"degree":21,"count":3},{"degree":22,"count":1},{"degree":24,"count":2}]
Minimum constraint arity30
Maximum constraint arity30
Distribution of constraint arities[{"arity":30,"count":50}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":50}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407794OPT4 7.97837 7.97854
cosoco 2 (complete)4394787OPT4 50.1148 50.1115
cosoco 2.0 (complete)4397504OPT4 50.1905 50.1949
cosoco 2.0 (complete)4408764OPT4 50.2829 50.2864

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: 4
Solution found:
<instantiation> <list> x[]  </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 0 0 0 1 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 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 0 0 0 0 0 0   </values> </instantiation>