MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
fapp/fapp36-40/fapp39/
fapp39-2750-2.xml

Jump to solvers results

General information on the benchmark

Namefapp/fapp36-40/fapp39/
fapp39-2750-2.xml
MD5SUMb2c8a831f9d033b4a9ad8eac1f5cc450
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkMSAT TO
Best Number of satisfied constraints20689
Best CPU time to get the best result obtained on this benchmark2400.06
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables2750
Number of constraints23154
Maximum constraint arity2
Maximum domain size502
Number of constraints which are defined in extension0
Number of constraints which are defined in intension23154
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 EPFC275609MSAT (TO) 2400.06 2418.16
AbsconMax 109 PFC275610MSAT (TO) 2400.18 2422.33
CSP4J - MaxCSP 2006-12-19275608? 63.0204 63.2251