TPTP Problem File: CSR109+2.p

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : CSR109+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% Domain   : Commonsense Reasoning
% Problem  : Skolemization of a deep class hierarchy, with subsumption
% Version  : Especial > Augmented > Especial.
% English  :

% Refs     : [NP01]  Niles & Pease (2001), Towards A Standard Upper Ontology
%          : [Sie07] Siegel (2007), Email to G. Sutcliffe
% Source   : [Sie07]
% Names    : TQG50

% Status   : ContradictoryAxioms
% Rating   : 0.69 v7.5.0, 0.75 v7.4.0, 0.00 v7.3.0
% Syntax   : Number of formulae    : 37984 (32648 unt;   0 def)
%            Number of atoms       : 59801 (1489 equ)
%            Maximal formula atoms :   23 (   1 avg)
%            Number of connectives : 22740 ( 923   ~; 115   |;10379   &)
%                                         ( 137 <=>;11186  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :  487 ( 486 usr;   0 prp; 1-8 aty)
%            Number of functors    : 9428 (8981 usr;9293 con; 0-8 aty)
%            Number of variables   : 13120 (11617   !;1503   ?)
% SPC      : FOF_CAX_RFO_SEQ

% Comments : Requires at least 53 steps. 
%          : This version includes the cache axioms.
% Bugfixes : v3.4.1 - Bugfixes in CSR003+*.ax
%          : v3.4.2 - Bugfixes in CSR003+1.ax
%          : v3.5.0 - Bugfixes in CSR003+1.ax
%          : v4.0.0 - Bugfixes in CSR003 axiom files.
%          : v4.0.1 - Bugfixes in CSR003 axiom files.
%          : v4.1.0 - Bugfixes in CSR003 axiom files.
%          : v5.3.0 - Bugfixes in CSR003 axiom files.
%          : v5.4.0 - Bugfixes in CSR003 axiom files.
%          : v7.3.0 - Bugfixes in CSR003 axiom files.
%------------------------------------------------------------------------------
%----Include axioms from SUMO_MILO
include('Axioms/CSR003+1.ax').
%----Include cache axioms for SUMO+MILO
include('Axioms/CSR003+4.ax').
%------------------------------------------------------------------------------
fof(local_1,axiom,
    s__instance(s__Creature50_1,s__Animal) ).

fof(local_2,axiom,
    ( s__subclass(s__Reptile,s__Animal)
   => ? [V_C1,V_C2,V_C3,V_C4,V_C5,V_C6,V_C7,V_C8,V_C9,V_C10] :
        ( s__instance(V_C1,s__SetOrClass)
        & s__instance(V_C2,s__SetOrClass)
        & s__instance(V_C3,s__SetOrClass)
        & s__instance(V_C4,s__SetOrClass)
        & s__instance(V_C5,s__SetOrClass)
        & s__instance(V_C6,s__SetOrClass)
        & s__instance(V_C7,s__SetOrClass)
        & s__instance(V_C8,s__SetOrClass)
        & s__instance(V_C9,s__SetOrClass)
        & s__instance(V_C10,s__SetOrClass)
        & s__subclass(V_C1,V_C2)
        & s__subclass(V_C2,V_C3)
        & s__subclass(V_C3,V_C4)
        & s__subclass(V_C4,V_C5)
        & s__subclass(V_C5,V_C6)
        & s__subclass(V_C6,V_C7)
        & s__subclass(V_C7,V_C8)
        & s__subclass(V_C8,V_C9)
        & s__subclass(V_C9,V_C10)
        & s__subclass(V_C10,s__Reptile)
        & s__instance(s__Creature50_1,V_C1) ) ) ).

fof(prove_from_SUMO_MILO,conjecture,
    s__instance(s__Creature50_1,s__Reptile) ).

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