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

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

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-dec-pigeon/
Pb-pigeon-clau-011-010.xml
MD5SUM46ced5e3eb9b8d9f9897ebef4f7d04b7
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 benchmark6.61021
Satisfiable
(Un)Satisfiability was proved
Number of variables110
Number of constraints561
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":110}]
Minimum variable degree11
Maximum variable degree11
Distribution of variable degrees[{"degree":11,"count":110}]
Minimum constraint arity2
Maximum constraint arity10
Distribution of constraint arities[{"arity":2,"count":550},{"arity":10,"count":11}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":561}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.5-Hybrid (complete)4391447UNSAT 6.61021 6.61154
(reference) PicatSAT 2019-09-12 (complete)4407788UNSAT 63.5643 63.5675
miniBTD 19.06.16 (complete)4391847UNSAT 1511.17 1511.21
cosoco 2.0 (complete)4408587? (TO) 2400.04 2400.11
cosoco 2.0 (complete)4397327? (TO) 2400.05 2400.11
cosoco 2 (complete)4390047? (TO) 2400.05 2400.11
NACRE 1.0.5 (complete)4391647? (TO) 2400.06 2400.11

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: