Help to solve

Consider a classical solving problem with initial situation I={}, goal G={q,r} and actions a and b with Prec(a)={}, Add(a)={q}, Del(a)={}; Prec(b)={q}, Add(b)={r}, Del(b)={q}.
Encode this planning problem with horizon n=1 (i.e. actions at tome t=0 only ) as a SAT problem and show its infeasibility following the steps of a SAT solver.

For the initial state s0=I, determine the value of the heuristics h1(hmax), h_add, and the optimal cost h*(s0).

Pomogite reshit', cheloveki