MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/pedigree/
normalized-pedck60-L1_ext.xml
MD5SUMe08809f446b18218f71ac6c97558ae86
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints2
Best CPU time to get the best result obtained on this benchmark0.32395
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-271127166OPTIMUM2 0.027995 0.0361029
toulbar2/BTD 2008-06-271127165OPTIMUM2 0.32395 0.520024
Sugar++ v1.13+minisat-inc1127163OPTIMUM2 1.70174 1.77873
Sugar v1.13+minisat1127164OPTIMUM2 1.79073 2.00222
AbsconMax 112 pc-d1127162OPTIMUM2 30.9213 31.664
AbsconMax 112 pc-w1127161OPTIMUM2 31.0583 31.5768
Concrete + CSP4J - Tabu Engine 2008-05-301127160MSAT (TO)2 3600.03 3601.12
Concrete + CSP4J - MCRW Engine 2008-05-301127159MSAT (TO)2 3600.08 3601.92

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