MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/pedigree/
normalized-pedck60-L12_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/pedigree/
normalized-pedck60-L12_ext.xml
MD5SUM830c54b62ac04459a017a66b311dea62
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints6
Best CPU time to get the best result obtained on this benchmark0.342947
Satisfiable
(Un)Satisfiability was proved
Number of variables61
Number of constraints108
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension108
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-271127182OPTIMUM6 0.030995 0.0305259
toulbar2/BTD 2008-06-271127181OPTIMUM6 0.342947 0.348561
Sugar++ v1.13+minisat-inc1127179OPTIMUM6 1.46278 1.62108
Sugar v1.13+minisat1127180OPTIMUM6 1.57176 1.72076
AbsconMax 112 pc-d1127178OPTIMUM6 92.5339 183.359
AbsconMax 112 pc-w1127177OPTIMUM6 144.251 307.57
Concrete + CSP4J - Tabu Engine 2008-05-301127176MSAT (TO)6 3600.07 3601.92
Concrete + CSP4J - MCRW Engine 2008-05-301127175MSAT (TO)6 3600.08 3633.32

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: 6
Solution found:
1 1 1 5 4 4 8 1 0 4 4 1 1 4 5 1 0 4 5 1 1 4 1 4 5 0 0 4 4 4 1 5 1 4 6 1 1 4 1 4 4 4 1 4 4 4 4 1 1 1 4 1 4 4 1 4 1 4 4 1 -1