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

Result page for benchmark
Random/Random-RB-3-20-20/
rand-3-20-20-60-632-40.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-RB-3-20-20/
rand-3-20-20-60-632-40.xml
MD5SUMdc4dbad226249f26f24e6fd4bdcbff7b
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 benchmark471.508
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints60
Number of domains1
Minimum domain size20
Maximum domain size20
Distribution of domain sizes[{"size":20,"count":20}]
Minimum variable degree2
Maximum variable degree16
Distribution of variable degrees[{"degree":2,"count":1},{"degree":5,"count":1},{"degree":6,"count":4},{"degree":7,"count":1},{"degree":8,"count":2},{"degree":9,"count":3},{"degree":10,"count":2},{"degree":11,"count":2},{"degree":13,"count":2},{"degree":15,"count":1},{"degree":16,"count":1}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":60}]
Number of extensional constraints60
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":60}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.12 (complete)4267428UNSAT 471.508 471.487
cosoco-mini 1.1 (2017-06-27) (complete)4251792UNSAT 473.412 473.403
cosoco-mini 1.1 (2017-07-29) (complete)4260247UNSAT 473.64401 473.711
miniBTD 2017-08-10 (complete)4264987UNSAT 513.25299 513.27301
miniBTD 2017-06-30 (complete)4251791UNSAT 546.702 546.761
Naxos 1.1.0 (complete)4251793? (TO) 2400.04 2400.31

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: