We used 100 SAT solvers as automated experts for our EUMAS 2016 paper.
Each line in the solverCommandList file is a SATenstein solver developed within the UBCSAT framework. 
Please replace instanceName with a valid cnf formula, and cutoffTime with a valid time. For instance, 
the following is a valid command 
./ubcsat -alg satenstein -adaptivenoisescheme 1 -adaptiveprom 0 -adaptpromwalkprob 0 -adaptwalkprob 0 -c 0.0001 -decreasingvariable 3 -dp 0.05 -heuristic 2 -maxinc 10 -novnoise 0.5 -performalternatenovelty 1 -pflat 0.15 -phi 5 -promdp 0.05 -promisinglist 0 -promnovnoise 0.5 -promphi 5 -promtheta 6 -promwp 0.01 -s 0.01 -scoringmeasure 1 -selectclause 1 -theta 6 -tiebreaking 4 -updateschemepromlist 3 -wpwalk 0.6 -adaptive 0 -clausepen 1 -performrandomwalk 1 -randomwalk 4 -rfp 0.1 -singleclause 0 -smoothingscheme 2 -tabusearch 0 -varinfalse 1 -i ais6.cnf -cutoff max -timeout 1

The 4 ais instances (all interval series) are taken from https://www.cs.ubc.ca/~hoos/SATLIB/benchm.html
We include a UBCSAT executable, but in case this does not work for you, detailed instruction on how to build SATenstein2.0 from source can be found from
http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/
Feel free to shoot me an email (akhudabu@cs.cmu.edu, khudabukhsh@gmail.com) in case you run into any trouble running the solvers. 

