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

Result page for benchmark
Sat/Sat-m1-various/
hole-10.xml

Jump to solvers results

General information on the benchmark

NameSat/Sat-m1-various/
hole-10.xml
MD5SUM9520e39dbeb812da3aa0c7bffde6870d
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 benchmark20.5051
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 constraints561
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","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)4391412UNSAT 20.5051 20.5049
(reference) PicatSAT 2019-09-12 (complete)4407587UNSAT 63.3828 63.3822
cosoco 2 (complete)4390012UNSAT 1385.04 1384.91
cosoco 2.0 (complete)4397292UNSAT 1389.57 1389.69
cosoco 2.0 (complete)4408552UNSAT 1439.43 1439.24
miniBTD 19.06.16 (complete)4391812UNSAT 1842.91 1842.7
NACRE 1.0.5 (complete)4391612? (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: