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

View Problem - Process Solution

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

% Computer : n002.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:27 EDT 2023

% Result   : Theorem 0.22s 0.70s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : KRS152+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.15  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.36  % Computer : n002.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Aug 28 01:39:04 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.22/0.60  start to proof:theBenchmark
% 0.22/0.69  %-------------------------------------------
% 0.22/0.69  % File        :CSE---1.6
% 0.22/0.69  % Problem     :theBenchmark
% 0.22/0.69  % Transform   :cnf
% 0.22/0.69  % Format      :tptp:raw
% 0.22/0.69  % Command     :java -jar mcs_scs.jar %d %s
% 0.22/0.69  
% 0.22/0.69  % Result      :Theorem 0.030000s
% 0.22/0.69  % Output      :CNFRefutation 0.030000s
% 0.22/0.69  %-------------------------------------------
% 0.22/0.69  %------------------------------------------------------------------------------
% 0.22/0.69  % File     : KRS152+1 : TPTP v8.1.2. Released v3.1.0.
% 0.22/0.69  % Domain   : Knowledge Representation (Semantic Web)
% 0.22/0.69  % Problem  : DL Test: k_ph ABox test from DL98 systems comparison
% 0.22/0.69  % Version  : Especial.
% 0.22/0.69  % English  :
% 0.22/0.69  
% 0.22/0.69  % Refs     : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.22/0.69  %          : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.22/0.69  % Source   : [Bec03]
% 0.22/0.69  % Names    : positive_description-logic-Manifest207 [Bec03]
% 0.22/0.69  
% 0.22/0.69  % Status   : Theorem
% 0.22/0.69  % Rating   : 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.04 v5.3.0, 0.09 v5.2.0, 0.00 v3.2.0, 0.11 v3.1.0
% 0.22/0.69  % Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
% 0.22/0.69  %            Number of atoms       :   37 (   0 equ)
% 0.22/0.69  %            Maximal formula atoms :    8 (   2 avg)
% 0.22/0.69  %            Number of connectives :   29 (   9   ~;   0   |;  12   &)
% 0.22/0.69  %                                         (   7 <=>;   1  =>;   0  <=;   0 <~>)
% 0.22/0.69  %            Maximal formula depth :    6 (   3 avg)
% 0.22/0.69  %            Maximal term depth    :    1 (   1 avg)
% 0.22/0.69  %            Number of predicates  :   12 (  12 usr;   0 prp; 1-2 aty)
% 0.22/0.69  %            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
% 0.22/0.69  %            Number of variables   :   12 (  10   !;   2   ?)
% 0.22/0.69  % SPC      : FOF_THM_RFO_NEQ
% 0.22/0.69  
% 0.22/0.69  % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.22/0.69  %            datatypes, so this problem may not be perfect. At least it's
% 0.22/0.69  %            still representative of the type of reasoning required for OWL.
% 0.22/0.69  %------------------------------------------------------------------------------
% 0.22/0.69  %----Thing and Nothing
% 0.22/0.69  fof(axiom_0,axiom,
% 0.22/0.69      ! [X] :
% 0.22/0.69        ( cowlThing(X)
% 0.22/0.69        & ~ cowlNothing(X) ) ).
% 0.22/0.69  
% 0.22/0.69  %----String and Integer disjoint
% 0.22/0.69  fof(axiom_1,axiom,
% 0.22/0.69      ! [X] :
% 0.22/0.69        ( xsd_string(X)
% 0.22/0.69      <=> ~ xsd_integer(X) ) ).
% 0.22/0.69  
% 0.22/0.69  %----Equality cC10
% 0.22/0.69  fof(axiom_2,axiom,
% 0.22/0.69      ! [X] :
% 0.22/0.69        ( cC10(X)
% 0.22/0.69      <=> ( cC2(X)
% 0.22/0.69          & cC4(X) ) ) ).
% 0.22/0.69  
% 0.22/0.69  %----Equality cC12
% 0.22/0.69  fof(axiom_3,axiom,
% 0.22/0.69      ! [X] :
% 0.22/0.69        ( cC12(X)
% 0.22/0.69      <=> ? [Y] :
% 0.22/0.69            ( rR1(X,Y)
% 0.22/0.69            & cC10(Y) ) ) ).
% 0.22/0.69  
% 0.22/0.69  %----Equality cC6
% 0.22/0.69  fof(axiom_4,axiom,
% 0.22/0.69      ! [X] :
% 0.22/0.69        ( cC6(X)
% 0.22/0.69      <=> ( ~ cC2(X)
% 0.22/0.69          & cC4(X) ) ) ).
% 0.22/0.69  
% 0.22/0.69  %----Equality cC8
% 0.22/0.69  fof(axiom_5,axiom,
% 0.22/0.69      ! [X] :
% 0.22/0.69        ( cC8(X)
% 0.22/0.69      <=> ? [Y] :
% 0.22/0.69            ( rR1(X,Y)
% 0.22/0.69            & cC6(Y) ) ) ).
% 0.22/0.69  
% 0.22/0.69  %----Equality cTEST
% 0.22/0.70  fof(axiom_6,axiom,
% 0.22/0.70      ! [X] :
% 0.22/0.70        ( cTEST(X)
% 0.22/0.70      <=> ( cC12(X)
% 0.22/0.70          & ~ cC8(X) ) ) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21080
% 0.22/0.70  fof(axiom_7,axiom,
% 0.22/0.70      cTEST(iV21080) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21080
% 0.22/0.70  fof(axiom_8,axiom,
% 0.22/0.70      cowlThing(iV21080) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21080
% 0.22/0.70  fof(axiom_9,axiom,
% 0.22/0.70      ! [X] :
% 0.22/0.70        ( rR1(iV21080,X)
% 0.22/0.70       => ~ cC6(X) ) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21080
% 0.22/0.70  fof(axiom_10,axiom,
% 0.22/0.70      ~ cC8(iV21080) ).
% 0.22/0.70  
% 0.22/0.70  fof(axiom_11,axiom,
% 0.22/0.70      rR1(iV21080,iV21081) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21081
% 0.22/0.70  fof(axiom_12,axiom,
% 0.22/0.70      ~ cC6(iV21081) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21081
% 0.22/0.70  fof(axiom_13,axiom,
% 0.22/0.70      cowlThing(iV21081) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21081
% 0.22/0.70  fof(axiom_14,axiom,
% 0.22/0.70      cC2(iV21081) ).
% 0.22/0.70  
% 0.22/0.70  %----iV21081
% 0.22/0.70  fof(axiom_15,axiom,
% 0.22/0.70      cC4(iV21081) ).
% 0.22/0.70  
% 0.22/0.70  %----Thing and Nothing
% 0.22/0.70  %----String and Integer disjoint
% 0.22/0.70  %----iV21080
% 0.22/0.70  %----iV21080
% 0.22/0.70  %----iV21081
% 0.22/0.70  %----iV21081
% 0.22/0.70  fof(the_axiom,conjecture,
% 0.22/0.70      ( ! [X] :
% 0.22/0.70          ( cowlThing(X)
% 0.22/0.70          & ~ cowlNothing(X) )
% 0.22/0.70      & ! [X] :
% 0.22/0.70          ( xsd_string(X)
% 0.22/0.70        <=> ~ xsd_integer(X) )
% 0.22/0.70      & cowlThing(iV21080)
% 0.22/0.70      & cC12(iV21080)
% 0.22/0.70      & cC10(iV21081)
% 0.22/0.70      & cowlThing(iV21081) ) ).
% 0.22/0.70  
% 0.22/0.70  %------------------------------------------------------------------------------
% 0.22/0.70  %-------------------------------------------
% 0.22/0.70  % Proof found
% 0.22/0.70  % SZS status Theorem for theBenchmark
% 0.22/0.70  % SZS output start Proof
% 0.22/0.70  %ClaNum:27(EqnAxiom:0)
% 0.22/0.70  %VarNum:46(SingletonVarNum:21)
% 0.22/0.70  %MaxLitNum:5
% 0.22/0.70  %MaxfuncDepth:1
% 0.22/0.70  %SharedTerms:17
% 0.22/0.70  %goalClause: 21 22
% 0.22/0.70  [1]P1(a1)
% 0.22/0.70  [2]P4(a1)
% 0.22/0.70  [3]P5(a2)
% 0.22/0.70  [4]P8(a2,a1)
% 0.22/0.70  [5]~P6(a1)
% 0.22/0.70  [6]~P7(a2)
% 0.22/0.70  [7]~P9(x71)
% 0.22/0.70  [8]P11(x81)+P10(x81)
% 0.22/0.70  [9]~P2(x91)+P1(x91)
% 0.22/0.70  [10]~P2(x101)+P4(x101)
% 0.22/0.70  [11]~P6(x111)+P4(x111)
% 0.22/0.70  [12]~P5(x121)+P3(x121)
% 0.22/0.70  [13]~P11(x131)+~P10(x131)
% 0.22/0.70  [14]~P6(x141)+~P1(x141)
% 0.22/0.70  [15]~P5(x151)+~P7(x151)
% 0.22/0.70  [23]~P6(x231)+~P8(a2,x231)
% 0.22/0.70  [18]~P3(x181)+P2(f3(x181))
% 0.22/0.70  [19]~P7(x191)+P6(f4(x191))
% 0.22/0.70  [24]~P3(x241)+P8(x241,f3(x241))
% 0.22/0.70  [25]~P7(x251)+P8(x251,f4(x251))
% 0.22/0.70  [16]P6(x161)+~P4(x161)+P1(x161)
% 0.22/0.70  [17]P5(x171)+~P3(x171)+P7(x171)
% 0.22/0.70  [20]~P1(x201)+~P4(x201)+P2(x201)
% 0.22/0.70  [26]~P8(x261,x262)+P3(x261)+~P2(x262)
% 0.22/0.70  [27]~P8(x271,x272)+P7(x271)+~P6(x272)
% 0.22/0.70  [21]P9(a5)+P10(a6)+~P11(a6)+~P2(a1)+~P3(a2)
% 0.22/0.70  [22]P9(a5)+P11(a6)+~P10(a6)+~P2(a1)+~P3(a2)
% 0.22/0.70  %EqnAxiom
% 0.22/0.70  
% 0.22/0.70  %-------------------------------------------
% 0.22/0.70  cnf(28,plain,
% 0.22/0.70     (P2(a1)),
% 0.22/0.70     inference(scs_inference,[],[1,2,20])).
% 0.22/0.70  cnf(29,plain,
% 0.22/0.70     (P3(a2)),
% 0.22/0.70     inference(scs_inference,[],[1,2,3,20,12])).
% 0.22/0.70  cnf(39,plain,
% 0.22/0.70     (~P11(a6)+P10(a6)),
% 0.22/0.70     inference(scs_inference,[],[28,29,7,21])).
% 0.22/0.70  cnf(40,plain,
% 0.22/0.70     (~P10(a6)+P11(a6)),
% 0.22/0.70     inference(scs_inference,[],[28,29,7,22])).
% 0.22/0.70  cnf(47,plain,
% 0.22/0.70     (P10(a6)),
% 0.22/0.70     inference(scs_inference,[],[39,8])).
% 0.22/0.70  cnf(48,plain,
% 0.22/0.70     (P11(a6)),
% 0.22/0.70     inference(scs_inference,[],[47,40])).
% 0.22/0.70  cnf(49,plain,
% 0.22/0.70     (~P11(a6)),
% 0.22/0.70     inference(scs_inference,[],[47,13])).
% 0.22/0.70  cnf(51,plain,
% 0.22/0.70     ($false),
% 0.22/0.70     inference(scs_inference,[],[48,49]),
% 0.22/0.70     ['proof']).
% 0.22/0.70  % SZS output end Proof
% 0.22/0.70  % Total time :0.030000s
%------------------------------------------------------------------------------