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

Result page for benchmark
Random/Random-B-2-23-23/
rand-2-23-23-253-131-0.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-B-2-23-23/
rand-2-23-23-253-131-0.xml
MD5SUM3925c474c05bd21213e760e2a53982be
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 benchmark45.3988
Satisfiable
(Un)Satisfiability was proved
Number of variables23
Number of constraints253
Number of domains1
Minimum domain size23
Maximum domain size23
Distribution of domain sizes[{"size":23,"count":23}]
Minimum variable degree22
Maximum variable degree22
Distribution of variable degrees[{"degree":22,"count":23}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":253}]
Number of extensional constraints253
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":253}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264977UNSAT 45.3988 45.401501
miniBTD 2017-06-30 (complete)4251818UNSAT 45.6334 45.6311
cosoco-mini 1.1 (2017-06-27) (complete)4251819UNSAT 67.2914 67.2931
cosoco-mini 1.1 (2017-07-29) (complete)4260237UNSAT 67.534103 67.5924
cosoco-mini 1.12 (complete)4267418UNSAT 69.485298 69.478302
Naxos 1.1.0 (complete)4251820UNSAT 299.598 299.608

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: