2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Primes/
Primes-m1-p15/Primes-15-40-3-5.xml

Jump to solvers results

General information on the benchmark

NamePrimes/
Primes-m1-p15/Primes-15-40-3-5.xml
MD5SUM25f96b3bf5c8370c442a7a32cdfe0f98
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 benchmark208.669
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints40
Number of domains1
Minimum domain size46
Maximum domain size46
Distribution of domain sizes[{"size":46,"count":91}]
Minimum variable degree0
Maximum variable degree6
Distribution of variable degrees[{"degree":0,"count":9},{"degree":1,"count":19},{"degree":2,"count":29},{"degree":3,"count":25},{"degree":4,"count":15},{"degree":6,"count":3}]
Minimum constraint arity3
Maximum constraint arity8
Distribution of constraint arities[{"arity":3,"count":3},{"arity":4,"count":8},{"arity":5,"count":9},{"arity":6,"count":5},{"arity":7,"count":6},{"arity":8,"count":9}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":40}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Concrete 3.10 (complete)4387288SAT 208.669 198.386
Concrete 3.12.2 (complete)4400918SAT 355.635 346.122
AbsCon 2019-07-23 (complete)4390758SAT 406.692 403.793
choco-solver 2019-09-24 parallel (complete)4406918SAT 1322.8 167.107
choco-solver 2019-09-20 (complete)4403618SAT 2024.3 510.446
choco-solver 2019-09-16 (complete)4399118SAT 2036.83 513.812
PicatSAT 2019-09-12 (complete)4395138SAT 2444.64 2444.45
choco-solver 2019-09-16 parallel (complete)4399718SAT 4173.77 526.155
choco-solver 2019-09-20 parallel (complete)4404518SAT 4235.66 534.06
BTD 19.07.01 (complete)4386822? 2520.01 2519.96
cosoco 2.0 (complete)4396938? (TO) 2519.57 2520.01
cosoco 2 (complete)4389658? (TO) 2519.93 2520.01
cosoco 2.0 (complete)4408198? (TO) 2520.05 2519.9
Concrete 3.12.3 (complete)4402718? (TO) 2520.08 2480.44
choco-solver 2019-09-24 (complete)4406018? (TO) 2520.11 2483.81
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388044? (TO) 2520.12 2515.95
Concrete 3.12.2 (complete)4396038? (TO) 2520.16 2485.14
choco-solver 2019-06-14 (complete)4393158? (TO) 2520.39 635.401
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388043? (TO) 2520.44 2462.82
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405418? (TO) 2605.67 2520.44
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392558? (TO) 2609.8 2520.41
choco-solver 2019-06-14 parallel (complete)4393758? (TO) 17580.8 2520.03
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405718? (TO) 19116 2520.14
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392858? (TO) 19187.5 2520.12
cosoco 2.O parallel (complete)4398218? (TO) 19996.9 2520.02
cosoco 2.0 parallel (complete)4409478? (TO) 20001.7 2520.02

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 > <list> x[0] x[2] x[3] x[4] x[5] x[6] 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[21] x[22]
x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[31] x[32] x[33] x[34] x[35] 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[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[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[93] x[94] x[95] x[96] x[97]
x[98] x[99] </list> <values> 44 38 33 6 28 10 37 31 16 16 7 40 20 10 40 8 22 3 25 8 36 14 38 4 43 36 37 37 31 2 19 37 13 2 35 36 5 12 14 46
27 19 45 20 10 29 2 44 44 11 4 7 8 3 8 6 39 43 38 14 47 27 46 15 17 10 33 2 46 45 28 14 11 18 42 3 13 30 10 10 7 47 15 40 9 15 31 17 22 30
47 </values> </instantiation>