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-1.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-B-2-23-23/
rand-2-23-23-253-131-1.xml
MD5SUM6701d983c46d683e3bb89bf94ea97cb4
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 benchmark40.973202
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)4264978UNSAT 40.973202 41.0728
miniBTD 2017-06-30 (complete)4251821UNSAT 41.2332 41.2309
cosoco-mini 1.1 (2017-07-29) (complete)4260238UNSAT 62.605099 62.695801
cosoco-mini 1.1 (2017-06-27) (complete)4251822UNSAT 62.7035 62.7011
cosoco-mini 1.12 (complete)4267419UNSAT 63.1423 63.141602
Naxos 1.1.0 (complete)4251823UNSAT 277.43 277.44

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: