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

Result page for benchmark
Random/Random-m1-10-60-20/
rand-10-60-20-30-51200-43.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-m1-10-60-20/
rand-10-60-20-30-51200-43.xml
MD5SUMb8d48d817bcc13bb1c11a01b9e9dbb1a
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 benchmark13.5942
Satisfiable
(Un)Satisfiability was proved
Number of variables60
Number of constraints30
Number of domains1
Minimum domain size20
Maximum domain size20
Distribution of domain sizes[{"size":20,"count":60}]
Minimum variable degree1
Maximum variable degree9
Distribution of variable degrees[{"degree":1,"count":1},{"degree":2,"count":3},{"degree":3,"count":8},{"degree":4,"count":14},{"degree":5,"count":10},{"degree":6,"count":12},{"degree":7,"count":6},{"degree":8,"count":5},{"degree":9,"count":1}]
Minimum constraint arity10
Maximum constraint arity10
Distribution of constraint arities[{"arity":10,"count":30}]
Number of extensional constraints30
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":30}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 19.06.16 (complete)4391925UNSAT 13.5942 13.5971
NACRE 1.0.5-Hybrid (complete)4391525UNSAT 314.037 314.066
cosoco 2 (complete)4390125UNSAT 520.06 520.113
cosoco 2.0 (complete)4408665UNSAT 520.343 520.361
cosoco 2.0 (complete)4397405UNSAT 554.703 554.664
NACRE 1.0.5 (complete)4391725UNSAT 586.304 586.296
(reference) PicatSAT 2019-09-12 (complete)4407561? (TO) 2400.1 2400.06

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: