CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-6-0-sat-2_ext.xml
MD5SUM3ab669a0c285107bdf20b7a03753675a
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.017996
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints559
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension559
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
Mistral-option 1.3141054700SAT 0.017996 0.0254389
MDG-noprobe 2008-06-271054691SAT 0.019996 0.0260111
Mistral-prime 1.3131054701SAT 0.020996 0.026394
MDG-probe 2008-06-271054690SAT 0.023995 0.030112
casper zito1054703SAT 0.031994 0.0376319
cpHydra k_401054707SAT 0.031994 0.04316
cpHydra k_101054706SAT 0.031994 0.0382729
casper zao1054702SAT 0.040993 0.0483759
spider 2008-06-141054689SAT 0.042993 0.052505
mddc-solv 2008-06-091054688SAT 0.072988 0.0790489
bpsolver 2008-06-271054695SAT 0.117981 0.126025
Minion/Tailor 2008-07-041105115SAT 0.559914 0.58466
Concrete + CSP4J - WMC Engine 2008-05-301054686SAT 0.597909 0.635813
choco2_impwdeg 2008-06-261054696SAT 0.623904 0.677761
Concrete + CPS4J 2008-05-301054687SAT 0.693893 0.765134
choco2_dwdeg 2008-06-261054697SAT 0.791879 0.852337
Concrete + CSP4J - Tabu Engine 2008-05-301054685SAT 0.807876 0.856804
Sugar v1.13+minisat1054694SAT 0.903861 1.02117
Abscon 112v4 ESAC1054705SAT 1.01984 1.04936
Abscon 112v4 AC1054704SAT 1.03884 1.05438
Sugar v1.13+picosat1054693SAT 1.10383 1.38739
SAT4J CSP 2008-06-131054692SAT 1.13982 1.17255
galac M1054698SAT 1.2958 1.38088
galac E1054699SAT 1.43478 1.75377

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