TSTP Solution File: SWB008+2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWB008+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n022.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 : Tue Aug 22 11:00:16 EDT 2023

% Result   : Theorem 2.98s 1.74s
% Output   : CNFRefutation 2.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   33 (  10 unt;  15 typ;   0 def)
%            Number of atoms       :   34 (   6 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   26 (  10   ~;   7   |;   5   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (   7   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-1 aty)
%            Number of variables   :   17 (;  17   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > icext > ip > #nlpp > literal_plain > uri_rdf_type > uri_owl_sameAs > uri_owl_InverseFunctionalProperty > uri_owl_DatatypeProperty > uri_foaf_mbox_sha1sum > uri_ex_robert > uri_ex_bob > dat_str_xyz > #skF_2 > #skF_1 > #skF_3

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(uri_owl_InverseFunctionalProperty,type,
    uri_owl_InverseFunctionalProperty: $i ).

tff(uri_rdf_type,type,
    uri_rdf_type: $i ).

tff('#skF_2',type,
    '#skF_2': $i > $i ).

tff('#skF_1',type,
    '#skF_1': $i > $i ).

tff(dat_str_xyz,type,
    dat_str_xyz: $i ).

tff(uri_ex_bob,type,
    uri_ex_bob: $i ).

tff(icext,type,
    icext: ( $i * $i ) > $o ).

tff(ip,type,
    ip: $i > $o ).

tff(uri_ex_robert,type,
    uri_ex_robert: $i ).

tff(uri_foaf_mbox_sha1sum,type,
    uri_foaf_mbox_sha1sum: $i ).

tff(uri_owl_sameAs,type,
    uri_owl_sameAs: $i ).

tff(iext,type,
    iext: ( $i * $i * $i ) > $o ).

tff(uri_owl_DatatypeProperty,type,
    uri_owl_DatatypeProperty: $i ).

tff('#skF_3',type,
    '#skF_3': $i > $i ).

tff(literal_plain,type,
    literal_plain: $i > $i ).

tff(f_32,axiom,
    ! [X,Y] :
      ( iext(uri_owl_sameAs,X,Y)
    <=> ( X = Y ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_eqdis_sameas) ).

tff(f_52,axiom,
    ( iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_DatatypeProperty)
    & iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty)
    & iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz))
    & iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_008_Inverse_Functional_Data_Properties) ).

tff(f_28,axiom,
    ! [X,C] :
      ( iext(uri_rdf_type,X,C)
    <=> icext(C,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdfs_cext_def) ).

tff(f_43,axiom,
    ! [P] :
      ( icext(uri_owl_InverseFunctionalProperty,P)
    <=> ( ip(P)
        & ! [X1,X2,Y] :
            ( ( iext(P,X1,Y)
              & iext(P,X2,Y) )
           => ( X1 = X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_char_inversefunctional) ).

tff(f_45,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties) ).

tff(c_8,plain,
    ! [Y_4] : iext(uri_owl_sameAs,Y_4,Y_4),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_22,plain,
    iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_26,plain,
    iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_37,plain,
    ! [C_19,X_20] :
      ( icext(C_19,X_20)
      | ~ iext(uri_rdf_type,X_20,C_19) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_44,plain,
    icext(uri_owl_InverseFunctionalProperty,uri_foaf_mbox_sha1sum),
    inference(resolution,[status(thm)],[c_26,c_37]) ).

tff(c_24,plain,
    iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz)),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_83,plain,
    ! [X2_26,X1_27,P_28,Y_29] :
      ( ( X2_26 = X1_27 )
      | ~ iext(P_28,X2_26,Y_29)
      | ~ iext(P_28,X1_27,Y_29)
      | ~ icext(uri_owl_InverseFunctionalProperty,P_28) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_91,plain,
    ! [X1_27] :
      ( ( uri_ex_bob = X1_27 )
      | ~ iext(uri_foaf_mbox_sha1sum,X1_27,literal_plain(dat_str_xyz))
      | ~ icext(uri_owl_InverseFunctionalProperty,uri_foaf_mbox_sha1sum) ),
    inference(resolution,[status(thm)],[c_24,c_83]) ).

tff(c_112,plain,
    ! [X1_30] :
      ( ( uri_ex_bob = X1_30 )
      | ~ iext(uri_foaf_mbox_sha1sum,X1_30,literal_plain(dat_str_xyz)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_44,c_91]) ).

tff(c_121,plain,
    uri_ex_robert = uri_ex_bob,
    inference(resolution,[status(thm)],[c_22,c_112]) ).

tff(c_20,plain,
    ~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_123,plain,
    ~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_bob),
    inference(demodulation,[status(thm),theory(equality)],[c_121,c_20]) ).

tff(c_127,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_123]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWB008+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % 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 : Thu Aug  3 18:20:33 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.98/1.74  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.98/1.75  
% 2.98/1.75  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.98/1.77  
% 2.98/1.77  Inference rules
% 2.98/1.77  ----------------------
% 2.98/1.77  #Ref     : 0
% 2.98/1.77  #Sup     : 20
% 2.98/1.77  #Fact    : 0
% 2.98/1.77  #Define  : 0
% 2.98/1.77  #Split   : 1
% 2.98/1.77  #Chain   : 0
% 2.98/1.77  #Close   : 0
% 2.98/1.77  
% 2.98/1.77  Ordering : KBO
% 2.98/1.77  
% 2.98/1.77  Simplification rules
% 2.98/1.77  ----------------------
% 2.98/1.77  #Subsume      : 2
% 2.98/1.77  #Demod        : 6
% 2.98/1.77  #Tautology    : 7
% 2.98/1.77  #SimpNegUnit  : 0
% 2.98/1.77  #BackRed      : 2
% 2.98/1.77  
% 2.98/1.77  #Partial instantiations: 0
% 2.98/1.77  #Strategies tried      : 1
% 2.98/1.77  
% 2.98/1.77  Timing (in seconds)
% 2.98/1.77  ----------------------
% 2.98/1.78  Preprocessing        : 0.48
% 2.98/1.78  Parsing              : 0.25
% 2.98/1.78  CNF conversion       : 0.03
% 2.98/1.78  Main loop            : 0.23
% 2.98/1.78  Inferencing          : 0.09
% 2.98/1.78  Reduction            : 0.06
% 2.98/1.78  Demodulation         : 0.05
% 2.98/1.78  BG Simplification    : 0.01
% 2.98/1.78  Subsumption          : 0.05
% 2.98/1.78  Abstraction          : 0.01
% 2.98/1.78  MUC search           : 0.00
% 2.98/1.78  Cooper               : 0.00
% 2.98/1.78  Total                : 0.76
% 2.98/1.78  Index Insertion      : 0.00
% 2.98/1.78  Index Deletion       : 0.00
% 2.98/1.78  Index Matching       : 0.00
% 2.98/1.78  BG Taut test         : 0.00
%------------------------------------------------------------------------------