MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
rlfap/rlfapGraphs/
graph12.xml

Jump to solvers results

General information on the benchmark

Namerlfap/rlfapGraphs/
graph12.xml
MD5SUMbcaa2df6e1cf105739aab9f695d60b2f
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMSAT TO
Best Number of satisfied constraints3957
Best CPU time to get the best result obtained on this benchmark2400.11
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables680
Number of constraints4017
Maximum constraint arity2
Maximum domain size44
Number of constraints which are defined in extension0
Number of constraints which are defined in intension4017
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275073MSAT (TO) 2400.11 2423
AbsconMax 109 EPFC275072MSAT (TO) 2400.12 2402.89
CSP4J - MaxCSP 2006-12-19275071? (problem) 11.6742 11.8161