2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

Result page for benchmark
Quasigroups/
QuasiGroup-4-09_c18.xml

Jump to solvers results

General information on the benchmark

NameQuasigroups/
QuasiGroup-4-09_c18.xml
MD5SUM32889b6f2e93f59096a50faf26931df2
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.137709
Satisfiable
(Un)Satisfiability was proved
Number of variables162
Number of constraints146
Number of domains2
Minimum domain size9
Maximum domain size81
Distribution of domain sizes[{"size":9,"count":81},{"size":81,"count":72}]
Minimum variable degree0
Maximum variable degree75
Distribution of variable degrees[{"degree":0,"count":9},{"degree":2,"count":72},{"degree":74,"count":9},{"degree":75,"count":72}]
Minimum constraint arity3
Maximum constraint arity82
Distribution of constraint arities[{"arity":3,"count":72},{"arity":9,"count":1},{"arity":81,"count":1},{"arity":82,"count":72}]
Number of extensional constraints0
Number of intensional constraints72
Distribution of constraint types[{"type":"intension","count":72},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":72}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-2.0 2018-08-01 (complete)4303909SAT 0.137709 0.13823
macht 2018.06.11 (complete)4295838SAT 0.201643 0.201925
macht 2018.07.27 (complete)4305876SAT 0.202467 0.202827
Mistral-2.0 2018-06-15 (complete)4289687SAT 0.330142 0.335312
BTD_12 2018-06-11_12 (complete)4295833SAT 0.737616 0.741921
BTD_12 2018.07.27_12 (complete)4306112SAT 0.759659 0.759791
BTD 2018.06.11_3 (complete)4295834SAT 1.05202 1.05219
BTD 2018.07.27_3 (complete)4306348SAT 1.15209 1.15637
Choco-solver 4.0.7 seq (493a269) (complete)4292553SAT 1.60853 0.704881
Choco-solver 4.0.7b seq (e747e1e) (complete)4306847SAT 1.66668 0.718369
PicatSAT 2018-08-14 (complete)4309663SAT 3.06989 3.07414
PicatSAT 2018-08-02 (complete)4303323SAT 3.19274 3.23046
PicatSAT 2018-06-15 (complete)4295839SAT 3.20712 3.20772
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308141SAT 3.28988 1.66461
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311877SAT 3.43594 1.68861
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290597SAT 3.60895 1.75215
scop both+MapleCOMSPS (2018-06-13) (complete)4295840SAT 9.43484 3.52524
scop order+MapleCOMSPS (2018-06-13) (complete)4295841SAT 9.45432 3.55655
scop order+MapleCOMSPS (2018-07-31) (complete)4305404SAT 10.4977 4.32835
scop both+MapleCOMSPS (2018-07-31) (complete)4305640SAT 10.786 4.56797
Concrete 3.8 2018-06-13 (complete)4295835SAT 11.9958 5.16632
OscaR - Conflict Ordering 2018-08-14 (complete)4307642SAT 12.4905 10.5725
Concrete 3.9.2-SuperNG (complete)4305246SAT 13.2917 5.55835
OscaR - Conflict Ordering 2018-07-02 (complete)4290821SAT 13.5696 11.3075
Concrete 3.9.2 (complete)4305245SAT 13.7059 5.8278
Concrete 3.8-SuperNG 2018-06-13 (complete)4295836SAT 14.2307 5.94463
cosoco 1.12 (complete)4295837SAT 16.9322 16.9341
Sat4j-CSP 2018-07-11 (complete)4290110? (TO) 2400.07 2393.44

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[0][7] x[0][8] x[1][0] x[1][1] x[1][2]
x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[3][0] x[3][1]
x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[5][0]
x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8]
x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7]
x[8][8] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[0][7] y[0][8] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6]
y[1][7] y[1][8] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[3][0] y[3][1] y[3][2] y[3][3] y[3][4] y[3][5]
y[3][6] y[3][7] y[3][8] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[4][7] y[4][8] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4]
y[5][5] y[5][6] y[5][7] y[5][8] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] y[6][7] y[6][8] y[7][0] y[7][1] y[7][2] y[7][3]
y[7][4] y[7][5] y[7][6] y[7][7] y[7][8] y[8][0] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] </list> <values> 0 2 7 8 1 3
4 5 6 3 1 5 7 6 4 0 8 2 4 7 2 1 0 8 5 6 3 7 6 0 3 8 2 1 4 5 5 3 6 2 4 7 8 0 1 8 0 1 6 3 5 7 2 4 2 8 3 4 5 0 6 1 7 6 4 8 5 2 1 3 7 0 1 5 4 0
7 6 2 3 8 * 29 43 71 46 75 22 59 15 21 * 68 61 33 4 72 44 47 67 52 * 1 54 17 32 78 39 79 69 9 * 26 56 37 49 5 14 57 6 74 * 34 53 18 64 35 36
73 24 66 * 7 11 58 38 8 48 13 77 63 * 28 25 51 76 62 41 2 19 12 * 27 55 23 31 45 16 42 65 3 * </values> </instantiation>