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

Result page for benchmark
QRandom/QRandom-mdd-7-25-5-p9/
mdd-7-25-5-ps05-psh09-3.xml

Jump to solvers results

General information on the benchmark

NameQRandom/QRandom-mdd-7-25-5-p9/
mdd-7-25-5-ps05-psh09-3.xml
MD5SUM47cdae4cc979e49bd09b7efbbe69f743
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 benchmark18.712
Satisfiable
(Un)Satisfiability was proved
Number of variables25
Number of constraints58
Number of domains1
Minimum domain size5
Maximum domain size5
Distribution of domain sizes[{"size":5,"count":25}]
Minimum variable degree12
Maximum variable degree22
Distribution of variable degrees[{"degree":12,"count":3},{"degree":13,"count":1},{"degree":14,"count":3},{"degree":15,"count":4},{"degree":16,"count":3},{"degree":17,"count":3},{"degree":18,"count":1},{"degree":19,"count":4},{"degree":20,"count":2},{"degree":22,"count":1}]
Minimum constraint arity7
Maximum constraint arity7
Distribution of constraint arities[{"arity":7,"count":58}]
Number of extensional constraints58
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":58}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264970UNSAT 18.712 18.712799
miniBTD 2017-06-30 (complete)4252349UNSAT 18.9077 18.9097
cosoco-mini 1.1 (2017-07-29) (complete)4260230UNSAT 36.737999 36.813099
cosoco-mini 1.12 (complete)4267411UNSAT 36.8153 36.813702
cosoco-mini 1.1 (2017-06-27) (complete)4252350UNSAT 37.039 37.0422
Naxos 1.1.0 (complete)4252351? (TO) 2400.03 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: