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

Result page for benchmark
Random/Random-m1-5-12-12/
rand-5-12-12-200-12442-38.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-m1-5-12-12/
rand-5-12-12-200-12442-38.xml
MD5SUMb26246ce3e5ddb90abbf8b583e2fe87c
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 benchmark21.3645
Satisfiable
(Un)Satisfiability was proved
Number of variables12
Number of constraints200
Number of domains1
Minimum domain size12
Maximum domain size12
Distribution of domain sizes[{"size":12,"count":12}]
Minimum variable degree77
Maximum variable degree95
Distribution of variable degrees[{"degree":77,"count":2},{"degree":79,"count":2},{"degree":81,"count":1},{"degree":82,"count":1},{"degree":84,"count":2},{"degree":86,"count":1},{"degree":87,"count":1},{"degree":89,"count":1},{"degree":95,"count":1}]
Minimum constraint arity5
Maximum constraint arity5
Distribution of constraint arities[{"arity":5,"count":200}]
Number of extensional constraints200
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":200}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264990UNSAT 21.3645 21.369301
miniBTD 2017-06-30 (complete)4251782UNSAT 21.5721 21.5778
cosoco-mini 1.12 (complete)4267431UNSAT 53.835602 53.8493
cosoco-mini 1.1 (2017-07-29) (complete)4260250UNSAT 53.921101 54.037102
cosoco-mini 1.1 (2017-06-27) (complete)4251783UNSAT 54.0083 54.0061
Naxos 1.1.0 (complete)4251784UNSAT 283.911 283.902

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: