TPTP Problem File: KRS165+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : KRS165+1 : TPTP v9.0.0. Released v3.1.0.
% Domain : Knowledge Representation (Semantic Web)
% Problem : Two classes may be different names for the same set of individuals
% Version : Especial.
% English :
% Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% Source : [Bec03]
% Names : positive_equivalentClass-Manifest002 [Bec03]
% Status : Theorem
% Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.1.0
% Syntax : Number of formulae : 4 ( 0 unt; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 14 ( 4 ~; 0 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 7 ( 7 !; 0 ?)
% SPC : FOF_THM_EPR_NEQ
% Comments : Sean Bechhofer says there are some errors in the encoding of
% datatypes, so this problem may not be perfect. At least it's
% still representative of the type of reasoning required for OWL.
%------------------------------------------------------------------------------
%----Thing and Nothing
fof(axiom_0,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ) ).
%----String and Integer disjoint
fof(axiom_1,axiom,
! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ) ).
%----Equality cCar
fof(axiom_2,axiom,
! [X] :
( cCar(X)
<=> cAutomobile(X) ) ).
%----Thing and Nothing
%----String and Integer disjoint
%----Super cAutomobile
%----Super cCar
fof(the_axiom,conjecture,
( ! [X] :
( cowlThing(X)
& ~ cowlNothing(X) )
& ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& ! [X] :
( cAutomobile(X)
=> cCar(X) )
& ! [X] :
( cCar(X)
=> cAutomobile(X) ) ) ).
%------------------------------------------------------------------------------