CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/aim/
normalized-aim-100-1-6-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-100-1-6-4.xml
MD5SUMe5c5d92df12b009ff7647cd5cfcf618f
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.096984
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints260
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension260
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141063083SAT 0.096984 0.102698
Mistral-prime 1.3131063084SAT 0.108983 0.114934
MDG-noprobe 2008-06-271063074SAT 0.139977 0.148726
MDG-probe 2008-06-271063073SAT 0.142977 0.144926
cpHydra k_401063090SAT 0.177972 0.183919
cpHydra k_101063089SAT 0.180971 0.197604
casper zito1063086SAT 0.31695 0.323382
casper zao1063085SAT 0.317951 0.325633
Minion/Tailor 2008-07-041106285SAT 0.6519 0.672856
Sugar v1.13+minisat1063077SAT 0.813875 0.742827
Sugar v1.13+picosat1063076SAT 0.923859 1.02315
Concrete + CPS4J 2008-05-301063072SAT 1.04184 1.10853
Abscon 112v4 ESAC1063088SAT 1.06184 0.885641
choco2_dwdeg 2008-06-261063080SAT 1.06484 1.09914
choco2_impwdeg 2008-06-261063079SAT 1.08083 1.10205
Abscon 112v4 AC1063087SAT 1.12783 1.15417
galac E1063082SAT 1.43678 1.55349
galac M1063081SAT 1.62175 1.68342
SAT4J CSP 2008-06-131063075SAT 1.77873 1.96347
bpsolver 2008-06-271063078? (TO) 1800.03 1804.71
Concrete + CSP4J - Tabu Engine 2008-05-301063070? (TO) 1800.05 1820.22
Concrete + CSP4J - WMC Engine 2008-05-301063071? (TO) 1800.08 1807.82

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