/************************  About DCCASat ******************************/
This version sets the parameter max_flips to 4000000000 and the parameter max_tries to 4500000000000000000.
This version is the one evaluated in the following AAAI-14 paper.

Chuan Luo, Shaowei Cai, Wei Wu, Kaile Su. Double Configuration Checking in Stochastic Local Search for Satisfiability. To appear in Proc. of AAAI 2014.

/************************  About CCASat *******************************/    
      
CCASat is a local search solver for the Boolean Satisfiability (SAT) problem.
CCASat is designed and implemented by Shaowei Cai, when he was pursuing his Phd degree in Peking University (Beijing, China, 2012).  
This is a tidy version that performs (almost) the same as the one submitted to SAT Challenge 2012.
The binary and codes of CCASat are permitted to be used for education and research purposes.                    
Homepage: www.shaoweicai.net
Email: shaoweicai.cs@gmail.com

Acknowledgement: The author would like to thank Chuan Luo for discussions and particularly the helps on implementing the PAWS weighting schemes, and Kaile Su  for funding support and discussions on this project.


/******************** compiling and running commands *******************/
Compiling command: g++ cca.cpp -m32 -O2 -static -o CCASat

One can compile CCASat by simply run ./make under the directory.

Running command: ./CCASat <instance file> <random seed>
