MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/rand-3-20-20/
normalized-rand-3-20-20-60-632-6_ext.xml
MD5SUM0f1b884dfd1924af2bb3a0367831bfe2
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 benchmark228.629
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints60
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension60
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-271112110OPTIMUM1 178.494 179.736
toulbar2/BTD 2008-06-271112109OPTIMUM1 228.629 234.452
Sugar v1.13+minisat1112108OPTIMUM1 547.464 552.903
Sugar++ v1.13+minisat-inc1112107OPTIMUM1 641.437 645.594
AbsconMax 112 pc-w1112105OPTIMUM1 2395.7 2426.86
Concrete + CSP4J - Tabu Engine 2008-05-301112104MSAT (TO)1 3600.03 3601.43
Concrete + CSP4J - MCRW Engine 2008-05-301112103MSAT (TO)1 3600.09 3601.52
AbsconMax 112 pc-d1112106MSAT (TO)2 3600.13 3605.33

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:
0 2 15 15 6 7 10 18 17 0 10 9 14 10 11 15 0 3 6 19