TPTP Problem File: KLE165+2.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : KLE165+2 : TPTP v7.5.0. Released v4.0.0.
% Domain   : Kleene Algebra (Demonic Refinement Algebra)
% Problem  : Denest for weakly quasi commutation
% Version  : [Hoe08] axioms.
% English  :

% Refs     : [Str06] Struth (2006), Abstract Abstract Reduction
%          : [HS08]  Hoefner & Struth (2008), On Automating the Calculus of
%          : [Hoe08] Hoefner (2008), Email to G. Sutcliffe
% Source   : [Hoe08]
% Names    :

% Status   : Theorem
% Rating   : 1.00 v4.0.0
% Syntax   : Number of formulae    :   19 (  14 unit)
%            Number of atoms       :   25 (  15 equality)
%            Maximal formula depth :    5 (   3 average)
%            Number of connectives :    6 (   0   ~;   0   |;   1   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of predicates  :    2 (   0 propositional; 2-2 arity)
%            Number of functors    :    6 (   2 constant; 0-2 arity)
%            Number of variables   :   36 (   0 sgn;  36   !;   0   ?)
%            Maximal term depth    :    4 (   2 average)
% SPC      : FOF_THM_RFO_SEQ

% Comments :
%------------------------------------------------------------------------------
%---Include axioms for demonic refinement algebra
include('Axioms/KLE004+0.ax').
%------------------------------------------------------------------------------
fof(goals,conjecture,(
    ! [X0,X1] :
      ( ( leq(multiplication(X0,X1),multiplication(X1,strong_iteration(addition(X1,X0))))
       => leq(strong_iteration(addition(X1,X0)),multiplication(strong_iteration(X1),strong_iteration(X0))) )
      & leq(multiplication(strong_iteration(X1),strong_iteration(X0)),strong_iteration(addition(X1,X0))) ) )).

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