TPTP Problem File: LCL545+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : LCL545+1 : TPTP v9.0.0. Released v3.3.0.
% Domain : Logic Calculi (Propositional modal)
% Problem : Prove axiom m5 from KM4B axiomatization of S5
% Version : [HC96] axioms.
% English :
% Refs : [HC96] Hughes & Cresswell (1996), A New Introduction to Modal
% : [Hal] Halleck (URL), John Halleck's Logic Systems
% Source : [TPTP]
% Names :
% Status : Theorem
% Rating : 1.00 v8.2.0, 0.97 v8.1.0, 1.00 v3.3.0
% Syntax : Number of formulae : 89 ( 31 unt; 0 def)
% Number of atoms : 156 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 67 ( 0 ~; 0 |; 3 &)
% ( 49 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 61 ( 60 usr; 59 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 0 con; 1-2 aty)
% Number of variables : 110 ( 110 !; 0 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments :
%------------------------------------------------------------------------------
%----Include Hilbert's axiomatization of propositional logic
include('Axioms/LCL006+0.ax').
include('Axioms/LCL006+1.ax').
include('Axioms/LCL006+2.ax').
%----Include axioms of modal logic
include('Axioms/LCL007+0.ax').
include('Axioms/LCL007+1.ax').
%----Include axioms for KM4B
include('Axioms/LCL007+3.ax').
%------------------------------------------------------------------------------
%----Modal definitions
fof(s1_0_op_possibly,axiom,
op_possibly ).
fof(s1_0_op_or,axiom,
op_or ).
fof(s1_0_op_implies,axiom,
op_implies ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies ).
fof(s1_0_op_equiv,axiom,
op_equiv ).
fof(s1_0_op_strict_equiv,axiom,
op_strict_equiv ).
%----Conjecture
fof(s1_0_axiom_m5,conjecture,
axiom_m5 ).
%------------------------------------------------------------------------------