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

Result page for benchmark
GracefulGraph/GracefulGraph-m1-s1/
GracefulGraph-K14-P05.xml

Jump to solvers results

General information on the benchmark

NameGracefulGraph/GracefulGraph-m1-s1/
GracefulGraph-K14-P05.xml
MD5SUM59020dc5d68df7ba2fdec80297510e85
Bench CategoryCSP (decision problem)
Best result obtained on this benchmark
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables1106
Number of constraints513
Number of domains2
Minimum domain size511
Maximum domain size512
Distribution of domain sizes[{"size":511,"count":511},{"size":512,"count":70}]
Minimum variable degree0
Maximum variable degree16
Distribution of variable degrees[{"degree":0,"count":525},{"degree":2,"count":511},{"degree":15,"count":28},{"degree":16,"count":42}]
Minimum constraint arity3
Maximum constraint arity511
Distribution of constraint arities[{"arity":3,"count":511},{"arity":70,"count":1},{"arity":511,"count":1}]
Number of extensional constraints0
Number of intensional constraints511
Distribution of constraint types[{"type":"intension","count":511},{"type":"allDifferent","count":2}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.5 (complete)4391728? (TO) 2400.01 2400.01
cosoco 2.0 (complete)4397408? (TO) 2400.01 2400.11
cosoco 2 (complete)4390128? (TO) 2400.02 2400.3
cosoco 2.0 (complete)4408668? (TO) 2400.04 2400.2
miniBTD 19.06.16 (complete)4391928? (TO) 2400.05 2400.11
(reference) PicatSAT 2019-09-12 (complete)4407554? (TO) 2400.05 2400.31
NACRE 1.0.5-Hybrid (complete)4391528? (TO) 2400.07 2400.12

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: