MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/rand-3-20-20/
normalized-rand-3-20-20-60-632-35_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/rand-3-20-20/
normalized-rand-3-20-20-60-632-35_ext.xml
MD5SUM508714bde231e40d4eeec9f003400a13
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 benchmark202.107
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints57
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension57
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
toulbar2 2008-06-271112118OPTIMUM1 185.649 187.79
toulbar2/BTD 2008-06-271112117OPTIMUM1 202.107 204.043
AbsconMax 112 pc-w1112113OPTIMUM1 231.383 234.05
Sugar v1.13+minisat1112116OPTIMUM1 544.719 550.801
Sugar++ v1.13+minisat-inc1112115OPTIMUM1 2050.38 2070.22
Concrete + CSP4J - Tabu Engine 2008-05-301112112MSAT (TO)1 3600.04 3621.22
Concrete + CSP4J - MCRW Engine 2008-05-301112111MSAT (TO)1 3600.09 3625.42
AbsconMax 112 pc-d1112114MSAT (TO)2 3600.16 3625.16

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:
6 7 0 13 16 7 17 17 15 5 10 7 11 10 13 12 0 4 17 0