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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWB009+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 : n012.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:17 EDT 2023

% Result   : Theorem 3.15s 1.86s
% Output   : CNFRefutation 3.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   31 (   5 unt;  13 typ;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   49 (  22   ~;  16   |;   8   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   3   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;  10 con; 0-4 aty)
%            Number of variables   :   26 (;  23   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > icext > #nlpp > uri_rdf_type > uri_owl_someValuesFrom > uri_owl_onProperty > uri_owl_Restriction > uri_owl_ObjectProperty > uri_owl_Class > uri_ex_s > uri_ex_p > uri_ex_c > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_57,axiom,
    ? [BNODE_z] :
      ( iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)
      & iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
      & iext(uri_rdf_type,uri_ex_s,BNODE_z)
      & iext(uri_rdf_type,BNODE_z,uri_owl_Restriction)
      & iext(uri_owl_onProperty,BNODE_z,uri_ex_p)
      & iext(uri_owl_someValuesFrom,BNODE_z,uri_ex_c) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_009_Existential_Restriction_Entailments) ).

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_40,axiom,
    ! [Z,P,C] :
      ( ( iext(uri_owl_someValuesFrom,Z,C)
        & iext(uri_owl_onProperty,Z,P) )
     => ! [X] :
          ( icext(Z,X)
        <=> ? [Y] :
              ( iext(P,X,Y)
              & icext(C,Y) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_restrict_somevaluesfrom) ).

tff(f_45,negated_conjecture,
    ~ ? [BNODE_x] :
        ( iext(uri_ex_p,uri_ex_s,BNODE_x)
        & iext(uri_rdf_type,BNODE_x,uri_ex_c) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_009_Existential_Restriction_Entailments) ).

tff(c_16,plain,
    iext(uri_owl_onProperty,'#skF_2',uri_ex_p),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_20,plain,
    iext(uri_rdf_type,uri_ex_s,'#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_26,plain,
    ! [C_18,X_19] :
      ( icext(C_18,X_19)
      | ~ iext(uri_rdf_type,X_19,C_18) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_43,plain,
    icext('#skF_2',uri_ex_s),
    inference(resolution,[status(thm)],[c_20,c_26]) ).

tff(c_14,plain,
    iext(uri_owl_someValuesFrom,'#skF_2',uri_ex_c),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_8,plain,
    ! [C_5,Z_3,P_4,X_11] :
      ( icext(C_5,'#skF_1'(Z_3,P_4,C_5,X_11))
      | ~ icext(Z_3,X_11)
      | ~ iext(uri_owl_onProperty,Z_3,P_4)
      | ~ iext(uri_owl_someValuesFrom,Z_3,C_5) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_81,plain,
    ! [P_37,X_38,Z_39,C_40] :
      ( iext(P_37,X_38,'#skF_1'(Z_39,P_37,C_40,X_38))
      | ~ icext(Z_39,X_38)
      | ~ iext(uri_owl_onProperty,Z_39,P_37)
      | ~ iext(uri_owl_someValuesFrom,Z_39,C_40) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_4,plain,
    ! [X_1,C_2] :
      ( iext(uri_rdf_type,X_1,C_2)
      | ~ icext(C_2,X_1) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_47,plain,
    ! [BNODE_x_20] :
      ( ~ iext(uri_rdf_type,BNODE_x_20,uri_ex_c)
      | ~ iext(uri_ex_p,uri_ex_s,BNODE_x_20) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_52,plain,
    ! [X_1] :
      ( ~ iext(uri_ex_p,uri_ex_s,X_1)
      | ~ icext(uri_ex_c,X_1) ),
    inference(resolution,[status(thm)],[c_4,c_47]) ).

tff(c_122,plain,
    ! [Z_61,C_62] :
      ( ~ icext(uri_ex_c,'#skF_1'(Z_61,uri_ex_p,C_62,uri_ex_s))
      | ~ icext(Z_61,uri_ex_s)
      | ~ iext(uri_owl_onProperty,Z_61,uri_ex_p)
      | ~ iext(uri_owl_someValuesFrom,Z_61,C_62) ),
    inference(resolution,[status(thm)],[c_81,c_52]) ).

tff(c_128,plain,
    ! [Z_63] :
      ( ~ icext(Z_63,uri_ex_s)
      | ~ iext(uri_owl_onProperty,Z_63,uri_ex_p)
      | ~ iext(uri_owl_someValuesFrom,Z_63,uri_ex_c) ),
    inference(resolution,[status(thm)],[c_8,c_122]) ).

tff(c_131,plain,
    ( ~ icext('#skF_2',uri_ex_s)
    | ~ iext(uri_owl_onProperty,'#skF_2',uri_ex_p) ),
    inference(resolution,[status(thm)],[c_14,c_128]) ).

tff(c_135,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_16,c_43,c_131]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWB009+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.14  % 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.35  % Computer : n012.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 : Thu Aug  3 18:21:22 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.15/1.86  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.15/1.87  
% 3.15/1.87  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.31/1.89  
% 3.31/1.89  Inference rules
% 3.31/1.89  ----------------------
% 3.31/1.89  #Ref     : 0
% 3.31/1.89  #Sup     : 23
% 3.31/1.89  #Fact    : 0
% 3.31/1.89  #Define  : 0
% 3.31/1.89  #Split   : 0
% 3.31/1.89  #Chain   : 0
% 3.31/1.89  #Close   : 0
% 3.31/1.89  
% 3.31/1.89  Ordering : KBO
% 3.31/1.89  
% 3.31/1.89  Simplification rules
% 3.31/1.89  ----------------------
% 3.31/1.89  #Subsume      : 0
% 3.31/1.89  #Demod        : 2
% 3.31/1.89  #Tautology    : 1
% 3.31/1.89  #SimpNegUnit  : 0
% 3.31/1.89  #BackRed      : 0
% 3.31/1.89  
% 3.31/1.89  #Partial instantiations: 0
% 3.31/1.89  #Strategies tried      : 1
% 3.31/1.89  
% 3.31/1.89  Timing (in seconds)
% 3.31/1.89  ----------------------
% 3.31/1.90  Preprocessing        : 0.45
% 3.31/1.90  Parsing              : 0.24
% 3.31/1.90  CNF conversion       : 0.03
% 3.31/1.90  Main loop            : 0.31
% 3.31/1.90  Inferencing          : 0.15
% 3.31/1.90  Reduction            : 0.07
% 3.31/1.90  Demodulation         : 0.05
% 3.31/1.90  BG Simplification    : 0.02
% 3.31/1.90  Subsumption          : 0.06
% 3.31/1.90  Abstraction          : 0.01
% 3.31/1.90  MUC search           : 0.00
% 3.31/1.90  Cooper               : 0.00
% 3.31/1.90  Total                : 0.80
% 3.31/1.90  Index Insertion      : 0.00
% 3.31/1.90  Index Deletion       : 0.00
% 3.31/1.90  Index Matching       : 0.00
% 3.31/1.90  BG Taut test         : 0.00
%------------------------------------------------------------------------------