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-015-010.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-dec-pigeon/
Pb-pigeon-card-015-010.xml
MD5SUM4075ec57c143d98d1900f8e9a33246e5
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 benchmark106.65
Satisfiable
(Un)Satisfiability was proved
Number of variables150
Number of constraints25
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":150}]
Minimum variable degree2
Maximum variable degree2
Distribution of variable degrees[{"degree":2,"count":150}]
Minimum constraint arity10
Maximum constraint arity15
Distribution of constraint arities[{"arity":10,"count":15},{"arity":15,"count":10}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":25}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407790UNSAT 106.65 106.673
NACRE 1.0.5-Hybrid (complete)4391405UNSAT 121.72 121.733
miniBTD 19.06.16 (complete)4391805? 2400 2400.03
NACRE 1.0.5 (complete)4391605? (TO) 2400.03 2400.01
cosoco 2 (complete)4390005? (TO) 2400.06 2399.9
cosoco 2.0 (complete)4408545? (TO) 2400.08 2400.6
cosoco 2.0 (complete)4397285? (TO) 2400.1 2399.8

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: