TSTP Solution File: KRS082+1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : KRS082+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 05:39:11 EDT 2023

% Result   : Unsatisfiable 0.21s 0.64s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : KRS082+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35  % Computer : n028.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Aug 28 02:34:09 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.57  start to proof:theBenchmark
% 0.21/0.63  %-------------------------------------------
% 0.21/0.63  % File        :CSE---1.6
% 0.21/0.63  % Problem     :theBenchmark
% 0.21/0.63  % Transform   :cnf
% 0.21/0.63  % Format      :tptp:raw
% 0.21/0.63  % Command     :java -jar mcs_scs.jar %d %s
% 0.21/0.63  
% 0.21/0.63  % Result      :Theorem 0.000000s
% 0.21/0.63  % Output      :CNFRefutation 0.000000s
% 0.21/0.63  %-------------------------------------------
% 0.21/0.64  %------------------------------------------------------------------------------
% 0.21/0.64  % File     : KRS082+1 : TPTP v8.1.2. Released v3.1.0.
% 0.21/0.64  % Domain   : Knowledge Representation (Semantic Web)
% 0.21/0.64  % Problem  : DL Test: t4.1 Dynamic blocking example
% 0.21/0.64  % Version  : Especial.
% 0.21/0.64  % English  :
% 0.21/0.64  
% 0.21/0.64  % Refs     : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.21/0.64  %          : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.21/0.64  % Source   : [Bec03]
% 0.21/0.64  % Names    : inconsistent_description-logic-Manifest023 [Bec03]
% 0.21/0.64  
% 0.21/0.64  % Status   : Unsatisfiable
% 0.21/0.64  % Rating   : 0.00 v6.4.0, 0.25 v6.3.0, 0.00 v6.2.0, 0.25 v6.1.0, 0.00 v3.1.0
% 0.21/0.64  % Syntax   : Number of formulae    :   10 (   1 unt;   0 def)
% 0.21/0.64  %            Number of atoms       :   38 (   0 equ)
% 0.21/0.64  %            Maximal formula atoms :   17 (   3 avg)
% 0.21/0.64  %            Number of connectives :   31 (   3   ~;   0   |;  12   &)
% 0.21/0.64  %                                         (   5 <=>;  11  =>;   0  <=;   0 <~>)
% 0.21/0.64  %            Maximal formula depth :   14 (   5 avg)
% 0.21/0.64  %            Maximal term depth    :    1 (   1 avg)
% 0.21/0.64  %            Number of predicates  :   13 (  13 usr;   0 prp; 1-2 aty)
% 0.21/0.64  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.21/0.64  %            Number of variables   :   27 (  22   !;   5   ?)
% 0.21/0.64  % SPC      : FOF_UNS_RFO_NEQ
% 0.21/0.64  
% 0.21/0.64  % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.21/0.64  %            datatypes, so this problem may not be perfect. At least it's
% 0.21/0.64  %            still representative of the type of reasoning required for OWL.
% 0.21/0.64  %------------------------------------------------------------------------------
% 0.21/0.64  %----Thing and Nothing
% 0.21/0.64  fof(axiom_0,axiom,
% 0.21/0.64      ! [X] :
% 0.21/0.64        ( cowlThing(X)
% 0.21/0.64        & ~ cowlNothing(X) ) ).
% 0.21/0.64  
% 0.21/0.64  %----String and Integer disjoint
% 0.21/0.64  fof(axiom_1,axiom,
% 0.21/0.64      ! [X] :
% 0.21/0.64        ( xsd_string(X)
% 0.21/0.64      <=> ~ xsd_integer(X) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Super cUnsatisfiable
% 0.21/0.64  fof(axiom_2,axiom,
% 0.21/0.64      ! [X] :
% 0.21/0.64        ( cUnsatisfiable(X)
% 0.21/0.64       => ? [Y] :
% 0.21/0.64            ( rs(X,Y)
% 0.21/0.64            & ? [Z] :
% 0.21/0.64                ( rp(Y,Z)
% 0.21/0.64                & cowlThing(Z) )
% 0.21/0.64            & ! [Z] :
% 0.21/0.64                ( rr(Y,Z)
% 0.21/0.64               => cc(Z) )
% 0.21/0.64            & ! [Z] :
% 0.21/0.64                ( rp(Y,Z)
% 0.21/0.64               => ? [W] :
% 0.21/0.64                    ( rr(Z,W)
% 0.21/0.64                    & cowlThing(W) ) )
% 0.21/0.64            & ! [Z] :
% 0.21/0.64                ( rp(Y,Z)
% 0.21/0.64               => ? [W] :
% 0.21/0.64                    ( rp(Z,W)
% 0.21/0.64                    & cowlThing(W) ) )
% 0.21/0.64            & ! [Z] :
% 0.21/0.64                ( rp(Y,Z)
% 0.21/0.64               => ! [W] :
% 0.21/0.64                    ( rr(Z,W)
% 0.21/0.64                   => cc(W) ) )
% 0.21/0.64            & ? [Z] :
% 0.21/0.64                ( rr(Y,Z)
% 0.21/0.64                & cowlThing(Z) ) ) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Super cUnsatisfiable
% 0.21/0.64  fof(axiom_3,axiom,
% 0.21/0.64      ! [X] :
% 0.21/0.64        ( cUnsatisfiable(X)
% 0.21/0.64       => ca(X) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Equality cc
% 0.21/0.64  fof(axiom_4,axiom,
% 0.21/0.64      ! [X] :
% 0.21/0.64        ( cc(X)
% 0.21/0.64      <=> ! [Y] :
% 0.21/0.64            ( rinvR(X,Y)
% 0.21/0.64           => ! [Z] :
% 0.21/0.64                ( rinvP(Y,Z)
% 0.21/0.64               => ! [W] :
% 0.21/0.64                    ( rinvS(Z,W)
% 0.21/0.64                   => ~ ca(W) ) ) ) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Inverse: rinvP
% 0.21/0.64  fof(axiom_5,axiom,
% 0.21/0.64      ! [X,Y] :
% 0.21/0.64        ( rinvP(X,Y)
% 0.21/0.64      <=> rp(Y,X) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Inverse: rinvR
% 0.21/0.64  fof(axiom_6,axiom,
% 0.21/0.64      ! [X,Y] :
% 0.21/0.64        ( rinvR(X,Y)
% 0.21/0.64      <=> rr(Y,X) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Inverse: rinvS
% 0.21/0.64  fof(axiom_7,axiom,
% 0.21/0.64      ! [X,Y] :
% 0.21/0.64        ( rinvS(X,Y)
% 0.21/0.64      <=> rs(Y,X) ) ).
% 0.21/0.64  
% 0.21/0.64  %----Transitive: rp
% 0.21/0.64  fof(axiom_8,axiom,
% 0.21/0.64      ! [X,Y,Z] :
% 0.21/0.64        ( ( rp(X,Y)
% 0.21/0.64          & rp(Y,Z) )
% 0.21/0.64       => rp(X,Z) ) ).
% 0.21/0.64  
% 0.21/0.64  %----i2003_11_14_17_19_28752
% 0.21/0.64  fof(axiom_9,axiom,
% 0.21/0.64      cUnsatisfiable(i2003_11_14_17_19_28752) ).
% 0.21/0.64  
% 0.21/0.64  %------------------------------------------------------------------------------
% 0.21/0.64  %-------------------------------------------
% 0.21/0.64  % Proof found
% 0.21/0.64  % SZS status Theorem for theBenchmark
% 0.21/0.64  % SZS output start Proof
% 0.21/0.64  %ClaNum:24(EqnAxiom:0)
% 0.21/0.64  %VarNum:87(SingletonVarNum:39)
% 0.21/0.64  %MaxLitNum:5
% 0.21/0.64  %MaxfuncDepth:1
% 0.21/0.64  %SharedTerms:2
% 0.21/0.64  [1]P1(a1)
% 0.21/0.64  [2]~P2(x21)
% 0.21/0.64  [3]P6(x31)+P5(x31)
% 0.21/0.64  [4]~P1(x41)+P3(x41)
% 0.21/0.64  [5]~P6(x51)+~P5(x51)
% 0.21/0.64  [6]P4(x61)+P3(f2(x61))
% 0.21/0.64  [7]P4(x71)+P7(x71,f3(x71))
% 0.21/0.64  [8]~P1(x81)+P9(x81,f4(x81))
% 0.21/0.64  [9]P4(x91)+P8(f3(x91),f9(x91))
% 0.21/0.64  [10]P4(x101)+P10(f9(x101),f2(x101))
% 0.21/0.64  [11]~P1(x111)+P11(f4(x111),f5(x111))
% 0.21/0.64  [12]~P1(x121)+P12(f4(x121),f6(x121))
% 0.21/0.64  [13]~P10(x132,x131)+P9(x131,x132)
% 0.21/0.64  [14]~P8(x142,x141)+P11(x141,x142)
% 0.21/0.64  [15]~P7(x152,x151)+P12(x151,x152)
% 0.21/0.64  [16]~P12(x162,x161)+P7(x161,x162)
% 0.21/0.64  [17]~P11(x172,x171)+P8(x171,x172)
% 0.21/0.64  [18]~P9(x182,x181)+P10(x181,x182)
% 0.21/0.64  [19]P4(x191)+~P1(x192)+~P12(f4(x192),x191)
% 0.21/0.64  [22]~P1(x222)+~P11(f4(x222),x221)+P11(x221,f7(x222,x221))
% 0.21/0.64  [23]~P1(x232)+~P11(f4(x232),x231)+P12(x231,f8(x232,x231))
% 0.21/0.64  [20]~P11(x201,x203)+P11(x201,x202)+~P11(x203,x202)
% 0.21/0.64  [21]P4(x211)+~P12(x213,x211)+~P1(x212)+~P11(f4(x212),x213)
% 0.21/0.64  [24]~P10(x244,x242)+~P4(x241)+~P7(x241,x243)+~P3(x242)+~P8(x243,x244)
% 0.21/0.64  %EqnAxiom
% 0.21/0.64  
% 0.21/0.64  %-------------------------------------------
% 0.21/0.64  cnf(25,plain,
% 0.21/0.64     (P3(a1)),
% 0.21/0.64     inference(scs_inference,[],[1,4])).
% 0.21/0.64  cnf(26,plain,
% 0.21/0.64     (P9(a1,f4(a1))),
% 0.21/0.64     inference(scs_inference,[],[1,4,8])).
% 0.21/0.64  cnf(29,plain,
% 0.21/0.64     (P11(f4(a1),f5(a1))),
% 0.21/0.64     inference(scs_inference,[],[1,4,8,12,11])).
% 0.21/0.64  cnf(33,plain,
% 0.21/0.64     (P12(f5(a1),f8(a1,f5(a1)))),
% 0.21/0.64     inference(scs_inference,[],[1,4,8,12,11,20,23])).
% 0.21/0.64  cnf(39,plain,
% 0.21/0.64     (P4(f8(a1,f5(a1)))),
% 0.21/0.64     inference(scs_inference,[],[1,4,8,12,11,20,23,22,19,21])).
% 0.21/0.64  cnf(41,plain,
% 0.21/0.64     (P10(f4(a1),a1)),
% 0.21/0.64     inference(scs_inference,[],[26,18])).
% 0.21/0.64  cnf(68,plain,
% 0.21/0.64     ($false),
% 0.21/0.64     inference(scs_inference,[],[25,33,29,39,41,17,24,16]),
% 0.21/0.64     ['proof']).
% 0.21/0.64  % SZS output end Proof
% 0.21/0.64  % Total time :0.000000s
%------------------------------------------------------------------------------