Create 5 well-formed sentences of first-order predicate logic other than the ones used in this assignment. The following constraints apply:

• For every predicate letter that you use, you need to specify how many terms it takes. You could simply state that, say, F is a one-place predicate, you could say that it has an arity of 1, you could create a translation scheme of your choice (e.g., Fx: x is a frog), or you could use a superscript (e.g., F¹).
• Per sentence, you must use at least two operators. If F and B are one-place predicates, then this is an example of a well-formed sentence that fulfills this constraint: (Fa Bx)
• In total, you must have used the identity symbol, all unary operators, and all binary operators at least once.