%------------------------------------------------------------------------------
% File     : LCL007+3 : TPTP v9.0.0. Released v3.3.0.
% Domain   : Logic Calculi (Propositional modal)
% Axioms   : KM4B axiomatization of S5 based on Hilbert's PC
% Version  : [HC96] axioms.
% English  :

% Refs     : [HC96]  Hughes & Cresswell (1996), A New Introduction to Modal
%          : [Hal]   Halleck (URL), John Halleck's Logic Systems
%          : [She06] Shen (2006), Automated Proofs of Equivalence of Modal
% Source   : [Hal]
% Names    :

% Status   : Satisfiable
% Syntax   : Number of formulae    :    6 (   6 unt;   0 def)
%            Number of atoms       :    6 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    0 (   0   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    1 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    6 (   6 usr;   6 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?)
% SPC      : 

% Comments : Requires LCL006+0, LCL006+1, LCL006+2 LCL007+0 LCL007+1
%------------------------------------------------------------------------------
%----Modal definitions
fof(km4b_op_possibly,axiom,
    op_possibly ).

%----Modal rules
fof(km4b_necessitation,axiom,
    necessitation ).

%----Modal axioms
fof(km4b_axiom_K,axiom,
    axiom_K ).

fof(km4b_axiom_M,axiom,
    axiom_M ).

fof(km4b_axiom_4,axiom,
    axiom_4 ).

fof(km4b_axiom_B,axiom,
    axiom_B ).

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