MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-200/
normalized-aim-200-2-0-unsat-4_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-2-0-unsat-4_ext.xml
MD5SUM7e5cea338ef01f45408046e9a75c44cc
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark3.34849
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints392
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension392
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1111241OPTIMUM1 3.34849 3.60503
Sugar v1.13+minisat1111242OPTIMUM1 4.99724 5.23746
toulbar2 2008-06-271111244OPTIMUM1 24.8642 25.0797
AbsconMax 112 pc-w1111239OPTIMUM1 38.9101 40.1452
toulbar2/BTD 2008-06-271111243OPTIMUM1 39.462 39.8238
Concrete + CSP4J - Tabu Engine 2008-05-301111238MSAT (TO)1 3600.01 3616.12
Concrete + CSP4J - MCRW Engine 2008-05-301111237MSAT (TO)1 3600.04 3612.02
AbsconMax 112 pc-d1111240MSAT (TO)1 3600.09 3681.46

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 1
Solution found:
1 0 1 0 0 1 1 1 0 0 0 1 0 1 0 0 1 1 1 1 1 1 1 0 1 1 0 1 0 1 0 1 1 1 1 1 1 0 1 0 1 1 0 1 1 0 1 1 0 0 1 1 1 1 1 1 0 1 1 0 0 1 1 0 0 0 0 0 0 1
1 1 1 1 0 1 0 1 1 1 1 1 0 0 1 0 1 1 0 1 1 1 1 1 1 1 0 0 0 1 1 1 0 1 0 1 1 1 1 1 0 0 1 1 1 1 0 1 0 1 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 0 0 1
1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 0 1 0 0 0 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1