2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameRlfap_mini/Rlfap-dec-scens11_mini/
Rlfap-ext-scen-11-f02_c18.xml
MD5SUM7ac25fa9c4532324d4bc78edd5427656
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 benchmark39.1724
Satisfiable
(Un)Satisfiability was proved
Number of variables680
Number of constraints4103
Number of domains5
Minimum domain size6
Maximum domain size42
Distribution of domain sizes[{"size":6,"count":2},{"size":22,"count":10},{"size":23,"count":4},{"size":35,"count":336},{"size":42,"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
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388383UNSAT 39.1724 24.3882
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388382UNSAT 40.2702 24.4555
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405166UNSAT 44.6493 22.9129
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392606UNSAT 46.464 23.8493
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405466UNSAT 47.6631 23.313
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392306UNSAT 48.8258 23.516
PicatSAT 2019-09-12 (complete)4394886UNSAT 177.102 177.119
AbsCon 2019-07-23 (complete)4390506UNSAT 267.204 261.81
cosoco 2.0 (complete)4407946UNSAT 297.166 297.17
cosoco 2 (complete)4389406UNSAT 300.596 300.597
cosoco 2.0 (complete)4396686UNSAT 327.899 327.871
choco-solver 2019-09-24 (complete)4405766UNSAT 1433.96 1421.88
Concrete 3.10 (complete)4387511UNSAT 1660.84 1617.43
cosoco 2.O parallel (complete)4397966UNSAT 1920.78 241.162
Concrete 3.12.3 (complete)4402466UNSAT 2050.11 2005.26
cosoco 2.0 parallel (complete)4409226UNSAT 2071.25 259.989
Concrete 3.12.2 (complete)4400666UNSAT 2268.08 2223.04
choco-solver 2019-09-24 parallel (complete)4406666UNSAT 12715.1 1597.59
choco-solver 2019-06-14 parallel (complete)4393506UNSAT 13573.1 1705.71
choco-solver 2019-09-16 parallel (complete)4399466UNSAT 13949.2 1752.83
choco-solver 2019-09-20 parallel (complete)4404266UNSAT 13974.4 1755.44
BTD 19.07.01 (complete)4386935? (TO) 2519.92 2520.01
Concrete 3.12.2 (complete)4395786? (TO) 2520.08 2472.75
choco-solver 2019-09-16 (complete)4398866? (TO) 2520.34 634.213
choco-solver 2019-09-20 (complete)4403366? (TO) 2520.37 634.604
choco-solver 2019-06-14 (complete)4392906? (TO) 2520.51 634.597

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: