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

Result page for benchmark
Primes/
Primes-m1-p25/Primes-25-80-2-7.xml

Jump to solvers results

General information on the benchmark

NamePrimes/
Primes-m1-p25/Primes-25-80-2-7.xml
MD5SUM9c56925ad46dd74394de0f8e05e9e1a1
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.012065
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints80
Number of domains1
Minimum domain size96
Maximum domain size96
Distribution of domain sizes[{"size":96,"count":100}]
Minimum variable degree1
Maximum variable degree12
Distribution of variable degrees[{"degree":1,"count":9},{"degree":2,"count":14},{"degree":3,"count":17},{"degree":4,"count":17},{"degree":5,"count":13},{"degree":6,"count":12},{"degree":7,"count":9},{"degree":8,"count":3},{"degree":9,"count":3},{"degree":11,"count":2},{"degree":12,"count":1}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":13},{"arity":3,"count":10},{"arity":4,"count":11},{"arity":5,"count":3},{"arity":6,"count":11},{"arity":7,"count":6},{"arity":8,"count":16},{"arity":9,"count":10}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":80}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
BTD 19.07.01 (complete)4386815SAT 0.012065 0.0123601
cosoco 2.0 (complete)4408009SAT 0.01503 0.016358
cosoco 2 (complete)4389469SAT 0.015376 0.017493
cosoco 2.0 (complete)4396749SAT 0.015419 0.0166661
cosoco 2.O parallel (complete)4398029SAT 0.091374 0.037445
cosoco 2.0 parallel (complete)4409289SAT 0.099734 0.036329
choco-solver 2019-09-24 (complete)4405829SAT 1.38729 0.763946
choco-solver 2019-06-14 (complete)4392969SAT 2.41999 1.6009
choco-solver 2019-09-20 (complete)4403429SAT 2.48518 1.46485
choco-solver 2019-09-16 (complete)4398929SAT 2.75233 1.64433
AbsCon 2019-07-23 (complete)4390569SAT 3.36608 2.21056
choco-solver 2019-09-16 parallel (complete)4399529SAT 4.2472 2.32875
choco-solver 2019-09-24 parallel (complete)4406729SAT 4.50792 2.36856
choco-solver 2019-06-14 parallel (complete)4393569SAT 4.56343 2.38314
choco-solver 2019-09-20 parallel (complete)4404329SAT 4.8925 2.98081
Concrete 3.12.3 (complete)4402529SAT 5.50523 2.84125
Concrete 3.10 (complete)4387281SAT 6.06204 2.84807
Concrete 3.12.2 (complete)4400729SAT 6.26867 2.91304
Concrete 3.12.2 (complete)4395849SAT 6.35615 2.97487
PicatSAT 2019-09-12 (complete)4394949SAT 9.13071 9.13142
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388023SAT 18.122 14.309
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405529SAT 42.3536 23.9721
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392669SAT 42.8401 24.6551
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388022? (NS) 2154.84 601.36
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392369? (NS) 11049.4 1573.08
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405229? (NS) 11141.2 1575.07

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> 23 37 5 53 67 31 37 61 97 79 41 5 53 29 43 3
53 3 83 37 37 67 61 11 19 13 41 89 61 31 11 5 83 23 71 61 67 17 37 61 11 89 79 71 29 41 89 97 53 73 43 3 59 13 17 89 41 73 79 17 13 2 29 5
37 13 79 11 43 19 97 73 19 73 47 61 29 47 67 2 41 23 3 7 43 29 7 3 11 97 19 31 3 67 47 41 3 37 71 47 </values> </instantiation>