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

Result page for benchmark
PigeonsPlus/PigeonsPlus-m1-s1/
pigeonsPlus-09-03.xml

Jump to solvers results

General information on the benchmark

NamePigeonsPlus/PigeonsPlus-m1-s1/
pigeonsPlus-09-03.xml
MD5SUM944781a71279aa84e7aac7ce597bf3c8
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 benchmark1.96697
Satisfiable
(Un)Satisfiability was proved
Number of variables36
Number of constraints54
Number of domains2
Minimum domain size8
Maximum domain size9
Distribution of domain sizes[{"size":8,"count":9},{"size":9,"count":27}]
Minimum variable degree1
Maximum variable degree9
Distribution of variable degrees[{"degree":1,"count":18},{"degree":2,"count":9},{"degree":9,"count":9}]
Minimum constraint arity2
Maximum constraint arity3
Distribution of constraint arities[{"arity":2,"count":45},{"arity":3,"count":9}]
Number of extensional constraints54
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":54}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.12 (complete)4267370UNSAT 1.96697 2.0543101
cosoco-mini 1.1 (2017-06-27) (complete)4253280UNSAT 1.97122 1.9708
cosoco-mini 1.1 (2017-07-29) (complete)4260189UNSAT 1.98305 2.0702801
miniBTD 2017-06-30 (complete)4253279UNSAT 2.25466 2.25513
miniBTD 2017-08-10 (complete)4264929UNSAT 2.2928901 2.3831501
Naxos 1.1.0 (complete)4253281UNSAT 92.0216 92.0139

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: