MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
fapp/fapp11-15/fapp15/
fapp15-3000-4.xml

Jump to solvers results

General information on the benchmark

Namefapp/fapp11-15/fapp15/
fapp15-3000-4.xml
MD5SUM9e78c37f84975ac2cde8c3ed71f26ee9
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMSAT TO
Best Number of satisfied constraints31270
Best CPU time to get the best result obtained on this benchmark2400.14
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables3000
Number of constraints33021
Maximum constraint arity2
Maximum domain size182
Number of constraints which are defined in extension0
Number of constraints which are defined in intension33021
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 EPFC275261MSAT (TO) 2400.14 2422.01
AbsconMax 109 PFC275262MSAT (TO) 2400.16 2421.67
CSP4J - MaxCSP 2006-12-19275260? (problem) 988.472 990.025