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

Result page for benchmark
QRandom/QRandom-reg2ext-s1/
reg-s20-p03-c20-d10-n10-l5-30.xml

Jump to solvers results

General information on the benchmark

NameQRandom/QRandom-reg2ext-s1/
reg-s20-p03-c20-d10-n10-l5-30.xml
MD5SUM65e58671dc4199faf26ac203b1450cb4
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 benchmark4.5770798
Satisfiable
(Un)Satisfiability was proved
Number of variables130
Number of constraints100
Number of domains23
Minimum domain size1
Maximum domain size20
Distribution of domain sizes[{"size":1,"count":20},{"size":6,"count":20},{"size":10,"count":10},{"size":20,"count":80}]
Minimum variable degree1
Maximum variable degree14
Distribution of variable degrees[{"degree":1,"count":40},{"degree":2,"count":80},{"degree":6,"count":1},{"degree":7,"count":1},{"degree":8,"count":2},{"degree":11,"count":3},{"degree":12,"count":2},{"degree":14,"count":1}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":100}]
Number of extensional constraints100
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":100}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264974UNSAT 4.5770798 4.5829101
miniBTD 2017-06-30 (complete)4252310UNSAT 4.59579 4.59713
cosoco-mini 1.1 (2017-06-27) (complete)4252311UNSAT 7.25368 7.25521
cosoco-mini 1.1 (2017-07-29) (complete)4260234UNSAT 7.2746401 7.3651199
cosoco-mini 1.12 (complete)4267415UNSAT 7.3367901 7.3388
Naxos 1.1.0 (complete)4252312? (TO) 2400.1 2400.1

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: