2018 XCSP3 competition: mini-solvers track: solvers results per benchmarks

Result page for benchmark
Rlfap_mini/Rlfap-dec-scens11_mini/
Rlfap-ext-scen-11-f04_c18.xml

Jump to solvers results

General information on the benchmark

NameRlfap_mini/Rlfap-dec-scens11_mini/
Rlfap-ext-scen-11-f04_c18.xml
MD5SUM297c804b8c4092219cf99e305dde67fa
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 benchmark4.84628
Satisfiable
(Un)Satisfiability was proved
Number of variables680
Number of constraints4103
Number of domains5
Minimum domain size6
Maximum domain size40
Distribution of domain sizes[{"size":6,"count":2},{"size":22,"count":14},{"size":33,"count":336},{"size":40,"count":328}]
Minimum variable degree1
Maximum variable degree62
Distribution of variable degrees[{"degree":1,"count":1},{"degree":3,"count":26},{"degree":4,"count":13},{"degree":5,"count":86},{"degree":6,"count":20},{"degree":7,"count":89},{"degree":8,"count":12},{"degree":9,"count":87},{"degree":10,"count":28},{"degree":11,"count":42},{"degree":12,"count":25},{"degree":13,"count":40},{"degree":14,"count":14},{"degree":15,"count":40},{"degree":16,"count":8},{"degree":17,"count":29},{"degree":18,"count":6},{"degree":19,"count":18},{"degree":20,"count":13},{"degree":21,"count":11},{"degree":22,"count":7},{"degree":23,"count":7},{"degree":24,"count":8},{"degree":25,"count":8},{"degree":27,"count":9},{"degree":28,"count":8},{"degree":29,"count":2},{"degree":30,"count":6},{"degree":31,"count":1},{"degree":35,"count":3},{"degree":36,"count":3},{"degree":38,"count":2},{"degree":39,"count":2},{"degree":42,"count":1},{"degree":43,"count":1},{"degree":44,"count":1},{"degree":47,"count":1},{"degree":55,"count":1},{"degree":62,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":4103}]
Number of extensional constraints4103
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":4103}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
NACRE 1.0.4 (complete)4298096UNSAT 4.84628 4.85655
cosoco 1.12 (complete)4298093UNSAT 29.5481 29.5566
miniBTD_12 2018.07.27_12 (complete)4301022UNSAT 223.471 223.508
miniBTD 2018.07.27_3 (complete)4301198UNSAT 230.645 230.674
minimacht 2018.07.27 (complete)4300846UNSAT 330.11 330.125
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4298098? (TO) 2520.04 2505.81
GG's minicp 2018-04-29 (complete)4298094? (TO) 2520.05 2505.82
slowpoke 2018-04-29 (incomplete)4298097? (TO) 2520.05 2508.41
The dodo solver 2018-04-29 (complete)4298100? (TO) 2520.09 2484.31
MiniCPFever 2018-04-29 (complete)4298095? (TO) 2520.09 2470.42
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4298099? (TO) 2520.1 2505.51

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: