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

Result page for benchmark
MagicHexagon/MagicHexagon-m1-s1/
MagicHexagon-04-m018.xml

Jump to solvers results

General information on the benchmark

NameMagicHexagon/MagicHexagon-m1-s1/
MagicHexagon-04-m018.xml
MD5SUMe1b631bab6f8bd4ad65377e678a0b81e
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 benchmark2.54992
Satisfiable
(Un)Satisfiability was proved
Number of variables49
Number of constraints28
Number of domains1
Minimum domain size37
Maximum domain size37
Distribution of domain sizes[{"size":37,"count":37}]
Minimum variable degree0
Maximum variable degree9
Distribution of variable degrees[{"degree":0,"count":12},{"degree":4,"count":31},{"degree":5,"count":3},{"degree":6,"count":2},{"degree":9,"count":1}]
Minimum constraint arity2
Maximum constraint arity37
Distribution of constraint arities[{"arity":2,"count":6},{"arity":4,"count":6},{"arity":5,"count":6},{"arity":6,"count":6},{"arity":7,"count":3},{"arity":37,"count":1}]
Number of extensional constraints0
Number of intensional constraints6
Distribution of constraint types[{"type":"intension","count":6},{"type":"allDifferent","count":1},{"type":"sum","count":21}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2.O parallel (complete)4397975SAT 2.54992 0.333929
cosoco 2.0 parallel (complete)4409235SAT 2.91543 0.379374
cosoco 2.0 (complete)4407955SAT 4.56223 4.56642
cosoco 2 (complete)4389415SAT 4.60566 4.60743
cosoco 2.0 (complete)4396695SAT 4.60974 4.60943
choco-solver 2019-09-24 (complete)4405775SAT 5.41157 2.04082
AbsCon 2019-07-23 (complete)4390515SAT 5.79909 4.08097
choco-solver 2019-09-16 (complete)4398875SAT 8.44593 2.54407
BTD 19.07.01 (complete)4386832SAT 9.81931 9.82496
choco-solver 2019-09-20 (complete)4403375SAT 10.0731 2.84157
choco-solver 2019-06-14 (complete)4392915SAT 10.1513 2.88823
choco-solver 2019-06-14 parallel (complete)4393515SAT 15.1618 2.43099
choco-solver 2019-09-24 parallel (complete)4406675SAT 19.4919 3.46705
choco-solver 2019-09-20 parallel (complete)4404275SAT 20.4025 3.15751
choco-solver 2019-09-16 parallel (complete)4399475SAT 25.1657 3.67918
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388074SAT 46.1515 41.4794
Concrete 3.10 (complete)4387313SAT 53.519 43.324
Concrete 3.12.2 (complete)4400675SAT 79.659 67.1389
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392315SAT 125.527 18.9368
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405175SAT 128.387 19.5033
PicatSAT 2019-09-12 (complete)4394895SAT 140.299 140.304
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388073SAT 158.591 153.312
Concrete 3.12.3 (complete)4402475SAT 167.081 153.189
Concrete 3.12.2 (complete)4395795SAT 204.004 187.15
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392615SAT 5348.73 719.499
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405475SAT 5357.66 713.186

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][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4]
x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0]
x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3]
x[6][4] x[6][5] x[6][6] </list> <values>-16 14 17 -15 * * * -1 -3 -7 -4 15 * * 9 6 1 4 -2 -18 * 8 -8 -5 -6 -10 3 18 -9 5 2 0 16 -14 * -11 7
10 11 -17 * * 12 -13 -12 13 * * * </values> </instantiation>