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

Result page for benchmark
QRandom/
QRandom-geometric-rw/geometric-50-20-d4-75-76.xml

Jump to solvers results

General information on the benchmark

NameQRandom/
QRandom-geometric-rw/geometric-50-20-d4-75-76.xml
MD5SUM67696fc72ebd3977eb7611ca6505cd00
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.043006
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints365
Number of domains1
Minimum domain size20
Maximum domain size20
Distribution of domain sizes[{"size":20,"count":50}]
Minimum variable degree6
Maximum variable degree22
Distribution of variable degrees[{"degree":6,"count":1},{"degree":10,"count":4},{"degree":11,"count":2},{"degree":12,"count":6},{"degree":13,"count":7},{"degree":14,"count":7},{"degree":15,"count":5},{"degree":16,"count":5},{"degree":17,"count":3},{"degree":18,"count":2},{"degree":19,"count":4},{"degree":20,"count":2},{"degree":21,"count":1},{"degree":22,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":365}]
Number of extensional constraints365
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":365}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
BTD 19.07.01 (complete)4386745SAT 0.043006 0.043403
cosoco 2.0 (complete)4407908SAT 0.103879 0.109594
cosoco 2 (complete)4389368SAT 0.104653 0.109421
cosoco 2.0 (complete)4396648SAT 0.10548 0.108367
cosoco 2.0 parallel (complete)4409188SAT 0.142563 0.139074
cosoco 2.O parallel (complete)4397928SAT 0.162566 0.157025
PicatSAT 2019-09-12 (complete)4394848SAT 0.25068 0.250884
choco-solver 2019-09-24 (complete)4405728SAT 1.86745 0.764888
choco-solver 2019-09-20 (complete)4403328SAT 3.08163 1.10026
choco-solver 2019-06-14 (complete)4392868SAT 3.13531 1.12077
choco-solver 2019-09-16 (complete)4398828SAT 3.1839 1.13048
AbsCon 2019-07-23 (complete)4390468SAT 4.27052 2.40877
choco-solver 2019-06-14 parallel (complete)4393468SAT 4.65755 1.39291
choco-solver 2019-09-24 parallel (complete)4406628SAT 4.70989 1.39436
choco-solver 2019-09-20 parallel (complete)4404228SAT 4.94086 1.41729
choco-solver 2019-09-16 parallel (complete)4399428SAT 5.18225 1.51026
Concrete 3.12.3 (complete)4402428SAT 7.47609 3.3637
Concrete 3.10 (complete)4387134SAT 8.36932 3.46814
Concrete 3.12.2 (complete)4400628SAT 8.43933 3.48629
Concrete 3.12.2 (complete)4395748SAT 8.90347 3.72795
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387813SAT 16.2737 6.44204
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405428SAT 16.8912 6.0097
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392268SAT 17.3707 6.01881
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387812SAT 17.5552 6.88096
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392568SAT 17.9197 6.21301
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405128SAT 19.4057 6.41522

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] </list> <values> 3 1 1 2 3 1 3 1 1 5 4 1 3 12 5 9 1 12 17 2 7 5 18 6 9 10 16 1 18 15 6
1 13 3 1 5 3 2 10 17 6 12 8 20 5 13 19 4 5 17 </values> </instantiation>