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

Result page for benchmark
Random/Random-m1-5-12-12t/
rand-5-12-12-200-t95-3.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-m1-5-12-12t/
rand-5-12-12-200-t95-3.xml
MD5SUMd4014e5e87f6d68ac86bab8f8f62518f
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 benchmark42.035099
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":1},{"degree":78,"count":1},{"degree":79,"count":1},{"degree":81,"count":2},{"degree":82,"count":1},{"degree":83,"count":2},{"degree":84,"count":1},{"degree":86,"count":1},{"degree":91,"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)4264991UNSAT 42.035099 42.050999
miniBTD 2017-06-30 (complete)4251785UNSAT 42.4331 42.4371
cosoco-mini 1.1 (2017-07-29) (complete)4260251UNSAT 54.240601 54.3209
cosoco-mini 1.1 (2017-06-27) (complete)4251786UNSAT 54.5854 54.5866
cosoco-mini 1.12 (complete)4267432UNSAT 54.650002 54.662201
Naxos 1.1.0 (complete)4251787UNSAT 284.494 284.526

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: