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

Result page for benchmark
AllInterval/AllInterval-m1-s1/
AllInterval-035.xml

Jump to solvers results

General information on the benchmark

NameAllInterval/AllInterval-m1-s1/
AllInterval-035.xml
MD5SUMfe30f006f3af9f6842518347a037ed7d
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 benchmark0.534362
Satisfiable
(Un)Satisfiability was proved
Number of variables69
Number of constraints36
Number of domains2
Minimum domain size34
Maximum domain size35
Distribution of domain sizes[{"size":34,"count":34},{"size":35,"count":35}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":36},{"degree":3,"count":33}]
Minimum constraint arity3
Maximum constraint arity35
Distribution of constraint arities[{"arity":3,"count":34},{"arity":34,"count":1},{"arity":35,"count":1}]
Number of extensional constraints0
Number of intensional constraints34
Distribution of constraint types[{"type":"intension","count":34},{"type":"allDifferent","count":2}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 2017-08-10 (complete)4264796SAT 0.27029201 0.27108499
miniBTD 2017-06-30 (complete)4252119SAT 0.274694 0.27547
Naxos 1.1.0 (complete)4252121SAT 0.534362 0.534971
cosoco-mini 1.12 (complete)4267237? (TO) 2400.03 2400.5
cosoco-mini 1.1 (2017-07-29) (complete)4260056? (TO) 2400.04 2400.21
cosoco-mini 1.1 (2017-06-27) (complete)4252120? (TO) 2400.06 2400

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] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] y[0] y[1] y[2] y[3] y[4] y[5] y[6]
y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16] y[17] y[18] y[19] y[20] y[21] y[22] y[23] y[24] y[25] y[26] y[27] y[28] y[29] y[30]
y[31] y[32] y[33] </list> <values> 34 0 33 1 32 2 31 3 30 4 29 5 28 6 27 7 26 8 25 9 24 10 23 11 22 12 21 13 20 14 19 15 18 16 17 34 33 32
31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 </values> </instantiation>