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

Result page for benchmark
SchurrLemma/SchurrLemma-mod-s1/
SchurrLemma-mod-030-9.xml

Jump to solvers results

General information on the benchmark

NameSchurrLemma/SchurrLemma-mod-s1/
SchurrLemma-mod-030-9.xml
MD5SUMa570971bdea1b5dac7f2a8202873b646
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark8.44943
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints210
Number of domains1
Minimum domain size9
Maximum domain size9
Distribution of domain sizes[{"size":9,"count":30}]
Minimum variable degree14
Maximum variable degree28
Distribution of variable degrees[{"degree":14,"count":1},{"degree":15,"count":2},{"degree":16,"count":2},{"degree":17,"count":2},{"degree":18,"count":2},{"degree":19,"count":2},{"degree":20,"count":2},{"degree":21,"count":4},{"degree":22,"count":2},{"degree":23,"count":2},{"degree":24,"count":2},{"degree":25,"count":2},{"degree":26,"count":2},{"degree":27,"count":2},{"degree":28,"count":1}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":210}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"allDifferent","count":210}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Naxos 1.1.0 (complete)4252622UNSAT 8.44943 8.45008
miniBTD 2017-06-30 (complete)4252620UNSAT 31.9944 31.9929
miniBTD 2017-08-10 (complete)4265026UNSAT 33.1731 33.176498
cosoco-mini 1.1 (2017-07-29) (complete)4260286UNSAT 50.066002 50.144901
cosoco-mini 1.12 (complete)4267467UNSAT 50.381401 50.378201
cosoco-mini 1.1 (2017-06-27) (complete)4252621UNSAT 51.0515 51.0489

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: