%------------------------------------------------------------------------------
% File     : REL045+1 : TPTP v9.0.0. Released v4.0.0.
% Domain   : Relation Algebra
% Problem  : An unfold law
% Version  : [Mad95] (equational) axioms.
% English  :

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

% Status   : Theorem
% Rating   : 0.76 v9.0.0, 0.85 v8.2.0, 0.92 v8.1.0, 0.87 v7.5.0, 0.90 v7.4.0, 0.82 v7.3.0, 0.77 v7.2.0, 0.75 v7.1.0, 0.82 v7.0.0, 0.87 v6.4.0, 0.86 v6.3.0, 0.79 v6.2.0, 0.91 v6.1.0, 0.92 v6.0.0, 1.00 v5.1.0, 0.86 v5.0.0, 0.88 v4.1.0, 0.91 v4.0.1, 0.90 v4.0.0
% Syntax   : Number of formulae    :   14 (  14 unt;   0 def)
%            Number of atoms       :   14 (  14 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    0 (   0   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (  26   !;   0   ?)
% SPC      : FOF_THM_RFO_PEQ

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

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