MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
rlfap/
rlfapSubs/scen06-sub0.xml

Jump to solvers results

General information on the benchmark

Namerlfap/
rlfapSubs/scen06-sub0.xml
MD5SUM7cdeeef4054c013f703ddee7bf272037
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints217
Best CPU time to get the best result obtained on this benchmark1377.83
SatisfiableNO
(Un)Satisfiability was proved
Number of variables32
Number of constraints223
Maximum constraint arity2
Maximum domain size44
Number of constraints which are defined in extension0
Number of constraints which are defined in intension223
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 EPFC280295OPTIMUM 1377.83 1379.53
AbsconMax 109 PFC280296OPTIMUM 1738.19 1748.74
CSP4J - MaxCSP 2006-12-19280294MSAT (TO) 2400.03 2403.57