MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namemaxcsp/pedigree/
normalized-pedck60-L2_ext.xml
MD5SUM2818707ab7bf8efd67a0ac42395f06bf
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.32495
Satisfiable
(Un)Satisfiability was proved
Number of variables61
Number of constraints106
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension106
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-271127230OPTIMUM2 0.028995 0.0365749
toulbar2/BTD 2008-06-271127229OPTIMUM2 0.32495 0.340485
Sugar++ v1.13+minisat-inc1127227OPTIMUM2 1.69474 1.95088
Sugar v1.13+minisat1127228OPTIMUM2 1.81372 2.17869
AbsconMax 112 pc-d1127226OPTIMUM2 31.1433 32.0064
AbsconMax 112 pc-w1127225OPTIMUM2 32.1561 34.8975
Concrete + CSP4J - Tabu Engine 2008-05-301127224MSAT (TO)2 3600.07 3627.32
Concrete + CSP4J - MCRW Engine 2008-05-301127223MSAT (TO)2 3600.09 3605.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:
3 8 1 5 4 4 4 2 0 6 1 1 1 6 5 1 0 4 2 1 1 5 1 1 5 2 0 6 4 4 2 5 1 6 6 3 1 5 1 4 1 1 1 1 4 4 5 1 1 6 5 5 4 4 1 4 1 5 0 6 -1