MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
rlfap/rlfapGraphs/
graph5.xml

Jump to solvers results

General information on the benchmark

Namerlfap/rlfapGraphs/
graph5.xml
MD5SUMb509eeceb1ac41f35f546685c5462d75
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints1129
Best CPU time to get the best result obtained on this benchmark2041.34
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables200
Number of constraints1134
Maximum constraint arity2
Maximum domain size44
Number of constraints which are defined in extension0
Number of constraints which are defined in intension1134
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275082OPTIMUM 2041.34 2060.7
AbsconMax 109 EPFC275081MSAT (TO) 2400.15 2403.08
CSP4J - MaxCSP 2006-12-19275080? (problem) 3.2965 3.38554