2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Subisomorphism/Subisomorphism-m1-LV/
Subisomorphism-g10-g47.xml

Jump to solvers results

General information on the benchmark

NameSubisomorphism/Subisomorphism-m1-LV/
Subisomorphism-g10-g47.xml
MD5SUM334d7669d2b71554b19d311723364262
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.095749
Satisfiable
(Un)Satisfiability was proved
Number of variables41
Number of constraints83
Number of domains1
Minimum domain size128
Maximum domain size128
Distribution of domain sizes[{"size":128,"count":41}]
Minimum variable degree2
Maximum variable degree11
Distribution of variable degrees[{"degree":2,"count":1},{"degree":3,"count":6},{"degree":4,"count":10},{"degree":5,"count":14},{"degree":6,"count":4},{"degree":7,"count":4},{"degree":10,"count":1},{"degree":11,"count":1}]
Minimum constraint arity1
Maximum constraint arity41
Distribution of constraint arities[{"arity":1,"count":2},{"arity":2,"count":80},{"arity":41,"count":1}]
Number of extensional constraints82
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":82},{"type":"allDifferent","count":1}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.5 (complete)4391580SAT 0.095749 0.096314
NACRE 1.0.5-Hybrid (complete)4391380SAT 0.108816 0.109476
cosoco 2 (complete)4389980SAT 0.220216 0.221715
cosoco 2.0 (complete)4397260SAT 0.221945 0.221567
cosoco 2.0 (complete)4408520SAT 0.252135 0.252841
miniBTD 19.06.16 (complete)4391780SAT 2.21223 2.21245
(reference) PicatSAT 2019-09-12 (complete)4407673SAT 16.7917 16.7917

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[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] </list> <values> 125
45 47 5 113 88 13 101 70 111 68 18 24 4 49 78 81 37 43 12 55 96 41 120 39 15 53 32 33 79 72 38 95 67 63 66 122 0 119 106 20 </values>
</instantiation>