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

Result page for benchmark
Primes/
Primes-m1-p10/Primes-10-60-3-5.xml

Jump to solvers results

General information on the benchmark

NamePrimes/
Primes-m1-p10/Primes-10-60-3-5.xml
MD5SUMbe3388c5d29b2a85b1452e4a694387b2
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.312103
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints60
Number of domains1
Minimum domain size28
Maximum domain size28
Distribution of domain sizes[{"size":28,"count":99}]
Minimum variable degree0
Maximum variable degree8
Distribution of variable degrees[{"degree":0,"count":1},{"degree":1,"count":14},{"degree":2,"count":13},{"degree":3,"count":22},{"degree":4,"count":24},{"degree":5,"count":17},{"degree":6,"count":6},{"degree":7,"count":2},{"degree":8,"count":1}]
Minimum constraint arity3
Maximum constraint arity8
Distribution of constraint arities[{"arity":3,"count":5},{"arity":4,"count":10},{"arity":5,"count":15},{"arity":6,"count":8},{"arity":7,"count":9},{"arity":8,"count":13}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":60}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 19.06.16 (complete)4391809SAT 0.312103 0.312445
cosoco 2.0 (complete)4397289SAT 0.330886 0.331296
cosoco 2 (complete)4390009SAT 0.331235 0.331611
cosoco 2.0 (complete)4408549SAT 0.335485 0.335658
NACRE 1.0.5 (complete)4391609SAT 2.20573 2.20602
NACRE 1.0.5-Hybrid (complete)4391409SAT 16.8206 16.8367
(reference) PicatSAT 2019-09-12 (complete)4407691SAT 38.764 38.7674

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] x[35] x[36] x[37] x[38] x[39] x[40]
x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63]
x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[80] x[81] x[82] x[83] x[84] x[85] x[86]
x[87] x[88] x[89] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] </list> <values> 7 17 19 13 7 13 17 5 29 3 5 19 2 29 7 17 2 17
5 17 3 23 19 29 5 2 5 7 19 13 29 5 5 23 29 19 7 17 3 5 29 7 3 29 11 19 23 11 13 2 7 17 3 2 17 7 5 2 17 3 13 13 11 19 17 13 17 29 7 19 11 13
5 13 11 19 11 2 7 2 19 23 17 23 23 11 7 3 11 29 5 2 17 23 29 5 17 17 11 29 </values> </instantiation>