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

Result page for benchmark
PseudoBoolean/PseudoBoolean-dec-pigeon/
Pb-pigeon-card-011-010.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-dec-pigeon/
Pb-pigeon-card-011-010.xml
MD5SUM304d36c9f4738ce6debdcd70a29e2b53
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark29.5875
Satisfiable
(Un)Satisfiability was proved
Number of variables110
Number of constraints21
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":110}]
Minimum variable degree2
Maximum variable degree2
Distribution of variable degrees[{"degree":2,"count":110}]
Minimum constraint arity10
Maximum constraint arity11
Distribution of constraint arities[{"arity":10,"count":11},{"arity":11,"count":10}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":21}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407789UNSAT 29.5875 29.5886
NACRE 1.0.5-Hybrid (complete)4391411UNSAT 223.709 223.722
cosoco 2 (complete)4390011UNSAT 1690.99 1691.14
cosoco 2.0 (complete)4397291UNSAT 1706.11 1706.25
cosoco 2.0 (complete)4408551UNSAT 1706.72 1706.56
miniBTD 19.06.16 (complete)4391811? 2400.01 2400.11
NACRE 1.0.5 (complete)4391611? (TO) 2400.06 2400.01

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:
Solution found: