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 constraints5
Best CPU time to get the best result obtained on this benchmark0.003998
(Un)Satisfiability was proved
Number of variables6
Number of constraints6
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension6
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
aolibdvo 2007-01-17280601OPTIMUM 0.003998 0.0107939
aolibpvo 2007-01-17280600OPTIMUM 0.003999 0.00590796
AbsconMax 109 EPFC280603OPTIMUM 0.655899 0.711449
AbsconMax 109 PFC280604OPTIMUM 0.686894 0.75469
Toolbar_MaxSat 2007-01-19280606OPTIMUM 0.849869 0.850616
Toulbar2 2007-01-12280605OPTIMUM 1.3378 1.34655
toolbar 2007-01-12280608OPTIMUM 1.43278 1.46196
Toolbar_BTD 2007-01-12280607OPTIMUM 1.48577 1.56778
CSP4J - MaxCSP 2006-12-19280602? (problem) 0.329949 0.368314