sbt.internal.util.logic
A formula consists of variables, negation, and conjunction (and). (Disjunction is not currently included- it is modeled at the level of a sequence of clauses. This is less convenient when defining clauses, but is not less powerful.)
Constructs a formula that is true iff this formula and f are both true.
f
Constructs a clause that proves atoms when this formula is true.
atoms
A formula consists of variables, negation, and conjunction (and). (Disjunction is not currently included- it is modeled at the level of a sequence of clauses. This is less convenient when defining clauses, but is not less powerful.)