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

Result page for benchmark
Primes/
Primes-m1-p25/Primes-25-60-3-7.xml

Jump to solvers results

General information on the benchmark

NamePrimes/
Primes-m1-p25/Primes-25-60-3-7.xml
MD5SUMcb02fe1604c5e2402c2e6090aa48ef6c
Bench CategoryCSP (decision problem)
Best result obtained on this benchmark
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints60
Number of domains1
Minimum domain size96
Maximum domain size96
Distribution of domain sizes[{"size":96,"count":97}]
Minimum variable degree0
Maximum variable degree11
Distribution of variable degrees[{"degree":0,"count":3},{"degree":1,"count":4},{"degree":2,"count":14},{"degree":3,"count":20},{"degree":4,"count":25},{"degree":5,"count":13},{"degree":6,"count":10},{"degree":7,"count":8},{"degree":8,"count":1},{"degree":10,"count":1},{"degree":11,"count":1}]
Minimum constraint arity3
Maximum constraint arity10
Distribution of constraint arities[{"arity":3,"count":6},{"arity":4,"count":7},{"arity":5,"count":12},{"arity":6,"count":1},{"arity":7,"count":9},{"arity":8,"count":7},{"arity":9,"count":9},{"arity":10,"count":9}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":60}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
miniBTD 19.06.16 (complete)4391959? 2400 2399.87
NACRE 1.0.5-Hybrid (complete)4391559? (TO) 2400.03 2400.41
cosoco 2 (complete)4390159? (TO) 2400.03 2399.8
cosoco 2.0 (complete)4408699? (TO) 2400.04 2400.2
NACRE 1.0.5 (complete)4391759? (TO) 2400.04 2400.11
cosoco 2.0 (complete)4397439? (TO) 2400.06 2400.11
(reference) PicatSAT 2019-09-12 (complete)4407684? (TO) 2400.07 2399.8

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: