TPTP Problem File: REL012+2.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : REL012+2 : TPTP v7.4.0. Released v4.0.0.
% Domain   : Relation Algebra
% Problem  : Cancelativity of converse
% Version  : [Mad95] (equational) axioms : Augmented.
% English  :

% Refs     : [Mad95] Maddux (1995), Relation-Algebraic Semantics
%          : [Hoe08] Hoefner (2008), Email to G. Sutcliffe
% Source   : [Hoe08]
% Names    :

% Status   : Theorem
% Rating   : 0.33 v7.4.0, 0.41 v7.3.0, 0.15 v7.2.0, 0.17 v7.1.0, 0.18 v7.0.0, 0.40 v6.4.0, 0.43 v6.3.0, 0.50 v6.2.0, 0.55 v6.1.0, 0.42 v5.5.0, 0.12 v5.4.0, 0.22 v5.3.0, 0.00 v4.1.0, 0.18 v4.0.1, 0.20 v4.0.0
% Syntax   : Number of formulae    :   17 (  17 unit)
%            Number of atoms       :   17 (  17 equality)
%            Maximal formula depth :    4 (   3 average)
%            Number of connectives :    0 (   0   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of predicates  :    1 (   0 propositional; 2-2 arity)
%            Number of functors    :    8 (   3 constant; 0-2 arity)
%            Number of variables   :   36 (   0 sgn;  36   !;   0   ?)
%            Maximal term depth    :    7 (   3 average)
% SPC      : FOF_THM_RFO_PEQ

% Comments :
%------------------------------------------------------------------------------
%---Include axioms for relation algebra
include('Axioms/REL001+0.ax').
%---Include Dedekind and modular laws
include('Axioms/REL001+1.ax').
%------------------------------------------------------------------------------
fof(goals,conjecture,(
    ! [X0,X1] : join(composition(complement(composition(X0,X1)),converse(X1)),complement(X0)) = complement(X0) )).

%------------------------------------------------------------------------------