CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/langford2/
normalized-langford-2-7.xml
MD5SUM7461ea6c46b3c4fc477be1a9706828d0
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.007997
Satisfiable
(Un)Satisfiability was proved
Number of variables14
Number of constraints98
Maximum constraint arity2
Maximum domain size14
Number of constraints which are defined in extension0
Number of constraints which are defined in intension98
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271084546SAT 0.007997 0.0098109
Mistral-prime 1.3131084556SAT 0.009997 0.015602
MDG-probe 2008-06-271084545SAT 0.009998 0.012289
casper zito1084558SAT 0.010997 0.011808
Mistral-option 1.3141084555SAT 0.011997 0.0107131
casper zao1084557SAT 0.019996 0.023003
cpHydra k_401084562SAT 0.020996 0.026646
cpHydra k_101084561SAT 0.020996 0.019964
bpsolver 2008-06-271084550SAT 0.035994 0.043448
Minion/Tailor 2008-07-041105902SAT 0.355945 0.373898
Sugar v1.13+minisat1084549SAT 0.618905 0.693233
Sugar v1.13+picosat1084548SAT 0.660899 0.709798
Concrete + CSP4J - Tabu Engine 2008-05-301084542SAT 0.669897 0.686483
Concrete + CPS4J 2008-05-301084544SAT 0.670897 0.690889
choco2_impwdeg 2008-06-261084551SAT 0.710891 0.735183
Abscon 112v4 ESAC1084560SAT 0.753885 0.789847
choco2_dwdeg 2008-06-261084552SAT 0.791879 0.845927
Abscon 112v4 AC1084559SAT 0.806876 0.835194
Concrete + CSP4J - WMC Engine 2008-05-301084543SAT 1.06884 1.11602
galac M1084553SAT 1.2828 1.34596
galac E1084554SAT 1.54277 1.61939
SAT4J CSP 2008-06-131084547SAT 1.62375 1.65564

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:
11 3 1 7 4 2 0 13 6 5 12 10 9 8