CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-100/
normalized-aim-100-6-0-sat-3_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-6-0-sat-3_ext.xml
MD5SUM5ae738496199d0575ed4d40e6f94903f
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.018996
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints561
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension561
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271054806SAT 0.018996 0.0258719
Mistral-prime 1.3131054816SAT 0.018996 0.0200029
Mistral-option 1.3141054815SAT 0.019996 0.025075
MDG-probe 2008-06-271054805SAT 0.020996 0.027784
casper zao1054817SAT 0.028995 0.030509
casper zito1054818SAT 0.030994 0.0393619
cpHydra k_101054821SAT 0.031994 0.032687
cpHydra k_401054822SAT 0.032994 0.038145
spider 2008-06-141054804SAT 0.043992 0.052662
mddc-solv 2008-06-091054803SAT 0.067989 0.0750291
bpsolver 2008-06-271054810SAT 0.088986 0.0876631
Concrete + CSP4J - WMC Engine 2008-05-301054801SAT 0.592909 0.632982
Concrete + CPS4J 2008-05-301054802SAT 0.597908 0.652
Minion/Tailor 2008-07-041105120SAT 0.630903 0.687272
choco2_impwdeg 2008-06-261054811SAT 0.632903 0.68037
choco2_dwdeg 2008-06-261054812SAT 0.78188 0.816719
Sugar v1.13+picosat1054808SAT 0.863868 0.949555
Sugar v1.13+minisat1054809SAT 0.897863 1.01083
Abscon 112v4 AC1054819SAT 0.919859 0.946919
Abscon 112v4 ESAC1054820SAT 0.937856 0.937466
SAT4J CSP 2008-06-131054807SAT 1.11383 1.18771
galac M1054813SAT 1.22181 1.28006
galac E1054814SAT 1.44478 1.53542
Concrete + CSP4J - Tabu Engine 2008-05-301054800SAT 3.68144 3.7477

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 0 0 0 1 0 1 1 0 1 1 1 1 0 0 0 1 1 0 0 1 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 0 1 1 1 0 0 0 1 0 0 0 1 0 1 0 0 1 0 0 1 0 1 0 1 1
0 1 0 1 1 1 1 1 0 0 1 0 0 0 0 1 0 0 1 0 0 1 1 1 1 0 1 0 1 1