MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
rlfap/rlfapGraphsMod/
graph13-w1.xml

Jump to solvers results

General information on the benchmark

Namerlfap/rlfapGraphsMod/
graph13-w1.xml
MD5SUM0f8e3bd5588672ca520e9a21c0eea254
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMSAT TO
Best Number of satisfied constraints1467
Best CPU time to get the best result obtained on this benchmark2400.07
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables916
Number of constraints1479
Maximum constraint arity2
Maximum domain size44
Number of constraints which are defined in extension0
Number of constraints which are defined in intension1479
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC275058MSAT (TO) 2400.07 2402.81
CSP4J - MaxCSP 2006-12-19275056MSAT (TO) 2400.09 2411.68
AbsconMax 109 EPFC275057MSAT (TO) 2400.1 2422