We introduce a refutation graph calculus for classical first-order predicate logic. which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension. i. https://chefesquipmenters.shop/product-category/egg-turners/