Supplementary material to the paper 
Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Marcel Steinmetz: "Making DL-Lite Planning Practical" 641-645 2021 KR https://doi.org/10.24963/kr.2021/61 

It includes
	* A PDDL pre-processor tool written in C for realizing a polynomial DNF transformation. It works in two modes: ``derived predicates'' or naive transformation.

	* Benchmark collection used in the KR21 planning & dl-lite paper. The collection contains several eKAB (original and new) domains, eKAB versions of two WSC domains, and modified PDDL benchmarks.


When compiled the files can be run by FF and FD with the commands:
FF
./ff -o domain.pddl -f problem.pddl 

FD (the configuration which mimics FF)
./fast-downward.py domain_path.pddl problem_path.pddl --heuristic "hff=ff(transform=adapt_costs(one))" --search "iterated([ehc(hff, preferred=[hff]), eager_greedy([hff], preferred=[hff])], continue_on_fail=true, continue_on_solve=false)"
