2018 XCSP3 competition: parallel solvers tracks: solvers results per benchmarks

Result page for benchmark
Rlfap/Rlfap-dec-scens11/
Rlfap-scen-11-f12_c18.xml

Jump to solvers results

General information on the benchmark

NameRlfap/Rlfap-dec-scens11/
Rlfap-scen-11-f12_c18.xml
MD5SUM3a3bda421e3d420e405b4b910599d042
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.9557
Satisfiable
(Un)Satisfiability was proved
Number of variables680
Number of constraints4103
Number of domains5
Minimum domain size6
Maximum domain size32
Distribution of domain sizes[{"size":6,"count":2},{"size":17,"count":4},{"size":22,"count":10},{"size":27,"count":336},{"size":32,"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
scop both+glucose-syrup (2018-07-07) (complete)4297344UNSAT 16.9557 5.95718
scop order+glucose-syrup (2018-07-07) (complete)4297108UNSAT 17.3288 5.92617
scop both+glucose-syrup (2018-07-31) (complete)4307528UNSAT 19.2241 7.09064
scop order+glucose-syrup (2018-07-31) (complete)4307292UNSAT 19.3865 7.14802
Choco-solver 4.0.7b par (e747e1e) (complete)4297892UNSAT 36.3726 6.74006
OscaR - Parallel with EPS 2018-08-14 (complete)4309248UNSAT 117.064 17.3632
OscaR - Parallel with EPS 2018-07-02 (complete)4291846UNSAT 123.141 18.9708

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: