TPTP Problem File: LCL915+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : LCL915+1 : TPTP v9.0.0. Released v6.4.0.
% Domain : Logical Calculi (Propositional modal)
% Problem : M10 axiomatization of S5 based on S1-0
% Version : [Zem73] axioms.
% English :
% Refs : [Zem73] Zeman (1973), Modal Logic, the Lewis-Modal systems
% : [Hal] Halleck (URL), John Halleck's Logic Systems
% : [She06] Shen (2006), Automated Proofs of Equivalence of Modal
% Source : [TPTP]
% Names :
% Status : Satisfiable
% Rating : 0.33 v9.0.0, 0.20 v8.2.0, 0.00 v7.5.0, 0.33 v7.3.0, 0.00 v7.1.0, 0.50 v7.0.0, 0.00 v6.4.0
% Syntax : Number of formulae : 47 ( 15 unt; 0 def)
% Number of atoms : 85 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 0 ~; 0 |; 2 &)
% ( 23 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 35 ( 34 usr; 33 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 0 con; 1-2 aty)
% Number of variables : 55 ( 55 !; 0 ?)
% SPC : FOF_SAT_RFO_SEQ
% Comments :
%------------------------------------------------------------------------------
%----Propositional logic definitions
include('Axioms/LCL006+1.ax').
%----Propositional modal logic rules and axioms
include('Axioms/LCL007+0.ax').
%----Propositional modal logic definitions
include('Axioms/LCL007+1.ax').
%----Axiomatization of S1-0
include('Axioms/LCL007+4.ax').
%----M10 axiomatization of S5 based on S1-0
include('Axioms/LCL007+6.ax').
%------------------------------------------------------------------------------