PAGOdA extended with the delta-chase

This is a version of PAGOdA extended with a technique, called delta-chase, able to solve efficiently some categories of inputs.
In this version the user must specify a bound D on the parameter of the delta-chase (instead of the parameter itself) and a maximum size N for the materialisation. If N is properly chosen w.r.t. the available main memory, the system will not fill the memory up.