kissat - Man Page

manual page for kissat 1.0.3


usage: kissat [ <option> ... ] [ <dimacs> [ <proof> ] ]

where '<option>' is one of the following common options:


print this list of all command line options


print only reduced list of command line options


force writing proof (to existing CNF alike file)


do not print satisfying assignment


suppress all messages (see also '--quiet')


print all statistics (see also '--statistics')


increase verbose level (see also '--verbose')

Further '<option>' can be one of the following less frequent options:


print solver information


use colors (default if connected to terminal)


no colors (default if not connected to terminal)


print embedded option list


same as '-f' (force writing proof)


print GIT identifier


print option range list


relaxed parsing (ignore DIMACS header)


stricter parsing (no empty header lines)


print version and exit

The following solving limits can be enforced:



Satisfying assignments have by default values for all variables unless '--partial' is specified, then only values are printed for variables which are necessary to satisfy the formula.

The following predefined option settings are supported:


default configuration


target satisfiable instances ('--target=2')


target unsatisfiable instances ('--stable=0')

Or '<option>' is one of the following long options:


extract and eliminate and gates [true]


delay autarky reasoning [true]


enable autarky reasoning [true]


backward subsumption in BVE [true]


bump reason side literals too [true]


allow chronological backtracking [true]


maximum jumped over levels [100]


enable compacting garbage collection [true]


compact inactive limit (in percent) [10]


per mille scores decay [50]


usable defragmentation limit in percent [75]


size defragmentation limit [2^18]


maximum delay (autarky, failed, ...) [2]


eagerly subsume recently learned clauses [20]


bounded variable elimination (BVE) [true]


maximum elimination bound [16]


elimination clause size limit [100]


delay variable elimination [false]


initial elimination interval [500]


base elimination interval [500]


maximum relative efficiency [100]


minimum elimination efficiency [1e6]


elimination occurrence limit [1e3]


relative efficiency in per mille [100]


elimination rounds limit [2]


fast exponential moving average window [33]


slow exponential moving average window [1e5]


extract and eliminate equivalence gates [true]


extract gates in variable elimination [true]


failed literal probing [true]


delay failed literal probing [true]


maximum relative efficiency [100]


minimum probe efficiency [5e5]


relative efficiency in per mille [2]


failed literal probing rounds [2]


force initial phase [false]


forward subsumption in BVE [true]


on-the-fly hyper binary resolution [true]


extract and eliminate if-then-else gates [true]


enable incremental solving [false]


minimization depth [1e3]


initial mode change interval [1e3]


base mode change interval [1e3]


on-the-fly strengthening [true]


initial decision phase [true]


enable phase saving [true]


enable probing [true]


delay probing [false]


initial probing interval [100]


probing interval [100]


profile level [2]


disable all messages [false]


delay preprocessing after scheduling [true]


learned clause reduction [true]


reduce fraction in percent [75]


initial reduce interval [300]


base reduce interval [300]


restart at reduce (1=stable,2=always) [0]


stable reluctant doubling restarting [true]


reluctant interval [2^10]


reluctant limit (0=unlimited) [2^20]


reinitialization of decision phases [true]


initial rephase interval [1e3]


base rephase interval [1e3]


enable restarts [true]


base restart interval [1]


fast/slow margin in percent [10]


random seed [0]


enable probing and elimination [true]


enable stable search mode [1]


stable bias in percent [100]


print complete statistics [false]


equivalent literal substitution [true]


substitute multiple round limit [1e7]


minimum efficiency [1e6]


maximum substitution rounds [2]


subsumption clause size limit [1e3]


maximum relative efficiency [100]


minimum subsume efficiency [1e6]


subsumption occurrence limit [1e3]


relative efficiency in per mille [1e4]


target phases (1=stable,2=focused) [1]


enable hyper ternary resolution [true]


delay hyper ternary resolution [true]


maximum clauses added in percent [20]


maximum relative efficiency [100]


minimum ternary efficiency [1e6]


relative efficiency in per mille [40]


learned clause tier one glue limit [2]


learned clause tier two glue limit [6]


transitive reduction of binary clauses [true]


maximum relative efficiency [100]


minimum transitive efficiency [1e6]


relative efficiency in per mille [20]


tumbled external indices order [true]


verbosity level [0]


vivify clauses [true]


remove implied redundant clauses [2]


maximum relative efficiency [50]


minimum vivify efficiency [2e5]


relative efficiency in per mille [2]


initial local search [false]


maximum relative efficiency [100]


minimum vivify efficiency [1e7]


relative efficiency in per mille [10]


rounds per walking phase [1]


extract and eliminate XOR gates [true]


minimum elimination bound [1]


XOR extraction clause size limit [5]

Furthermore '<dimacs>' is the input file in DIMACS format. The solver reads from '<stdin>' if '<dimacs>' is unspecified. If the path has a '.bz2', '.gz', '.lzma', '7z' or '.xz' suffix then the solver tries to find a corresponding decompression tool ('bzip2', 'gzip', 'lzma', '7z', or 'xz') to decompress the input file on-the-fly after checking that the input file has the correct format (starts with the corresponding signature bytes).

If '<proof>' is specified then a proof trace is written to the given file.  If the file name is '-' then the proof is written to '<stdout>'. In this case the ASCII version of the DRAT format is used.  For real files the binary proof format is used unless '--no-binary' is specified.

Writing of compressed proof files follows the same principle as reading compressed files. The compression format is based on the file suffix and it is checked that the corresponding compression utility can be found.


January 2021 kissat 1.0.3