CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-2-0-sat-4_ext.xml
MD5SUM7673d7e5dd98a821d6aa24c70d01b22f
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.014997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints195
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension195
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-prime 1.3131055138SAT 0.014997 0.0138789
MDG-noprobe 2008-06-271055128SAT 0.014997 0.015474
cpHydra k_401055144SAT 0.018996 0.0369371
Mistral-option 1.3141055137SAT 0.024995 0.024982
cpHydra k_101055143SAT 0.025995 0.032278
spider 2008-06-141055126SAT 0.032994 0.040244
MDG-probe 2008-06-271055127SAT 0.044992 0.0522909
casper zito1055140SAT 0.05799 0.0598219
mddc-solv 2008-06-091055125SAT 0.064989 0.0719401
casper zao1055139SAT 0.088985 0.094455
Minion/Tailor 2008-07-041105134SAT 0.416935 0.46449
Concrete + CPS4J 2008-05-301055124SAT 0.423935 0.472225
Concrete + CSP4J - WMC Engine 2008-05-301055123SAT 0.514921 0.540336
choco2_dwdeg 2008-06-261055134SAT 0.573911 0.628575
Sugar v1.13+minisat1055131SAT 0.675896 0.786296
choco2_impwdeg 2008-06-261055133SAT 0.681895 0.72925
Sugar v1.13+picosat1055130SAT 0.712891 0.801805
Abscon 112v4 ESAC1055142SAT 0.890863 0.94609
SAT4J CSP 2008-06-131055129SAT 0.890864 0.923222
Abscon 112v4 AC1055141SAT 0.922859 0.956774
galac E1055136SAT 1.03984 1.13654
galac M1055135SAT 1.09583 1.15832
bpsolver 2008-06-271055132SAT 332.479 333.721
Concrete + CSP4J - Tabu Engine 2008-05-301055122SAT 796.756 804.378

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