CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/langford2/
normalized-langford-2-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/langford2/
normalized-langford-2-4.xml
MD5SUMbe55c9c56f9fe119dba73251bdbac9e5
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.006998
Satisfiable
(Un)Satisfiability was proved
Number of variables8
Number of constraints32
Maximum constraint arity2
Maximum domain size8
Number of constraints which are defined in extension0
Number of constraints which are defined in intension32
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271084672SAT 0.006998 0.00745802
Mistral-option 1.3141084681SAT 0.006998 0.0135161
Mistral-prime 1.3131084682SAT 0.007998 0.0139449
casper zito1084684SAT 0.007998 0.0162659
MDG-probe 2008-06-271084671SAT 0.007998 0.00787008
casper zao1084683SAT 0.010997 0.019205
cpHydra k_101084687SAT 0.018996 0.0243019
cpHydra k_401084688SAT 0.018996 0.0247359
bpsolver 2008-06-271084676SAT 0.028994 0.0345469
Minion/Tailor 2008-07-041105899SAT 0.308952 0.329275
Concrete + CPS4J 2008-05-301084670SAT 0.481926 0.520292
Sugar v1.13+picosat1084674SAT 0.505922 0.538131
Concrete + CSP4J - Tabu Engine 2008-05-301084668SAT 0.508922 0.534571
Sugar v1.13+minisat1084675SAT 0.51792 0.557505
choco2_dwdeg 2008-06-261084678SAT 0.528919 0.5712
Concrete + CSP4J - WMC Engine 2008-05-301084669SAT 0.539917 0.587894
Abscon 112v4 ESAC1084686SAT 0.693894 0.738534
Abscon 112v4 AC1084685SAT 0.71389 0.746814
SAT4J CSP 2008-06-131084673SAT 0.975851 1.01205
galac M1084679SAT 1.05784 1.16918
choco2_impwdeg 2008-06-261084677SAT 1.15282 1.32612
galac E1084680SAT 1.20681 1.31918

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:
1 4 2 0 3 7 6 5