MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints3
Best CPU time to get the best result obtained on this benchmark670.579
(Un)Satisfiability was proved
Number of variables20
Number of constraints5
Maximum constraint arity10
Maximum domain size10
Number of constraints which are defined in extension5
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 PFC280334OPTIMUM 670.579 671.035
AbsconMax 109 EPFC280333OPTIMUM 1986.79 1988.17
CSP4J - MaxCSP 2006-12-19280332? 0.503922 0.683859
Toolbar_MaxSat 2007-01-19280336? (exit code) 0.041992 0.0853501
toolbar 2007-01-12280338? (exit code) 0.045992 0.059585
Toolbar_BTD 2007-01-12280337? (exit code) 0.049992 0.083529
Toulbar2 2007-01-12280335? (TO) 2400.05 2402.1
aolibpvo 2007-01-17280330Signal 0.003999 0.0089089
aolibdvo 2007-01-17280331Signal 0.004998 0.0126459