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

Result page for benchmark
Langford/Langford-m1-k3/
Langford-3-05.xml

Jump to solvers results

General information on the benchmark

NameLangford/Langford-m1-k3/
Langford-3-05.xml
MD5SUMa0353f5a729d36131132d05371d2400b
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.0090229996
Satisfiable
(Un)Satisfiability was proved
Number of variables15
Number of constraints11
Number of domains1
Minimum domain size15
Maximum domain size15
Distribution of domain sizes[{"size":15,"count":15}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":10},{"degree":3,"count":5}]
Minimum constraint arity2
Maximum constraint arity15
Distribution of constraint arities[{"arity":2,"count":10},{"arity":15,"count":1}]
Number of extensional constraints0
Number of intensional constraints10
Distribution of constraint types[{"type":"intension","count":10},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264848UNSAT 0.0090229996 0.00968906
miniBTD 2017-06-30 (complete)4252162UNSAT 0.009075 0.0100051
cosoco-mini 1.1 (2017-06-27) (complete)4252163UNSAT 0.015023 0.016101
cosoco-mini 1.1 (2017-07-29) (complete)4260108UNSAT 0.015281 0.108083
cosoco-mini 1.12 (complete)4267289UNSAT 0.016562 0.130905
Naxos 1.1.0 (complete)4252164UNSAT 0.021588 0.0216691

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: