CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/aim/
normalized-aim-50-6-0-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-50-6-0-4.xml
MD5SUMf20c382dc2cc1dc56158af2a4cb9c28b
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.027995
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints350
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension350
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271063137SAT 0.027995 0.029358
casper zito1063149SAT 0.031994 0.154698
Mistral-option 1.3141063146SAT 0.035994 0.0362351
Mistral-prime 1.3131063147SAT 0.036993 0.0430609
cpHydra k_401063153SAT 0.037994 0.041101
cpHydra k_101063152SAT 0.038993 0.0423999
MDG-probe 2008-06-271063136SAT 0.040993 0.046835
casper zao1063148SAT 0.044992 0.0513531
bpsolver 2008-06-271063141SAT 0.104983 0.11408
Minion/Tailor 2008-07-041106303SAT 0.800877 0.860749
Sugar v1.13+minisat1063140SAT 0.961852 1.0658
Sugar v1.13+picosat1063139SAT 0.985849 1.06585
Concrete + CSP4J - Tabu Engine 2008-05-301063133SAT 1.04584 0.798464
Concrete + CSP4J - WMC Engine 2008-05-301063134SAT 1.05784 1.11017
Abscon 112v4 ESAC1063151SAT 1.07184 1.10249
Concrete + CPS4J 2008-05-301063135SAT 1.07883 1.15518
Abscon 112v4 AC1063150SAT 1.10383 1.15489
choco2_impwdeg 2008-06-261063142SAT 1.20881 1.28175
choco2_dwdeg 2008-06-261063143SAT 1.22281 1.27777
galac E1063145SAT 1.48177 1.57195
galac M1063144SAT 1.52477 1.63367
SAT4J CSP 2008-06-131063138SAT 1.89271 1.55894

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