CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/schurrLemma/
normalized-lemma-66-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/schurrLemma/
normalized-lemma-66-4.xml
MD5SUMcb71f77943a3e9336840301264b4b7c7
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.072988
Satisfiable
(Un)Satisfiability was proved
Number of variables66
Number of constraints1056
Maximum constraint arity3
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension1056
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271047963SAT 0.072988 0.080652
cpHydra k_101047978SAT 0.084986 0.084354
cpHydra k_401047979SAT 0.088985 0.0997671
Abscon 112v4 AC1047976SAT 1.37979 1.43141
choco2_impwdeg 2008-06-261047968SAT 1.54676 1.58099
Concrete + CSP4J - WMC Engine 2008-05-301047960SAT 1.70974 1.78455
choco2_dwdeg 2008-06-261047969SAT 1.81172 1.84089
casper zao1047974SAT 7.53985 7.63069
Concrete + CSP4J - Tabu Engine 2008-05-301047959SAT 41.4637 41.8705
MDG-probe 2008-06-271047962SAT 421.705 423.838
galac E1047971SAT 444.956 447.838
bpsolver 2008-06-271047967SAT 1675.52 1688.12
Mistral-option 1.3141047972? (TO) 1800.01 1814.71
Concrete + CPS4J 2008-05-301047961? (TO) 1800.02 1815.32
Mistral-prime 1.3131047973? (TO) 1800.03 1802.21
casper zito1047975? (TO) 1800.04 1800.91
Minion/Tailor 2008-07-041104807? (TO) 1800.08 1807.91
Sugar v1.13+minisat1047966? (TO) 1800.11 1801.12
galac M1047970? (TO) 1800.12 1808.11
Abscon 112v4 ESAC1047977? (TO) 1800.13 1800.97
Sugar v1.13+picosat1047965? (TO) 1800.15 1809.62
SAT4J CSP 2008-06-131047964? (TO) 1800.16 1803.21

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
0 0 1 0 1 1 1 0 2 2 0 2 2 2 2 0 2 2 1 2 1 0 1 3 0 3 3 3 3 3 3 0 3 1 1 1 3 3 0 3 3 3 3 3 3 0 3 3 3 1 1 1 0 2 2 2 2 0 2 2 2 2 0 1 1 1