MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
MaxCSP/planning/
mprime01ac_ext.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/planning/
mprime01ac_ext.xml
MD5SUM5c1b2e517af3e1ee681690c233f37d8a
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints13116
Best CPU time to get the best result obtained on this benchmark31.5392
Satisfiable
(Un)Satisfiability was proved
Number of variables208
Number of constraints13118
Maximum constraint arity2
Maximum domain size18
Number of constraints which are defined in extension13118
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
Toolbar_MaxSat 2007-01-19280714OPTIMUM 15.2057 15.3533
aolibpvo 2007-01-17280708OPTIMUM 31.5392 31.8385
AbsconMax 109 EPFC280711OPTIMUM 48.9046 49.2019
aolibdvo 2007-01-17280709OPTIMUM 70.5543 70.5735
Toulbar2 2007-01-12280713OPTIMUM 205.082 206.737
toolbar 2007-01-12280716OPTIMUM 206.49 208.308
Toolbar_BTD 2007-01-12280715OPTIMUM 206.661 208.459
AbsconMax 109 PFC280712OPTIMUM 402.08 402.528
CSP4J - MaxCSP 2006-12-19280710? 0.422935 0.483234