TPTP Problem File: KRS085+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : KRS085+1 : TPTP v9.0.0. Released v3.1.0.
% Domain : Knowledge Representation (Semantic Web)
% Problem : DL Test: t7.2
% 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 : inconsistent_description-logic-Manifest029 [Bec03]
% Status : Unsatisfiable
% Rating : 0.00 v3.1.0
% Syntax : Number of formulae : 22 ( 1 unt; 0 def)
% Number of atoms : 65 ( 15 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 46 ( 3 ~; 0 |; 21 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 0 prp; 1-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 52 ( 50 !; 2 ?)
% SPC : FOF_UNS_RFO_SEQ
% 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.
%------------------------------------------------------------------------------
fof(cUnsatisfiable_substitution_1,axiom,
! [A,B] :
( ( A = B
& cUnsatisfiable(A) )
=> cUnsatisfiable(B) ) ).
fof(cowlNothing_substitution_1,axiom,
! [A,B] :
( ( A = B
& cowlNothing(A) )
=> cowlNothing(B) ) ).
fof(cowlThing_substitution_1,axiom,
! [A,B] :
( ( A = B
& cowlThing(A) )
=> cowlThing(B) ) ).
fof(cp1_substitution_1,axiom,
! [A,B] :
( ( A = B
& cp1(A) )
=> cp1(B) ) ).
fof(rf_substitution_1,axiom,
! [A,B,C] :
( ( A = B
& rf(A,C) )
=> rf(B,C) ) ).
fof(rf_substitution_2,axiom,
! [A,B,C] :
( ( A = B
& rf(C,A) )
=> rf(C,B) ) ).
fof(rinvF_substitution_1,axiom,
! [A,B,C] :
( ( A = B
& rinvF(A,C) )
=> rinvF(B,C) ) ).
fof(rinvF_substitution_2,axiom,
! [A,B,C] :
( ( A = B
& rinvF(C,A) )
=> rinvF(C,B) ) ).
fof(rinvR_substitution_1,axiom,
! [A,B,C] :
( ( A = B
& rinvR(A,C) )
=> rinvR(B,C) ) ).
fof(rinvR_substitution_2,axiom,
! [A,B,C] :
( ( A = B
& rinvR(C,A) )
=> rinvR(C,B) ) ).
fof(rr_substitution_1,axiom,
! [A,B,C] :
( ( A = B
& rr(A,C) )
=> rr(B,C) ) ).
fof(rr_substitution_2,axiom,
! [A,B,C] :
( ( A = B
& rr(C,A) )
=> rr(C,B) ) ).
fof(xsd_integer_substitution_1,axiom,
! [A,B] :
( ( A = B
& xsd_integer(A) )
=> xsd_integer(B) ) ).
fof(xsd_string_substitution_1,axiom,
! [A,B] :
( ( A = B
& xsd_string(A) )
=> xsd_string(B) ) ).
%----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 cUnsatisfiable
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rr(X,Y)
& ? [Z] :
( rr(Y,Z)
& cp1(Z)
& ! [W] :
( rinvR(Z,W)
=> ~ cp1(W) ) ) )
& cp1(X) ) ) ).
%----Super cowlThing
fof(axiom_3,axiom,
! [X] :
( cowlThing(X)
=> ! [Y0,Y1] :
( ( rf(X,Y0)
& rf(X,Y1) )
=> Y0 = Y1 ) ) ).
%----Inverse: rinvF
fof(axiom_4,axiom,
! [X,Y] :
( rinvF(X,Y)
<=> rf(Y,X) ) ).
%----Inverse: rinvR
fof(axiom_5,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ) ).
%----Transitive: rr
fof(axiom_6,axiom,
! [X,Y,Z] :
( ( rr(X,Y)
& rr(Y,Z) )
=> rr(X,Z) ) ).
%----i2003_11_14_17_19_39537
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_39537) ).
%------------------------------------------------------------------------------