TPTP Problem File: LCL869^1.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : LCL869^1 : TPTP v7.0.0. Bugfixed v5.0.0.
% Domain   : Logical Calculi (Modal logic)
% Problem  : Modal logic M5 'includes' modal logic D45
% Version  : [Ben10] axioms.
% English  : 

% Refs     : [Ben10a] Benzmueller (2010), Email to Geoff Sutcliffe
%          : [Ben10b] Benzmueller (2010), Simple Type Theory as a Framework
% Source   : [Ben10a]
% Names    : Problem 31 [Ben10b]

% Status   : CounterSatisfiable
% Rating   : 0.67 v6.2.0, 0.33 v5.4.0, 1.00 v5.0.0
% Syntax   : Number of formulae    :   64 (   0 unit;  32 type;  31 defn)
%            Number of atoms       :  232 (  36 equality; 135 variable)
%            Maximal formula depth :   11 (   6 average)
%            Number of connectives :  132 (   4   ~;   4   |;  11   &; 104   @)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of type conns  :  170 ( 170   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   36 (  32   :;   0   =)
%            Number of variables   :   85 (   3 sgn;  30   !;   6   ?;  49   ^)
%                                         (  85   :;   0  !>;   0  ?*)
%                                         (   0  @-;   0  @+)
% SPC      : TH0_CSA_EQU_NAR

% Comments : 
% Bugfixes : v5.0.0 - Bugfix to LCL013^0.ax
%------------------------------------------------------------------------------
%----Include the definitions for quantified multimodal logic
include('Axioms/LCL013^0.ax').
%------------------------------------------------------------------------------
thf(conj,conjecture,(
    ! [R: $i > $i > $o] :
      ( ( ( mserial @ R )
        & ( mtransitive @ R )
        & ( meuclidean @ R ) )
     => ( ( mreflexive @ R )
        & ( meuclidean @ R ) ) ) )).

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