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

Result page for benchmark
QRandom/QRandom-ehi-s90/
ehi-90-315-37.xml

Jump to solvers results

General information on the benchmark

NameQRandom/QRandom-ehi-s90/
ehi-90-315-37.xml
MD5SUM63a6c7e62165414b16ef9081a892f3cd
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 benchmark0.075300001
Satisfiable
(Un)Satisfiability was proved
Number of variables315
Number of constraints4374
Number of domains1
Minimum domain size7
Maximum domain size7
Distribution of domain sizes[{"size":7,"count":315}]
Minimum variable degree22
Maximum variable degree30
Distribution of variable degrees[{"degree":22,"count":2},{"degree":23,"count":3},{"degree":24,"count":3},{"degree":25,"count":7},{"degree":26,"count":34},{"degree":27,"count":70},{"degree":28,"count":93},{"degree":29,"count":80},{"degree":30,"count":23}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":4374}]
Number of extensional constraints4374
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":4374}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.1 (2017-06-27) (complete)4252317UNSAT 0.073364 0.0745481
cosoco-mini 1.12 (complete)4267401UNSAT 0.075300001 0.076043896
cosoco-mini 1.1 (2017-07-29) (complete)4260220UNSAT 0.076595001 0.14953201
Naxos 1.1.0 (complete)4252318UNSAT 0.078841 0.0795291
miniBTD 2017-06-30 (complete)4252316UNSAT 0.217224 0.218044
miniBTD 2017-08-10 (complete)4264960UNSAT 0.222901 0.22401799

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: