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

Result page for benchmark
QRandom/QRandom-bdd-18-21-2/
bdd-18-21-2-133-78-24.xml

Jump to solvers results

General information on the benchmark

NameQRandom/QRandom-bdd-18-21-2/
bdd-18-21-2-133-78-24.xml
MD5SUM12e2e274c64cbf9c8a04283668281b9c
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 benchmark117.121
Satisfiable
(Un)Satisfiability was proved
Number of variables21
Number of constraints133
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":21}]
Minimum variable degree101
Maximum variable degree123
Distribution of variable degrees[{"degree":101,"count":1},{"degree":106,"count":1},{"degree":110,"count":2},{"degree":111,"count":2},{"degree":112,"count":1},{"degree":113,"count":3},{"degree":114,"count":1},{"degree":115,"count":1},{"degree":116,"count":2},{"degree":117,"count":2},{"degree":118,"count":1},{"degree":119,"count":2},{"degree":120,"count":1},{"degree":123,"count":1}]
Minimum constraint arity18
Maximum constraint arity18
Distribution of constraint arities[{"arity":18,"count":133}]
Number of extensional constraints133
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":133}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.12 (complete)4267393UNSAT 117.121 117.124
cosoco-mini 1.1 (2017-06-27) (complete)4252338UNSAT 118.191 118.209
cosoco-mini 1.1 (2017-07-29) (complete)4260212UNSAT 120.255 120.306
Naxos 1.1.0 (complete)4252339? (TO) 2400.02 2400.4
miniBTD 2017-06-30 (complete)4252337? (TO) 2400.08 2400.22
miniBTD 2017-08-10 (complete)4264952? (TO) 2400.28 2400.47

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: