Welcome to KBDD, a BDD based solver for modal logic K
Copyright (C) 2003 Guoqiang Pan

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
long with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

A recent version of CUDD is needed to compile this source.

For problems and questions about  contact:
     Guoqiang Pan
     Dept. of CS, Rice University
     gqpan@cs.rice.edu
     
Usage:
    ksat [options] file
    options include:
	-t : input file is in tptp format
	-base : Do not use level-based optimization.
	-a : Use atoms instead of particles
	-f : Use full vectors instead of lean vectors
	-b : Use bottom up approach (not valid without -base)
	-altvo : Use level based variable ordering (usually better)
	-toX : timeout at X seconds
	
Space out is set at 384MB. Change main.cc if needed to change space out.
	
Best results can be achieved with the mlk simplifier, also avaliable on
http://www.cs.rice.edu/~gqpan