MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
pseudoSeries/
ssa/ssa-0432-003.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/
ssa/ssa-0432-003.xml
MD5SUMdc9e2f6f8ccdc90333d37df61624232c
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints1457
Best CPU time to get the best result obtained on this benchmark164.92
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables870
Number of constraints1458
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension1458
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
AbsconMax 109 EPFC275729OPTIMUM 164.92 166.086
AbsconMax 109 PFC275730OPTIMUM 1339.43 1351.87
CSP4J - MaxCSP 2006-12-19275728MSAT (TO) 2400.04 2411.23