CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-2-0-sat-3_ext.xml
MD5SUM01cd537fc78b874d1530b26717ef6507
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.012998
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints191
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension191
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.3141054631SAT 0.012998 0.0157149
casper zao1054633SAT 0.014997 0.0178211
Mistral-prime 1.3131054632SAT 0.019996 0.0213279
MDG-noprobe 2008-06-271054622SAT 0.022995 0.0298929
cpHydra k_401054638SAT 0.032994 0.0398089
cpHydra k_101054637SAT 0.033994 0.0409509
MDG-probe 2008-06-271054621SAT 0.045992 0.0517361
spider 2008-06-141054620SAT 0.054991 0.0621411
mddc-solv 2008-06-091054619SAT 0.076987 0.0843019
casper zito1054634SAT 0.117981 0.121471
Minion/Tailor 2008-07-041105112SAT 0.440932 0.468717
choco2_impwdeg 2008-06-261054627SAT 0.484926 0.518553
Concrete + CPS4J 2008-05-301054618SAT 0.523919 0.546154
choco2_dwdeg 2008-06-261054628SAT 0.590909 0.623854
Sugar v1.13+picosat1054624SAT 0.71889 0.805976
Sugar v1.13+minisat1054625SAT 0.747885 0.849079
Abscon 112v4 ESAC1054636SAT 0.821874 0.848423
Abscon 112v4 AC1054635SAT 0.858868 0.887082
SAT4J CSP 2008-06-131054623SAT 1.00685 1.03422
galac M1054629SAT 1.03184 1.07546
galac E1054630SAT 1.12383 1.21839
bpsolver 2008-06-271054626SAT 2.44163 2.47516
Concrete + CSP4J - Tabu Engine 2008-05-301054616SAT 439.907 442.111
Concrete + CSP4J - WMC Engine 2008-05-301054617? (TO) 1800.04 1817.02

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