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

Result page for benchmark
Primes/
Primes-m1-p15/Primes-15-60-3-5.xml

Jump to solvers results

General information on the benchmark

NamePrimes/
Primes-m1-p15/Primes-15-60-3-5.xml
MD5SUMcb28c088349c564a44b865f26515e86f
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 size46
Maximum domain size46
Distribution of domain sizes[{"size":46,"count":99}]
Minimum variable degree0
Maximum variable degree8
Distribution of variable degrees[{"degree":0,"count":1},{"degree":1,"count":14},{"degree":2,"count":13},{"degree":3,"count":22},{"degree":4,"count":24},{"degree":5,"count":17},{"degree":6,"count":6},{"degree":7,"count":2},{"degree":8,"count":1}]
Minimum constraint arity3
Maximum constraint arity8
Distribution of constraint arities[{"arity":3,"count":5},{"arity":4,"count":10},{"arity":5,"count":15},{"arity":6,"count":8},{"arity":7,"count":9},{"arity":8,"count":13}]
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
cosoco-mini 1.1 (2017-07-29) (complete)4260194? (TO) 2400 2400.1001
miniBTD 2017-08-10 (complete)4264934? (TO) 2400.01 2400.2
Naxos 1.1.0 (complete)4253091? (TO) 2400.04 2400
cosoco-mini 1.1 (2017-06-27) (complete)4253090? (TO) 2400.06 2400.1
miniBTD 2017-06-30 (complete)4253089? (TO) 2400.06 2400.4
cosoco-mini 1.12 (complete)4267375? (TO) 2400.0601 2399.8999

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: