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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWB007+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.35s 1.58s
% Output   : CNFRefutation 2.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   21 (   6 unt;  10 typ;   0 def)
%            Number of atoms       :   20 (   3 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   14 (   5   ~;   3   |;   5   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   1   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   9 con; 0-0 aty)
%            Number of variables   :    4 (;   4   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > #nlpp > uri_rdfs_subClassOf > uri_rdfs_range > uri_rdf_type > uri_owl_sameAs > uri_ex_w > uri_ex_p > uri_ex_c2 > uri_ex_c1 > uri_ex_c

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_41,axiom,
    ( iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2)
    & iext(uri_rdf_type,uri_ex_w,uri_ex_c1)
    & iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1)
    & iext(uri_rdfs_range,uri_ex_p,uri_ex_c1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_007_Equal_Classes) ).

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

tff(f_34,negated_conjecture,
    ~ ( iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
      & iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
      & iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_007_Equal_Classes) ).

tff(c_12,plain,
    iext(uri_rdf_type,uri_ex_w,uri_ex_c1),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_14,plain,
    iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_16,plain,
    ! [Y_4,X_5] :
      ( ( Y_4 = X_5 )
      | ~ iext(uri_owl_sameAs,X_5,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_25,plain,
    uri_ex_c2 = uri_ex_c1,
    inference(resolution,[status(thm)],[c_14,c_16]) ).

tff(c_10,plain,
    iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_8,plain,
    iext(uri_rdfs_range,uri_ex_p,uri_ex_c1),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_6,plain,
    ( ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)
    | ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
    | ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_33,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_25,c_10,c_25,c_8,c_25,c_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWB007+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.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 18:20:48 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.35/1.58  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.35/1.58  
% 2.35/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.35/1.61  
% 2.35/1.61  Inference rules
% 2.35/1.61  ----------------------
% 2.35/1.61  #Ref     : 0
% 2.35/1.61  #Sup     : 4
% 2.35/1.61  #Fact    : 0
% 2.35/1.61  #Define  : 0
% 2.35/1.61  #Split   : 0
% 2.35/1.61  #Chain   : 0
% 2.35/1.61  #Close   : 0
% 2.35/1.61  
% 2.35/1.61  Ordering : KBO
% 2.35/1.61  
% 2.35/1.61  Simplification rules
% 2.35/1.61  ----------------------
% 2.35/1.61  #Subsume      : 0
% 2.35/1.61  #Demod        : 8
% 2.35/1.61  #Tautology    : 4
% 2.35/1.61  #SimpNegUnit  : 0
% 2.35/1.61  #BackRed      : 1
% 2.35/1.61  
% 2.35/1.61  #Partial instantiations: 0
% 2.35/1.61  #Strategies tried      : 1
% 2.35/1.61  
% 2.35/1.61  Timing (in seconds)
% 2.35/1.61  ----------------------
% 2.35/1.61  Preprocessing        : 0.42
% 2.35/1.61  Parsing              : 0.23
% 2.35/1.61  CNF conversion       : 0.02
% 2.35/1.61  Main loop            : 0.14
% 2.35/1.61  Inferencing          : 0.06
% 2.35/1.62  Reduction            : 0.04
% 2.35/1.62  Demodulation         : 0.03
% 2.35/1.62  BG Simplification    : 0.01
% 2.35/1.62  Subsumption          : 0.03
% 2.35/1.62  Abstraction          : 0.00
% 2.35/1.62  MUC search           : 0.00
% 2.35/1.62  Cooper               : 0.00
% 2.35/1.62  Total                : 0.61
% 2.35/1.62  Index Insertion      : 0.00
% 2.35/1.62  Index Deletion       : 0.00
% 2.35/1.62  Index Matching       : 0.00
% 2.35/1.62  BG Taut test         : 0.00
%------------------------------------------------------------------------------