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

Result page for benchmark
Rlfap/
Rlfap-m1-scens11/Rlfap-scen-11-f04.xml

Jump to solvers results

General information on the benchmark

NameRlfap/
Rlfap-m1-scens11/Rlfap-scen-11-f04.xml
MD5SUM3c3f91fe2d5d1aa7af585cdf812638b5
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 benchmark16.9607
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 constraints0
Number of intensional constraints4103
Distribution of constraint types[{"type":"intension","count":4103}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4387608UNSAT 16.9607 7.42333
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4387609UNSAT 17.2812 7.60277
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405173UNSAT 21.8736 7.58161
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392613UNSAT 22.2523 7.745
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405473UNSAT 22.4104 7.61922
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392313UNSAT 22.671 7.69507
cosoco 2.0 (complete)4407953UNSAT 27.7175 27.7211
cosoco 2.0 (complete)4396693UNSAT 28.0063 28.0121
cosoco 2 (complete)4389413UNSAT 31.4444 31.4448
PicatSAT 2019-09-12 (complete)4394893UNSAT 50.173 50.1786
BTD 19.07.01 (complete)4386677UNSAT 52.233 52.3595
AbsCon 2019-07-23 (complete)4390513UNSAT 63.0356 57.8737
cosoco 2.O parallel (complete)4397973UNSAT 130.735 20.3113
cosoco 2.0 parallel (complete)4409233UNSAT 161.859 24.1835
choco-solver 2019-09-24 (complete)4405773UNSAT 297.204 289.631
Concrete 3.10 (complete)4387022UNSAT 1311.07 1275.87
Concrete 3.12.3 (complete)4402473UNSAT 1484.95 1450.82
Concrete 3.12.2 (complete)4400673UNSAT 1489.64 1455.3
choco-solver 2019-09-20 (complete)4403373UNSAT 2091.45 526.176
choco-solver 2019-09-16 (complete)4398873UNSAT 2118.27 533.245
choco-solver 2019-06-14 (complete)4392913UNSAT 2212.98 556.812
choco-solver 2019-09-16 parallel (complete)4399473UNSAT 4074.1 513.682
choco-solver 2019-09-24 parallel (complete)4406673UNSAT 4076.92 516.011
choco-solver 2019-09-20 parallel (complete)4404273UNSAT 4199.9 531.239
choco-solver 2019-06-14 parallel (complete)4393513UNSAT 4631.15 583.012
Concrete 3.12.2 (complete)4395793? (TO) 2520.13 2471.47

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: