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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SWB014+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n029.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:22 EDT 2023

% Result   : Theorem 3.82s 1.95s
% Output   : CNFRefutation 3.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   48 (  17 unt;  17 typ;   0 def)
%            Number of atoms       :   78 (   0 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   78 (  31   ~;  29   |;  14   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (   5   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;  12 con; 0-5 aty)
%            Number of variables   :   35 (;  31   !;   4   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ iext > icext > ic > #nlpp > uri_rdf_type > uri_rdf_rest > uri_rdf_nil > uri_rdf_first > uri_owl_unionOf > uri_ex_harry > uri_ex_Species > uri_ex_Falcon > uri_ex_Eagle > #skF_2 > #skF_5 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_72,axiom,
    ? [BNODE_u,BNODE_l1,BNODE_l2] :
      ( iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species)
      & iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species)
      & iext(uri_rdf_type,uri_ex_harry,BNODE_u)
      & iext(uri_owl_unionOf,BNODE_u,BNODE_l1)
      & iext(uri_rdf_first,BNODE_l1,uri_ex_Eagle)
      & iext(uri_rdf_rest,BNODE_l1,BNODE_l2)
      & iext(uri_rdf_first,BNODE_l2,uri_ex_Falcon)
      & iext(uri_rdf_rest,BNODE_l2,uri_rdf_nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_014_Harry_belongs_to_some_Species) ).

tff(f_56,negated_conjecture,
    ~ ? [BNODE_x] :
        ( iext(uri_rdf_type,uri_ex_harry,BNODE_x)
        & iext(uri_rdf_type,BNODE_x,uri_ex_Species) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) ).

tff(f_51,axiom,
    ! [Z,S1,C1,S2,C2] :
      ( ( iext(uri_rdf_first,S1,C1)
        & iext(uri_rdf_rest,S1,S2)
        & iext(uri_rdf_first,S2,C2)
        & iext(uri_rdf_rest,S2,uri_rdf_nil) )
     => ( iext(uri_owl_unionOf,Z,S1)
      <=> ( ic(Z)
          & ic(C1)
          & ic(C2)
          & ! [X] :
              ( icext(Z,X)
            <=> ( icext(C1,X)
                | icext(C2,X) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_bool_unionof_class_002) ).

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_44,plain,
    iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_48,plain,
    ! [BNODE_x_14] :
      ( ~ iext(uri_rdf_type,BNODE_x_14,uri_ex_Species)
      | ~ iext(uri_rdf_type,uri_ex_harry,BNODE_x_14) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_57,plain,
    ~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon),
    inference(resolution,[status(thm)],[c_44,c_48]) ).

tff(c_62,plain,
    ~ icext(uri_ex_Falcon,uri_ex_harry),
    inference(resolution,[status(thm)],[c_4,c_57]) ).

tff(c_34,plain,
    iext(uri_rdf_first,'#skF_5',uri_ex_Falcon),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_46,plain,
    iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_58,plain,
    ~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle),
    inference(resolution,[status(thm)],[c_46,c_48]) ).

tff(c_66,plain,
    ~ icext(uri_ex_Eagle,uri_ex_harry),
    inference(resolution,[status(thm)],[c_4,c_58]) ).

tff(c_38,plain,
    iext(uri_rdf_first,'#skF_4',uri_ex_Eagle),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_40,plain,
    iext(uri_owl_unionOf,'#skF_3','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_36,plain,
    iext(uri_rdf_rest,'#skF_4','#skF_5'),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_32,plain,
    iext(uri_rdf_rest,'#skF_5',uri_rdf_nil),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_42,plain,
    iext(uri_rdf_type,uri_ex_harry,'#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_67,plain,
    ! [C_15,X_16] :
      ( icext(C_15,X_16)
      | ~ iext(uri_rdf_type,X_16,C_15) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_81,plain,
    icext('#skF_3',uri_ex_harry),
    inference(resolution,[status(thm)],[c_42,c_67]) ).

tff(c_196,plain,
    ! [Z_65,C2_69,C1_64,S1_67,S2_68,X_66] :
      ( icext(C2_69,X_66)
      | icext(C1_64,X_66)
      | ~ icext(Z_65,X_66)
      | ~ iext(uri_owl_unionOf,Z_65,S1_67)
      | ~ iext(uri_rdf_rest,S2_68,uri_rdf_nil)
      | ~ iext(uri_rdf_first,S2_68,C2_69)
      | ~ iext(uri_rdf_rest,S1_67,S2_68)
      | ~ iext(uri_rdf_first,S1_67,C1_64) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_254,plain,
    ! [C2_106,C1_107,S1_108,S2_109] :
      ( icext(C2_106,uri_ex_harry)
      | icext(C1_107,uri_ex_harry)
      | ~ iext(uri_owl_unionOf,'#skF_3',S1_108)
      | ~ iext(uri_rdf_rest,S2_109,uri_rdf_nil)
      | ~ iext(uri_rdf_first,S2_109,C2_106)
      | ~ iext(uri_rdf_rest,S1_108,S2_109)
      | ~ iext(uri_rdf_first,S1_108,C1_107) ),
    inference(resolution,[status(thm)],[c_81,c_196]) ).

tff(c_257,plain,
    ! [C2_106,C1_107,S1_108] :
      ( icext(C2_106,uri_ex_harry)
      | icext(C1_107,uri_ex_harry)
      | ~ iext(uri_owl_unionOf,'#skF_3',S1_108)
      | ~ iext(uri_rdf_first,'#skF_5',C2_106)
      | ~ iext(uri_rdf_rest,S1_108,'#skF_5')
      | ~ iext(uri_rdf_first,S1_108,C1_107) ),
    inference(resolution,[status(thm)],[c_32,c_254]) ).

tff(c_260,plain,
    ! [C1_115,S1_116] :
      ( icext(C1_115,uri_ex_harry)
      | ~ iext(uri_owl_unionOf,'#skF_3',S1_116)
      | ~ iext(uri_rdf_rest,S1_116,'#skF_5')
      | ~ iext(uri_rdf_first,S1_116,C1_115) ),
    inference(splitLeft,[status(thm)],[c_257]) ).

tff(c_262,plain,
    ! [C1_115] :
      ( icext(C1_115,uri_ex_harry)
      | ~ iext(uri_owl_unionOf,'#skF_3','#skF_4')
      | ~ iext(uri_rdf_first,'#skF_4',C1_115) ),
    inference(resolution,[status(thm)],[c_36,c_260]) ).

tff(c_266,plain,
    ! [C1_117] :
      ( icext(C1_117,uri_ex_harry)
      | ~ iext(uri_rdf_first,'#skF_4',C1_117) ),
    inference(demodulation,[status(thm),theory(equality)],[c_40,c_262]) ).

tff(c_269,plain,
    icext(uri_ex_Eagle,uri_ex_harry),
    inference(resolution,[status(thm)],[c_38,c_266]) ).

tff(c_273,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_66,c_269]) ).

tff(c_276,plain,
    ! [C2_118] :
      ( icext(C2_118,uri_ex_harry)
      | ~ iext(uri_rdf_first,'#skF_5',C2_118) ),
    inference(splitRight,[status(thm)],[c_257]) ).

tff(c_279,plain,
    icext(uri_ex_Falcon,uri_ex_harry),
    inference(resolution,[status(thm)],[c_34,c_276]) ).

tff(c_283,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_62,c_279]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWB014+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.34  % Computer : n029.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.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug  3 18:42:22 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 3.82/1.95  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.82/1.95  
% 3.82/1.95  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.82/1.98  
% 3.82/1.98  Inference rules
% 3.82/1.98  ----------------------
% 3.82/1.98  #Ref     : 0
% 3.82/1.98  #Sup     : 48
% 3.82/1.98  #Fact    : 0
% 3.82/1.98  #Define  : 0
% 3.82/1.98  #Split   : 11
% 3.82/1.98  #Chain   : 0
% 3.82/1.98  #Close   : 0
% 3.82/1.98  
% 3.82/1.98  Ordering : KBO
% 3.82/1.98  
% 3.82/1.98  Simplification rules
% 3.82/1.98  ----------------------
% 3.82/1.98  #Subsume      : 7
% 3.82/1.98  #Demod        : 7
% 3.82/1.98  #Tautology    : 3
% 3.82/1.98  #SimpNegUnit  : 7
% 3.82/1.98  #BackRed      : 5
% 3.82/1.98  
% 3.82/1.98  #Partial instantiations: 0
% 3.82/1.98  #Strategies tried      : 1
% 3.82/1.98  
% 3.82/1.98  Timing (in seconds)
% 3.82/1.98  ----------------------
% 3.82/1.99  Preprocessing        : 0.47
% 3.82/1.99  Parsing              : 0.25
% 3.82/1.99  CNF conversion       : 0.03
% 3.82/1.99  Main loop            : 0.43
% 3.82/1.99  Inferencing          : 0.18
% 3.82/1.99  Reduction            : 0.10
% 3.82/1.99  Demodulation         : 0.07
% 3.82/1.99  BG Simplification    : 0.03
% 3.82/1.99  Subsumption          : 0.10
% 3.82/1.99  Abstraction          : 0.01
% 3.82/1.99  MUC search           : 0.00
% 3.82/1.99  Cooper               : 0.00
% 3.82/1.99  Total                : 0.95
% 3.82/1.99  Index Insertion      : 0.00
% 3.82/1.99  Index Deletion       : 0.00
% 3.82/1.99  Index Matching       : 0.00
% 3.82/1.99  BG Taut test         : 0.00
%------------------------------------------------------------------------------