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

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

Jump to solvers results

General information on the benchmark

NameSchurrLemma/SchurrLemma-mod-s1/
SchurrLemma-mod-100-9.xml
MD5SUM4f03c112a8f6a228f13fa4574ba8a054
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 benchmark40.2139
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints2450
Number of domains1
Minimum domain size9
Maximum domain size9
Distribution of domain sizes[{"size":9,"count":100}]
Minimum variable degree49
Maximum variable degree98
Distribution of variable degrees[{"degree":49,"count":1},{"degree":50,"count":2},{"degree":51,"count":2},{"degree":52,"count":2},{"degree":53,"count":2},{"degree":54,"count":2},{"degree":55,"count":2},{"degree":56,"count":2},{"degree":57,"count":2},{"degree":58,"count":2},{"degree":59,"count":2},{"degree":60,"count":2},{"degree":61,"count":2},{"degree":62,"count":2},{"degree":63,"count":2},{"degree":64,"count":2},{"degree":65,"count":2},{"degree":66,"count":2},{"degree":67,"count":2},{"degree":68,"count":2},{"degree":69,"count":2},{"degree":70,"count":2},{"degree":71,"count":2},{"degree":72,"count":2},{"degree":73,"count":3},{"degree":74,"count":3},{"degree":75,"count":2},{"degree":76,"count":2},{"degree":77,"count":2},{"degree":78,"count":2},{"degree":79,"count":2},{"degree":80,"count":2},{"degree":81,"count":2},{"degree":82,"count":2},{"degree":83,"count":2},{"degree":84,"count":2},{"degree":85,"count":2},{"degree":86,"count":2},{"degree":87,"count":2},{"degree":88,"count":2},{"degree":89,"count":2},{"degree":90,"count":2},{"degree":91,"count":2},{"degree":92,"count":2},{"degree":93,"count":2},{"degree":94,"count":2},{"degree":95,"count":2},{"degree":96,"count":2},{"degree":97,"count":2},{"degree":98,"count":1}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":2450}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"allDifferent","count":2450}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Naxos 1.1.0 (complete)4252616UNSAT 40.2139 40.2152
miniBTD 2017-08-10 (complete)4265028UNSAT 316.33301 316.35101
miniBTD 2017-06-30 (complete)4252614UNSAT 317.905 317.859
cosoco-mini 1.1 (2017-07-29) (complete)4260288UNSAT 384.09399 384.19
cosoco-mini 1.12 (complete)4267469UNSAT 384.14801 384.315
cosoco-mini 1.1 (2017-06-27) (complete)4252615UNSAT 390.169 390.132

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: