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

Result page for benchmark
Random/Random-B-2-26-26/
rand-2-26-26-325-155-2.xml

Jump to solvers results

General information on the benchmark

NameRandom/Random-B-2-26-26/
rand-2-26-26-325-155-2.xml
MD5SUMf524f0f0288a36fdb548674cb0263900
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark2026.13
Satisfiable
(Un)Satisfiability was proved
Number of variables26
Number of constraints325
Number of domains1
Minimum domain size26
Maximum domain size26
Distribution of domain sizes[{"size":26,"count":26}]
Minimum variable degree25
Maximum variable degree25
Distribution of variable degrees[{"degree":25,"count":26}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":325}]
Number of extensional constraints325
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":325}]
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)4251810SAT 51.4052 51.4123
cosoco-mini 1.1 (2017-07-29) (complete)4260240SAT 51.9286 51.996799
cosoco-mini 1.12 (complete)4267421SAT 52.315399 52.316502
miniBTD 2017-08-10 (complete)4264980SAT 93.496201 93.576897
miniBTD 2017-06-30 (complete)4251809SAT 94.1984 94.1921
Naxos 1.1.0 (complete)4251811SAT 2026.13 2026.27

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:
<instantiation type='solution'> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17]
x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] </list> <values>9 20 0 24 15 0 17 3 14 22 5 16 18 0 23 24 12 19 18 11 5 8 11 6 20 7
</values> </instantiation>