## TPTP Problem File: KLE123+1.p

View Solutions - Solve Problem

```%------------------------------------------------------------------------------
% File     : KLE123+1 : TPTP v7.5.0. Released v4.0.0.
% Domain   : Kleene Algebra (Modal)
% Problem  : Validity of while rule
% Version  : [Hoe08] axioms.
% English  : The while rule of Hoare logic is valid with respect to the Kleene
%            algebra semantics.

% Refs     : [DMS04] Desharnais et al. (2004), Termination in Modal Kleene
%          : [Hoe08] Hoefner (2008), Email to G. Sutcliffe
% Source   : [Hoe08]
% Names    :

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

%------------------------------------------------------------------------------
%---Include axioms for modal Kleene algebra
include('Axioms/KLE002+0.ax').
%---Include axioms for Boolean domain/codomain
include('Axioms/KLE001+4.ax').
%---Include axioms for diamond and boxes
include('Axioms/KLE001+6.ax').
%------------------------------------------------------------------------------
fof(while_do_definition,axiom,(
! [X0,X1] : while_do(X1,X0) = multiplication(star(multiplication(domain(X1),X0)),antidomain(X1)) )).

fof(goals,conjecture,(
! [X0,X1,X2] :