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 constraints67
Best CPU time to get the best result obtained on this benchmark0.828873
(Un)Satisfiability was proved
Number of variables50
Number of constraints68
Maximum constraint arity3
Maximum domain size36
Number of constraints which are defined in extension68
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 PFC280541OPTIMUM 0.828873 0.857673
AbsconMax 109 EPFC280540OPTIMUM 0.965852 1.01928
aolibdvo 2007-01-17280538OPTIMUM 1.23781 1.24702
aolibpvo 2007-01-17280537OPTIMUM 5.50716 5.51059
Toolbar_BTD 2007-01-12280544OPTIMUM 24.2433 24.2881
Toulbar2 2007-01-12280542OPTIMUM 24.5003 24.6013
toolbar 2007-01-12280545OPTIMUM 25.4691 25.5938
CSP4J - MaxCSP 2006-12-19280539? (problem) 1.3388 1.39518
Toolbar_MaxSat 2007-01-19280543? (exit code) 1.46978 1.48469